A data transmission method, apparatus and system
By mapping data units to N channels and performing cyclic shifting during data transmission, the problem of insufficient resistance to sudden interference is solved, and power consumption and cost are reduced.
Patent Information
- Application Number
- CN202311447642.1
- Authority / Receiving Office
- CN · China
- Patent Type
- Patents(China)
- Current Assignee / Owner
- Filing Date
- 2023-10-31
- Publication Date
- 2026-11-17
- Estimated Expiration
- 2043-10-31
AI Technical Summary
In existing data transmission processes, there is insufficient resistance to sudden interference, and the power consumption and cost are relatively high.
By mapping data units to N channels, with each of the g channels including at least one data set, and cyclically shifting each data set, the distance between the same code block data units transmitted in the same channel is increased, thereby improving the ability to resist sudden interference by using interleaving and coding techniques.
It improves the ability of data transmission to resist sudden interference, while reducing power consumption and cost.
Smart Images

Figure CN119921786B_ABST
Abstract
Description
Technical Field
[0001] This application relates to the field of data transmission technology, and in particular to a data transmission method, apparatus and system. Background Technology
[0002] During data transmission, interference and noise can cause data transmission errors. To avoid these errors, error correction techniques are typically used. Forward error correction (FEC) is a commonly used technique to detect and correct a limited number of errors in transmitted data without retransmission. The main principle of FEC is to process the original data using certain algorithms to add redundant content, ensuring that even if only some normal data and redundant content are received, the original data can still be completely recovered. For example, the original data can be divided into multiple code blocks of length k bytes, and then each k-byte code block can be encoded into an n-byte code block before transmission, where k is less than n.
[0003] To further improve the system's resilience to burst errors, interleaving techniques are typically employed. This technique distributes adjacent bytes within a code block across different times or channels for transmission. If a transmission error occurs at a certain time or on a certain channel, deinterleaving will distribute the data transmission error across different code blocks, thereby reducing the error probability of each code block. Interleaving discretizes a long burst error into random errors, which are then eliminated using FEC (Fluid Interference Coding). The greater the interleaving depth, the greater the dispersion, and the stronger the resilience against burst errors. Therefore, the quality of the interleaving method determines the transmission path's resilience to burst interference. Summary of the Invention
[0004] This application provides a data transmission method, apparatus, and system for increasing the distance between data units of the same code block transmitted in the same channel, thereby greatly increasing the ability to resist sudden interference while reducing power consumption and cost.
[0005] To achieve the above objectives, the embodiments of this application adopt the following technical solutions:
[0006] Firstly, a data transmission method is provided, applicable to a data transmission device. The method includes: acquiring a logic block, also known as a logic layer data block, which can refer to the data code used by the logic layer in data processing. The logic block includes X data units, where X is a positive integer, and x is the number of the X data units, with values of 0, 1, 2, ..., (X-1); mapping the X data units to N channels; where each of the N channels includes X / N data units, and the i-th data unit in the j-th channel is the v-th data unit among the X data units, where v = int(k / g)*g + (((int(int(k / N) / m)mod g)*(g-1) + (k mod g))mod g), k = i*N+j; where g is a factor of N, M is the number of code blocks corresponding to the X data units, m is a positive integer less than M, mod represents modulo, and int represents rounding down; and transmitting the processed data units in each of the N channels.
[0007] In the above technical solution, when the data transmitting device acquires a logic block with X data units, it can map the X data units to N channels. Each of the N channels includes at least one data set, and each data set includes multiple data groups. These multiple data groups correspond to different cyclic shift values, thereby increasing the distance between data units of the same code block transmitted in the same channel. This increases the difference in the numbering of data units of the same code block transmitted in the same channel, thus significantly increasing the ability to resist sudden interference when transmitting data units processed by the N channels. Furthermore, this solution does not require increasing the number of encoders or channels, thereby greatly reducing power consumption and cost.
[0008] In one possible implementation of the first aspect, mapping the X data units to N channels includes: allocating the X data units to the N channels, where each of the N channels (g channels) includes at least one data set, and each data set includes multiple data groups; and cyclically shifting the channels containing the data units in the multiple data groups of each data set, where the multiple data groups correspond to different cyclic shift values. In the above possible implementation, by applying different cyclic shift values to the multiple data groups in the data sets corresponding to each of the g channels, the distance between data units of the same code block transmitted in the same channel can be increased, i.e., the difference in the numbering of data units of the same code block transmitted in the same channel is increased, thereby greatly increasing the data's resistance to sudden interference during transmission.
[0009] In one possible implementation of the first aspect, the method further includes: determining g and the number of rows m of data units included in each of the plurality of data groups based on M and N. In the above possible implementation, by determining g and the number of rows m of data units included in each of the plurality of data groups based on M and N, it can be ensured that the distance between data units of the same code block transmitted in the same channel is large, that is, the difference in the numbers of data units of the same code block transmitted in the same channel is large, and the data allocated to the N channels is relatively balanced.
[0010] In one possible implementation of the first aspect, determining g and the number of rows m of data units in each of the plurality of data groups based on M and N includes: determining the greatest common divisor g based on M and N; and determining the number of rows m of data units in each of the plurality of data groups based on M and the greatest common divisor g, where m is a positive integer and M is greater than m. In the above possible implementation, it can be guaranteed that the distance between data units of the same code block transmitted in the same channel is relatively large, and the data distributed across N channels is relatively balanced.
[0011] In one possible implementation of the first aspect, mapping the X data units to N channels includes: for each of the X data units, querying preset correspondence information based on the data unit's position information in the logic block to determine the data unit's mapping position information in the N channels; and mapping the data unit to the N channels based on the mapping position information. The preset correspondence is used to indicate the correspondence between the position information of each of the X data units in the logic block and the mapping position information in the N channels. In the above possible implementation, by querying preset correspondence information to determine and map the mapping position information of each data unit in the N channels, the data mapping rate can be improved.
[0012] In one possible implementation of the first aspect, the cyclic shift value corresponding to the i-th data unit in the j-th channel is equal to int(i / m) mod g. In the above possible implementation, the distance between data units of the same code block transmitted in the same channel can be increased, that is, the difference in the numbers of the data units of the same code block transmitted in the same channel can be increased, thereby greatly increasing the data's ability to resist sudden interference during transmission.
[0013] In one possible implementation of the first aspect, obtaining the logic block includes: mapping the data to be transmitted into code blocks to obtain M pre-encoded code blocks; and encoding the M pre-encoded code blocks to obtain the logic block. In the above possible implementation, by mapping and encoding the data to be transmitted into code blocks, the distance between data units of the same code block transmitted in the same channel can be increased. Furthermore, when data transmission errors occur, error correction can be performed using check bits during the encoding process, thereby providing the ability to resist sudden interference.
[0014] In one possible implementation of the first aspect, encoding the M pre-encoded blocks to obtain the logic block includes: encoding the M pre-encoded blocks to obtain M post-encoded blocks; and reusing the M post-encoded blocks with logic layer management information to obtain the logic block. In the above possible implementation, by reusing the M post-encoded blocks with logic layer management information, data transmission efficiency can be improved and the number of interactions between devices can be reduced.
[0015] Secondly, a data transmission method is provided, comprising: receiving data units from each of N channels; wherein each of the N channels comprises X / N data units, and the i-th data unit in the j-th channel is the v-th data unit among the X data units, v = int(k / g)*g + (((int(int(k / N) / m)mod g)*(g-1)+(k mod g))mod g), k = i*N+j; where g is a factor of N, M is the number of code blocks corresponding to the X data units, m is a positive integer less than M, mod represents modulo, and int represents rounding down; and demapping the data units in the N channels to obtain a logic block comprising X data units. Optionally, the cyclic shift value corresponding to the i-th data unit in the j-th channel is equal to int(i / m)mod g.
[0016] In one possible implementation of the second aspect, demapping the data units in the N channels includes: cyclically shifting the channels containing the data units in the plurality of data groups of each data set, wherein the plurality of data groups correspond to different cyclic shift values; obtaining the data units in the N channels after cyclic shifting to obtain the logic block.
[0017] In one possible implementation of the second aspect, the method further includes: determining g and the number of rows m of data units included in each of the plurality of data groups, based on M and N.
[0018] In one possible implementation of the second aspect, determining g and the number of rows m of data units included in each of the plurality of data groups based on M and N includes: determining the greatest common divisor g based on M and N; and determining the number of rows m of data units included in each of the plurality of data groups based on M and the greatest common divisor g, where m is a positive integer and M is greater than m.
[0019] In one possible implementation of the second aspect, demapping the data units in the N channels to obtain a logic block comprising X data units includes: for each data unit in the N channels, querying preset corresponding information based on the mapping position information of the data unit in the N channels to determine the position information of the data unit in the X data units; and demapping the data unit into the logic block based on the position information; wherein the preset corresponding relationship is used to indicate the correspondence between the position information of each data unit in the X data units in the logic block and the mapping position information in the N channels.
[0020] In one possible implementation of the second aspect, the method further includes: decoding the logic block to obtain M decoded code blocks; and de-channel mapping the M decoded code blocks to obtain the data to be transmitted.
[0021] In one possible implementation of the second aspect, the logic block is decoded to obtain M decoded code blocks, including: demultiplexing the logic block to obtain M pre-decoding code blocks and logic layer management information; and decoding the M pre-decoding code blocks to obtain the M decoded code blocks.
[0022] Thirdly, a data transmission apparatus is provided, comprising: an acquisition unit for acquiring a logic block comprising X data units, where X is a positive integer; a processing unit for mapping the X data units to N channels; wherein each of the N channels comprises X / N data units, wherein the i-th data unit in the j-th channel is the v-th data unit among the X data units, v = int(k / g)*g + (((int(int(k / N) / m)mod g)*(g-1) + (kmod g))mod g), k = i*N+j; where g is a factor of N, M is the number of code blocks corresponding to the X data units, m is a positive integer less than M, mod represents modulo, and int represents rounding down; and a transmission unit for transmitting the processed data units in each of the N channels.
[0023] In one possible implementation of the third aspect, the processing unit is further configured to: allocate the X data units to the N channels, each of the N channels including at least one data set, each data set including multiple data groups; and perform cyclic shifting on the channels containing the data units in the multiple data groups of each data set, the multiple data groups corresponding to different cyclic shift values.
[0024] In one possible implementation of the third aspect, the processing unit is further configured to: determine, based on M and N, the number of rows m of data units included in each of the plurality of data groups.
[0025] In one possible implementation of the third aspect, the processing unit is further configured to: determine the greatest common divisor g based on M and N; and determine the number of rows m of the data units included in each of the plurality of data groups based on M and the greatest common divisor g, where m is a positive integer and M is greater than m.
[0026] In one possible implementation of the third aspect, the processing unit is further configured to: for each of the X data units, query preset corresponding information based on the position information of the data unit in the logic block to determine the mapping position information of the data unit in the N channels; and map the data unit to the N channels based on the mapping position information; wherein the preset corresponding relationship is used to indicate the correspondence between the position information of each of the X data units in the logic block and the mapping position information in the N channels.
[0027] In one possible implementation of the third aspect, the cyclic shift value corresponding to the data unit in the i-th row and j-th column is equal to int(i / m)mod g.
[0028] In one possible implementation of the third aspect, the processing unit is further configured to: perform code block mapping on the data to be transmitted to obtain M pre-encoded code blocks; and perform encoding processing on the M pre-encoded code blocks to obtain the logic block.
[0029] In one possible implementation of the third aspect, the processing unit is further configured to: encode the M pre-encoded blocks to obtain M post-encoded blocks; and reuse the M post-encoded blocks with logic layer management information to obtain the logic block.
[0030] Fourthly, a data receiving apparatus is provided, comprising: a receiving unit for receiving data units from each of N channels; wherein each of the N channels includes X / N data units, wherein the i-th data unit in the j-th channel is the v-th data unit among the X data units, v = int(k / g)*g + (((int(int(k / N) / m)mod g)*(g-1) + (k mod g))mod g), k = i*N+j; wherein g is a factor of N, M is the number of code blocks corresponding to the X data units, m is a positive integer less than M, mod represents the remainder, and int represents the floor function; and a processing unit for demapping the data units in the N channels to obtain a logic block including X data units.
[0031] In one possible implementation of the fourth aspect, the processing unit is further configured to: cyclically shift the data units in the plurality of data groups of each data set, wherein the plurality of data groups correspond to different cyclic shift values; and obtain the data units in the N channels after cyclic shifting to obtain the logic block.
[0032] In one possible implementation of the fourth aspect, the processing unit is further configured to: determine, based on M and N, the number of rows m of data units included in each of the plurality of data groups.
[0033] In one possible implementation of the fourth aspect, the processing unit is further configured to: determine the greatest common divisor g based on M and N; and determine the number of rows m of the data units included in each of the plurality of data groups based on M and the greatest common divisor g, where m is a positive integer and M is greater than m.
[0034] In one possible implementation of the fourth aspect, the processing unit is further configured to: for each data unit in the N channels, query preset corresponding information based on the mapping position information of the data unit in the N channels to determine the position information of the data unit in the X data units; and demap the data unit to the logic block based on the position information; wherein the preset corresponding relationship is used to indicate the correspondence between the position information of each data unit in the X data units in the logic block and the mapping position information in the N channels.
[0035] In one possible implementation of the fourth aspect, the cyclic shift value corresponding to the i-th data unit in the j-th channel is equal to int(i / m)mod g.
[0036] In one possible implementation of the fourth aspect, the processing unit is further configured to: decode the logic block to obtain M decoded code blocks; and map the M decoded code blocks to obtain the data to be transmitted.
[0037] In one possible implementation of the fourth aspect, the processing unit is further configured to: demultiplex the logic block to obtain M pre-decoding code blocks and logic layer management information; and decode the M pre-decoding code blocks to obtain the M post-decoding code blocks.
[0038] Fifthly, a chip is provided, the chip comprising: an interleaving circuit and a transmitter, the interleaving circuit and the transmitter being configured to support the chip in performing a data transmission method as provided in the first aspect or any possible implementation thereof.
[0039] In a sixth aspect, a chip is provided, the chip comprising: an interleaving circuit and a receiver, the interleaving circuit and the receiver being configured to support the chip in performing a data transmission method as provided in the second aspect or any possible implementation thereof.
[0040] A seventh aspect provides a data transmission system, the data transmission system including a data transmitting device and a data receiving device; wherein the data transmitting device includes the device provided by the third aspect or any possible implementation of the third aspect, or includes the chip provided by the fifth aspect, and is used to perform the data transmission method provided by the first aspect or any possible implementation of the first aspect; the data receiving device includes the device provided by the fourth aspect or any possible implementation of the fourth aspect, or includes the chip provided by the sixth aspect, and is used to perform the data transmission method provided by the second aspect or any possible implementation of the second aspect.
[0041] Eighthly, a readable storage medium is provided, which stores instructions that, when executed on a device, cause the device to perform a data transmission method as provided in the first aspect or any possible implementation thereof.
[0042] A ninth aspect provides a readable storage medium storing instructions that, when executed on a device, cause the device to perform a data transmission method as provided in the second aspect or any possible implementation thereof.
[0043] In a tenth aspect, a computer program product is provided, comprising: a computer program (also referred to as code or instructions) that, when executed, causes a computer to perform a data transmission method provided by the first aspect or any possible implementation thereof.
[0044] Eleventhly, a computer program product is provided, comprising: a computer program (also referred to as code or instructions) that, when executed, causes a computer to perform the data transmission method provided by the second aspect or any possible implementation thereof.
[0045] It is understood that the beneficial effects achieved by any of the data transmitting devices, data receiving devices, chips, data transmission systems, computer-readable storage media, and computer program products provided above can be referred to in accordance with the beneficial effects of the data transmission methods provided above, and will not be repeated here. Attached Figure Description
[0046] Figure 1 This is a schematic diagram of the structure of a data transmission system provided in an embodiment of this application;
[0047] Figure 2 This is a schematic diagram of another data transmission system provided in an embodiment of this application;
[0048] Figure 3 A schematic diagram of the basic components of an electronic device provided in an embodiment of this application;
[0049] Figure 4 This application provides a schematic diagram of inter-interface transmission.
[0050] Figure 5 A schematic diagram of an RS encoding provided for an embodiment of this application;
[0051] Figure 6 A schematic diagram illustrating a code block transmission according to an embodiment of this application;
[0052] Figure 7 This application provides a schematic diagram of data processing during data transmission.
[0053] Figure 8 An example diagram of data processing provided for the application embodiment;
[0054] Figure 9 An example diagram illustrating another data processing method provided in the application embodiments;
[0055] Figure 10 A flowchart illustrating a data transmission method provided in an embodiment of this application;
[0056] Figure 11 This application provides a schematic diagram of data processing during data transmission, as illustrated in an embodiment of the present application.
[0057] Figure 12 This application provides a schematic diagram of data processing during data transmission, as illustrated in an embodiment of the present application.
[0058] Figure 13 This is a schematic diagram illustrating data processing during another data transmission process provided in an embodiment of this application;
[0059] Figure 14 A schematic diagram illustrating a data unit mapped to N channels, provided as an embodiment of this application;
[0060] Figure 15 This is a schematic diagram illustrating code block mapping of data units according to an embodiment of this application;
[0061] Figure 16 This is a schematic diagram illustrating the encoding of code blocks according to an embodiment of this application;
[0062] Figure 17 This is a schematic diagram illustrating a cyclic shift of the channel containing a data unit in N channels, provided as an embodiment of this application.
[0063] Figure 18 An example diagram of a data transmission method provided in the application embodiment;
[0064] Figure 19 An example diagram illustrating another data transmission method provided in the application embodiment;
[0065] Figure 20 A flowchart illustrating another data transmission method provided in an embodiment of this application;
[0066] Figure 21 This is a schematic diagram illustrating data processing during another data transmission process provided in an embodiment of this application;
[0067] Figure 22 This is a schematic diagram of the structure of a data transmission device provided in an embodiment of this application;
[0068] Figure 23 A schematic diagram of another data transmission device provided in an embodiment of this application;
[0069] Figure 24 This is a schematic diagram of the structure of a data receiving device provided in an embodiment of this application;
[0070] Figure 25 This is a schematic diagram of another data receiving device provided in an embodiment of this application. Detailed Implementation
[0071] The following sections will discuss the fabrication and use of various embodiments in detail. However, it should be understood that many applicable inventive concepts provided in this application can be implemented in a variety of specific environments. The specific embodiments discussed are merely illustrative of specific ways of implementing and using this application and technology, and do not limit the scope of this application.
[0072] Unless otherwise defined, all technical terms used herein have the same meaning as commonly known to one of ordinary skill in the art.
[0073] Each circuit or other component may be described or referred to as "for" performing one or more tasks. In this context, "for" is used to imply a structure by indicating that the circuit / component includes a structure (e.g., a circuit system) that performs one or more tasks during operation. Therefore, even when the specified circuit / component is currently inoperable (e.g., not turned on), it can still be referred to as "for performing that task." Circuits / components used with the term "for" include hardware, such as circuits that perform operations.
[0074] The technical solutions in the embodiments of this application will be described below with reference to the accompanying drawings. In this application, "at least one" means one or more, and "more than one" means two or more. "And / or" describes the relationship between related objects, indicating that there can be three relationships. For example, A and / or B can mean: A exists alone, A and B exist simultaneously, or B exists alone, where A and B can be singular or plural. The character " / " generally indicates that the related objects before and after are in an "or" relationship. "At least one of the following" or similar expressions refer to any combination of these items, including any combination of single or plural items. For example, at least one of a, b, or c can mean: a, b, c, a and b, a and c, b and c, a, b, and c; where a, b, and c can be single or multiple.
[0075] The embodiments of this application use terms such as "first" and "second" to distinguish objects with similar names, functions, or effects. Those skilled in the art will understand that the terms "first" and "second" do not limit the quantity or order of execution. The term "coupling" is used to indicate an electrical connection, including direct connection via wires or terminals or indirect connection via other devices. Therefore, "coupling" should be considered as a broad type of electronic communication connection.
[0076] It should be noted that, in this application, the terms "exemplary" or "for example" are used to indicate that something is being described as an example, illustration, or illustration. Any embodiment or design described as "exemplary" or "for example" in this application should not be construed as being more preferred or advantageous than other embodiments or design solutions. Specifically, the use of terms such as "exemplary" or "for example" is intended to present the relevant concepts in a concrete manner.
[0077] The technical solution provided in this application can be applied to a data transmission system including multiple data transmission devices, which can be devices, chips applied to devices, or interface devices, etc. In this data transmission system, data transmission devices (e.g., data transmitting devices) and data transmission devices (e.g., data receiving devices) can be directly connected or indirectly connected through switching devices such as routers; that is, all multiple data transmission devices can be connected to the switching device. In this application, data transmission between the multiple data transmission devices can be performed via wired or wireless means. Furthermore, when transmitting data between the multiple data transmission devices, signal transmission can be performed directly or through an interface device.
[0078] When the data transmission device is a chip within a device, the chips in the data transmission system can be interconnected via wired or wireless means. This chip can be a chip within the device, a chip in a docking station, or a chip in an adapter, etc. The docking station can connect to gigabit Ethernet ports, video graphics arrays (VGA), HDMI, trans flash (TF) cards, secure digital (SD) cards, charging ports, and USB ports, etc.
[0079] Optionally, when the data transmission device is a chip, the chip may further include an interface module, meaning this application can be applied to an interface module for chip-to-chip interconnection. This interface module can be understood as an intellectual property (IP) module integrated within the chip. Alternatively, the interface module can also be sold independently as an IP module. For example, the chip can be a system-on-chip (SoC), a central processing unit (CPU), or a graphics processing unit (GPU), etc., and the aforementioned interface module can be an interface module within the SoC, CPU, or GPU, etc. Optionally, the interface module can be a transmitting circuit and / or a receiving circuit.
[0080] The following example, using a data transmission system comprising multiple devices, illustrates the structure of such a data transmission device.
[0081] Figure 1This is a schematic diagram of a data transmission system provided in an embodiment of this application. The data transmission system includes a first device 110 and a second device 120, which are connected via a wired or wireless means, such as a cable. The first device 110 and the second device 120 can transmit signals, such as audio / video data or charging signals. In one example, the first device 110 can be a set-top box, and the second device 120 can be a television. The set-top box and the television can be connected via a cable, and the set-top box can transmit audio / video data to the television via the cable. In another example, the first device 110 is a monitor, and the second device 120 is a game controller. The monitor and the game controller can be connected via a cable, and the game controller can transmit control information to the monitor via the cable.
[0082] Optionally, the first device 110 may include interface A, and the second device may include interface B. The connection between the first device 110 and the second device 120 may specifically be between interface A of the first device 110 and interface B of the second device 120, for example, the interface A of the first device 110 and the interface B of the second device 120 may be connected by a cable.
[0083] Figure 2 This is a schematic diagram of another data transmission system provided in an embodiment of this application. The data transmission system includes multiple devices 210 and a router 220. The multiple devices 210 can be connected to the router 220 via wired or wireless means; for example, all multiple devices 210 can be connected to the router 220 via cables. Any two devices among the multiple devices 210 can transmit signals through the router 220, such as transmitting audio / video data or charging signals. In one example, the multiple devices 210 may include a display 211, a set-top box 212, and an audio player (e.g., an MP3 player) 213. The set-top box 212 can transmit audio / video data to the display 211 through the router 220, and the set-top box 212 can also transmit audio data to the audio player 213 through the router 220. Additionally, the multiple devices 210 may also include two interconnected devices; for example, the multiple devices 210 may also include a game controller 214, which can be connected to the display 211 and transmit control information to the display 211.
[0084] Optionally, each of the plurality of devices 210 may include an interface, and the router 220 may include multiple interfaces. The interface of each of the plurality of devices 210 may be connected to one of the multiple interfaces of the router 220. For example, the plurality of devices 210 may include a monitor, a set-top box, a game controller, and an audio player. The multiple interfaces of the router 220 include a first interface to a fourth interface. The interface of the monitor is connected to the first interface of the router 220 via a cable, the interface of the set-top box is connected to the second interface of the router 220 via a cable, the interface of the game controller is connected to the third interface of the router 220 via a cable, and the interface of the audio player is connected to the fourth interface of the router 220 via a cable.
[0085] The devices in the aforementioned system with data transmission capabilities can be called communication devices. These communication devices can be deployed on land, including indoors or outdoors, handheld or vehicle-mounted. They can also be deployed on water (such as on ships) and in the air (such as on airplanes, balloons, and satellites), and can be applied to various scenarios. For example, the communication device may include, but is not limited to: mobile phone, tablet computer, laptop computer, PDA, mobile internet device (MID), camera, wearable device (e.g., smartwatch, smart bracelet, pedometer, etc.), audio equipment, audio and video player, set-top box, game console, printer, mouse, keyboard, in-vehicle equipment (e.g., equipment on vehicles such as cars, bicycles, electric vehicles, airplanes, ships, trains, and high-speed trains), virtual reality (VR) device, augmented reality (AR) device, wireless terminal in industrial control, smart home device (e.g., refrigerator, television, air conditioner, electricity meter, etc.), smart robot, workshop equipment, wireless terminal in self-driving, wireless terminal in remote medical surgery, wireless terminal in smart grid, wireless terminal in transportation safety, wireless terminal in smart city, or smart home. Wireless terminals and flying equipment (e.g., intelligent robots, hot air balloons, drones, airplanes) in the home. Optionally, the signals transmitted between the above-mentioned communication devices may include, but are not limited to: audio and video signals, radio frequency signals, IoT data, and charging signals.
[0086] In this application, the interface specifications used for signal transmission between devices in the data transmission system may include, but are not limited to: Universal Serial Bus (USB) interface specifications, High Definition Multimedia Interface (HDMI) specifications, DisplayPort (DP) specifications, Unified Multimedia Interconnection (UMI) interface specifications, and Peripheral Component Interconnect Express (PCI-Express) interface specifications. Correspondingly, the interface may be HDMI, miniHDMI, micro HDMI, Type-A, Type-B, Micro-B, or Type-C, etc.
[0087] For example, in the above example, the interface connection between the set-top box and the TV, or between the game console and the monitor, can be via a USB cable, following the USB interface standard; or the connection can be via an HDMI cable, following the HDMI interface standard.
[0088] It is understood that the interface specifications used for signal transmission between the above-mentioned devices are merely exemplary. In practical applications, the interface specifications may also include other or any interface specifications that may appear in the future, such as the Unified Media Interconnection (UMI) interface, etc. This application embodiment does not impose specific limitations on this.
[0089] In this application, when the device is an electronic device, such as Figure 3The diagram illustrates the basic components of an electronic device. The electronic device includes an interface chip 200 (UMI interface), which comprises one or more adapters 201, an OR management / control adapter 202, and an OR port 203. Alternatively, if the electronic device is a routing device, the interface chip 200 may only include one or more ports 203. Each of the one or more adapters 201 can be coupled to an external component of the interface chip 200. The OR management / control adapter 202 can be coupled to an external component of the interface chip 200 for management / control purposes. The port 203 can be coupled to a connector 204 of the electronic device, which is used to couple external devices of the electronic device. The one or more adapters 201 may be transmit / receive adapters. For example, when adapter 201 is used for audio / video format adaptation, adapter 201 may be an audio / video transmit / receive adapter. When adapter 201 is used for third-party protocol adaptation, adapter 201 may be a third-party protocol adapter.
[0090] For example, when port 203 is a downlink port, the transmitting adapter can be used to adapt the service information to be sent into service information that can be transmitted on port 203 of the interface chip, and then send the service information out through port 203. When port 203 is an uplink port, the receiving adapter 201 can be used to adapt the service information received from port 203 into service information that can be processed internally by the electronic device for internal processing. The management and control adapter 202 can be used to adapt control information.
[0091] Different electronic devices can be combined with their basic components to form various device types. For example, an electronic device may include a source device with at least one downlink port and at least one audio / video transmission adapter, or a source device with at least one uplink port and an audio / video reception adapter, or a docking station device with at least one uplink port, at least one audio / video reception adapter, and at least one conventional audio / video interface, or a routing device with at least one downlink port and at least one uplink port, but without audio / video transmission adapters and audio / video reception adapters, or a composite device with both uplink and downlink ports.
[0092] like Figure 4 The diagram illustrates an interface-to-interface transmission method according to an embodiment of this application. The uplink and downlink ports between devices include a main link (ML) and a sideband link (SL). Further, they may also include a powerbus link (PL) and a cable information link (CL). The cable information link can be used to transmit cable information, such as cable type and cable capability information.
[0093] The main link is used for high-speed data transmission, such as audio and video signal transmission, while the auxiliary link is mainly used for management and control between devices, such as device discovery, capability query, device configuration, and device control. It can also be used for low-speed data transmission and control message transmission.
[0094] In some scenarios, the main link consists of one or more lanes, each supporting unidirectional transmission only, while the auxiliary link consists of two single-ended lanes in different directions. Alternatively, some lanes of the main link are unidirectional, while others are bidirectional, and the auxiliary link is bidirectional. A main link can include multiple lanes, such as 2 / 5 / 9 lanes. The more lanes, the faster the data transmission speed.
[0095] In addition, both uplink and downlink ports can include multiple pins, such as pins connected to ground, pins connected to power, pins connected to the main link channel, and pins connected to the auxiliary link channel.
[0096] During signal transmission, interference and noise can cause data transmission errors. To avoid these errors, error correction techniques are typically used. Forward error correction (FEC) is a commonly used technique to detect and correct a limited number of errors in transmitted data without retransmission. Common FEC encoding methods include low-density parity check codes (LDPC), turbo codes, polar codes, Reed-Solomon (RS) codes, and convolutional codes. The main principle of FEC is to process the original data using algorithms to add redundant content, sacrificing some transmission bandwidth to ensure that even if only a portion of the normal data and redundant content is received, the original data can still be fully recovered. RS codes are a common FEC encoding scheme, and the following section uses RS codes as an example to illustrate the FEC encoding process.
[0097] For example, such as Figure 5The diagram illustrates a method for FEC encoding using RS code. The encoding process includes: dividing the data to be transmitted into code blocks of size k bytes (including information bits), where one byte equals 8 bits; and RS encoding each code block to obtain an encoded code block of size n bytes (including information bits and parity bits), where k is less than or equal to n. For example, in one example, RS(194, 192) code based on GF(256) is used, where k = 192 and n = 194. In another example, RS(48, 46) code based on GF(256) is used, where k = 46 and n = 48. Here, GF refers to the Galois field (GF), also known as a finite field.
[0098] To further improve the system's resilience to burst errors, interleaving technology is typically employed. This interleaving technique distributes adjacent code blocks across different times or channels for transmission. If a transmission error occurs on a certain channel at a certain time, after deinterleaving, the erroneous data will be distributed across different code blocks, thereby reducing the error probability of each code block.
[0099] For example, such as Figure 6 As shown, after interleaving the four code blocks ([A1 A2 A3 A4][B1 B2 B3 B4][C1 C2 C3 C4][D1 D2 D3 D4]), [A1 B1 C1 D1] is transmitted in channel 1, [A2 B2 C2 D2] in channel 2, [C1 C2 C3 C4] in channel 3, and [D1 D2 D3 D4] in channel 4. If a transmission error occurs in [A2 B2 C2 D2] on channel 2, after deinterleaving, A2 to D2 are distributed among the four code blocks ([A1 A2 A3 A4][B1 B2 B3 B4][C1 C2 C3 C4][D1 D2 D3 D4]), thereby reducing the error rate of a single code block. Since the error rate of a single code block is below a certain value, it can be corrected using error-correcting codes, and finally, the receiving end can obtain completely correct data. Among them, the greater the distance between data of the same code block transmitted in the same channel after interleaving, the greater the interleaving depth, the greater the dispersion, and the stronger the ability to resist sudden errors.
[0100] In high-speed data transmission, encoded data is distributed across multiple channels for transmission (for example, in one implementation, encoded data is evenly distributed byte-by-byte across enabled channels). The more channels there are, the more code blocks participate in interleaving, and the greater the distance between data blocks of the same code transmitted on the same channel after interleaving, thus increasing the ability to resist sudden interference. However, more channels and more code blocks also mean greater power consumption. The following example illustrates the data processing in this high-speed data transmission process, which may include code block mapping, encoding, and channel mapping.
[0101] In one example, such as Figure 7 The diagram shown illustrates data processing during high-speed data transmission. Figure 8 This diagram illustrates the mapping of the bitstream, code blocks, and channels corresponding to this data processing procedure. The diagram uses RS encoding (the corresponding encoder is called an RS-FEC encoder) and the number of RS-FEC encoders is 3 (or the number of encoded code blocks is 3). It should be noted that the scheme described in this application is applicable to various types of encoders and is not limited to RS-FEC encoders. Specifically, the data processing procedure may include: mapping the bitstream A to be transmitted into code blocks to obtain three code blocks, denoted as code blocks E1 to E3; encoding code blocks E1 to E3 using RS-FEC encoders to obtain three encoded code blocks, denoted as code blocks C1 to C3. This can be done using three RS-FEC encoders to encode E1 to E3 separately, or using one encoder to encode code blocks E1 to E3 sequentially; and mapping code blocks C1 to C3 into channels, that is, mapping the data in code blocks C1 to C3 to N channels (denoted as channel 0 to channel N-1). Figure 8 In this example, N equals 4, and the four channels are represented as 0 to 3. Bitstream A contains 144 bytes of data, denoted by B0, B1, ..., B233. The numbers 0 to 143 represent the sequence numbers of the 144 data units (bytes) in bitstream A. After code block mapping, the data units in code block E1 are [B0B3 B6 B9 B12...B141], those in code block E2 are [B1 B4 B7 B10 B13...B142], and those in code block E3 are [B2 B5 B8 B11 B14...B143]. For simplicity, the diagram only shows the byte numbers corresponding to the data units in each code block.
[0102] As shown in the example above, within the same channel, the distance between two data points output by the same RS-FEC encoder is 12, or the interleaving depth is 12. This interleaving depth of 12 is equal to the least common multiple of the number of RS-FEC encoders or code blocks (3) and the number of channels (4). For example, ... Figure 9As shown, if the RS-FEC encoder or the number of code blocks is 6 and the number of channels is 9, and the code block mapping, encoding and channel mapping of the code stream A to be transmitted are performed in a similar manner as described above, then the interleaving depth is 18, that is, the interleaving depth 18 is equal to the least common multiple of the number of RS-FEC encoders or code blocks 6 and the number of channels 9. Figure 9 In the diagram, the six code blocks obtained after mapping code stream A are represented as code blocks E1 to E6. The data units in code block E1 are [0 6 12 18…282], the data units in code block E2 are [1 7 13 19…283], the data units in code block E3 are [2 8 14 20…284], the data units in code block E4 are [3 9 15 21…285], the data units in code block E5 are [4 10 16 22…286], and the data units in code block E6 are [5 11 17 23…287]. The nine channels are represented as 0 to 8. For simplicity, only the byte numbers corresponding to the data units of each code block are shown in the diagram.
[0103] Therefore, in the above code block mapping, encoding, and mapping methods, within the same channel, the minimum value of the byte numbers corresponding to any two data units of the same RS FEC encoder code block (referred to as the interleaving depth, or the distance between any two data units) is equal to the least common multiple of the number of RS-FEC encoders and the number of channels. When this method is applied to scenarios with long error or interference times, it is necessary to increase the number of RS-FEC encoders or open more channels to increase the interleaving depth. However, increasing the number of encoders and channels will increase cost and power consumption, resulting in high power consumption and high cost.
[0104] Based on this, this application provides a data transmission method that increases the distance between data units of the same code block transmitted in the same channel (i.e., the difference between the byte numbers of any two data units in the same code block), thereby significantly increasing the interleaving depth and improving the system's ability to resist sudden interference. Furthermore, compared to the methods in the examples above, this method does not increase the number of encoders or channels, thus greatly reducing power consumption and cost. This method can be applied to any data transmission system, such as the data transmission system provided above. The specific process of this method is described below.
[0105] Figure 10 This is a flowchart illustrating a data transmission method provided in an embodiment of this application. The method may include the following steps. This method can be applied to a data transmission system including a data transmitting device and a data receiving device, which can be connected via wired or wireless means, and the connection can be direct or indirect. Figure 11 for Figure 10 The data transmission method shown is an example of data processing, and S302 below will be referred to as channel mapping.
[0106] S301: The data transmitting device acquires a data block to be mapped by the channel, which includes X data units, where X is a positive integer. Figure 11 The X data units are represented as B(0) to B(X-1).
[0107] The data unit can refer to the basic unit or basic element in the data block to be mapped by the channel. A data block to be mapped by the channel can include multiple data units, and each data unit can include data of a fixed length, such as 1 bit of data, 1 byte of data, or 2 bytes of data.
[0108] The data block to be mapped may consist only of the data to be transmitted. For example, the data block may consist only of a block body, which is a logical layer block (LLB) containing X data units. Alternatively, the data block may include both a block body and parity data. The block body is a logical layer block, and the parity data may refer to the parity data (or parity byte) corresponding to the FEC encoding of the block body. For example, the data block may include a block body and a block tail, where the block body is a logical layer block and the block tail includes the parity data of that logical layer block. Furthermore, the data block to be mapped may be multiplexed from multiple logical layer blocks (optionally, also including the parity data of those logical layer blocks).
[0109] For the sake of simplicity, this article refers to the data block to be mapped as a logical block.
[0110] The length X of this logical block data can be a fixed value or adjusted according to the actual amount of data to be transmitted.
[0111] In one example, the logical block can consist of 240 bytes, all of which are the block body. If each data unit includes 1 byte of data, then the logical block includes 240 data units. Alternatively, the logical block can consist of 240 bytes, with the first 230 bytes forming the block body and the last 10 bytes forming the block footer. The block footer contains the checksum bytes corresponding to the block body. If each data unit includes 1 byte of data, then the logical block includes 230 data units and 10 bytes of checksum data.
[0112] In another example, the logical block can consist of 480 bytes, all of which are the block body. If each data unit includes one byte of data, then the logical block includes 480 data units. Alternatively, the logical block can consist of 480 bytes, with the first 460 bytes forming the block body and the last 20 bytes forming the block trailer. The block trailer contains the checksum bytes corresponding to the block body. If each data unit includes one byte of data, then the logical block includes 460 data units and 20 bytes of checksum data.
[0113] Optionally, the X data units can correspond to M code blocks (or M encoders), where M is a positive integer. For example, the value of M can be a positive integer, such as 1, 3, 5, 6, 8, or 10, etc. The specific value of M is not limited in the embodiments of this application.
[0114] In one possible embodiment, such as Figure 12 As shown, the data transmitting device acquires the data block to be channel mapped, which may specifically include: performing code block mapping on the data to be transmitted (or input code stream, which can be represented as A(0) to A(X'-1)), the data to be transmitted including X' data units, for example, performing code block mapping on the X' data units in the manner of row-to-column reading or column-to-row reading, to obtain M pre-encoded code blocks, which are respectively represented as code blocks E1 to code blocks EM; performing encoding processing on the M pre-encoded code blocks, for example, performing RS-FEC encoding processing on the M pre-encoded code blocks respectively, to obtain M post-encoded code blocks, which are respectively represented as code blocks C1 to code blocks CM, code blocks C1 to code blocks CM including pre-encoded code blocks and check information, the number of data units of code blocks C1 to code blocks CM is X”, X” is greater than or equal to X', the data block to be channel mapped includes the M post-encoded code blocks; then, the data block to be channel mapped can be channel mapped according to the following step S302. At this point, X” equals X, and X data units include X' data units and the check information of M pre-coded code blocks.
[0115] Optionally, when the number of data units X' included in the data to be transmitted is an integer of M, the number X of data units included in the data block to be mapped by the channel can be an integer multiple of M. If X' and / or X is not an integer multiple of M, it can be filled by data padding so that X' and / or X after padding is an integer multiple of M. The padding data can be predetermined (e.g., padding with 00) or padding with random bits. This application embodiment does not impose specific limitations on this. In addition, the M encoded code blocks can be obtained by encoding with M encoders, in which case the encoding delay is relatively short; or, the M encoded code blocks can also be obtained by time division multiplexing with less than M encoders, for example, serial encoding with one encoder. The latter method saves costs, but requires buffering the data and waiting for all M pre-encoded code blocks to be encoded before channel mapping, resulting in a longer delay.
[0116] Furthermore, when other information needs to be transmitted in this logical layer, the data transmission device can also multiplex (or reuse) the M encoded code blocks together with other information. For example, combining... Figure 12 ,like Figure 13 As shown, after obtaining the M encoded code blocks, the data transmitting device can multiplex the M encoded code blocks with the other information to obtain the data block to be mapped by the channel. For example, the other information may include logic layer management information, so that the data block to be mapped by the channel may include the M encoded code blocks and the logic layer management information.
[0117] It is understandable that when the data block to be mapped by the channel only includes the M encoded code blocks, the value of X” is equal to that of X, that is, the X data units in the data block to be mapped by the channel are the X' data units in the data to be transmitted (optionally, it also includes the check information of the M code blocks corresponding to the X' data units); when the data block to be mapped by the channel includes both the M encoded code blocks and the logic layer management information, the value of X” is less than that of X, that is, the X data units in the data block to be mapped by the channel include the X' data units in the data to be transmitted, the check information of the M code blocks, and the data units corresponding to the logic layer management information.
[0118] S302: The data transmitting device maps the X data units to N channels. Each of the N channels, consisting of g channels, includes at least one data set. Each data set includes multiple data groups, each corresponding to a different cyclic shift value. The cyclic shift value is a non-negative integer less than g. Here, N and g are positive integers, with N greater than or equal to g. For example, the value of g can be a factor of N. Figure 12In this application, N channels are represented as channels 0 to N-1, and data units mapped to the N channels are represented as D(0, 0) to D(W-1, N-1). The i-th data unit of the j-th channel is represented as D(i, j), where W = int(X / N) + 1, and int represents rounding down. Mapping these X data units to N channels is also referred to as allocating or distributing these X data units to the N channels for further processing.
[0119] In this dataset, the difference between the cyclic shift values of any two adjacent data groups can be equal. In one example, the cyclic shift values of the data groups can be sequentially increasing. For instance, the dataset could include three data groups with cyclic shift values of 0, 1, and 2 respectively. Alternatively, the dataset could include six data groups with cyclic shift values of 0, 1, 2, 0, 1, and 2 respectively.
[0120] Furthermore, each of these multiple data groups can include m rows of data units, that is, each data group includes m rows of data units, where M is greater than m and m is a positive integer. Each of these m rows of data units includes g columns of data units, and each of these g columns corresponds to one of the aforementioned g channels.
[0121] Furthermore, these N channels can also be called N enable channels, specifically referring to enabled channels, or understood as channels actually used for data transmission. The number of channels possessed by the data transmitting device can be greater than or equal to N, meaning that these N channels can be some or all of the channels possessed by the data transmitting device.
[0122] Optionally, each of the multiple data groups is obtained by cyclically shifting the data units of that data group.
[0123] In one possible embodiment, the data transmitting device maps the X data units to N channels, which may specifically include: the data transmitting device allocating the X data units to the N channels according to certain rules, wherein each of the N channels includes at least one data set, and each data set includes multiple data groups, which correspond to different cyclic shift values.
[0124] Optionally, the values of g and m can be determined based on the number of coded blocks M and the number of channels N included in the logic block. That is, the data transmitting device can determine g and the number of rows m of data units included in each data group based on M and N. The following provides an example illustrating how to determine the values of g and m.
[0125] For example, the data transmitting device may determine the value of g and the value of m by: determining the greatest common divisor g based on M and N, i.e. g is the greatest common divisor of M and N; and determining the number of rows m of the data units included in each data group based on M and the greatest common divisor g, for example, m = M / g, i.e. the value of m is equal to the quotient of M and g.
[0126] For example, after the X data units are mapped to the N channels, the following conditions are met: Assuming that the N channels include W rows and N columns of data units (or each channel includes X / N data units), then the cyclic shift value corresponding to the data unit in the i-th row and j-th column (or the i-th data unit of the j-th channel) is equal to int(i / m)mod g; and / or, the data unit in the i-th row and j-th column is the v-th data unit among the X data units, v = int(k / g)*g + (((int(int(k / N) / m)mod g)*(g-1) + (k mod g))mod g), k = i*N+j, v = 0, 1, 2, ..., (X-1). Where g = gcd(M, N), m = M / g, gcd represents taking the greatest common divisor, mod represents taking the remainder, int represents rounding down, * represents multiplication, / represents division, and W is a positive integer. The X data units are mapped to the N channels, that is, the i-th data unit D(i,j) of the j-th channel is equal to B(v).
[0127] Based on the above description, Figure 14 The diagram illustrates a distribution of the X data units mapped to the N channels. The N channels are divided into n interleaving regions (represented as interleaving region 0 to interleaving region n-1, n = N / g) according to each adjacent g channel. The cyclic shift values (or offsets) corresponding to these multiple data groups are 0, 1, 2, ..., g-1, respectively. Each data group includes m rows of data units. Figure 14 It is assumed that the multiple data sets include g data sets, which are respectively represented as group 0 to group (g-1).
[0128] It is understood that the g channels can be adjacent channels or non-adjacent channels. Although the following embodiments of this application use the example of g channels being adjacent, in actual implementation, they are not limited to being adjacent. Each of the g channels in the N channels can be determined as a channel mapping interleaving region in any way. For example, the N channels include 8 channels, where the odd-numbered channels form a group containing g channels, and the even-numbered channels form another group containing g channels.
[0129] For ease of understanding, the following example uses a data stream code block to be transmitted containing X' = 276 data units, a data block to be mapped to the channel containing X = 288 data units, an encoder using RS(48, 46) encoding, M = 6, and N = 9. Figures 15 to 17 The interleaving, encoding, and channel mapping processes in the embodiments of this application are illustrated with examples. The numbers in the figures represent the serial numbers of digital units, and the data units corresponding to the same fill pattern in the figures can represent different data units within the same code block.
[0130] Figure 15 The diagram illustrates the code block mapping of the 276 data stream code blocks to be transmitted (represented as code stream A). After code block mapping, the data units in code block E1 are [0 6 12 18…270], the data units in code block E2 are [1 7 13 19…271], the data units in code block E3 are [2 8 14 20…272], the data units in code block E4 are [39 15 21…273], the data units in code block E5 are [410 16 22…274], and the data units in code block E6 are [5 1117 23…275]. The numbers 0, 1, 2, …275 represent the sequence number of the data unit.
[0131] Figure 16 The diagram shows the encoded code blocks E1 to E6. Assuming RS(48, 46) encoding is used, RSxx represents the check information corresponding to the code block. Accordingly, the encoded code block C1 is [0 6 12 18…270RS00 RS01], code block C2 is [1 7 13 19…271RS10 RS11], code block C3 is [2 8 14 20…272RS20 RS21], code block C4 is [39 15 21…273RS30 RS31], code block C5 is [4 10 16 22…274RS40 RS41], and code block C6 is [5 11 1723…275RS50 RS51]. In the diagram, RS00, RS01, RS10, RS11, RS20, RS21, RS30, RS31, RS40, RS41, RS50, and RS51 represent verification information. The data block to be mapped is [0 12…275 276 277 278…281 282 283 284 285 286 287], where [276 277 278 279 280 281…286 287] correspond to [RS00 RS01 RS10 RS11 RS20 R21…RS50 RS51] respectively, and the numbers 0, 1, 2, … 275 represent the sequence number of the data unit of the data block to be mapped.
[0132] Figure 17A schematic diagram is shown illustrating the mapping of data blocks to be mapped across nine channels. The numbers in the diagram represent the sequence numbers of the data units within the data blocks to be mapped. Where g = gcd(M, N) = gcd(6, 9) = 3, each set of three adjacent channels constitutes one interleaving region. The nine channels are divided into three interleaving regions. Each interleaving region (i.e., each set of three adjacent channels) includes multiple data sets. Each data set includes three data groups, designated as group 0 to group 2. Each data group includes two rows of data units, and the corresponding cyclic shift values for these three data groups are 0, 1, and 2, respectively. The diagram illustrates a rightward cyclic shift, but in practical applications, a leftward cyclic shift is also possible; this embodiment does not impose specific limitations on this. As an example, the diagram only shows a partial schematic of the data unit channel mapping results. It can be understood that step S302 of this invention can complete the mapping of all X = 288 data units.
[0133] according to Figure 17 It is known that within the same channel, the minimum distance between any two data units in the same code block is 54. That is, the minimum difference in sequence numbers between any two data units from the same code block is 54. The minimum difference in sequence numbers between any two data units in the same code block is defined as the interleaving depth, which is 54. This 54 is equal to the product of the number of channels (9) and the number of code blocks (6). For example, the distance between two data units B0 and B54 from the same code block C1 in the 0th channel of the same channel is 54 (the difference in data unit sequence numbers is 54). And the above... Figure 10 In the illustrated scheme, when the number of channels is 9 and the number of code blocks is 6, the corresponding interleaving depth is 18. Therefore, the technical solution provided in this application embodiment can increase the distance between data units from the same code block transmitted in the same channel, thereby greatly increasing the ability to resist sudden interference, and... Figure 10 Compared to the proposed solution, this method does not require an increase in the number of encoders or channels, thus significantly reducing power consumption and cost.
[0134] Figure 18 The diagram shows how X data units are mapped to the N channels when M=5 and N=1, 2, 3, 4. Figure 19 The diagram illustrates the mapping of X data units to N channels when M=10 and N=1, 2, 3, 4, 5, 6, 7, 8. B1 to B54 in the diagram represent different data units, and data units corresponding to the same fill pattern can represent different data units within the same code block. As an example, the diagram only shows a partial schematic of the data unit channel mapping results. It can be understood that step S302 of this invention can complete the mapping of all X=288 data units.
[0135] In another possible embodiment, the data transmitting device maps the X data units to N channels, which may specifically include: for each of the X data units, querying preset corresponding information based on the position information of the data unit in the logic block to determine the mapping position information of the data unit in the N channels; and mapping the data unit to the N channels based on the mapping position information.
[0136] The preset correspondence is used to indicate the correspondence between the position information of each data unit in the X data units within the logic block and the mapped position information in the N channels. For example, assuming the N channels comprise W rows and N columns of data units, the preset correspondence can be: the data unit in the i-th row and j-th column is the v-th data unit among the X data units, v = int(k / g)*g + (((int(int(k / N) / m)mod g)*(g-1) + (k mod g))mod g), k = i*N+j, v = 0, 1, 2, ..., (X-1). Here, g = gcd(M, N), m = M / g, gcd represents taking the greatest common divisor, mod represents taking the remainder, int represents rounding down, * represents multiplication, / represents division, and W is a positive integer.
[0137] It is understood that the preset correspondence can also be in other forms. For example, the preset correspondence can be directly used to indicate the sequence number of each data unit in the X data units and the corresponding position number mapped to the N channels. The above illustration is only an example and does not constitute a limitation on the embodiments of this application.
[0138] S303: The data transmitting device transmits the processed data units in each of the N channels according to the channel mapping result.
[0139] When the X data units are mapped to N channels, the data transmitting device can process the data allocated to each channel according to the channel mapping result. This processing may include scrambling, precoding, etc., of the data units (for example, such as...). Figure 17 As shown), each of the N channels transmits processed data units. For example, using... Figure 17 For example, in each channel, the data unit sent by the j-th channel in the i-th time unit is represented as F(i,j), where F(i,j) is the data unit after processing by D(i,j).
[0140] In this embodiment, after acquiring a data block with X data units to be mapped to a channel, the data transmitting device can map the X data units to N channels. Each of the N channels includes at least one data set, and each data set includes multiple data groups corresponding to different cyclic shift values. This increases the transmission distance of data units from the same code block within the same channel, thereby significantly increasing the resistance to sudden interference when transmitting data units from the N channels. Furthermore, this solution eliminates the need to increase the number of encoders and channels, thus greatly reducing power consumption and cost.
[0141] Furthermore, after the data transmitting device transmits the data units from the N channels, the data receiving device can receive the data units from the N channels and demap the received data units to obtain the demapped data block. That is, after S303, as... Figure 20 As shown, the method may further include: S304-S305. Figure 20 S301-S303 are not shown in the diagram. Figure 21 for Figure 20 The data transmission method shown is an example of data processing corresponding to the data processing method shown, and S305 below is referred to as dechannel mapping.
[0142] S304: The data receiving device receives data units from each of the N channels to obtain the data units of the channel to be mapped.
[0143] The N channels are represented as channels 0 to N-1, and the data received by the j-th channel in the i-th time unit is represented as G(i,j). After de-precoding and descrambling corresponding to the scrambling and precoding in step S303 above, the data unit H(i,j) to be mapped by the channel is obtained. H(i,j) represents the data unit to be mapped by the channel in the j-th channel in the i-th time unit.
[0144] S305: The data receiving device demaps the data units in the received N channels to obtain a demapped data block including X data units.
[0145] In one possible embodiment, the data receiving device demaps the data units in the N channels, which may specifically include: the data receiving device cyclically shifts the channels in which the data units in the plurality of data groups of each data set are located, and the plurality of data groups correspond to different cyclic shift values; the data receiving device obtains the data units in the N channels after cyclic shifting to obtain the demapped data block.
[0146] Optionally, the X data units and the data units in the N channels satisfy the following conditions: Assuming the N channels comprise W rows and N columns of data units, the cyclic shift value corresponding to the data unit in the i-th row and j-th column is equal to int(i / m)mod g; and / or, the data unit in the i-th row and j-th column is the v-th data unit among the X data units, v = int(k / g)*g + (((int(int(k / N) / m)mod g)*(g-1) + (k mod g))mod g), k = i*N+j. Where g = gcd(M, N), m = M / g, gcd represents taking the greatest common divisor, mod represents taking the remainder, int represents rounding down, * represents multiplication, / represents division, W is a positive integer, W = int(X / M) + 1. Let H(i,j) represent the data unit to be mapped in the j-th channel at the i-th time unit, and let P(v) represent the v-th data unit of the data block after the channel mapping is solved, i.e., P(v) = H(i,j).
[0147] For example, taking X=288, M=6, N=9 as an example, assume that the distribution of data units in the N channels received by the data receiving device is as follows: Figure 17 As shown. The data receiving device can determine g = gcd(M, N) = gcd(6, 9) = 3 based on the above conditions, meaning that every three adjacent channels constitute one interleaving region. The nine channels are divided into three interleaving regions. Each interleaving region (i.e., every three adjacent channels) includes multiple data sets, each data set includes three data groups, each data group includes two rows of data units, and the cyclic shift values corresponding to these three data groups are 0, 1, and 2, respectively. At this time, in Figure 17 Taking the first data set in each interleaving region as an example, the data receiving device can perform no cyclic shift on the channel containing the first data set (i.e., the cyclic shift value is 0), perform a left cyclic shift on the channel containing the second data set with a corresponding cyclic shift value of 1, and perform a left cyclic shift on the channel containing the third data set with a corresponding cyclic shift value of 2. After processing multiple data sets in each interleaving region according to the above scheme, a schematic diagram of data units in N channels can be obtained. Furthermore, the data receiving device can obtain data units from the N channels to achieve demapping of the data units in the N channels.
[0148] In another possible embodiment, the data receiving device demaps the data units in the N channels to obtain a demapped data block (logic block) comprising X data units. This includes: for each data unit in the N channels, the data receiving device queries preset correspondence information based on the data unit's mapping position information in the N channels to determine the data unit's position information in the X data units; and the data receiving device demaps the data unit into the logical block based on the position information. The preset correspondence indicates the correspondence between the position information of each data unit in the X data units in the logical block and its mapping position information in the N channels.
[0149] The preset correspondence is used to indicate the correspondence between the position information of each data unit in the X data units in the logic block and the mapping position information in the N channels. For example, assuming the N channels include W rows and N columns of data units, the preset correspondence can be: the data unit in the i-th row and j-th column is the v-th data unit in the X data units, v = int(k / g)*g + (((int(int(k / N) / m)mod g)*(g-1) + (k mod g))mod g), k = i*N+j. Here, g = gcd(M, N), m = M / g, gcd represents taking the greatest common divisor, mod represents taking the remainder, int represents rounding down, * represents multiplication, / represents division, and M is a positive integer. H(i, j) represents the data unit to be mapped to the channel in the j-th channel at the i-th time unit, and P(v) represents the v-th data unit in the logic block after demapping, i.e., P(v) = H(i, j).
[0150] It is understood that the preset correspondence can also be in other forms. For example, the preset correspondence can be directly used to indicate the number of each data unit in the X data units and the corresponding position number mapped to the N channels. The above illustration is only an example and does not constitute a limitation on the embodiments of this application.
[0151] It is understandable that if no bit error occurs during transmission, for the same logical block, P(v) = B(v).
[0152] Optional, such as Figure 20 As shown, after the data receiving device demaps the data units in the N channels, the method may further include: S306-S307. Figure 21 The diagram also shows other processing steps after demultiplexing, such as demultiplexing, decoding, and code block inverse mapping. In the diagram, the M pre-decoding code blocks after demultiplexing are represented as code blocks Q1 to QM, and the M post-decoding code blocks after decoding are represented as code blocks R1 to RM.
[0153] S306: The data receiving device decodes the logic block to obtain M decoded code blocks.
[0154] If the data transmitting device does not multiplex the M coded blocks with the transport layer management information during the transmission of the X data units, the demapped data obtained by the data transmitting device includes the M pre-decoded blocks. If the data transmitting device multiplexes the M pre-decoded blocks with the transport layer management information during the transmission of the X data units, the demapped data obtained by the data receiving device includes the M pre-decoded blocks and the transport layer management information.
[0155] In one possible embodiment, if the demapped data obtained by the data receiving device includes M pre-decoding code blocks, the data receiving device can perform RS-FEC decoding on the M pre-decoding code blocks to obtain M post-decoding code blocks. If the demapped data obtained by the data receiving device includes M pre-decoding code blocks and transport layer management information, the data receiving device can demultiplex the demapped data to obtain M pre-decoding code blocks and transport layer management information; subsequently, the data receiving device can perform RS-FEC decoding on the M pre-decoding code blocks to obtain M post-decoding code blocks. Optionally, the M pre-decoding code blocks may include data units, or may include data units and check data.
[0156] It is understandable that the above decoding can also be called decoding, and the M pre-decoding code blocks can also be called M pre-decoding code blocks. The module used for RS-FEC decoding can be called a decoder or a decoder.
[0157] Understandably, if no errors occur during transmission, for the same logical block, the value of code block Q1 before decoding is the same as the value of code block C1 after encoding, the value of code block Q2 before decoding is the same as the value of code block C2 after encoding, and so on. For the same logical block, the value of code block R1 after decoding is the same as the value of code block E1 before encoding, the value of code block R2 after decoding is the same as the value of code block E2 before encoding, and so on.
[0158] S307: The data receiving device performs decoding block mapping on the M decoded code blocks to obtain the data to be transmitted.
[0159] Optionally, after the data receiving device obtains the M decoded code blocks, it performs decoding block mapping on these M decoded code blocks. Specifically, this may include: if the data sending device performs interleaving in a row-to-column manner, the data receiving device can perform decoding block mapping in a column-to-row manner to obtain the data to be transmitted; if the data sending device performs code block mapping in a column-to-row manner, the data receiving device can perform decoding block mapping in a row-to-column manner to obtain the data to be transmitted. This data to be transmitted can also be referred to as output data.
[0160] In this embodiment, the data receiving device receives data units from each of N channels. Each of the N channels includes at least one data set, and each data set includes multiple data groups. These multiple data groups correspond to different cyclic shift values, thereby increasing the distance between data units of the same code block transmitted in the same channel. That is, the difference in the numbers of the data units of the same code block transmitted in the same channel is larger, which greatly increases the ability to resist burst interference when transmitting data units from the N channels. In addition, this scheme does not require increasing the number of decoders and channels, thereby greatly reducing power consumption and cost.
[0161] The data blocks for channel mapping and demapping can include one or more logical blocks. One or more logical blocks constitute a logical layer data frame (LLDF). Channel mapping and demapping are performed as a whole using the logical data frame. All data within a single LLDF is continuously allocated and combined on each channel. Data allocation and combination must ensure that the amount of data transmitted on each channel is the same; otherwise, random data needs to be padded, preferably with 0x00, to ensure that the LLCF code patterns transmitted on each channel after LLDF are aligned.
[0162] In one possible embodiment of this application, the data transmission method may include: acquiring a logic block comprising X data units, where X is a positive integer; allocating the X data units to N channels, wherein each of the N channels comprises at least one data set, and each data set comprises multiple data groups; cyclically shifting the data units in the multiple data groups of each data set, wherein the multiple data groups correspond to different cyclic shift values; and transmitting the data units of each of the N channels.
[0163] In one possible embodiment of this application, the data transmission method may include: acquiring a logic block comprising X data units, the X data units corresponding to M code blocks, where X and M are positive integers; determining g and m based on the number of M and N channels, where M is greater than m; allocating the X data units to N channels, each of the N channels comprising at least one data set, each data set comprising multiple data groups, each data group comprising n rows of data units; cyclically shifting the data units in the multiple data groups of each data set, the multiple data groups corresponding to different cyclic shift values; and transmitting the data units of each of the N channels.
[0164] In one possible embodiment of this application, the data transmission method may include: acquiring a logic block comprising X data units, the X data units corresponding to M code blocks, where X and M are positive integers; determining a greatest common divisor g based on the M and the number of N channels; determining m based on the M and the greatest common divisor g, where M is greater than m; allocating the X data units to N channels, each of the N channels including at least one data set, each data set including multiple data groups, each data group including n rows of data units; cyclically shifting the channels containing the data units in the multiple data groups of each data set, the multiple data groups corresponding to different cyclic shift values; and transmitting the data units of each of the N channels.
[0165] In one possible embodiment of this application, the data transmission method may include: acquiring a logic block comprising X data units, where X is a positive integer; for each of the X data units, querying preset corresponding information based on the position information of the data unit in the logic block to determine the mapping position information of the data unit in N channels; mapping the data unit to the N channels based on the mapping position information; wherein the preset corresponding relationship is used to indicate the correspondence between the position information of each of the X data units in the logic block and the mapping position information in the N channels; and sending the data units of each of the N channels.
[0166] In one possible embodiment of this application, the data transmission method may include: acquiring a logic block comprising X data units, where X is a positive integer; mapping the X data units to N channels; and sending the data units of each of the N channels; wherein the N channels comprise W rows and N columns of data units, where the cyclic shift value corresponding to the data unit in the i-th row and j-th column is equal to int(i / m)mod g; and / or, the data unit in the i-th row and j-th column is the v-th data unit among the X data units, v = int(k / g)*g + (((int(int(k / N) / m)mod g)*(g-1) + (k mod g))mod g), k = i*N+j; where g = gcd(M, N), m = M / g, gcd represents taking the greatest common divisor, mod represents taking the remainder, and int represents rounding down.
[0167] In one possible embodiment of this application, the data transmission method may include: receiving data units from each of N channels, wherein each of the N channels includes at least one data set, each data set includes multiple data groups, the multiple data groups corresponding to different cyclic shift values, where N and g are positive integers, and N is greater than or equal to g; performing cyclic shift on the channel containing the data units in the multiple data groups of each data set, the multiple data groups corresponding to different cyclic shift values; and obtaining the data units in the N channels after cyclic shift to obtain the logic block.
[0168] In one possible embodiment of this application, the data transmission method may include: receiving data units from each of N channels, wherein the N channels correspond to receiving X data units, and the X data units correspond to M code blocks, where M is a positive integer; determining, based on M and N, that each of the N channels g includes at least one data set, each data set includes multiple data groups, each data group includes m rows of data, where N and g are positive integers, and N is greater than or equal to g; performing cyclic shifting on the channels containing the data units in the multiple data groups of each data set, wherein the multiple data groups correspond to different cyclic shift values; and obtaining the data units in the N channels after cyclic shifting to obtain the logic block.
[0169] In one possible embodiment of this application, the data transmission method may include: receiving data units from each of N channels, wherein the N channels correspond to receiving X data units, and the X data units correspond to M code blocks, where M is a positive integer; determining the number of rows m of data units included in g and each of the plurality of data groups based on M and N, including: determining the greatest common divisor g based on M and N to determine that each of the N channels g includes at least one data set; determining that each of the plurality of data groups included in each data set includes m rows of data based on M and the greatest common divisor g, where N and g are positive integers, and N is greater than or equal to g; performing cyclic shifting on the channels where the data units in the plurality of data groups of each data set are located, wherein the plurality of data groups correspond to different cyclic shift values; and obtaining the data units in the N channels after cyclic shifting to obtain the logic block.
[0170] In one possible embodiment of this application, the data transmission method may include: receiving data units from each of N channels, wherein the N channels correspond to receiving X data units; for each data unit in the N channels, querying preset correspondence information based on the mapping position information of the data unit in the N channels to determine the position information of the data unit in the X data units; and demapping the data unit based on the position information to obtain the logical block; wherein the preset correspondence is used to indicate the correspondence between the position information of each data unit in the X data units in the logical block and the mapping position information in the N channels.
[0171] In one possible embodiment of this application, the data transmission method may include: receiving data units from each of N channels; demapping the data units in the N channels to obtain a logic block comprising X data units; wherein the N channels comprise W rows and N columns of data units, wherein the cyclic shift value corresponding to the data unit in the i-th row and j-th column is equal to int(i / m)mod g; and / or, the data unit in the i-th row and j-th column is the v-th data unit among the X data units, v = int(k / g)*g + (((int(int(k / N) / m)mod g)*(g-1) + (k mod g))mod g), k = i*N+j; wherein g = gcd(M, N), m = M / g, gcd represents taking the greatest common divisor, mod represents taking the remainder, and int represents rounding down.
[0172] In one possible embodiment of this application, taking the use of 5 encoders, with the Type-C port supporting a maximum of 4 enabled channels, and assuming the number of enabled channels ranges from 1 to 4, the data interleaving method in the corresponding channels can be as follows: Figure 18As shown, at this time, M=5, N=4, gcd(M,N)=1, that is, g=1, m=M / 1=5, divided into 5 channel mapping interleaving regions, each channel mapping interleaving region contains 1 channel, the corresponding cyclic shift value is 0, which means that no cyclic shift is required. Accordingly, the specific implementation of this method is as follows: (1) All LLB data are distributed byte by byte to each enabled channel in byte order; (2) Data is distributed from low to high according to the channel order; (3) The entire logical layer data frame (LLDF) data distribution is completed according to the above rules (1) and (2), and the next LLDF is restored to the initial distribution state.
[0173] In one possible embodiment of this application, taking 10 encoders (i.e., M=10) as an example, the type-B port supports a maximum of 8 enabled channels, and assuming the number of enabled channels ranges from 1 to 8, the data interleaving method in the corresponding channels can be as follows: Figure 19As shown, the arrangement of data in each channel is cyclic after every 10 data items. The figure shows the smallest cyclic interleaved arrangement. Accordingly, the method is specifically implemented as follows: (1) All LLB data is distributed byte by byte to each enabled channel in byte order; (2) Data is distributed from low to high according to the channel order. (3) Based on the above rules (1) and (2), if the number of enabled channels N is even, considering M = 10, for all even numbers less than or equal to 8, gcd(M,N) = 2, that is, g = 2, m = 10 / 2 = 5. Every 2 adjacent channels constitute a channel mapping interleaving region. Every 10 lines of each interleaving region is a cycle. The first 5 lines are not processed, that is, the cycle shift is 0. The odd and even channels in the last 5 lines are swapped. The entire LLDF data processing is completed in this cycle. The initial distribution state of LLDF is not to swap. Taking 8 channels as an example, channel 0 and channel 1 constitute a channel mapping interleaving region, channel 2 and channel 3 constitute a channel mapping interleaving region, channel 4 and channel 5 constitute a channel mapping interleaving region, and channel 6 and channel 7 constitute a channel mapping interleaving region. Every 10 lines of each interleaving region is a cycle. The first 5 lines are not swapped. The odd and even channels in the last 5 lines are swapped. (4) Based on the above rules (1) and (2), when the number of enabled channels is equal to 5, considering M=10, gcd(M,N)=5, that is, g=5, m=10 / 5=2, all 5 channels constitute a fair mapping interleaving region, forming a cycle every 10 rows, divided into 5 groups, each group with 2 rows, the cycle shift values of each group are 0, 1, 2, 3, 4 respectively, the channels in the first group of two rows do not perform cycle shift, that is, the cycle shift value is 0, the cycle shift value of the channels in the next group of two rows of data is 1, that is, the two data units to be sent in channel 0 are moved to channel 1 for transmission, the two data units to be sent in channel 1 are moved to channel 2 for transmission, the two data units to be sent in channel 2 are moved to channel 3 for transmission, the two data units to be sent in channel 3 are moved to channel 4 for transmission, and the two data units to be sent in channel 4 are moved to channel 0 for transmission. (5) Complete the entire LLDF data distribution according to the above rules, and the next LLDF is restored to the initial distribution state.
[0174] The above primarily describes the solutions provided by the embodiments of this application from the perspective of the interaction between the data transmitting device and the data receiving device. It is understood that, in order to achieve the above functions, the data transmitting device and the data receiving device include corresponding hardware structures and / or software modules for executing each function. Those skilled in the art should readily recognize that, based on the units and algorithm steps of the various examples described in conjunction with the embodiments disclosed herein, this application can be implemented in hardware or a combination of hardware and computer software. Whether a function is executed in hardware or by computer software driving hardware depends on the specific application and design constraints of the technical solution. Those skilled in the art can use different methods to implement the described functions for each specific application, but such implementation should not be considered beyond the scope of this application.
[0175] This application embodiment can divide the data transmitting device and data receiving device into functional modules according to the above method example. For example, each function can be divided into a separate functional module, or two or more functions can be integrated into one module. The integrated module can be implemented in hardware or as a software functional module. It should be noted that the module division in this application embodiment is illustrative and only represents one logical functional division. In actual implementation, there may be other division methods. The following description uses the division of each functional module according to each function as an example.
[0176] When using integrated units, Figure 22 A possible structural schematic diagram of the data transmission device involved in the above embodiments is shown. The data transmission device can be a transmitting device or a chip applied to a transmitting device. The device includes: an acquisition unit 401, a processing unit 402, and a transmission unit 403. The acquisition unit 401 can be used to support the device in executing S301 of the above method embodiments; the processing unit 402 can be used to support the device in executing S302 of the above method embodiments, or other technical processes described herein; the transmission unit 403 can be used to support the device in executing S303 of the above method embodiments. All relevant content of each step involved in the above method embodiments can be referenced to the functional description of the corresponding functional module, and will not be repeated here.
[0177] Based on hardware implementation, the acquisition unit 401 and processing unit 402 in this application can be the interleaving circuit of the device, and the transmitting unit 403 can be the transmitter of the device, which can also be called a transmitting port. Optionally, the transmitter can usually be integrated with the receiver as a transceiver, and the specific transceiver can also be called a communication interface.
[0178] like Figure 23The diagram shown is a structural schematic of a data transmission device according to an embodiment of this application. This device can be a transmitting end device or a chip applied to a transmitting end device. The device includes an interleaving circuit 411 and a transmitter 412. The interleaving circuit 411 is used to support the device in performing S301, S302 in the above method embodiments, and / or other processes using the techniques described herein. Furthermore, the transmitter 412 can be used to support the device in communication, for example, supporting communication between the device and a data receiving device.
[0179] It is understood that all relevant content of each step involved in the above method embodiments can be referenced to the functional description of the corresponding functional module, and will not be repeated here in the embodiments of this application.
[0180] When using integrated units, Figure 24 A possible structural schematic diagram of the data receiving device involved in the above embodiments is shown. The data receiving device can be a receiving end device or a chip applied to a receiving end device. The device includes a receiving unit 501 and a processing unit 502. The receiving unit 501 can be used to support the device in executing S304 of the above method embodiments; the processing unit 502 can be used to support the device in executing S305, S306, S307 of the above method embodiments, and / or other technical processes described herein. All relevant content of each step involved in the above method embodiments can be referenced to the functional description of the corresponding functional module, and will not be repeated here.
[0181] Based on hardware implementation, the processing unit 502 in this application can be the interleaving circuit of the device, and the receiving unit 501 can be the receiver of the device, which can also be called a receiving port. Optionally, the receiver can usually be integrated with the transmitter as a transceiver, and the specific transceiver can also be called a communication interface.
[0182] like Figure 25 The diagram shown is a schematic representation of a data receiving device according to an embodiment of this application. This data receiving device can be a receiving end device or a chip applied to a receiving end device. The device includes a receiver 511 and an interleaving circuit 512. The interleaving circuit 512 is used to support the device in performing processes S305, S306, and S307 in the above method embodiments, and / or other processes using the techniques described herein. Furthermore, the receiver 511 can be used to support the device in communication, for example, supporting communication between the device and a data transmitting device.
[0183] It is understood that all relevant content of each step involved in the above method embodiments can be referenced to the functional description of the corresponding functional module, and will not be repeated here in the embodiments of this application.
[0184] In another embodiment of this application, a data transmission system is provided, which includes a data transmitting device and a data receiving device; wherein the data transmitting device may be or include the aforementioned Figure 22 or Figure 23 The provided data transmitting device is used to perform the steps of the data transmitting device in the method embodiment provided above; the data receiving device may be or include the above-described steps. Figure 24 or Figure 25 The provided data receiving device is used to perform the steps of the data receiving device in the method embodiment provided above.
[0185] In the several embodiments provided in this application, it should be understood that the disclosed apparatus and methods can be implemented in other ways. For example, the apparatus embodiments described above are merely illustrative. For instance, the division of modules or units is merely a logical functional division, and in actual implementation, there may be other division methods. For example, multiple units or components may be combined or integrated into another apparatus, or some features may be ignored or not executed.
[0186] The units described as separate components may or may not be physically separate. A component shown as a unit can be one or more physical units; that is, it can be located in one place or distributed in multiple different locations. Some or all of the units can be selected to achieve the purpose of this embodiment according to actual needs.
[0187] If the integrated unit is implemented as a software functional unit and sold or used as an independent product, it can be stored in a readable storage medium. This readable storage medium may include various media capable of storing program code, such as a USB flash drive, external hard drive, read-only memory, random access memory, magnetic disk, or optical disk. Based on this understanding, the technical solution of the embodiments of this application, in essence, or the part that contributes to the prior art, or all or part of the technical solution, can be embodied in the form of a software product.
[0188] In another embodiment of this application, a readable storage medium is also provided, which stores computer-executable instructions when a device (which may be a microcontroller, chip, etc.) or processor executes the steps of the data transmission device in the above method embodiment.
[0189] In another embodiment of this application, a readable storage medium is also provided, which stores computer-executable instructions when a device (which may be a microcontroller, chip, etc.) or processor executes the steps of the data receiving device in the above method embodiment.
[0190] In another embodiment of this application, a computer program product is also provided, the computer program product including computer instructions stored in a readable storage medium; at least one processor of the device can read the computer instructions from the readable storage medium, and the at least one processor executes the computer instructions to cause the device to perform the steps of the data transmission apparatus in the above method embodiment.
[0191] In another embodiment of this application, a computer program product is also provided, the computer program product including computer instructions stored in a readable storage medium; at least one processor of the device can read the computer instructions from the readable storage medium, and the at least one processor executes the computer instructions to cause the device to perform the steps of the data receiving device in the above method embodiment.
[0192] Finally, it should be noted that the above description is merely a specific embodiment of this application, but the scope of protection of this application is not limited thereto. Any variations or substitutions within the technical scope disclosed in this application should be included within the scope of protection of this application. Therefore, the scope of protection of this application should be determined by the scope of the claims.
Claims
1. A data transmission method, characterized in that, The method includes: Obtain a logic block, wherein the logic block comprises X data units, where X is a positive integer; The X data units are mapped to N channels; each of the N channels includes X / N data units, where the i-th data unit in the j-th channel is the v-th data unit among the X data units, where v = int(k / g). g + (((int(int(k / N) / m) mod g) (g - 1) + (k mod g)) mod g), k=i N+j; where g is a factor of N, M is the number of code blocks corresponding to the X data units, m is a positive integer less than M, mod represents the remainder, and int represents the floor function. Send the processed data units from each of the N channels.
2. The method according to claim 1, characterized in that, The step of mapping the X data units to N channels includes: The X data units are allocated to the N channels, and each of the N channels includes at least one data set, and each data set includes multiple data groups. The channels containing the data units in the plurality of data groups of each data set are cyclically shifted, and the plurality of data groups correspond to different cyclic shift values.
3. The method according to claim 2, characterized in that, The method further includes: Based on M and N, determine the number of rows m of data units included in each of the multiple data groups, including g.
4. The method according to claim 3, characterized in that, The step of determining the number of rows m of data units included in each data group in the plurality of data groups based on the M and the N includes: Determine the greatest common divisor g based on M and N; Based on M and the greatest common divisor g, determine the number of rows m of data units included in each of the plurality of data groups, where m is a positive integer and M is greater than m.
5. The method according to claim 1, characterized in that, The step of mapping the X data units to N channels includes: For each of the X data units, based on the position information of the data unit in the logic block, a preset correspondence is queried to determine the mapping position information of the data unit in the N channels; Based on the mapping location information, the data unit is mapped to the N channels; The preset correspondence is used to indicate the correspondence between the position information of each of the X data units in the logic block and the mapping position information in the N channels.
6. The method according to any one of claims 1-5, characterized in that, The acquisition logic block includes: The data to be transmitted is mapped into code blocks to obtain M pre-encoded code blocks; The logic block is obtained by encoding the M pre-encoded blocks.
7. The method according to claim 6, characterized in that, The process of encoding the M pre-code blocks to obtain the logic block includes: The M pre-encoded code blocks are encoded to obtain M post-encoded code blocks; The M encoded code blocks are reused with the logic layer management information to obtain the logic block.
8. A data transmission method, characterized in that, The method includes: Receive data units from each of N channels; wherein the N channels comprise X data units, where X is a positive integer, and each of the N channels comprises X / N data units, where the i-th data unit in the j-th channel is the v-th data unit among the X data units, and v = int(k / g). g + (((int(int(k / N) / m) modg) (g - 1) + (k mod g)) mod g), k=i N+j; where g is a factor of N, M is the number of code blocks corresponding to the X data units, m is a positive integer less than M, mod represents the remainder, and int represents the floor function. The data units in the N channels are demapped to obtain a logic block containing X data units.
9. The method according to claim 8, characterized in that, The demapping of data units in the N channels includes: The channels containing data units in multiple data groups of each data set are cyclically shifted, and the multiple data groups correspond to different cyclic shift values; The data units in the N channels after cyclic shifting are obtained to obtain the logic block.
10. The method according to claim 9, characterized in that, The method further includes: Based on M and N, determine the number of rows m of data units included in each of the multiple data groups, including g.
11. The method according to claim 10, characterized in that, The step of determining the number of rows m of data units included in each data group in the plurality of data groups based on the M and the N includes: Determine the greatest common divisor g based on M and N; Based on M and the greatest common divisor g, determine the number of rows m of data units included in each of the plurality of data groups, where m is a positive integer and M is greater than m.
12. The method according to claim 8, characterized in that, The step of demapping the data units in the N channels to obtain a logic block comprising X data units includes: For each data unit in the N channels, a preset correspondence is queried based on the mapping position information of the data unit in the N channels to determine the position information of the data unit in the X data units; Based on the location information, the data unit is demapped into the logic block; The preset correspondence is used to indicate the correspondence between the position information of each of the X data units in the logic block and the mapping position information in the N channels.
13. The method according to any one of claims 8-12, characterized in that, The method further includes: The logic block is decoded to obtain M decoded code blocks; Decoding block mapping is performed on the M decoded code blocks to obtain the data to be transmitted.
14. The method according to claim 13, characterized in that, The decoding process of the logic block yields M pre-decoding code blocks, including: The logic block is demultiplexed to obtain M pre-decoding code blocks and logic layer management information; The M pre-decoding code blocks are decoded to obtain the M post-decoding code blocks.
15. A data transmission device, characterized in that, The device includes: An acquisition unit is used to acquire a logic block, wherein the logic block comprises X data units, where X is a positive integer; A processing unit is configured to map the X data units to N channels; wherein each of the N channels includes X / N data units, and the i-th data unit in the j-th channel is the v-th data unit among the X data units, where v = int(k / g). g + (((int(int(k / N) / m) mod g) (g - 1) + (k mod g))mod g), k=i N+j; where g is a factor of N, M is the number of code blocks corresponding to the X data units, m is a positive integer less than M, mod represents the remainder, and int represents the floor function. The transmitting unit is used to transmit the processed data units in each of the N channels.
16. The apparatus according to claim 15, characterized in that, The processing unit is also used for: The X data units are allocated to the N channels, and each of the N channels includes at least one data set, and each data set includes multiple data groups. The channels containing the data units in the plurality of data groups of each data set are cyclically shifted, and the plurality of data groups correspond to different cyclic shift values.
17. The apparatus according to claim 16, characterized in that, The processing unit is also used for: Based on M and N, determine the number of rows m of data units included in each of the multiple data groups, including g.
18. The apparatus according to claim 17, characterized in that, The processing unit is also used for: Determine the greatest common divisor g based on M and N; Based on M and the greatest common divisor g, determine the number of rows m of data units included in each of the plurality of data groups, where m is a positive integer and M is greater than m.
19. The apparatus according to claim 15, characterized in that, The processing unit is also used for: For each of the X data units, based on the position information of the data unit in the logic block, a preset correspondence is queried to determine the mapping position information of the data unit in the N channels; Based on the mapping location information, the data unit is mapped to the N channels; The preset correspondence is used to indicate the correspondence between the position information of each of the X data units in the logic block and the mapping position information in the N channels.
20. The apparatus according to any one of claims 15-19, characterized in that, The processing unit is also used for: The data to be transmitted is mapped into code blocks to obtain M pre-encoded code blocks; The M code blocks are encoded to obtain the logic block.
21. The apparatus according to claim 20, characterized in that, The processing unit is also used for: The M pre-encoded code blocks are encoded to obtain M post-encoded code blocks; The M encoded code blocks are reused with the logic layer management information to obtain the logic block.
22. A data receiving device, characterized in that, The device includes: A receiving unit is used to receive data units from each of the N channels; wherein the N channels include X data units, where X is a positive integer, and each of the N channels includes X / N data units, where the i-th data unit in the j-th channel is the v-th data unit among the X data units, and v = int(k / g). g + (((int(int(k / N) / m) mod g) (g - 1) + (k mod g)) mod g), k=i N+j; where g is a factor of N, M is the number of code blocks corresponding to the X data units, m is a positive integer less than M, mod represents the remainder, and int represents the floor function. The processing unit is used to demap the data units in the N channels to obtain a logic block including X data units.
23. The apparatus according to claim 22, characterized in that, The processing unit is also used for: The channels containing data units in multiple data groups of each data set are cyclically shifted, and the multiple data groups correspond to different cyclic shift values; The data units in the N channels after cyclic shifting are obtained to obtain the logic block.
24. The apparatus according to claim 23, characterized in that, The processing unit is also used for: Based on M and N, determine the number of rows m of data units included in each of the multiple data groups, including g.
25. The apparatus according to claim 24, characterized in that, The processing unit is also used for: Determine the greatest common divisor g based on M and N; Based on M and the greatest common divisor g, determine the number of rows m of data units included in each of the plurality of data groups, where m is a positive integer and M is greater than m.
26. The apparatus according to claim 22, characterized in that, The processing unit is also used for: For each data unit in the N channels, a preset correspondence is queried based on the mapping position information of the data unit in the N channels to determine the position information of the data unit in the X data units; Based on the location information, the data unit is demapped into the logic block; The preset correspondence is used to indicate the correspondence between the position information of each of the X data units in the logic block and the mapping position information in the N channels.
27. The apparatus according to any one of claims 22-26, characterized in that, The processing unit is also used for: The logic block is decoded to obtain M decoded code blocks; Decoding block mapping is performed on the M decoded code blocks to obtain the data to be transmitted.
28. The apparatus according to claim 27, characterized in that, The processing unit is also used for: The logic block is demultiplexed to obtain M pre-decoding code blocks and logic layer management information; The M pre-decoding code blocks are decoded to obtain the M post-decoding code blocks.
29. A chip, characterized in that, The chip includes an interleaving circuit and a transmitter, the interleaving circuit and the transmitter being configured to support the chip in performing the data transmission method as described in any one of claims 1-7.
30. A chip, characterized in that, The chip includes an interleaving circuit and a receiver, the interleaving circuit and the receiver being configured to support the chip in performing the data transmission method as described in any one of claims 8-14.
31. A data transmission system, characterized in that, The data transmission system includes a data transmitting device and a data receiving device. The data transmitting device includes the data transmitting device as described in any one of claims 15-21 or the chip as described in claim 29. The data receiving device includes the data receiving device as described in any one of claims 22-28 or the chip as described in claim 30.
32. A readable storage medium, characterized in that, The readable storage medium stores instructions that, when executed on the device, cause the device to perform the data transmission method as described in any one of claims 1-7.
33. A readable storage medium, characterized in that, The readable storage medium stores instructions that, when executed on the device, cause the device to perform the data transmission method as described in any one of claims 8-14.
Citation Information
Patent Citations
Data block interleaving and de-interleaving method in communication equipment and device thereof
CN104917587A
Block interleaving method and system based on data block transformation
CN112929125A
