CN115278769A - Data transmission method, device and system and readable storage medium - Google Patents
Data transmission method, device and system and readable storage medium Download PDFInfo
- Publication number
- CN115278769A CN115278769A CN202110484588.2A CN202110484588A CN115278769A CN 115278769 A CN115278769 A CN 115278769A CN 202110484588 A CN202110484588 A CN 202110484588A CN 115278769 A CN115278769 A CN 115278769A
- Authority
- CN
- China
- Prior art keywords
- data
- transmission
- original data
- transmission opportunities
- transmission opportunity
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Pending
Links
- 230000005540 biological transmission Effects 0.000 title claims abstract description 779
- 238000000034 method Methods 0.000 title claims abstract description 155
- 230000003111 delayed effect Effects 0.000 claims description 138
- 238000004891 communication Methods 0.000 claims description 74
- 238000012545 processing Methods 0.000 claims description 41
- 230000015654 memory Effects 0.000 claims description 35
- 238000004590 computer program Methods 0.000 claims description 15
- 230000000875 corresponding effect Effects 0.000 description 96
- 230000006870 function Effects 0.000 description 61
- 230000008569 process Effects 0.000 description 28
- 238000013461 design Methods 0.000 description 13
- 238000010586 diagram Methods 0.000 description 12
- 238000005516 engineering process Methods 0.000 description 9
- 238000001228 spectrum Methods 0.000 description 7
- 238000012937 correction Methods 0.000 description 6
- 230000007246 mechanism Effects 0.000 description 6
- 230000001934 delay Effects 0.000 description 5
- 239000011159 matrix material Substances 0.000 description 4
- 239000004065 semiconductor Substances 0.000 description 4
- 230000008878 coupling Effects 0.000 description 3
- 238000010168 coupling process Methods 0.000 description 3
- 238000005859 coupling reaction Methods 0.000 description 3
- 229910044991 metal oxide Inorganic materials 0.000 description 3
- 150000004706 metal oxides Chemical class 0.000 description 3
- 238000010295 mobile communication Methods 0.000 description 3
- 230000011664 signaling Effects 0.000 description 3
- 229910000577 Silicon-germanium Inorganic materials 0.000 description 2
- 230000006978 adaptation Effects 0.000 description 2
- 238000004364 calculation method Methods 0.000 description 2
- 230000001276 controlling effect Effects 0.000 description 2
- 238000005562 fading Methods 0.000 description 2
- 230000003287 optical effect Effects 0.000 description 2
- JBRZTFJDHDCESZ-UHFFFAOYSA-N AsGa Chemical compound [As]#[Ga] JBRZTFJDHDCESZ-UHFFFAOYSA-N 0.000 description 1
- 241000023320 Luma <angiosperm> Species 0.000 description 1
- LEVVHYCKPQWKOP-UHFFFAOYSA-N [Si].[Ge] Chemical compound [Si].[Ge] LEVVHYCKPQWKOP-UHFFFAOYSA-N 0.000 description 1
- 230000003044 adaptive effect Effects 0.000 description 1
- 239000000654 additive Substances 0.000 description 1
- 230000000996 additive effect Effects 0.000 description 1
- 230000002776 aggregation Effects 0.000 description 1
- 238000004220 aggregation Methods 0.000 description 1
- 238000013459 approach Methods 0.000 description 1
- 238000013473 artificial intelligence Methods 0.000 description 1
- 230000003190 augmentative effect Effects 0.000 description 1
- 238000004422 calculation algorithm Methods 0.000 description 1
- 230000001413 cellular effect Effects 0.000 description 1
- 230000000295 complement effect Effects 0.000 description 1
- 239000013256 coordination polymer Substances 0.000 description 1
- 238000013500 data storage Methods 0.000 description 1
- 235000019800 disodium phosphate Nutrition 0.000 description 1
- 230000009977 dual effect Effects 0.000 description 1
- 239000000835 fiber Substances 0.000 description 1
- 238000010304 firing Methods 0.000 description 1
- GVVPGTZRZFNKDS-JXMROGBWSA-N geranyl diphosphate Chemical compound CC(C)=CCC\C(C)=C\CO[P@](O)(=O)OP(O)(O)=O GVVPGTZRZFNKDS-JXMROGBWSA-N 0.000 description 1
- 230000007774 longterm Effects 0.000 description 1
- 238000007726 management method Methods 0.000 description 1
- OSWPMRLSEDHDFF-UHFFFAOYSA-N methyl salicylate Chemical compound COC(=O)C1=CC=CC=C1O OSWPMRLSEDHDFF-UHFFFAOYSA-N 0.000 description 1
- 230000011218 segmentation Effects 0.000 description 1
- 239000007787 solid Substances 0.000 description 1
- 230000003595 spectral effect Effects 0.000 description 1
- 230000003068 static effect Effects 0.000 description 1
- 238000006467 substitution reaction Methods 0.000 description 1
- 230000001360 synchronised effect Effects 0.000 description 1
- XLYOFNOQVPJJNP-UHFFFAOYSA-N water Substances O XLYOFNOQVPJJNP-UHFFFAOYSA-N 0.000 description 1
Images
Classifications
-
- H—ELECTRICITY
- H03—ELECTRONIC CIRCUITRY
- H03M—CODING; DECODING; CODE CONVERSION IN GENERAL
- H03M13/00—Coding, decoding or code conversion, for error detection or error correction; Coding theory basic assumptions; Coding bounds; Error probability evaluation methods; Channel models; Simulation or testing of codes
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L1/00—Arrangements for detecting or preventing errors in the information received
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L1/00—Arrangements for detecting or preventing errors in the information received
- H04L1/0001—Systems modifying transmission characteristics according to link quality, e.g. power backoff
- H04L1/0033—Systems modifying transmission characteristics according to link quality, e.g. power backoff arrangements specific to the transmitter
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W28/00—Network traffic management; Network resource management
- H04W28/02—Traffic management, e.g. flow control or congestion control
- H04W28/04—Error control
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Physics & Mathematics (AREA)
- Probability & Statistics with Applications (AREA)
- Theoretical Computer Science (AREA)
- Quality & Reliability (AREA)
- Data Exchanges In Wide-Area Networks (AREA)
- Detection And Prevention Of Errors In Transmission (AREA)
Abstract
The application provides a network coding method and device. The method comprises the following steps: the sending end encodes the original data on the plurality of transmission opportunities to generate a group of first-class check packets or encoding packets, the sending opportunity of the group of first-class check packets can delay a plurality of transmission opportunities relative to the last transmission opportunity in the plurality of transmission opportunities, the problem of burst errors of a channel can be solved, and therefore transmission reliability is guaranteed. Further, the method also comprises the following steps: and the sending end encodes the original data on one transmission opportunity and/or the first type check packet on the transmission opportunity to generate a group of second type check packets. The second type check packet is sent in the transmission opportunity or is sent by delaying a plurality of transmission opportunities, so that the problem of random errors of a channel can be solved, and the transmission reliability is further ensured. The method and the device can be applied to the scenarios of the extended reality XR service, low time delay and/or uplink large capacity.
Description
Technical Field
The present application relates to the field of communications technologies, and in particular, to a communication method, apparatus, and system.
Background
In a wireless communication network, network coding techniques provide a transmission mechanism that is both time delay and spectral efficiency. In the network coding technology, a sending end codes a plurality of original data to obtain and send coded data, and sends indication information such as coding coefficients corresponding to the coded data; the receiving end can decode the coded data according to the coding coefficient, thereby obtaining the original data. Through network coding, the system can maximize the throughput of the whole network and effectively improve the transmission performance of the wireless communication system.
However, due to fading caused by mobility or interference caused by other users, etc., consecutive errors occur in the Code Blocks (CBs) decoded by the receiving terminal.
How to avoid the influence of continuous errors in the transmission process on the communication quality is an urgent problem to be solved.
Disclosure of Invention
The embodiment of the application provides a data transmission method and a data transmission device, which are used for effectively improving the transmission performance of a wireless communication system.
In a first aspect, an embodiment of the present application provides a data transmission method, which may be executed by a terminal or a network device, or may be executed by a component (e.g., a processor, a chip, or a system-on-chip) of the terminal or the network device, and includes: encoding M first original data to obtain N first encoded data, wherein M is a positive integer, and N is a positive integer; and sending the M first original data and the N first coded data, wherein the number of transmission opportunities for transmitting the M first original data is P and includes a first transmission opportunity, and the transmission opportunity for transmitting the N first coded data is delayed by X transmission opportunities compared with the P transmission opportunities for transmitting the M first original data, X is a non-negative integer, and P is a positive integer and satisfies that P is more than or equal to 2.
The encoding data is obtained by encoding the original data on at least two transmission opportunities, so that M first original data used for encoding occupy at least two transmission opportunities, and at least one of the first encoded data and the M first original data is not transmitted on the same transmission opportunity, thereby solving the problem of burst errors occurring in a channel and ensuring the transmission reliability.
Optionally, the sending end obtains the relevant parameters of the first encoded data. The related parameters of the first coded data include one or more of parameters such as coding depth M, proportion R of the first coded data, number N or code rate R' of the first coded data, transmission opportunity of the first coded data, grouping information and the like. In this application, the meaning of the coding depth M is to code M pieces of original data, where the M pieces of original data are transmitted on P transmission opportunities, and P is a positive integer not less than 2. The coding depth may also be referred to as a coding length, a convolution depth, a coding block size, a coding window size, or a sliding window size, etc. The number of the first encoded data is the number of a set of first encoded data generated by encoding the M original data. The number of different sets of first encoded data may be determined individually. The number of first encoded data may be different or the same between different groups. The ratio of the first encoded data is a ratio of a total number N of a group of first encoded data generated by encoding M first original data to a total number M of corresponding first original data, and the ratio R of the first encoded data may also be a ratio of a total number N of a group of first encoded data generated by encoding M first original data to a sum of the total number M of the corresponding first original data and the total number N of the first encoded data. The code rate R 'is a ratio of the number M of the first original data to the sum of the total number N of the group of first encoded data generated by encoding the first original data and the number M of the first original data, or the code rate R' may be a ratio of the number M of the first original data to the total number N of the group of first encoded data generated by encoding the M first original data. The sending end codes the original data according to the related parameters of the first coded data to obtain coded data, so that the problem of burst errors of a channel can be solved, and the transmission reliability is ensured. Under the condition that the parameters are configurable, the flexibility of coding can be further increased, so that the channel state is adapted, and the transmission reliability and efficiency are improved.
Optionally, the obtaining, by the sending end, the related parameter of the first encoded data means that a network coding layer of the sending end obtains a parameter related to the first encoded data. The network coding Layer refers to a Protocol Layer having a network coding function, and may be a Radio Resource Control (RRC) Layer, a Packet Data Convergence Protocol (PDCP) Layer, a Backhaul Adaptation Protocol (BAP) Layer, an RLC Layer, an MAC Layer, or a Physical Layer (PHY) Protocol Layer. The network coding layer may also be a new protocol layer other than the MAC layer, the RLC layer, the BAP layer, and the PDCP layer, and may be a protocol layer added above the PDCP layer and having a network coding function, or a network coding layer added above the BAP layer, or a network coding layer added between the PDCP layer and the RLC layer, or a network coding layer added between the RLC layer and the MAC layer, or a network coding layer added between the MAC layer and the PHY layer.
Optionally, for the acquisition of the parameter related to the first encoded data, the acquisition mode of the sending end may be predefined, or may be semi-statically configured to the sending end by the network side device, such as semi-statically configured or dynamically configured, or may be self-defined preset by the sending end device, such as preset or configured according to one or more of system requirements, actual communication states, or protocol presets. The different encoding parameters may be obtained in the same or different manners. For example, the coding depth M is configured semi-statically by the network side device, the proportion or number of the first coded data is determined by the sending end device according to the actual communication state, and the transmission opportunity of the first coded data is determined by the sending end according to the transmission rule in a predefined manner, where the transmission rule may be specified by a protocol.
Optionally, the first transmission opportunity is further used for transmitting other raw data than the first raw data. By the method, different grouped data can be subjected to network coding, the problem of burst errors of a channel can be solved, the complexity of coding and decoding can be reduced, and the transmission reliability can be ensured.
With reference to the first aspect, in some implementations of the first aspect, the sending end network coding layer performs network coding on the obtained M first original data, to obtain a set of first coded data corresponding to the M first original data. The number or proportion of the first coded data required to be generated by the network coding is obtained according to the relevant parameters of the first coded data. The code pattern used for encoding may be one of Maximum Distance Separable (MDS) codes, random Linear Network Coding (RLNC) codes, linear Network Coding (LNC) codes, deterministic linear network coding (BATS) codes, batch Sparse (block) codes, LT (Luby Transform) codes, rateless (rateless) codes, RS (Reed-solomon) codes, and the like. Different code patterns correspond to different coding modes. By the implementation mode, the coded data obtained by coding the original data can be transmitted at different transmission opportunities, and the problem of burst errors occurring in a channel can be solved, so that the transmission reliability is ensured.
With reference to the first aspect, in some embodiments of the first aspect, the sending end obtains grouping information, and according to the grouping information, the sending end may group the original data on each transmission opportunity. The grouping information generally includes a grouping number G, that is, original data on one transmission opportunity is divided into G groups to obtain original data of different groups, and the original data of different groups may have different group numbers or identifications, for example, group numbers that may be identified as 1 to G for different groups. Since the number of original data transmitted in each transmission opportunity may be fixed or may be dynamically changed, the number of original data of the same group number in each transmission opportunity may be equal or different. Moreover, the number of original data in different packets within the same transmission opportunity may or may not be equal. In the case of grouping the original data on each transmission opportunity, the M first original data may refer to a group of original data having the same group number, and encoding the M first original data may refer to having a phaseAnd encoding the M first original data with the same group number. For example, when grouping, the number of original data included in different groups differs by no more than 1, and the grouping may be specifically performed according to the following rule: if the number of packets G is equal to the number of raw data L on one transmission opportunity, then one packet contains one raw data, and if the number of packets G is not equal to L, then the number of raw data in each packet can be confirmed by: (1) For the G (G =0,1, \8230;, mod (L, G) -1) packet, the number contains
Of raw data of (2), wherein
(2) For the G (G = mod (L, G), mod (L, G) +1, \8230;, G) th group, the number is included
Of raw data of (a), wherein
By the implementation mode, the sending end encodes the original data of the same group number on a plurality of transmission opportunities, so that the problem of burst errors of a channel can be solved, and the transmission reliability is improved; and encoding by grouping can also reduce the complexity of encoding and decoding.
Optionally, the M first original data and the N first encoded data are sent, where the number of transmission opportunities for transmitting the M first original data is P and includes a first transmission opportunity, and the transmission opportunity for transmitting the N first encoded data is delayed by X transmission opportunities compared with the P transmission opportunities for transmitting the M first original data, X is a non-negative integer, and P is a positive integer and satisfies that P ≧ 2.
Alternatively, the N first encoded data may be encoded data obtained by encoding with a generator matrix including an identity submatrix, where the encoded data obtained by the identity submatrix corresponds to the transmitted M first original data, and the remaining encoded data corresponds to the transmitted N first encoded data.
Optionally, the first transmission opportunity is further used for transmitting other original data besides the first original data. In one possible embodiment, the group number of the first original data is different from the group number of the other original data.
Optionally, in a possible implementation manner that the transmission opportunity for transmitting the N first encoded data is delayed by X transmission opportunities compared to the P transmission opportunities for transmitting the M first original data, the implementation manner includes one of the following:
the transmission opportunity for transmitting the N first coded data is delayed by at least X transmission opportunities compared with the first transmission opportunity in the P transmission opportunities for transmitting the M first original data, and X is more than or equal to P-1;
the last transmission opportunity for transmitting the N first coded data is delayed by at most X transmission opportunities compared with the first transmission opportunity in the P transmission opportunities for transmitting the M first original data, and X is more than or equal to P-1;
the transmission opportunity for transmitting the N first encoded data is delayed by at least X transmission opportunities from the last transmission opportunity of the P transmission opportunities for transmitting the M first original data; or
The last transmission opportunity for transmitting the N first encoded data is delayed by at most X transmission opportunities from the last transmission opportunity of the P transmission opportunities for transmitting the M first original data.
Optionally, in a possible implementation that the transmission opportunity for transmitting the N first encoded data is delayed by X transmission opportunities compared to the P transmission opportunities for transmitting the M first original data, the method further includes: the transmission opportunity for transmitting the N first encoded data is delayed by no more than Y transmission opportunities compared to P transmission opportunities for transmitting the M first original data, Y being a non-negative integer. The method comprises one of the following:
the transmission opportunity for transmitting the N first coding data is delayed by at least X transmission opportunities and at most Y transmission opportunities compared with the first transmission opportunity in the P transmission opportunities for transmitting the M first original data, and Y is more than or equal to X and more than or equal to P-1;
the transmission opportunity for transmitting the N first coded data is delayed by at least X transmission opportunities compared with the first transmission opportunity in the P transmission opportunities for transmitting the M first original data, is delayed by at most Y transmission opportunities compared with the last transmission opportunity in the P transmission opportunities for transmitting the M first original data, and meets the condition that Y is more than or equal to (X-P + 1) and X is more than or equal to P-1;
the transmission opportunity for transmitting the N first coded data is delayed by at least X transmission opportunities compared with the last transmission opportunity in the P transmission opportunities for transmitting the M first original data, at most Y transmission opportunities are delayed, and Y is larger than or equal to X; or
The transmission opportunity for transmitting the N first encoding data is delayed by at least X transmission opportunities compared with the last transmission opportunity in the P transmission opportunities for transmitting the M first original data, is delayed by at most Y transmission opportunities compared with the first transmission opportunity in the P transmission opportunities for transmitting the M first original data, and meets the condition that Y is more than or equal to X + P-1.
With reference to the first aspect, in certain embodiments of the first aspect, the N first encoded data include first encoded data a, the third transmission opportunity is used to transmit the first encoded data a, and the third transmission opportunity is also used to transmit one or more of other encoded data besides the first encoded data or other original data besides the first original data, and the method further includes:
and encoding the other encoded data on the third transmission opportunity, one or more of the first original data and the other original data, and the first encoded data a to obtain second encoded data. By the implementation mode, the sending end encodes the original data packet on one transmission opportunity and/or the first encoding data on the current transmission opportunity and can also generate a group of second encoding data, so that the problem of random errors of a channel can be further solved, and the transmission reliability is further improved.
Since there are both the first encoded data and the second encoded data, this type of encoding may be referred to as horizontal/vertical encoding.
Optionally, the sending end may further obtain related parameters of the second encoded data, where the related parameters of the second encoded data include one or more of a ratio r of the second encoded data, a number n or a code rate r' of the second encoded data, a transmission timing of the second encoded data, and the like. The meaning and the obtaining manner of the parameter corresponding to the second encoded data can refer to the description of the related parameter of the first encoded data, which is not described herein again.
Optionally, the generation manner, i.e., the encoding manner, of the second encoded data includes one or more of MDS codes, RLNC codes, LNC codes, bat codes, deterministic linear network codes, block codes, LT codes, rateless codes, or RS codes, which type of code is specifically adopted may be specified based on system design requirements or protocols or based on configuration, which is not described herein again.
Optionally, the third transmission opportunity is further used for transmitting the second encoded data. By the method, the second coded data can be transmitted on the third transmission opportunity, the problem of random errors of the channel can be solved, and the transmission reliability is ensured.
Optionally, the transmission opportunity for transmitting the second encoded data is delayed by Z transmission opportunities compared to the third transmission opportunity, where Z is a non-negative integer. In a possible implementation manner, the sending end delays the sending of the second encoded data by Z transmission opportunities compared with the third transmission opportunity according to the obtained correlation parameter of the second encoded data. By the mode, the sending end delays a plurality of transmission opportunities to send the second coded data, so that the problem of burst errors of the channel can be solved, and the transmission reliability is ensured.
With reference to the first aspect, in certain embodiments of the first aspect, the indication information is sent or received; the indication information is used for indicating one or more of the following items:
sliding window information of the M first original data, the sliding window information indicating M first original data corresponding to the N first encoded data; or
And the group numbers corresponding to the M first original data. By the method, the coded data are decoded according to the indication information to obtain the original data, so that a receiving end can acquire the sliding window and/or the group number without extra calculation, and the decoding complexity is reduced.
Optionally, the sliding window information may indicate, for the sliding window information, identification information of M first original data corresponding to the N first encoded data. By sending or receiving the indication information, the original data can be coded or decoded according to the indication information, the problem of random errors of a channel can be solved, and the transmission reliability is further improved.
Optionally, the indication information is encapsulated in a packet header of the first encoded data, that is, the packet header of the first encoded data carries the indication information. Alternatively, the indication information may be partially encapsulated in the packet header of the first encoded data, and another part of the information may be indicated by other information (e.g., a signaling manner, a semi-static indication, etc.).
With reference to the first aspect, in some embodiments of the first aspect, the sending end sends indication information to the receiving end, and the receiving end can know which data packets to decode together according to the indication information. One indication information indicates sliding window information, which may be window head and window tail positions, that is, a minimum SN number of original data corresponding to the first encoded data indicated in the header information of the first encoded data, and a maximum SN number of the original data corresponding to the first encoded data. Therefore, the receiving end network coding layer receives the first coded data, analyzes the information (which may be referred to as header information for short) in the header packet, and decodes the received coded data carrying the same minimum SN number and maximum SN number, the original data corresponding to the minimum SN number, the original data corresponding to the maximum SN number, and the original data having an SN number between the minimum SN number and the maximum SN number, which are all encoded by the network coding layer, so as to obtain all the original data in the current sliding window. The sliding window information may also be window header and window length, where the window length is the number of raw data in the window. Similar to the above description, the receiving-end network coding layer receives the first coded data, analyzes the header information, and performs decoding corresponding to the network coding on all the received coded data carrying the same minimum SN number and window length, the original data corresponding to the minimum SN number, and the original data having an SN number between the minimum SN number and the minimum SN number plus the window length, so as to obtain all the original data in the current sliding window. The sliding window information can also be the window tail and the window length, similarly, the receiving end network coding layer receives the first coded data, analyzes the header information, and decodes all the received coded data carrying the maximum SN number and the same window length, the original data corresponding to the maximum SN number and the original data with the SN number between the maximum SN number minus the window length and the maximum SN number together, which corresponds to the network coding, so as to obtain all the original data in the current sliding window. If the window length is a fixed value, the indication information may include only the window head or the window tail. By the method, the encoded data is decoded according to the indication information to obtain the original data, so that a receiving end can acquire the sliding window and/or the group number without additional calculation, and the decoding complexity is reduced. In addition, the coding window can be changed, and the coding flexibility is increased, so that the channel state can be adapted, and the transmission reliability and efficiency are improved.
Optionally, in the case of grouping the original data on each transmission opportunity, the indication information may further include a group number ID, that is, the indication information may include the group number ID and the sliding window information. Alternatively, the sliding window information may be the window head and window tail positions. The header information of the first encoded data indicates the minimum SN number of the original data corresponding to the encoded data, the maximum SN number of the original data corresponding to the encoded data, and the group ID. Therefore, the receiving end network coding layer receives the first coding data, analyzes the header information, and decodes corresponding network coding on all the received coding data carrying the same minimum SN number and maximum SN number, the original data corresponding to the minimum SN number, the original data corresponding to the maximum SN number and the original data with the SN number between the minimum SN number and the maximum SN number and the same group number ID, so as to obtain all the original data in the current sliding window. The sliding window information may also be the window header and window length, which is the number of original data in the window, and the group number ID. Similar to the above description, the receiving end network coding layer receives the first coded data, parses the header information, and puts all the received coded data carrying the minimum SN number and the same window length together with the original data corresponding to the minimum SN number and the original data having the SN number between the minimum SN number and the minimum SN number plus the window length and having the same group number ID for decoding corresponding to the network coding, thereby obtaining all the original data in the current sliding window. The sliding window information may also be the window end and window length and the group number ID. Similarly, the receiving end network coding layer receives the first coded data, analyzes the header information, and puts all the received coded data carrying the maximum SN number and the same window length, the original data corresponding to the maximum SN number, the original data with the SN number between the maximum SN number minus the window length and the maximum SN number, and the same group number ID together for decoding corresponding to the network coding, thereby obtaining all the original data in the current sliding window. By the method, the decoding corresponding to the network coding can be carried out on different grouped data, the problem of burst errors of a channel can be solved, the complexity of coding and decoding is reduced, and the transmission reliability is ensured.
Optionally, the first encoded data may be generated by using a sliding window, acquiring, by using the sliding window, that the number of transmission opportunities of the M pieces of first original data is P, and performing network encoding on the M pieces of first original data to obtain the first encoded data corresponding to the M pieces of first original data. Then, sliding window slides S transmission opportunities to obtain another group of M other original data, and then network coding is carried out on the M other original data to obtain other coded data corresponding to the M other original data. The sliding granularity is S transmission opportunities, and the value range of S can be 1-P.
In a second aspect, an embodiment of the present application provides a data transmission method, which may be executed by a terminal or a network device, and may also be executed by a component (e.g., a processor, a chip, or a system-on-chip) of the terminal or the network device, including: m 'first original data and N' first coded data are received, wherein M 'is a positive integer and N' is a positive integer. Decoding the M 'first original data and the N' first encoded data to obtain M first original data, wherein the number of transmission opportunities used in the M first original data is P, including a first transmission opportunity, and the transmission opportunities used in the N 'first encoded data are delayed by X transmission opportunities compared with the P transmission opportunities used in the M first original data, X is a non-negative integer, P is a positive integer and satisfies P ≧ 2, M is a positive integer and satisfies M' + N '≧ M, M ≧ M'.
The M first original data used for coding occupy at least two transmission opportunities, and at least one of the first coded data and the M first original data is not transmitted on the same transmission opportunity, so that the problem of burst errors occurring in a channel can be solved, and the transmission reliability is ensured.
Optionally, the receiving end obtains the relevant parameter of the first encoded data. The related parameters of the first coded data comprise one or more of parameters such as coding depth M, proportion R of the first coded data, number N or code rate R' of the first coded data, transmission opportunity of the first coded data, grouping information and the like. During the transmission and reception process of the communication system, a part of data may be discarded due to problems such as burst errors caused by channel quality, and therefore the number of data actually received by the receiving device may be less than the number of data transmitted by the transmitting end.
Optionally, the receiving end acquiring the related parameter of the first encoded data means that the receiving end network coding layer acquires a parameter related to the first encoded data. For the acquisition of the relevant parameters of the first coded data, the acquisition mode may be predefined, or the acquisition mode may be semi-statically configured by the network side device, or may be self-defined by the receiving end device. Different encoding parameters may be obtained in the same manner or different manners, for example, the encoding depth M is configured semi-statically by the network side device, the ratio or number of the first encoded data is self-defined by the receiving end device, and the transmission opportunity of the first encoded data is predefined. And the receiving end decodes the coded data according to the related parameters of the first coded data to obtain original data. When the parameters are configured, the flexibility of coding can be increased, the channel state can be further adapted, and the transmission reliability and efficiency can be improved.
With reference to the second aspect, in some embodiments of the second aspect, the M 'first original data and the N' first encoded data are decoded to obtain M first original data, where the number of transmission opportunities for the M first original data is P, including a first transmission opportunity, and the transmission opportunities for the N 'first encoded data are delayed by X transmission opportunities compared to the P transmission opportunities for the M first original data, where X is a non-negative integer, P is a positive integer and satisfies P ≧ 2, M is a positive integer and satisfies M' + N '≧ M, and M ≧ M'. The M pieces of first original data are obtained by decoding the M 'pieces of first original data and the N' pieces of first coded data, so that the problem of burst errors of a channel can be solved, and the transmission reliability is ensured.
Optionally, the receiving end network coding layer performs network coding corresponding decoding on the M 'pieces of first original data and the N' pieces of first coded data, so as to obtain M pieces of first original data corresponding to the M 'pieces of first original data and the N' pieces of first coded data. The number or proportion of the first original data required to be generated for decoding (also called decoding) corresponding to the network coding is obtained according to the relevant parameters of the first coded data. The decoding manner of the first raw data may be one or more code patterns of a Maximum Distance Separable (MDS) code, a Random Linear Network Coding (RLNC) code, a Linear Network Coding (LNC) code, a deterministic linear network coding (deterministic linear network coding), a bated Sparse (BATS) code, a block (block) code, an LT (Luby Transform) code, a rateless (ratess) code, an RS (Reed-solomon) code, and the like.
Optionally, the receiving end obtains grouping information, and according to the grouping information, the receiving end can group the original data on each transmission opportunity. The grouping information generally includes a grouping number G, that is, original data on one transmission opportunity is divided into G groups, original data of different groups are obtained, and group numbers 1 to G can be identified for different groups. Since the number of raw data transmitted per transmission opportunity may be fixed or may be dynamically changed, the number of raw data of the same group number of each transmission opportunity may be equal or different. Moreover, the number of original data in different packets within the same transmission opportunity may or may not be equal. The above-mentioned M' first original data refer to a group of original data having the same group number. The grouping of the N 'first encoded data is similar to the M' first original data, and refers to a group of encoded data having the same group number. The decoding of the M 'first original data and the N' first encoded data may refer to decoding of the M 'first original data and the N' first encoded data having the same group number. By the method, different grouped data can be decoded, the problem of burst errors of a channel can be solved, the complexity of coding and decoding is reduced, and the transmission reliability is ensured. Under the condition that the grouping information can be changed, different grouping information can be adopted under different channel states, and the transmission efficiency and the reliability are further improved.
Optionally, the first transmission opportunity is also used for other raw data besides the first raw data. By the method, different grouped data can be decoded, the problem of burst errors of a channel can be solved, the complexity of encoding and decoding is reduced, and the transmission reliability is ensured.
Optionally, the delaying of the transmission opportunity for the N' first encoded data by X transmission opportunities compared to the P transmission opportunities for the M first original data includes one of:
the transmission opportunity for the N' first encoded data is delayed by at least X transmission opportunities compared with the first transmission opportunity in the P transmission opportunities for the M first original data, and X is more than or equal to P-1;
the transmission opportunity for the N' first coded data is delayed by at most X transmission opportunities compared with the first transmission opportunity in the P transmission opportunities for the M first original data, and X is more than or equal to P-1;
the transmission opportunity for the N' first encoded data is delayed by at least X transmission opportunities from the last transmission opportunity of the P transmission opportunities for the M first original data; or
The transmission opportunity for the N' first encoded data is delayed by at most X transmission opportunities from the last transmission opportunity of the P transmission opportunities for the M first original data.
Optionally, the transmission opportunities for the N' first encoded data are delayed by no more than Y transmission opportunities compared to the P transmission opportunities for the M first original data, Y being a non-negative integer; the method further comprises one of:
the transmission opportunities for the N' first coded data are delayed by at least X transmission opportunities and at most Y transmission opportunities compared with the first transmission opportunity in the P transmission opportunities for the M first original data, and Y is more than or equal to X and more than or equal to P-1;
the transmission opportunity for the N' first encoded data is delayed by at least X transmission opportunities compared with the first transmission opportunity in the P transmission opportunities for the M first original data, is delayed by at most Y transmission opportunities compared with the last transmission opportunity in the P transmission opportunities for the M first original data, and satisfies that Y is not less than (X-P + 1) and X is not less than P-1;
the transmission opportunity for the N' first coded data is delayed by at least X transmission opportunities and at most Y transmission opportunities compared with the last transmission opportunity in the P transmission opportunities for the M first original data, and Y is more than or equal to X; or
The transmission opportunity for the N' first encoded data is delayed by at least X transmission opportunities from the last transmission opportunity among the P transmission opportunities for the M first original data, and is delayed by at most Y transmission opportunities from the first transmission opportunity among the P transmission opportunities for the M first original data, and Y ≧ X + P-1 is satisfied.
With reference to the second aspect, in certain embodiments of the second aspect, second encoded data is received. The original data is obtained by decoding the second coded data, so that the problem of random errors of a channel can be solved, and the transmission reliability is ensured.
Optionally, the receiving end may further obtain the related parameters of the second encoded data, where the related parameters of the second encoded data include one or more of the ratio r of the second encoded data, the number n or the code rate r' of the second encoded data, the transmission timing of the second encoded data, and the like. The meaning and the obtaining manner of the parameter corresponding to the second encoded data can refer to the description of the related parameter of the first encoded data, which is not repeated herein.
Optionally, the decoding manner of the second encoded data includes one or more of MDS codes, RLNC codes, LNC codes, bat codes, deterministic linear network codes, block codes, LT codes, rateless codes, RS codes, and the like, which is not described herein again.
With reference to the second aspect, in some embodiments of the second aspect, the N' first encoded data includes first encoded data a, the third transmission opportunity is used for transmission of the first encoded data a, and the third transmission opportunity is also used for transmission of one or more of other encoded data than the first encoded data or other original data than the first original data, and the method further includes:
decoding the received data at the third transmission opportunity to obtain the first encoded data a, the received data at the third transmission opportunity comprising one or more of:
the first encoded data a, the other encoded data, the first original data, the other original data, and the second encoded data. By decoding the received data at the third transmission opportunity to obtain the first encoded data a, the problem of burst errors occurring in the channel can be solved, thereby ensuring the transmission reliability.
Optionally, the transmission opportunity for the second encoded data is delayed by Z 'transmission opportunities compared to the third transmission opportunity, Z' being a non-negative integer. Since the total number V1 of the received data at the third transmission opportunity is greater than the total number transmitted at the first transmission opportunity minus the number of the second encoded data, and the total number transmitted at the first transmission opportunity minus the number of the second encoded data is represented by V2, the random error of any V1-V2 data at the third transmission opportunity can be solved by using the received data, so that the problem of interference randomness can be overcome.
With reference to the second aspect, in some embodiments of the second aspect, the receiving end receives the indication information; the indication information is used for indicating one or more of the following items:
sliding window information of the M first original data, the sliding window information indicating identification information of the M first original data corresponding to the N' first encoded data; or
And the group numbers corresponding to the M first original data. The indication information is used for obtaining decoding related parameters, so that the received data is decoded to obtain original data, the problem of burst errors of a channel can be solved, and the transmission reliability is ensured. By the mode, the coded data are decoded according to the indication information to obtain the original data, so that the problem of burst errors of a channel can be solved, and the transmission reliability is ensured.
Optionally, the sliding window information may indicate, for the sliding window information, identification information of M first original data corresponding to the N' first encoded data. By sending or receiving the indication information, the original data can be coded or decoded according to the indication information, the problem of random errors of a channel can be solved, and the transmission reliability is further improved.
Optionally, the indication information is encapsulated in the packet header of the first encoded data, that is, the packet header of the first encoded data carries the indication information. Optionally, the indication information may be partially encapsulated in the packet header of the first encoded data, and another part of the information may be indicated by other information (for example, a signaling manner). By the mode, the coded data are decoded according to the indication information to obtain the original data, so that the problem of burst errors of a channel can be solved, and the transmission reliability is ensured.
In a third aspect, an embodiment of the present application provides an apparatus, which may implement the method in the first aspect or any possible implementation manner of the first aspect. The device comprises corresponding units or means for performing the above-described method. The means comprised by the apparatus may be implemented by software and/or hardware. The apparatus may be, for example, a terminal, a network device, a server, or a centralized controller, or a chip, a system-on-chip, or a processor that can support the terminal, the network device, the server, or the centralized controller to implement the foregoing method.
In a fourth aspect, embodiments of the present application provide an apparatus, which may implement the method in the second aspect or any possible implementation manner of the second aspect. The apparatus comprises corresponding units or means for performing the above-described method. The means comprised by the apparatus may be implemented by software and/or hardware. The apparatus may be, for example, a terminal, a network device, a server, or a centralized controller, or a chip, a system-on-chip, or a processor that can support the terminal, the network device, the server, or the centralized controller to implement the foregoing method.
In a fifth aspect, an embodiment of the present application provides an apparatus, including: a processor coupled to a memory, the memory being configured to store a program or instructions that, when executed by the processor, cause the apparatus to perform the method of the first aspect, or any of the possible implementations of the first aspect.
In a sixth aspect, an embodiment of the present application provides an apparatus, including: a processor coupled to a memory, the memory storing a program or instructions that, when executed by the processor, cause the apparatus to perform the method of the second aspect described above, or any one of the possible embodiments of the second aspect.
In a seventh aspect, an embodiment of the present application provides a computer-readable medium, on which a computer program or instructions are stored, where the computer program or instructions, when executed, cause a computer to perform the method described in the first aspect or any one of the possible implementation manners of the first aspect.
In an eighth aspect, embodiments of the present application provide a computer-readable medium having stored thereon a computer program or instructions, which when executed, cause a computer to perform the method of the second aspect, or any one of the possible implementations of the second aspect.
In a ninth aspect, the present application provides a computer program product, which includes computer program code, when the computer program code runs on a computer, the computer executes the method described in the first aspect or any one of the possible implementation manners of the first aspect.
In a tenth aspect, embodiments of the present application provide a computer program product, which includes computer program code, when the computer program code runs on a computer, the computer executes the method described in the second aspect or any one of the possible implementation manners of the second aspect.
In an eleventh aspect, an embodiment of the present application provides a chip, including: a processor coupled to a memory, the memory being configured to store a program or instructions that, when executed by the processor, cause the chip to implement the method as described in the first aspect or any one of the possible implementations of the first aspect.
In a twelfth aspect, an embodiment of the present application provides a chip, including: a processor coupled to a memory, the memory being configured to store a program or instructions that, when executed by the processor, cause the chip to implement the method of the second aspect, or any one of the possible embodiments of the second aspect.
Drawings
Fig. 1 is a schematic diagram of a communication system applied to an embodiment provided in the present application;
fig. 2 is a schematic diagram of various specific communication scenarios applied in the embodiment provided in the present application;
fig. 3 shows an exemplary architecture of a communication system;
fig. 4 is a flowchart illustrating a communication method provided in an embodiment of the present application;
5a-5d are schematic diagrams illustrating a flow of network coding provided by an embodiment of the present application;
6a-6b show a flow diagram of network coding provided by an embodiment of the present application;
fig. 7 is a flowchart illustrating a communication method provided by an embodiment of the present application;
fig. 8 is a schematic structural diagram of a communication device according to an embodiment of the present application;
fig. 9 is a schematic structural diagram of another communication device according to an embodiment of the present application;
fig. 10 is a schematic structural diagram of another communication device according to an embodiment of the present application.
Detailed Description
The method and the device provided by the embodiment of the application can be applied to a communication system. Fig. 1 is a schematic architecture diagram of a communication system 1000 to which an embodiment of the present application is applied. As shown in fig. 1, the communication system includes a radio access network 100 and a core network 200, and optionally, the communication system 1000 may further include an internet 300. The radio access network 100 may include at least one radio access network device (e.g., 110a and 110b in fig. 1) and may further include at least one terminal (e.g., 120a-120j in fig. 1). The terminal is connected with the wireless access network equipment in a wireless mode, and the wireless access network equipment is connected with the core network in a wireless or wired mode. The core network device and the radio access network device may be different independent physical devices, or the function of the core network device and the logical function of the radio access network device may be integrated on the same physical device, or a physical device may be integrated with a part of the function of the core network device and a part of the function of the radio access network device. The terminals and the radio access network equipment can be connected with each other in a wired or wireless mode. Fig. 1 is a schematic diagram, and other network devices, such as a wireless relay device and a wireless backhaul device, may also be included in the communication system, which are not shown in fig. 1.
The radio access network device may be a base station (base station), an evolved NodeB (eNodeB), a Transmission Reception Point (TRP), a next generation base station (gNB) in a fifth generation (5th generation, 5g) mobile communication system, a next generation base station in a sixth generation (6th generation, 6g) mobile communication system, a base station in a future mobile communication system, an access node in a WiFi system, or the like; or may be a module or a unit that performs part of the functions of the base station, for example, a Centralized Unit (CU) or a Distributed Unit (DU). The radio access network device may be a macro base station (e.g., 110a in fig. 1), a micro base station or an indoor station (e.g., 110b in fig. 1), a relay node or a donor node, and the like. The embodiments of the present application do not limit the specific technology and the specific device form used by the radio access network device. For convenience of description, the following description will be made with a base station as an example of the radio access network device.
A terminal may also be referred to as a terminal equipment, user Equipment (UE), a mobile station, a mobile terminal, etc. The terminal can be widely applied to various scenes, for example, device-to-device (D2D), vehicle-to-electrical (V2X) communication, machine-type communication (MTC), internet of things (IOT), virtual reality, augmented reality, industrial control, automatic driving, telemedicine, smart grid, smart furniture, smart office, smart wearing, smart transportation, smart city, and the like. The terminal can be cell-phone, flat computer, take the computer of wireless transceiver function, wearable equipment, vehicle, unmanned aerial vehicle, helicopter, aircraft, steamer, robot, arm, intelligent house equipment etc.. The embodiment of the present application does not limit the specific technology and the specific device form adopted by the terminal.
The base stations and terminals may be fixed or mobile. The base station and the terminal can be deployed on land, including indoors or outdoors, handheld or vehicle-mounted; can also be deployed on the water surface; it may also be deployed on airborne airplanes, balloons and satellite vehicles. The embodiment of the application does not limit the application scenarios of the base station and the terminal.
The roles of base station and terminal may be relative, e.g., helicopter or drone 120i in fig. 1 may be configured to move the base station, for those terminals 120j that access radio access network 100 through 120i, terminal 120i is the base station; however, for the base station 110a, 120i is a terminal, i.e. the base station 110a and 120i communicate with each other via a wireless air interface protocol. Of course, 110a and 120i may communicate with each other through an interface protocol between the base station and the base station, and in this case, 120i is also the base station as compared to 110 a. Therefore, the base station and the terminal may be collectively referred to as a communication apparatus, and 110a, 110b, and 120a to 120j in fig. 1 may be referred to as communication apparatuses having their respective corresponding functions, for example, a communication apparatus having a base station function or a communication apparatus having a terminal function.
The base station and the terminal, the base station and the base station, and the terminal can communicate through a licensed spectrum, an unlicensed spectrum, or both; communication can be performed by a frequency spectrum of 6 gigahertz (GHz) or less, or by a frequency spectrum of 6GHz or more, or by using a frequency spectrum of 6GHz or less and a frequency spectrum of 6GHz or more at the same time. The embodiments of the present application do not limit the spectrum resources used for wireless communication.
In the embodiment of the present application, the functions of the base station may also be performed by a module (e.g., a chip) in the base station, or may also be performed by a control subsystem including the functions of the base station. The control subsystem including the base station function may be a control center in an application scenario of the terminal, such as a smart grid, industrial control, intelligent transportation, and smart city. The functions of the terminal may also be performed by a module (e.g., a chip or a modem) in the terminal, or by a device including the functions of the terminal.
Further, the present application may be applied to various specific communication scenarios, for example, scenarios such as point-to-point transmission between a base station and a terminal or between terminals (e.g., fig. 2 (a) is point-to-point transmission between a base station and a terminal), multi-hop transmission between a base station and a terminal (e.g., fig. 2 (b) and fig. 2 (c)), dual Connectivity (DC) or multi-connection between multiple base stations and terminals (e.g., fig. 2 (d)). It should be noted that, the above specific communication application scenarios are only examples and are not limited. In particular, from a service perspective, the embodiments of the present application are applicable to a plurality of service scenarios, for example, a data coding scenario in an extended reality (XR) service, an uplink large capacity scenario, and the like. Moreover, fig. 2 does not impose limitations on the network architecture applicable to the present application, and the present application does not restrict uplink, downlink, access link, backhaul (backhaul) link, sidelink (Sidelink), etc. transmissions.
The techniques described in embodiments of the present invention may be used in various communication systems, such as a fourth generation (4G) communication system, a 4.5G communication system, a 5G communication system, a system in which multiple communication systems are merged, or a future-evolution communication system (e.g., a 6G communication system). Such as Long Term Evolution (LTE) systems, new Radio (NR) systems, wireless fidelity (WiFi) systems, wireless ad hoc systems, device-to-device direct communication systems, and 3rd generation partnership project (3 GPP) -related communication systems, etc., as well as other such communication systems.
Fig. 3 is a schematic diagram illustrating an example of a possible architecture of a communication system, where a network device in a Radio Access Network (RAN) shown in fig. 3 includes a Centralized Unit (CU) and a Distributed Unit (DU) separated base station (e.g., a gnnodeb or a gNB). The RAN may be connected to a core network (e.g., LTE core network, 5G core network, etc.). CU and DU can be understood as the division of the base station from the logical function point of view. CUs and DUs may be physically separate or deployed together. A plurality of DUs can share one CU. A DU may also connect multiple CUs (not shown). The CU and the DU may be connected via an interface, for example, an F1 interface. CUs and DUs may be partitioned according to protocol layers of the wireless network. For example, functions of a Packet Data Convergence Protocol (PDCP) layer and a Radio Resource Control (RRC) layer are provided in the CU, and functions of a Radio Link Control (RLC), a Medium Access Control (MAC) layer, a physical (physical) layer, and the like are provided in the DU. It is to be understood that the division of CU and DU processing functions according to such protocol layers is merely an example and may be performed in other ways. For example, a CU or DU may be partitioned to have more protocol layer functionality. For example, a CU or DU may also be divided into parts of the processing functions with protocol layers. In one design, some of the functions of the RLC layer and the functions of the protocol layers above the RLC layer are set in the CU, and the remaining functions of the RLC layer and the functions of the protocol layers below the RLC layer are set in the DU. In another design, the functions of a CU or DU may also be divided according to traffic type or other system requirements. For example, dividing by time delay, setting the function that processing time needs to meet the time delay requirement in DU, and setting the function that does not need to meet the time delay requirement in CU. The network architecture shown in fig. 3 may be applied to a 5G communication system, which may also share one or more components or resources with an LTE system. In another design, a CU may also have one or more of the functions of a core network. One or more CUs may be centrally located or separately located. For example, the CUs may be located on the network side to facilitate centralized management. The DU may have multiple rf functions, or may set the rf functions remotely.
The functionality of a CU may be implemented by one entity or may further separate the Control Plane (CP) and the User Plane (UP), i.e. the control plane (CU-CP) and the user plane (CU-UP) of a CU may be implemented by different functional entities, which may be coupled to DUs to jointly perform the functionality of a base station.
It is understood that the embodiments provided in the present application are also applicable to an architecture in which CU and DU are not separated.
For the sake of easy understanding, the communication nouns or terms referred to in the embodiments of the present application will be explained first, and these communication nouns or terms will also be part of the present application.
In the network coding technology, a sending end codes a plurality of original data units to obtain a plurality of coded data units, and then generates a plurality of coded packets, wherein each coded packet comprises a coded data unit and coded coefficient indication information; the receiving end can decode the encoded data unit according to the encoding coefficient, thereby obtaining the original data unit.
In a communication system, a feedback retransmission mechanism can achieve effective error control. For example, a hybrid automatic repeat request (HARQ) retransmission mechanism of a Medium Access Control (MAC) layer and an automatic repeat request (ARQ) retransmission mechanism of a Radio Link Control (RLC) layer jointly ensure transmission reliability. As communication technology evolves and develops, new Radio (NR) places higher demands on reliability, effectiveness, etc. of a system. Wherein the ARQ mechanism is a function in an RLC layer Acknowledged Mode (AM) transmission mode. The ARQ operation of the transmitting end comprises transmitting and retransmitting Protocol Data Units (PDU) or segmenting, receiving a state report sent by the receiving end and receiving HARQ (hybrid automatic repeat request) sending failure indication sent by a bottom layer; the ARQ operation at the receiving end includes detecting whether the RLC layer PDU reception has failed. The receiving condition of data is fed back to the sending end periodically through a state report of the RLC layer, information contained in the state report comprises Serial Number (SN) of RLC layer PDU which has been received by the receiving end and SN number which has not been received, when the receiving end detects packet loss, the receiving end informs the sending end that a certain AM PDU or a re-segmentation segment has not been received through the state report of the RLC layer, and requests the sending end to retransmit the PDU.
The retransmission delay based on feedback is relatively large, and the round-trip time (RTT) of one uplink HARQ process in a frequency-division duplex (FDD) system is 8 Transmission Time Intervals (TTIs). Therefore, the feedback retransmission mechanism faces many problems, for example, the problem of frequent feedback overhead and performance loss in a multicast or broadcast scenario, the problem of severe performance loss in a burst continuous error scenario and a dual-connection or multi-connection congestion scenario, and the like. The network coding technology is used as a forward error correction technology, and can solve the problems of packet loss or performance loss and the like in wireless transmission by coding an original data packet and increasing redundancy, so that the time delay and feedback overhead caused by feedback can be avoided. Network coding patterns include Random Linear Network Coding (RLNC), convolutional Network Coding (CNC), deterministic linear network coding (deterministic linear network coding), batch sparse code (BATS), erasure code (erasure code), fountain code (fountain code), convolutional Network Coding (CNC), stream coding (streaming code), maximum Distance Separable (MDS) code, LT (luma Transform) code, rateless code, RS (Reed-solomon) code, and the like.
In a wireless channel environment, random errors occur in Code Blocks (CBs) within a physical layer Transport Block (TB) received by a receiving end due to channel additive noise, where the TB may be a data packet of a higher layer, and a size of the data packet is close to a size of the CB. For low-delay service, because of strict constraint on transmission delay, the physical layer has no chance of retransmission, and a phenomenon of random packet loss of data packets occurs at a high layer. Meanwhile, continuous errors occur in the CB after decoding at the receiving end due to factors such as fading caused by mobility or interference caused by other users, and the phenomenon of continuous packet loss of data packets occurs at a high level for low-delay services.
At present, a network coding method of Forward Error Correction (FEC) is generally adopted for low-latency services, where the FEC coding method is to add a part of redundant error correction (FEC) coded packets or FEC coded packets or check packets to a certain number of original data packets to be sent by a sending end and send the data packets together, and a specific coding generation method related to the coded packets or the check packets may adopt RLNC, deterministic linear network coding, bat codes, erasure codes, fountain codes, CNC, streaming codes, MDS codes, LT codes, rateless codes, RS codes, and the like. In the general FEC technical scheme, the number of original data packets is fixed, and the original data packets and corresponding check packets are continuously sent to a receiving end through a TB of a physical layer. However, the physical layer generally adopts an Adaptive Modulation and Coding (AMC) method to adapt the transmission quality of the radio channel, that is, the size of each TB is dynamically changed or the number of data packets included in each TB is dynamically changed. If the complexity and the decoding time delay are considered, the adoption of the FEC encoding strategy can adopt the redundant encoding error correction on a small number of original data packets. However, if a burst error occurs in the channel, the FEC coding packet and the original data packet will both be in error, and the original data packet will not be recovered.
In order to solve the above technical problem, an embodiment of the present application provides a network coding method, in which a sending end performs coding on original data on multiple transmission opportunities to generate a set of first type coded data; the group of first-class check packets is transmitted by a plurality of delayed transmission opportunities relative to the first or last transmission opportunity in the plurality of transmission opportunities, so that the problem that the original data packet cannot be recovered due to long burst errors of a channel is solved. Furthermore, the sending end encodes the first type of coded data and the original data on the transmission opportunity where the first type of coded data is located, and can also generate a group of second type of coded data, and the first type of coded data is sent at the transmission opportunity where the first type of coded data is located or sent at a plurality of transmission opportunities delayed from the transmission opportunity where the first type of coded data is located, so that the problem of random errors occurring in a channel can be solved, and the transmission reliability is further improved.
In the embodiment of the present application, data before encoding may be referred to as original data, system data, a system data block, an original data block, or original data, and the like, and data after encoding may be referred to as encoded data, an encoded block, or the like. A piece of data before encoding includes one or more data packets before encoding, where a data packet before encoding may also be referred to as an original data packet, or an original packet. 1. The encoded data includes one or more encoded data packets, where the encoded data packets may also be referred to as encoded data packets, encoded packets, or the like. In the following description of the present application, different names of the same concept, which have the same meaning, will be used in different places and will not be described again.
In this embodiment of the present application, a protocol layer having a coding and decoding function may be collectively referred to as a network coding layer, and the coding and decoding function may be a network coding function, or may also be other coding and decoding functions similar to the network coding function, which is not limited herein. The network coding layer codes the data before coding to generate coded data. The encoded data may be a data unit output by a module of the network coding layer, where outputting the encoded data unit may be understood as outputting the encoded data unit to a module that subsequently processes the encoded data unit in the terminal device or the network device through the communication interface. It will be appreciated that reference to outputting in this application may refer to sending signals or data over an air interface, or may refer to outputting signals or data within an apparatus (e.g., terminal equipment or network equipment) to other modules within the apparatus via a communication interface. The specific process is specifically described in the application scenario, and is not described herein again.
In this embodiment, a network coding layer at a sending end acquires an original data packet on a transmission opportunity, where the original data packet may be a data packet obtained by the network coding layer after aggregation (also referred to as concatenation) and/or segmentation according to a Service Data Unit (SDU) or PDU, or may be the SDU or PDU itself.
In the embodiments of the present application, a transmission opportunity may also be referred to as a scheduling opportunity, a transmission time interval, or other names. The physical meaning of a transmission opportunity may refer to a slot (slot), TTI, frame, subframe, or a fixed number of data units, which may be SDUs, PDUs, packets, bits, or bytes, transmitted by the corresponding protocol layer. The RLC layer and the protocol layers below it can only recognize the time slots on the current standard. For example, in the RLC layer, the MAC layer can determine a TB size per slot and notify the RLC layer of TB size indication information indicating the TB size. The RLC layer sends one or more RLC PDUs to the MAC layer, and the sum of the data amount of the one or more RLC PDUs is the data amount indicated by the TB size indication information, so that the RLC layer can identify each time slot and the original data packet in each time slot. However, the protocol layer above the RLC layer can only recognize packets received one by one, and cannot determine which packet starts and which packet ends as a packet in a time slot, so that it cannot determine which original packets are transmitted in a plurality of time slots. Similarly, if a transmission opportunity is a concept related to time, such as scheduling opportunity, transmission time interval, etc., a lower layer, such as the MAC layer, is also required to deliver related indication information to the network coding layer so that the network coding layer can identify the original data packet on multiple transmission opportunities. If one or more intermediate layers are arranged between the network coding layer and the MAC layer, the indication information can be transmitted through the one or more intermediate layers. Alternatively, if the network coding layer is not at the RLC layer and is at a protocol layer above the RLC layer, the transmission opportunity may be a transmission opportunity every time the network coding layer sends one or several PDUs or SDUs or original data packets to the next layer. For multiple transmission opportunities, the number of original data packets transmitted by each transmission opportunity may be the same or different.
The technical solution of the present application is described in detail with reference to the following embodiments and drawings. The following examples and implementations may be combined with each other and may not be repeated in some examples for the same or similar concepts or processes. It will be appreciated that the functions referred to in this application may be implemented by means of hardware circuitry, by means of software running in conjunction with a processor/microprocessor or general purpose computer, by means of an application specific integrated circuit, and/or by means of one or more digital signal processors. When described herein as a method, it may also be implemented by a computer processor and a memory coupled to the processor.
Fig. 4 is a flowchart illustrating a communication method 400 according to an embodiment of the present application. The execution subject of the method is a sending device (also called sending end or sending end device). The sending device may be a terminal (e.g., an XR terminal), or may be a chip, a system-on-chip, or a processor that supports the terminal to implement the method. Alternatively, the sending device may be a network device (e.g., a core network device, an access network device, a WiFi router, or a WiFi access point), or may be a chip, a chip system, or a processor, etc. that supports the network device to implement the method. The sending device may be a server (e.g., a cloud server), or may be a chip, a chip system, or a processor that supports the server to implement the method. As shown in FIG. 4, the method 400 of this embodiment may include portions 410 and 420:
and a part 410: and encoding the M first original data to obtain N first encoded data, wherein M is a positive integer and N is a positive integer.
In section 410, optionally, the transmitting end obtains the relevant parameters of the first encoded data. The related parameters of the first coded data comprise one or more of parameters such as coding depth M, proportion R of the first coded data, number N or code rate R' of the first coded data, transmission opportunity of the first coded data, grouping information and the like.
In the embodiment of the present application, the meaning of the coding depth M is to code M pieces of original data, where the M pieces of original data are sent on P transmission opportunities, and P is a positive integer not less than 2. The coded depth may also be referred to as a code length, a convolutional depth, a coded block size, a coding window size, or a sliding window size, etc. The number of the first encoded data is the number of a set of first encoded data generated by encoding the M original data. The number of different sets of first encoded data may be determined individually. The number of first encoded data may be different or the same between different groups. The ratio of the first encoded data is a ratio of a total number N of a group of first encoded data generated by encoding M first original data to a total number M of corresponding first original data, and the ratio R of the first encoded data may also be a ratio of a total number N of a group of first encoded data generated by encoding M first original data to a total number M of corresponding first original data plus a sum of the total number N of the first encoded data. The code rate R 'is a ratio of the number M of the first original data to the sum of the total number N of the group of first encoded data generated by encoding the first original data and the number M of the first original data, or the code rate R' may be a ratio of the number M of the first original data to the total number N of the group of first encoded data generated by encoding the M first original data.
In part 410, optionally, the obtaining, by the sending end, the parameter related to the first encoded data means that the network coding layer at the sending end obtains the parameter related to the first encoded data. The network coding Layer refers to a Protocol Layer having a network coding function, and the network coding Layer may be a Radio Resource Control (RRC) Layer, a Packet Data Convergence Protocol (PDCP) Layer, a Backhaul Adaptation Protocol (BAP) Layer, an RLC Layer, an MAC Layer, or a Physical Layer (PHY) Layer. The particular layer is not limited in this application. The network coding layer may also be a new protocol layer other than the above protocol layers, for example, the new protocol layer may be above the PDCP layer, above the BAP layer, between the PDCP layer and the RLC layer, between the RLC layer and the MAC layer, or between the MAC layer and the PHY layer, and the location of the new protocol layer may not be limited in this application. The network coding layer may be referred to as a coding layer, a decoding layer, a network coding layer, or other names, and is not limited in this application.
For the acquisition of the parameter related to the first encoded data, the acquisition mode of the sending end may be predefined, or may be configured to the sending end by the network side device, such as semi-statically configured or dynamically configured, or may be preset by the sending end, such as preset or configured according to one or more of system requirements, actual communication states, or protocol presettings. The different encoding parameters may be obtained in the same or different manners. For example, the coding depth M is configured semi-statically by the network side device, the proportion or number of the first coded data is determined by the sending end according to the actual communication state, and the transmission opportunity of the first coded data is determined by the sending end according to the transmission rule, where the transmission rule may be specified by a protocol.
In a possible implementation manner of the part 410 encoding the M first original data, the network encoding layer at the sending end performs network encoding on the M first original data, so as to obtain a set of first encoded data corresponding to the M first original data. The number or proportion of the first coded data required to be generated by the network coding is obtained according to the relevant parameters of the first coded data. The code pattern used for encoding may be one of Maximum Distance Separable (MDS) codes, random Linear Network Coding (RLNC) codes, linear Network Coding (LNC) codes, deterministic linear network coding (BATS), batch Sparse (BATS), block (block), LT (Luby Transform), rateless (rateless) codes, RS (Reed-solomon) codes, and the like. Different code patterns correspond to different coding modes.
In a possible implementation of the encoding of the M first original data in part 410, the sending end obtains grouping information, and according to the grouping information, the sending end may group the original data at each transmission opportunity. The grouping information generally includes a grouping number G, that is, original data on one transmission opportunity is divided into G groups to obtain original data of different groups, and the original data of different groups may have different group numbers or identifications, for example, group numbers that may be identified as 1 to G for different groups. Since the number of original data to be transmitted for each transmission opportunity may be fixed or may be dynamically changed, the number of original data of the same group number for each transmission opportunity may be equal or different. Moreover, the number of original data in different packets in the same transmitter-side may or may not be equal. In the case of grouping the original data at each transmission opportunity, the M first original data may refer to a group of original data having the same group number, and encoding the M first original data may refer to encoding the M first original data having the same group number. For example, when grouping, the number of original data included in different groups differs by no more than 1, and the grouping may be specifically performed according to the following rule: if the number of packets G is equal to the number L of original data on one transmission opportunity, a packet contains one original data, and if the number of packets G is not equal to L, the number of original data in each packet can be confirmed by the following procedure: (1) For the G (G =0,1, \ 8230;, mod (L, G) -1) group, the number is contained
Of raw data of (2), wherein
(2) For the G (G = mod (L, G), mod (L, G) +1, \ 8230;, G) packet, the number is included
Of raw data of (2), wherein
Part 420: and sending the M first original data and the N first coded data, wherein the number of transmission opportunities for transmitting the M first original data is P and includes a first transmission opportunity, and the transmission opportunity for transmitting the N first coded data is delayed by X transmission opportunities compared with the P transmission opportunities for transmitting the M first original data, X is a non-negative integer, P is a positive integer and satisfies that P is greater than or equal to 2.
In one possible implementation manner of transmitting the N first encoded data in part 420, the N first encoded data are encoded data obtained by encoding with a generator matrix including an identity sub-matrix, where the encoded data obtained by the identity sub-matrix corresponds to the transmitted M first original data, and the remaining encoded data corresponds to the transmitted N first encoded data.
Optionally, in part 420, the first transmission opportunity is further used for transmitting other raw data besides the first raw data. In one possible embodiment, the group number of the first original data is different from the group number of the other original data.
In part 420, optionally, one possible implementation that the transmission opportunity for transmitting the N first encoded data is delayed by X transmission opportunities compared to the P transmission opportunities for transmitting the M first original data includes one of the following:
the transmission opportunity for transmitting the N first coded data is delayed by at least X transmission opportunities compared with the first transmission opportunity in the P transmission opportunities for transmitting the M first original data, and X is more than or equal to P-1;
the last transmission opportunity for transmitting the N first coded data is delayed by at most X transmission opportunities compared with the first transmission opportunity in the P transmission opportunities for transmitting the M first original data, and X is more than or equal to P-1;
the transmission opportunity for transmitting the N first encoded data is delayed by at least X transmission opportunities from the last transmission opportunity of the P transmission opportunities for transmitting the M first original data; or
The last transmission opportunity for transmitting the N first encoded data is delayed by at most X transmission opportunities from the last transmission opportunity of the P transmission opportunities for transmitting the M first original data.
In part 420, optionally, in a possible implementation that the transmission opportunity for transmitting the N first encoded data is delayed by X transmission opportunities compared to the P transmission opportunities for transmitting the M first original data, the method further includes: the transmission opportunity for transmitting the N first encoded data is delayed by no more than Y transmission opportunities compared to P transmission opportunities for transmitting the M first original data, Y being a non-negative integer. The method comprises one of the following:
the transmission opportunity for transmitting the N first coded data is delayed by at least X transmission opportunities and at most Y transmission opportunities compared with the first transmission opportunity in the P transmission opportunities for transmitting the M first original data, and Y is more than or equal to X and more than or equal to P-1;
the transmission opportunity for transmitting the N first coding data is delayed by at least X transmission opportunities compared with the first transmission opportunity in the P transmission opportunities for transmitting the M first original data, is delayed by at most Y transmission opportunities compared with the last transmission opportunity in the P transmission opportunities for transmitting the M first original data, and meets the condition that Y is more than or equal to (X-P + 1) and X is more than or equal to P-1;
the transmission opportunity for transmitting the N first coded data is delayed by at least X transmission opportunities compared with the last transmission opportunity in the P transmission opportunities for transmitting the M first original data, at most Y transmission opportunities are delayed, and Y is larger than or equal to X; or
The transmission opportunity for transmitting the N first encoding data is delayed by at least X transmission opportunities compared with the last transmission opportunity in the P transmission opportunities for transmitting the M first original data, is delayed by at most Y transmission opportunities compared with the first transmission opportunity in the P transmission opportunities for transmitting the M first original data, and meets the condition that Y is more than or equal to X + P-1.
Optionally, as shown in fig. 4, the method 400 may further include parts 430 and 440:
part 430: the N first encoded data include first encoded data a, the third transmission opportunity is used to transmit the first encoded data a, and the third transmission opportunity is also used to transmit one or more of other encoded data except the first encoded data or other original data except the first original data, and the method further includes:
and encoding the other encoded data on the third transmission opportunity, one or more of the first original data and the other original data, and the first encoded data a to obtain second encoded data.
Similar to the step 410, the sending end obtains the relevant parameters of the first encoded data, the sending end may also obtain the relevant parameters of the second encoded data, and the relevant parameters of the second encoded data include one or more of the ratio r of the second encoded data, the number n or the code rate r' of the second encoded data, the transmission timing of the second encoded data, and the like. The meaning and the obtaining manner of the parameter corresponding to the second encoded data can refer to the description of the related parameter of the first encoded data, which is not repeated herein.
Similar to the generation manner of the first encoded data in section 410, the generation manner, i.e., the encoding manner, of the second encoded data includes one or more of MDS codes, RLNC codes, LNC codes, bat codes, deterministic linear network codes, block codes, LT codes, rateless codes, or RS codes, and specifically, which code type is adopted may be based on system design requirements or protocol specifications or based on configuration, which is not described herein again.
In part 430, optionally, the third transmission opportunity is further used for transmitting the second encoded data.
Optionally, in part 430, the transmission opportunity for transmitting the second encoded data is delayed by Z transmission opportunities compared to the third transmission opportunity, where Z is a non-negative integer. In a possible implementation manner, the sending end delays the sending of the second encoded data by Z transmission opportunities compared with the third transmission opportunity according to the obtained relevant parameters of the second encoded data.
Part 440: sending or receiving indication information; the indication information is used for indicating one or more of the following items:
sliding window information of the M first original data, the sliding window information indicating M first original data corresponding to the N first encoded data; or
The group numbers corresponding to the M pieces of first original data.
Optionally, the sliding window information may indicate identification information of M first original data corresponding to the N first encoded data.
It is to be understood that the indication in this application may be an explicit indication, or an implicit indication.
It is understood that the present application does not limit the order of execution of the sections 430 and 440. For example, the part 420 may be executed first and then the part 440 may be executed, or the part 440 may be executed first and then the part 410 may be executed; the part 420 may be executed first and then the part 430 may be executed, or the part 430 may be executed first and then the part 420 may be executed; the present application does not specifically limit the execution order of the sections 430 and 440.
In part 440, optionally, the indication information is encapsulated in the packet header of the first encoded data, that is, the packet header of the first encoded data carries the indication information. Alternatively, the indication information may be partially encapsulated in the packet header of the first encoded data, and another part of the information may be indicated by other information (e.g., signaling mode)
In one possible implementation of part 440, the transmitting end sends indication information to the receiving end, and the receiving end can know which data packets to decode together according to the indication information. One indication information indicates sliding window information, which may be window header and window end positions, that is, a minimum SN number of original data corresponding to the first encoded data indicated in the header information of the first encoded data, and a maximum SN number of the original data corresponding to the first encoded data. Therefore, the receiving end network coding layer receives the first coded data, analyzes the information (which may be referred to as header information for short) in the header packet, and decodes the received coded data carrying the minimum SN number and the maximum SN number, the original data corresponding to the minimum SN number, the original data corresponding to the maximum SN number, and the original data having the SN number between the minimum SN number and the maximum SN number, which are all the same, corresponding to the network coding, so as to obtain all the original data in the current sliding window. The sliding window information may also be the window header and the window length, where the window length is the number of raw data within the window. Similar to the above description, the receiving end network coding layer receives the first coded data, analyzes the header information, and performs decoding corresponding to the network coding on all the received coded data carrying the same minimum SN number and window length, the original data corresponding to the minimum SN number, and the original data having an SN number between the minimum SN number and the minimum SN number plus the window length, so as to obtain all the original data in the current sliding window. The sliding window information can also be the window tail and the window length, similarly, the receiving end network coding layer receives the first coded data, analyzes the header information, and decodes all the received coded data carrying the maximum SN number and the same window length, the original data corresponding to the maximum SN number and the original data with the SN number between the maximum SN number minus the window length and the maximum SN number together, which corresponds to the network coding, so as to obtain all the original data in the current sliding window. If the window length is a fixed value, the indication information may include a window head or a window tail.
Optionally, in the case of grouping the original data on each transmission opportunity, the indication information may further include a group number ID, that is, the indication information may include the group number ID and the sliding window information. Alternatively, the sliding window information may be the window head and window tail positions. The header information of the first encoded data indicates the minimum SN number of the original data corresponding to the encoded data, the maximum SN number of the original data corresponding to the encoded data, and the group ID. Therefore, the receiving end network coding layer receives the first coded data, analyzes the header information, and decodes all the coded data carrying the same minimum SN number and maximum SN number, the original data corresponding to the minimum SN number, the original data corresponding to the maximum SN number and the original data with the SN number between the minimum SN number and the maximum SN number and the same group number ID, which correspond to the network coding, so as to obtain all the original data in the current sliding window. The sliding window information may also be the window head and window length and the group number ID, where the window length is the number of the original data in the window. Similar to the above description, the receiving end network coding layer receives the first coded data, analyzes the header information, and performs network coding corresponding decoding on all the received coded data carrying the same minimum SN number and window length, the original data corresponding to the minimum SN number, and the original data having the SN number between the minimum SN number and the minimum SN number plus the window length and having the same group number ID, so as to obtain all the original data in the current sliding window. The sliding window information may also be the window end and window length and the group number ID. Similarly, the receiving end network coding layer receives the first coded data, analyzes the header information, and decodes the received coded data carrying the maximum SN number and the same window length, the original data corresponding to the maximum SN number, the original data having an SN number between the maximum SN number minus the window length and the maximum SN number, and the same group ID, so as to obtain all the original data in the current sliding window.
If the network coding layer is at the physical layer or the MAC layer or between the physical layer and the MAC layer, the information indicated by the sending end to the receiving end may further include the number of time slots that the coded packet delays compared to the original data and the group number ID, and the receiving end receives the coded data and uses the HARQ process number and the delayed number of time slots in its control message to know which time slots the coded packet corresponds to and the original data packets with the same group number ID, and decodes the received original data and the coded data together to obtain all the original data. It is understood that in the embodiment of the present application, the size of the window may be obtained according to the number of delayed slots. For example: the receiving end receives a set of encoded data at HARQ process 5 and the number of delays from the first transmission opportunity of the original data is 3, then the first transmission opportunity of the original data is process 2. The original data between process 2 to process 4 is taken as M original data, i.e., the window size is 3.
In a possible implementation manner of the part 400, the generation of the first encoded data may be implemented by using a sliding window, where the sliding window is used to obtain that the number of transmission opportunities of the M first original data is P, and the M first original data is network encoded to obtain the first encoded data corresponding to the M first original data. Then, sliding the window for S transmission opportunities to obtain another group of M other original data, and then performing network coding on the M other original data to obtain other coded data corresponding to the M other original data. The sliding granularity is S transmitters, and the value range of S can be more than or equal to 1 and less than or equal to P. Taking P =3 as an example, the scheme of the present embodiment is schematically illustrated in fig. 5a to 5d by using the implementation manner of the sliding window.
For example, as shown in FIG. 5a, a series of O-t-1's within a sliding window represent the original data sent on transmission opportunity t. The amount of raw data represented by O-t-1 may be different for different transmission opportunities, i.e. time slots t. Performing network coding in a mode such as RLNC, MDS, RS and the like on M pieces of first original data of the sliding window to generate first coded data; and delaying the transmission of the last transmission opportunity of the first original data within the relative sliding window by 2 transmission opportunities; alternatively, the first transmission opportunity of the first raw data within the relative sliding window is delayed by 4 transmission opportunities for transmission. It is to be understood that in the present embodiment, delaying transmission by 1 transmission opportunity is equivalent to transmitting at the next transmission opportunity. For example, the sliding window includes t =1, t =2, and t =3, and first original data represented by O-1-1, O-2-1, and O-3-1 is transmitted on 3 transmission opportunities, and the first original data corresponding to O-1-1, O-2-1, and O-3-1 is network-encoded to generate first encoded data, which is represented by P-5-1, and the first encoded data is transmitted on t =5 transmission opportunities. Where t =5 is delayed by 2 transmission opportunities with respect to the last transmission opportunity within the window, t = 3. The sliding window is slid S =1 transmission opportunity at a time along the transmission opportunity, and a further set of M other raw data within the window is network encoded, generating a further set of other encoded data. Delaying the transmission of 2 transmission opportunities relative to the last transmission opportunity of M other original data in the sliding window; or, the transmission is delayed by 4 transmission opportunities with respect to the first transmission opportunity of M other original data within this sliding window. For example, after a sliding window containing 3 transmission opportunities t =1, t =2, and t =3 slides S =1 transmission opportunity along the transmission opportunity direction, the sliding window contains 3 transmission opportunities t =2, t =3, and t =4 and other original data represented by O-2-1, O-3-1, and O-4-1. And performing network coding on other original data corresponding to O-2-1, O-3-1 and O-4-1 to generate a group of other coded data, denoted by P-6-1, and transmitting the coded data on t =6 transmission opportunities, wherein t =6 is delayed by 2 transmission opportunities by the last transmission opportunity in the relative window of t = 4. And performing network coding on other original data packets and/or the first coded data on the transmission opportunity where the first coded data is located to obtain second coded data. Transmitting at the current transmission opportunity or delaying T3 transmission opportunities, for example, taking first encoded data P-6-1 generated by a sliding window containing 3 transmission opportunities of T =2, T =3, and T =4 as an example, network-encoding the set of first encoded data P-6-1 and other original data packet O-6-1 at transmission opportunity T =6 where the set of first encoded data P-6-1 is located to generate second encoded data, which is denoted by P-6-2, and transmitting the second encoded data P-6-2 at current transmission opportunity T = 6.
For another example, as shown in FIG. 5b, a series of O-t-1 within the sliding window represents the original data sent on transmission opportunity t, and the number of original data packets represented by O-t-1 may be different for different transmission opportunities t. And performing network coding on the M first original data of the sliding window to generate first coded data. The first coded data is transmitted by delaying the last transmission opportunity of the first original data in a sliding window by at most 2 transmission opportunities; or, the first coded data is transmitted at least 1 transmission opportunity delayed relative to the last transmission opportunity of the M first original data in the sliding window; or, the first encoded data is transmitted with a delay of at most 2 transmission opportunities and at least 1 transmission opportunity relative to the last transmission opportunity of the M first original data within the sliding window; or, the first coded data is delayed by at least 3 transmission opportunities relative to the first transmission opportunities of the M first original data in the sliding window; or, the first coded data is transmitted with a delay of at most 4 transmission opportunities with respect to the first transmission opportunities of the M first original data within the sliding window; or, the first coded data is transmitted at least 3 and at most 4 transmission opportunities delayed with respect to the first transmission opportunity of the M first original data within the sliding window; or, the first encoded data is delayed by at most 4 transmission opportunities with respect to a first transmission opportunity of the M first original data within the sliding window and is delayed by at least 1 transmission opportunity with respect to a last transmission opportunity of the M first original data within the sliding window. For example, a sliding window including 3 transmission opportunities t =1, t =2, and t =3 is represented by O-1-1, O-2-1, and O-3-1, respectively, and the first encoded data within the window is network encoded to generate first encoded data, which is represented by P-4-1. The set of first encoded data is transmitted on two transmission opportunities, t =4 and t =5, delayed by at least 1 transmission opportunity with respect to the last transmission opportunity t =3 within the window and by at most 4 transmission opportunities with respect to the first transmission opportunity t =1 within the window. The sliding window network encodes another set of M other raw data within the window, generating another set of other encoded data, as the transmission opportunities slide S =1 transmission opportunity at a time. The transmission is delayed by 1 transmission opportunity relative to the last transmission opportunity of the M other original data in the sliding window, and delayed by 3 transmission opportunities relative to the first transmission opportunity of the M other original data in the sliding window. For example, when the sliding window contains other raw data represented by O-2-1, O-3-1, O-4-1, the network code generates a set of other coded data P-5-1 that is sent on t =5 and t =6 transmission opportunities. The last transmission opportunity t =4 within the window is delayed by at least 1 transmission opportunity and by at most 4 transmission opportunities with respect to the first transmission opportunity t =2 within the window. The other original data and/or the first coded data on the transmission opportunity where the first coded data is located are subjected to network coding to obtain second coded data, the second coded data are sent at the current transmission opportunity or are sent with Z transmission opportunities delayed, for example, the transmission opportunity of t =5 comprises part of the first coded data of P-4-1, part of the other coded data of P-5-1 and other original data represented by O-5-1, the data are subjected to network coding to generate second coded data, such as P-5-2, and the second coded data are sent at the transmission opportunity of t = 5. The difference between the embodiment of fig. 5b and the embodiment of fig. 5a is that the encoded data is carried by multiple transmission opportunities, which enhances the interleaving capability of the encoded data and can better combat random errors of the channel. But due to the same maximum delay constraint, the embodiment of fig. 5b is less robust against burst errors than the encoded data in the embodiment of fig. 5a, since the transmission interval of the encoded data to the original data is smaller.
For another example, as shown in fig. 5c, the difference from the embodiment in fig. 5a is that the sliding granularity of the sliding window is S = P transmission opportunities, i.e. the sliding window of the embodiment in fig. 5c is not overlapped during the sliding process, while the sliding window of the embodiment in fig. 5a contains the repetition-coded original data during the sliding process. The coding complexity is lower for the embodiment of fig. 5c than for the embodiment of fig. 5a, but the error correction capability of the embodiment of fig. 5c is less than that of the embodiment of fig. 5 a.
For another example, as shown in fig. 5d, similar to the difference between the embodiment in fig. 5c and the embodiment in fig. 5a, the difference between the embodiment in fig. 5d and the embodiment in fig. 5b is that the sliding granularity of the sliding window is S = P transmission opportunities, i.e. the sliding window of the embodiment in fig. 5d is not overlapped during the sliding process, while the sliding window of the embodiment in fig. 5b contains repeatedly encoded data packets during the sliding process, so the coding complexity of the embodiment in fig. 5d is lower than that of the embodiment in fig. 5b, but the error correction capability of the embodiment in fig. 5d is not as same as that of the embodiment in fig. 5 b.
In another possible implementation manner of part 400, the generation of the first encoded data may also be implemented in a sliding window manner. In the present embodiment, the M first original data refers to a group of original data having the same group number. The sliding window is divided into G groups, G is the number of groups into which the original data required to be sent by each transmission opportunity is divided, and the G (G is more than or equal to 1 and less than or equal to G) th group sliding window contains the G-th group original data. And acquiring M first original data on the g group by using the g group sliding window, wherein the number of transmission opportunities of the M first original data is P, and performing network coding on the M first original data to acquire a group of first coded data corresponding to the M first original data on the g group. Then, for the g-th group of sliding window sliding S transmission opportunities, obtaining another group of M other original data on the g-th group, and then performing network coding on the M other original data on the g-th group to obtain a group of other coded data corresponding to the M other original data on the g-th group. The sliding granularity is S transmission opportunities, and the value range of S can be 1-P. Taking P =3,g =3 as an example, the scheme of the present embodiment is schematically illustrated in fig. 6a-6b by adopting the implementation manner of the sliding window.
For example, as shown in fig. 6a, the original data on the transmission opportunity t is divided into G (= 3) groups, which are respectively denoted by t-1, t-2, and t-3, the amount of the original data denoted by t-G may be different for different transmission opportunities t or different packets G, and the number of sliding windows is also three according to the number of packets of the original data, where each group of sliding windows has a size of M first original data, and corresponding to P transmission opportunities, network coding such as RLNC, MDS, or RS is performed on the M first original data on the G-th group of sliding windows to generate first coded data, and the transmission is delayed by 2 transmission opportunities with respect to the last transmission opportunity of the M first original data in the sliding window; or, the first transmission opportunity of the M first original data within the relative sliding window is delayed by 4 transmission opportunities to transmit. And the g-th group sliding window performs network coding on M other original data on the g-th group in the window along with the g-th group of original data sliding for S = P transmission opportunities each time to generate another group of other coded data. Delaying the transmission of 2 transmission opportunities relative to the last transmission opportunity of M other original data in the sliding window; or, delay the transmission of 4 transmission opportunities relative to the first transmission opportunity of M other original data within this sliding window. For different sets of sliding windows, the positions of the window heads or the window tails of two adjacent sets of sliding windows may be staggered by Q transmission opportunities, and in the figure, the staggered position is staggered by Q =1 transmission opportunity. For example, the 1 st sliding window is slid to the transmission opportunity corresponding to 4-1, 5-1, 6-1, and the 2 nd sliding window is slid to the transmission position corresponding to 5-2, 6-2, 7-2. And performing network coding on other original data and/or the first coded data on the transmission opportunity where the first coded data is located to obtain second coded data. The second encoded data is transmitted at the current transmission opportunity, or delayed by Z transmission opportunities, in the figure the second encoded data is transmitted at the current transmission opportunity. In the figure, the first coded data only occupies one transmission opportunity, and if the first coded data occupies two transmission opportunities, the second coded data can be obtained by network coding one or more of other original data on the transmission opportunity on which the first coded data is located, the first coded data, or other coded data on the transmission opportunity on which the first coded data is located.
For another example, in the embodiment in fig. 6b, the embodiment in fig. 6a is different in that for different sets of sliding windows, the positions of the window heads or the window tails of two adjacent sets of sliding windows may be staggered by Q transmission opportunities, in the figure, the staggered positions are staggered by Q =2 transmission opportunities, for example, the sliding window of the 1 st set slides to the transmission opportunities corresponding to 4-1, 5-1, 6-1, and the sliding window of the 2 nd set slides to the transmission positions corresponding to 6-2, 7-2, 8-2.
Fig. 7 is a flowchart illustrating a communication method 700 according to an embodiment of the present application. The method is performed by a receiving device. The receiving device may be a terminal (e.g., an XR terminal), or may be a chip, a system-on-chip, or a processor that supports the terminal to implement the method. The receiving device may be a network device (e.g., a core network device, an access network device, a WiFi router, or a WiFi access point), or may be a chip, a chip system, or a processor that supports the network device to implement the method. The receiving device may be a server (e.g., a cloud server), or may be a chip, a chip system, a processor, or the like, which supports the server to implement the method. As shown in FIG. 7, the method 700 of this embodiment may include portions 710 and 720:
part 710: m 'first original data and N' first encoded data are received, wherein M 'is a positive integer and N' is a positive integer.
In part 710, optionally, the receiving end obtains the related parameters of the first encoded data. The related parameters of the first coded data comprise one or more of parameters such as coding depth M, proportion R of the first coded data, number N or code rate R' of the first coded data, transmission opportunity of the first coded data, grouping information and the like. During the transmission and reception process of the communication system, some data may be discarded due to problems such as burst errors caused by channel quality, and therefore the number of data actually received by the receiving end may be less than the number of data sent by the sending end. In view of this, the embodiment of the present application describes the number of the receiving-end related data with M ', N', etc. in part 710.
In part 710, optionally, the receiving end obtaining the parameter related to the first encoded data means that the receiving end network coding layer obtains the parameter related to the first encoded data. For the acquisition of the relevant parameters of the first encoded data, the acquisition mode may be predefined, or semi-statically configured by the network side device, or self-defined by the receiving end device. Different encoding parameters may be obtained in the same manner or different manners, for example, the encoding depth M is configured semi-statically by the network side device, the ratio or the number of the first encoded data is self-defined by the receiving end device, and the transmission opportunity of the first encoded data is predefined.
And 720 part: decoding the M 'first original data and the N' first coded data to obtain M first original data, wherein the number of transmission opportunities used in the M first original data is P, including a first transmission opportunity, and the transmission opportunities used in the N 'first coded data are delayed by X transmission opportunities compared with the P transmission opportunities used in the M first original data, X is a non-negative integer, P is a positive integer and satisfies that P is greater than or equal to 2, M is a positive integer and satisfies that M' + N '. M and M is greater than or equal to M'.
In a possible implementation manner that the portion 720 decodes the M 'first original data and the N' first encoded data to obtain M first original data, the receiving end network coding layer performs network coding corresponding decoding on the M 'first original data and the N' first encoded data, so as to obtain M first original data corresponding to the M 'first original data and the N' first encoded data. The number or the proportion of the first original data required to be generated for decoding (also called decoding) corresponding to the network coding is obtained according to the relevant parameters of the first coded data. The decoding manner of the first raw data may be one of Maximum Distance Separable (MDS) codes, random Linear Network Coding (RLNC) codes, linear Network Coding (LNC) codes, deterministic linear network coding (deterministic linear Sparse, BATS) codes, block codes, LT (Luby Transform) codes, rateless codes, RS (Reed-solomon) codes, and the like.
In a possible implementation manner of decoding the M 'first original data and the N' first encoded data to obtain M first original data in section 720, the receiving end obtains grouping information, and according to the grouping information, the receiving end can group the original data at each transmission opportunity. The grouping information generally includes a grouping number G, that is, original data on one transmission opportunity is divided into G groups, original data of different groups are obtained, and group numbers 1 to G can be identified for different groups. Since the number of original data to be transmitted in each transmission opportunity may be fixed or may be dynamically changed, the number of original data of the same group number in each transmission opportunity may be equal or may not be equal. Moreover, the number of original data in different packets within the same transmission opportunity may or may not be equal. The above-mentioned M' first original data refer to a group of original data having the same group number. The grouping of the N 'first encoded data is similar to the M' first original data, and refers to a group of encoded data having the same group number. The decoding of the M 'first original data and the N' first encoded data may refer to decoding of the M 'first original data and the N' first encoded data having the same group number.
Optionally, in part 720, the first transmission opportunity is used for other raw data besides the first raw data.
In part 720, optionally, delaying the transmission opportunity for the N' first encoded data by X transmission opportunities from the P transmission opportunities for the M first raw data includes one of:
the transmission opportunity for the N' first encoded data is delayed by at least X transmission opportunities compared with the first transmission opportunity in the P transmission opportunities for the M first original data, and X is more than or equal to P-1;
the transmission opportunity for the N' first encoded data is delayed by at most X transmission opportunities compared with the first transmission opportunity in the P transmission opportunities for the M first original data, and X ≧ P-1 is satisfied;
the transmission opportunity for the N' first encoded data is delayed by at least X transmission opportunities from the last transmission opportunity of the P transmission opportunities for the M first original data; or
The transmission opportunity for the N' first encoded data is delayed by at most X transmission opportunities from the last transmission opportunity of the P transmission opportunities for the M first original data.
Optionally, in part 720, the transmission opportunities for the N' first encoded data are delayed by no more than Y transmission opportunities compared to the P transmission opportunities for the M first original data, Y being a non-negative integer; the method further comprises one of:
the transmission opportunities for the N' first coded data are delayed by at least X transmission opportunities and at most Y transmission opportunities compared with the first transmission opportunity in the P transmission opportunities for the M first original data, and Y is more than or equal to X and more than or equal to P-1;
the transmission opportunity for the N' first coded data is delayed by at least X transmission opportunities compared with the first transmission opportunity in the P transmission opportunities for the M first original data, is delayed by at most Y transmission opportunities compared with the last transmission opportunity in the P transmission opportunities for the M first original data, and satisfies Y ≧ X-P +1 and X ≧ P-1;
the transmission opportunity for the N' first encoded data is delayed by at least X transmission opportunities and at most Y transmission opportunities from the last transmission opportunity of the P transmission opportunities for the M first original data, and Y is greater than or equal to X; or
The transmission opportunity for the N' first encoded data is delayed by at least X transmission opportunities compared to the last transmission opportunity of the P transmission opportunities for the M first original data, and is delayed by at most Y transmission opportunities compared to the first transmission opportunity of the P transmission opportunities for the M first original data, and Y ≧ X + P-1 is satisfied.
Optionally, as shown in fig. 7, the method 700 may further include 730, 740, and 750:
730 part: second encoded data is received.
Similar to the receiving end in the part 710 obtaining the relevant parameters of the first encoded data, the receiving end may further obtain the relevant parameters of the second encoded data, where the relevant parameters of the second encoded data include one or more of the ratio r of the second encoded data, the number n or the code rate r' of the second encoded data, the transmission timing of the second encoded data, and the like. The meaning and the obtaining manner of the parameter corresponding to the second encoded data can refer to the description of the related parameter of the first encoded data, which is not described herein again.
Similar to the decoding manner of the first encoded data in section 710, the decoding manner of the second encoded data includes MDS codes, RLNC codes, LNC codes, BATS codes, and patterns such as determined linear network codes, block codes, LT codes, rateless codes, and RS codes, which are not described herein again.
740, part: the N' first encoded data includes first encoded data a, a third transmission opportunity is used for transmission of the first encoded data a and a third transmission opportunity is also used for transmission of one or more of other encoded data than the first encoded data or other original data than the first original data, the method further comprising:
decoding the received data at the third transmission opportunity to obtain the first encoded data a, the received data at the third transmission opportunity comprising one or more of:
the first encoded data a, the other encoded data, the first original data, the other original data, and the second encoded data.
In part 740, optionally, the transmission opportunity for the second encoded data is delayed by Z 'transmission opportunities from the third transmission opportunity, where Z' is a non-negative integer. In the embodiment of the present application, since the total number V1 of the received data at the third transmission opportunity is greater than the total number transmitted at the first transmission opportunity minus the number of the second encoded data, and the total number transmitted at the first transmission opportunity minus the number of the second encoded data is represented by V2, the random error of any V1-V2 data at the third transmission opportunity can be solved by using the received data, so that the problem of random interference can be overcome. Wherein V1 and V2 are positive integers.
And a part 750: receiving indication information; the indication information is used for indicating one or more of the following items:
sliding window information of the M first original data, the sliding window information indicating identification information of the M first original data corresponding to the N' first encoded data; or
The group numbers corresponding to the M pieces of first original data.
It is understood that the present application does not limit the order of execution of portions 730 and 750. For example, portion 730 may be executed first and then portion 710 may be executed, or portion 710 may be executed first and then portion 730 may be executed. For another example, the part 750 may be executed first and then the part 710 may be executed, or the part 710 may be executed first and then the part 750 may be executed. The present application does not specifically limit the execution order of the sections 730 and 750.
Fig. 8 shows a schematic diagram of the structure of an apparatus. The apparatus 800 may be a network device, a terminal device, a server, or a centralized controller, and may also be a chip, a chip system, or a processor that supports the network device, the terminal device, the server, or the centralized controller to implement the foregoing method. The apparatus may be used for implementing the method described in the method embodiments above, and reference may be made specifically to the description in the method embodiments above.
The apparatus 800 may include one or more processors 801, and the processors 801 may also be referred to as processing units and may implement certain control functions. The processor 801 may be a general purpose processor, a special purpose processor, or the like. For example, a baseband processor or a central processor. The baseband processor may be configured to process communication protocols and communication data, and the central processor may be configured to control a communication device (e.g., a base station, a baseband chip, a terminal chip, a DU or CU, etc.), execute a software program, and process data of the software program.
In an alternative design, the processor 801 may also have instructions and/or data 803, and the instructions and/or data 803 may be executed by the processor to enable the apparatus 800 to perform the method described in the above method embodiment.
In an alternative design, processor 801 may include a transceiver unit to perform receive and transmit functions. The transceiving unit may be, for example, a transceiving circuit, or an interface circuit, or a communication interface. The transceiver circuitry, interface or interface circuitry used to implement the receive and transmit functions may be separate or integrated. The transceiver circuit, the interface circuit or the interface circuit may be used for reading and writing code/data, or the transceiver circuit, the interface circuit or the interface circuit may be used for transmitting or transferring signals.
In yet another possible design, the apparatus 800 may include circuitry that may perform the functions of transmitting or receiving or communicating in the foregoing method embodiments.
Optionally, the apparatus 800 may include one or more memories 802, on which instructions 804 may be stored, the instructions being executable on the processor to cause the apparatus 800 to perform the methods described in the above method embodiments. Optionally, the memory may further store data therein. Optionally, instructions and/or data may also be stored in the processor. The processor and the memory may be provided separately or may be integrated together. For example, the corresponding relationships described in the above method embodiments may be stored in a memory or in a processor.
Optionally, the apparatus 800 may further comprise a transceiver 805 and/or an antenna 806. The processor 801, which may be referred to as a processing unit, controls the apparatus 800. The transceiver 805 may be referred to as a transceiver unit, a transceiver circuit, a transceiver device, a transceiver module, or the like, and is used for implementing a transceiver function.
Optionally, the apparatus 800 in this embodiment of the present application may be used to perform the method described in fig. 4 or fig. 7 in this embodiment of the present application.
The processors and transceivers described herein may be implemented on Integrated Circuits (ICs), analog ICs, radio Frequency Integrated Circuits (RFICs), mixed signal ICs, application Specific Integrated Circuits (ASICs), printed Circuit Boards (PCBs), electronic devices, and the like. The processor and transceiver may also be fabricated using various IC process technologies, such as Complementary Metal Oxide Semiconductor (CMOS), N-type metal oxide semiconductor (NMOS), P-type metal oxide semiconductor (PMOS), bipolar Junction Transistor (BJT), bipolar CMOS (BiCMOS), silicon germanium (SiGe), gallium arsenide (GaAs), and the like.
The apparatus in the description of the above embodiment may be a network device or a terminal device, but the scope of the apparatus described in the present application is not limited thereto, and the structure of the apparatus may not be limited by fig. 8. The apparatus may be a stand-alone device or may be part of a larger device. For example, the apparatus may be:
(1) A stand-alone integrated circuit IC, or chip, or system-on-chip or subsystem;
(2) A set of one or more ICs, which optionally may also include storage means for storing data and/or instructions;
(3) An ASIC, such as a modem (MSM);
(4) A module that may be embedded within other devices;
(5) Receivers, terminals, smart terminals, cellular phones, wireless devices, handsets, mobile units, in-vehicle devices, network devices, cloud devices, artificial intelligence devices, machine devices, home devices, medical devices, industrial devices, and the like;
(6) Others, etc.
Fig. 9 provides a schematic structural diagram of a terminal device. The terminal device may be adapted to the scenario shown in fig. 1. For convenience of explanation, fig. 9 shows only main components of the terminal device. As shown in fig. 9, the terminal apparatus 900 includes a processor, a memory, a control circuit, an antenna, and an input-output device. The processor is mainly used for processing communication protocols and communication data, controlling the whole terminal, executing software programs and processing data of the software programs. The memory is used primarily for storing software programs and data. The radio frequency circuit is mainly used for converting baseband signals and radio frequency signals and processing the radio frequency signals. The antenna is mainly used for receiving and transmitting radio frequency signals in the form of electromagnetic waves. Input and output devices such as touch screens, display screens, keyboards, etc. are used primarily for receiving user input data and for outputting data to and from a user.
When the terminal device is started, the processor can read the software program in the storage unit, analyze and execute the instruction of the software program, and process the data of the software program. When data needs to be sent wirelessly, the processor performs baseband processing on the data to be sent and outputs baseband signals to the radio frequency circuit, and the radio frequency circuit processes the baseband signals to obtain radio frequency signals and sends the radio frequency signals outwards in the form of electromagnetic waves through the antenna. When data is transmitted to the terminal equipment, the radio frequency circuit receives a radio frequency signal through the antenna, the radio frequency signal is further converted into a baseband signal and the baseband signal is output to the processor, and the processor converts the baseband signal into the data and processes the data.
For ease of illustration, fig. 9 shows only one memory and processor. In an actual terminal device, there may be multiple processors and memories. The memory may also be referred to as a storage medium or a storage device, etc., which is not limited by the embodiment of the present invention.
As an alternative implementation manner, the processor may include a baseband processor and a central processing unit, the baseband processor is mainly used for processing the communication protocol and the communication data, and the central processing unit is mainly used for controlling the whole terminal device, executing the software program, and processing the data of the software program. The processor in fig. 9 integrates the functions of the baseband processor and the central processing unit, and those skilled in the art will understand that the baseband processor and the central processing unit may also be independent processors, and are interconnected through a bus or the like. Those skilled in the art will appreciate that the terminal device may include a plurality of baseband processors to accommodate different network formats, a plurality of central processors to enhance its processing capability, and various components of the terminal device may be connected by various buses. The baseband processor can also be expressed as a baseband processing circuit or a baseband processing chip. The central processor can also be expressed as a central processing circuit or a central processing chip. The function of processing the communication protocol and the communication data may be built in the processor, or may be stored in the storage unit in the form of a software program, and the software program is executed by the processor to realize the baseband processing function.
In one example, the antenna and the control circuit with transceiving functions can be regarded as a transceiving unit 911 of the terminal device 900, and the processor with processing functions can be regarded as a processing unit 912 of the terminal device 900. As shown in fig. 9, the terminal apparatus 900 includes a transceiving unit 911 and a processing unit 912. A transceiver unit may also be referred to as a transceiver, a transceiving device, etc. Alternatively, a device used for implementing a receiving function in the transceiving unit 911 may be regarded as a receiving unit, and a device used for implementing a transmitting function in the transceiving unit 911 may be regarded as a transmitting unit, that is, the transceiving unit 911 includes a receiving unit and a transmitting unit. For example, the receiving unit may also be referred to as a receiver, a receiving circuit, etc., and the sending unit may be referred to as a transmitter, a transmitting circuit, etc. Alternatively, the receiving unit and the transmitting unit may be integrated into one unit, or may be multiple units independent of each other. The receiving unit and the transmitting unit can be in one geographical position or can be dispersed in a plurality of geographical positions.
As shown in fig. 10, yet another embodiment of the present application provides an apparatus 1000. The apparatus may be a terminal, a network device, a server, or a centralized controller, or may be a component (e.g., an integrated circuit, a chip, etc.) of a terminal, a network device, a server, or a centralized controller. The apparatus may also be another communication module, which is used to implement the method in the embodiment of the method of the present application. The apparatus 1000 may include a processing module 1002 (or referred to as a processing unit). Optionally, the system may further include an interface module 1001 (or referred to as a transceiver unit or a transceiver module) and a storage module 1003 (or referred to as a storage unit). The interface module 1001 is used to enable communication with other devices. The interface module 1001 may be, for example, a transceiver module or an input-output module.
In one possible design, one or more of the modules in FIG. 10 may be implemented by one or more processors or by one or more processors and memory; or by one or more processors and transceivers; or by one or more processors, memories, and transceivers, which are not limited in this application. The processor, the memory and the transceiver can be arranged independently or integrated.
The apparatus has a function of implementing the terminal described in the embodiment of the present application, for example, the apparatus includes a module or a unit or means (means) corresponding to the terminal performing the terminal related steps described in the embodiment of the present application, and the function or the unit or the means (means) may be implemented by software or hardware, or may be implemented by hardware executing corresponding software, or may be implemented by a combination of software and hardware. Reference may be made in detail to the respective description of the corresponding method embodiments hereinbefore. Or, the apparatus has a function of implementing the network device described in the embodiment of the present application, for example, the apparatus includes a module or a unit or means (means) corresponding to the step of executing the network device described in the embodiment of the present application by the network device, and the function or the unit or the means (means) may be implemented by software or hardware, or may be implemented by hardware executing corresponding software, or may be implemented by a combination of software and hardware. Reference may further be made in detail to the corresponding description in the corresponding method embodiments hereinbefore described.
Optionally, each module in the apparatus 1000 in the embodiment of the present application may be configured to perform the method described in fig. 4 in the embodiment of the present application.
In one possible design, an apparatus 1000 may include: a processing module 1002 and an interface module 1001. The processing module 1002 is configured to encode M first original data to obtain N first encoded data, where M is a positive integer and N is a positive integer. The interface module 1001 is configured to send M first original data and N first encoded data, where the number of transmission opportunities for transmitting the M first original data is P and includes a first transmission opportunity, and the transmission opportunities for transmitting the N first encoded data are delayed by X transmission opportunities compared with the P transmission opportunities for transmitting the M first original data, where X is a non-negative integer, and P is a positive integer and satisfies that P is greater than or equal to 2.
In some possible embodiments of the apparatus 1000 described above, the first transmission opportunity is also used for transmitting other raw data than the first raw data.
In some possible embodiments of the apparatus 1000, the N first encoded data includes first encoded data a, the third transmission opportunity is used to transmit the first encoded data a, and the third transmission opportunity is also used to transmit one or more of other encoded data besides the first encoded data or other original data besides the first original data, and the embodiments further include:
the processing module 1002 is further configured to encode the first encoded data a and one or more of the other encoded data, the first original data and the other original data on the third transmission opportunity to obtain second encoded data.
In some possible embodiments of the apparatus 1000 described above, the third transmission opportunity is also used to transmit the second encoded data.
In some possible embodiments of the apparatus 1000 described above, the transmission opportunity for transmitting the second encoded data is delayed by Z transmission opportunities compared to the third transmission opportunity, Z being a non-negative integer.
In some possible embodiments of the apparatus 1000, the delaying of the transmission opportunity for transmitting the N first encoded data by X transmission opportunities as compared to the P transmission opportunities for transmitting the M first original data includes one of:
the transmission opportunity for transmitting the N first coded data is delayed by at least X transmission opportunities compared with the first transmission opportunity in the P transmission opportunities for transmitting the M first original data, and X is more than or equal to P-1;
the transmission opportunity for transmitting the N first coded data is delayed by at most X transmission opportunities compared with the first transmission opportunity in the P transmission opportunities for transmitting the M first original data, and X is more than or equal to P-1;
the transmission opportunity for transmitting the N first encoded data is delayed by at least X transmission opportunities from a last transmission opportunity of the P transmission opportunities for transmitting the M first original data; or
The transmission opportunity for transmitting the N first encoded data is delayed by at most X transmission opportunities from a last transmission opportunity of the P transmission opportunities for transmitting the M first original data.
In some possible embodiments of the apparatus 1000, in one possible embodiment that the transmission opportunity for transmitting the N first encoded data is delayed by X transmission opportunities compared to the P transmission opportunities for transmitting the M first original data, the embodiment further includes: the transmission opportunity for transmitting the N first encoded data is delayed by no more than Y transmission opportunities compared to P transmission opportunities for transmitting the M first original data, Y being a non-negative integer. The method comprises one of the following:
the transmission opportunity for transmitting the N first coding data is delayed by at least X transmission opportunities and at most Y transmission opportunities compared with the first transmission opportunity in the P transmission opportunities for transmitting the M first original data, and Y is more than or equal to X and more than or equal to P-1;
the transmission opportunity for transmitting the N first coded data is delayed by at least X transmission opportunities compared with the first transmission opportunity in the P transmission opportunities for transmitting the M first original data, is delayed by at most Y transmission opportunities compared with the last transmission opportunity in the P transmission opportunities for transmitting the M first original data, and meets the condition that Y is more than or equal to (X-P + 1) and X is more than or equal to P-1;
the transmission opportunity for transmitting the N first coded data is delayed by at least X transmission opportunities compared with the last transmission opportunity in the P transmission opportunities for transmitting the M first original data, at most Y transmission opportunities are delayed, and Y is larger than or equal to X; or
The transmission opportunity for transmitting the N first encoding data is delayed by at least X transmission opportunities compared with the last transmission opportunity in the P transmission opportunities for transmitting the M first original data, and delayed by at most Y transmission opportunities compared with the first transmission opportunity in the P transmission opportunities for transmitting the M first original data, and Y ≧ X + P-1 is satisfied
In some possible embodiments of the apparatus 1000, the interface module 1001 is further configured to send indication information; the indication information is used for indicating one or more of the following items:
sliding window information of the M first original data, wherein the sliding window information indicates identification information of the M first original data corresponding to the N first coded data; or
And the group numbers corresponding to the M first original data.
In some possible embodiments of the apparatus 1000, the indication information is encapsulated in a packet header of the first encoding data.
Optionally, each module in the apparatus 1000 in the embodiment of the present application may also be configured to perform the method described in fig. 7 in the embodiment of the present application.
In one possible design, an apparatus 1000 may include: a processing module 1002 and an interface module 1001. The interface module 1001 is configured to receive M 'first original data and N' first encoded data, where M 'is a positive integer and N' is a positive integer. The processing module 1002 is configured to decode M ' first original data and N ' first encoded data to obtain M first original data, where the number of transmission opportunities for the M first original data is P, which includes a first transmission opportunity, and the transmission opportunities for the N ' first encoded data are delayed by X transmission opportunities compared with the P transmission opportunities for the M first original data, where X is a non-negative integer, P is a positive integer and satisfies that P ≧ 2, M is a positive integer and satisfies M ^ + N ' ≧ M, and M ≧ M '.
In some possible embodiments of the apparatus 1000 described above, the first transmission opportunity is also used for other raw data than the first raw data.
In some possible embodiments of the apparatus 1000, the interface module 1001 is further configured to receive second encoded data.
In some possible embodiments of the apparatus 1000, the N' first encoded data includes first encoded data a, the third transmission opportunity is used for transmission of the first encoded data a and the third transmission opportunity is also used for transmission of one or more of other encoded data than the first encoded data or other original data than the first original data, and the embodiments further include:
the processing module 1002 is further configured to decode the received data on the third transmission opportunity to obtain the first encoded data a, where the received data on the third transmission opportunity includes one or more of the following:
the first coded data A, other coded data, first original data, other original data and second coded data.
In some possible embodiments of the apparatus 1000, the transmission opportunity for the second encoded data is delayed by Z 'transmission opportunities from the third transmission opportunity, Z' being a non-negative integer.
In some possible embodiments of the apparatus 1000, the delaying of the transmission opportunity for the N' first encoded data by X transmission opportunities as compared to the P transmission opportunities for the M first original data includes one of:
the transmission opportunity for the N' first encoded data is delayed by at least X transmission opportunities compared with a first transmission opportunity of P transmission opportunities for the M first original data, and X ≧ P-1 is satisfied;
the transmission opportunity for the N' first coded data is delayed by at most X transmission opportunities compared with the first transmission opportunity in the P transmission opportunities for the M first original data, and X is more than or equal to P-1;
the transmission opportunity for the N' first encoded data is delayed by at least X transmission opportunities from the last transmission opportunity of the P transmission opportunities for the M first original data; or
The transmission opportunity for the N' first encoded data is delayed by at most X transmission opportunities from the last transmission opportunity of the P transmission opportunities for the M first original data.
In some possible embodiments of the apparatus 1000, the transmission opportunities for the N' first encoded data are delayed by no more than Y transmission opportunities relative to the P transmission opportunities for the M first original data, Y being a non-negative integer; the method further comprises one of:
the transmission opportunities for the N' first coded data are delayed by at least X transmission opportunities and at most Y transmission opportunities compared with the first transmission opportunity in the P transmission opportunities for the M first original data, and Y is more than or equal to X and more than or equal to P-1;
the transmission opportunity for the N' first encoded data is delayed by at least X transmission opportunities compared with the first transmission opportunity in the P transmission opportunities for the M first original data, is delayed by at most Y transmission opportunities compared with the last transmission opportunity in the P transmission opportunities for the M first original data, and satisfies that Y is not less than (X-P + 1) and X is not less than P-1;
the transmission opportunity for the N' first encoded data is delayed by at least X transmission opportunities and at most Y transmission opportunities from the last transmission opportunity of the P transmission opportunities for the M first original data, and Y is greater than or equal to X; or
The transmission opportunity for the N' first encoded data is delayed by at least X transmission opportunities compared to the last transmission opportunity of the P transmission opportunities for the M first original data, and is delayed by at most Y transmission opportunities compared to the first transmission opportunity of the P transmission opportunities for the M first original data, and Y ≧ X + P-1 is satisfied.
In some possible embodiments of the apparatus 1000, the interface module 1001 is further configured to receive indication information; the indication information is used for indicating one or more of the following items:
sliding window information of the M first original data, wherein the sliding window information indicates identification information of the M first original data corresponding to the N' first coded data; or
And the group numbers corresponding to the M first original data.
It is understood that some optional features in the embodiments of the present application may be implemented independently without depending on other features in some scenarios, such as a currently-based solution, to solve corresponding technical problems and achieve corresponding effects, or may be combined with other features according to requirements in some scenarios. Accordingly, the apparatuses provided in the embodiments of the present application may also implement these features or functions, which are not described herein again.
Those skilled in the art will also appreciate that the various illustrative logical blocks and steps (step) set forth in the embodiments of the present application may be implemented in electronic hardware, computer software, or combinations of both. Whether such functionality is implemented as hardware or software depends upon the particular application and design requirements of the overall system. Those skilled in the art can implement the described functions in various ways for corresponding applications, but such implementation decisions should not be interpreted as causing a departure from the scope of the embodiments of the present application.
It is understood that the processor in the embodiment of the present application may be an integrated circuit chip having signal processing capability. In implementation, the steps of the above method embodiments may be performed by integrated logic circuits of hardware in a processor or instructions in the form of software. The processor may be a general purpose processor, a Digital Signal Processor (DSP), an Application Specific Integrated Circuit (ASIC), a Field Programmable Gate Array (FPGA) or other programmable logic device, discrete gate or transistor logic, or discrete hardware components.
The approaches described herein may be implemented in a variety of ways. For example, these techniques may be implemented in hardware, software, or a combination of hardware and software. For a hardware implementation, the processing units used to perform these techniques at the communication device may be implemented in one or more general purpose processors, DSPs, digital signal processing devices, ASICs, programmable logic devices, FPGAs, or other programmable logic devices, discrete gate or transistor logic, discrete hardware components, or any combinations of the above. A general-purpose processor may be a microprocessor, or the processor may be implemented by a combination of computing devices, e.g., a digital signal processor and a microprocessor, a plurality of microprocessors, one or more microprocessors in conjunction with a digital signal processor core, or any other similar configuration.
It will be appreciated that the memory in the embodiments of the subject application can be either volatile memory or nonvolatile memory, or can include both volatile and nonvolatile memory. The non-volatile memory may be a read-only memory (ROM), a Programmable ROM (PROM), an Erasable PROM (EPROM), an electrically Erasable EPROM (EEPROM), or a flash memory. Volatile memory can be Random Access Memory (RAM), which acts as external cache memory. By way of example, and not limitation, many forms of RAM are available, such as Static Random Access Memory (SRAM), dynamic random access memory (dynamic RAM, DRAM), synchronous Dynamic Random Access Memory (SDRAM), double data rate SDRAM (DDR SDRAM), enhanced SDRAM (ESDRAM), synchlink DRAM (SLDRAM), and direct rambus RAM (DR RAM). It should be noted that the memory of the systems and methods described herein is intended to comprise, without being limited to, these and any other suitable types of memory.
The present application also provides a computer-readable medium having stored thereon a computer program which, when executed by a computer, performs the functions of any of the method embodiments described above.
The present application also provides a computer program product which, when executed by a computer, implements the functionality of any of the above-described method embodiments.
The aspects described in the above embodiments may be implemented in whole or in part by software, hardware, firmware, or any combination thereof. When implemented in software, may be implemented in whole or in part in the form of a computer program product. The computer program product includes one or more computer instructions. When loaded and executed on a computer, cause the processes or functions described in accordance with the embodiments of the application to occur, in whole or in part. The computer may be a general purpose computer, a special purpose computer, a network of computers, or other programmable device. The computer instructions may be stored on a computer readable storage medium or transmitted from one computer readable storage medium to another, for example, from one website, computer, server, or data center to another website, computer, server, or data center via wire (e.g., coaxial cable, fiber optics, digital Subscriber Line (DSL)) or wireless (e.g., infrared, wireless, microwave, etc.). The computer-readable storage medium can be any available medium that can be accessed by a computer or a data storage device, such as a server, a data center, etc., that incorporates one or more of the available media. The usable medium may be a magnetic medium (e.g., a floppy disk, a hard disk, a magnetic tape), an optical medium (e.g., a Digital Video Disc (DVD)), or a semiconductor medium (e.g., a Solid State Disk (SSD)), among others.
It should be appreciated that reference throughout this specification to "an embodiment" means that a particular feature, structure or characteristic described in connection with the embodiment is included in at least one embodiment of the present application. Thus, the various embodiments are not necessarily referring to the same embodiment throughout the specification. Furthermore, the particular features, structures, or characteristics may be combined in any suitable manner in one or more embodiments. It should be understood that, in the various embodiments of the present application, the sequence numbers of the above-mentioned processes do not mean the execution sequence, and the execution sequence of each process should be determined by its function and inherent logic, and should not constitute any limitation to the implementation process of the embodiments of the present application.
It is understood that in this application, "when 8230, if" and "if" all refer to the fact that the device performs the corresponding process in an objective situation, and are not intended to be limiting in time, nor do they require certain judgment actions to be taken in the implementation of the device, nor do they imply other limitations.
The term "simultaneously" in this application is to be understood as meaning at the same point in time, within a period of time, within the same period of time, and in particular in conjunction with the context.
Those skilled in the art will understand that: the various numerical designations of first, second, etc. referred to in this application are merely for convenience of description and are not intended to limit the scope of the embodiments of the present application. The specific values, numbers and positions of the numbers (which may also be referred to as indexes) in the present application are only used for illustrative purposes, are not only used in a unique representation form, and are not used to limit the scope of the embodiments of the present application. The first, second, etc. numerical references in this application are also for descriptive convenience only and are not intended to limit the scope of the embodiments of the present application.
Reference in the present application to an element using the singular is intended to mean "one or more" rather than "one and only one" unless specifically stated otherwise. In the present application, unless otherwise specified, "at least one" is intended to mean "one or more" and "a plurality" is intended to mean "two or more".
Additionally, the terms "system" and "network" are often used interchangeably herein. The term "and/or" herein is merely an association relationship describing an associated object, and means that there may be three relationships, for example, a and/or B, which may mean: a exists alone, A and B exist simultaneously, and B exists alone, wherein A can be singular or plural, and B can be singular or plural. The character "/" generally indicates that the former and latter associated objects are in an "or" relationship.
Herein, the term "\8230 \ 8230at least one of \8230; \8230atleast one of;" means all or any combination of the listed items, e.g., "at least one of A, B, and C", may mean: a alone, B alone, C alone, A and B together, B and C together, and six cases of A, B and C together exist, wherein A can be singular or plural, B can be singular or plural, and C can be singular or plural.
It is understood that in the embodiments of the present application, "B corresponding to a" means that B is associated with a, from which B can be determined. It should also be understood that determining B from a does not mean determining B from a alone, but may also be determined from a and/or other information.
Predefinition in this application may be understood as defining, predefining, storing, pre-negotiating, pre-configuring, curing, or pre-firing.
Those of ordinary skill in the art would appreciate that the various illustrative elements and algorithm steps described in connection with the embodiments disclosed herein may be implemented as electronic hardware or combinations of computer software and electronic hardware. Whether such functionality is implemented as hardware or software depends upon the particular application and design constraints imposed on the solution. Skilled artisans may implement the described functionality in varying ways for each particular application, but such implementation decisions should not be interpreted as causing a departure from the scope of the present application.
For convenience and brevity of description, a person skilled in the art may refer to the corresponding processes in the foregoing method embodiments for specific working processes of the system, the apparatus, and the unit described above, which are not described herein again.
It is to be understood that the systems, apparatus and methods described herein may be implemented in other ways. For example, the above-described apparatus embodiments are merely illustrative, and for example, the division of the units is only one type of logical functional division, and other divisions may be realized in practice, for example, multiple units or components may be combined or integrated into another system, or some features may be omitted, or not executed. In addition, the shown or discussed mutual coupling or direct coupling or communication connection may be an indirect coupling or communication connection through some interfaces, devices or units, and may be in an electrical, mechanical or other form.
The units described as separate parts may or may not be physically separate, and parts displayed as units may or may not be physical units, may be located in one place, or may be distributed on a plurality of network units. Some or all of the units can be selected according to actual needs to achieve the purpose of the solution of the embodiment.
In addition, functional units in the embodiments of the present application may be integrated into one processing unit, or each unit may exist alone physically, or two or more units are integrated into one unit.
The functions may be stored in a computer-readable storage medium if they are implemented in the form of software functional units and sold or used as separate products. Based on such understanding, the technical solutions of the present application, in essence or part of the technical solutions contributing to the prior art, may be embodied in the form of a software product, which is stored in a storage medium and includes several instructions for causing a computer device (which may be a personal computer, a server, or a network device, etc.) to execute all or part of the steps of the methods described in the embodiments of the present application. And the aforementioned storage medium includes: various media capable of storing program codes, such as a usb disk, a removable hard disk, a read-only memory (ROM), a Random Access Memory (RAM), a magnetic disk, or an optical disk.
The same or similar parts between the various embodiments in this application may be referenced to each other. In the embodiments, and the implementation methods/implementation methods in the embodiments, if there is no special description or logic conflict in the present application, terms and/or descriptions between different embodiments and between various implementation methods/implementation methods in various embodiments have consistency and may be mutually cited, and technical features in different embodiments and various implementation methods/implementation methods in various embodiments may be combined to form a new embodiment, implementation method, or implementation method according to the inherent logic relationship. The above-described embodiments of the present application do not limit the scope of the present application.
The above description is only for the specific embodiments of the present application, but the scope of the present application is not limited thereto, and any person skilled in the art can easily conceive of the changes or substitutions within the technical scope of the present application, and shall be covered by the scope of the present application.
Claims (23)
1. A method of data transmission, comprising:
encoding M first original data to obtain N first encoded data, wherein M is a positive integer, and N is a positive integer;
and sending the M first original data and the N first coded data, wherein the number of transmission opportunities for transmitting the M first original data is P and includes a first transmission opportunity, and the transmission opportunities for transmitting the N first coded data are delayed by X transmission opportunities compared with the P transmission opportunities for transmitting the M first original data, X is a non-negative integer, P is a positive integer and satisfies that P is more than or equal to 2.
2. The method of claim 1, wherein the first transmission opportunity is further used for transmitting other raw data than the first raw data.
3. A method according to claim 1 or 2, wherein the N first encoded data includes first encoded data a, a third transmission opportunity is used to transmit the first encoded data a and a third transmission opportunity is also used to transmit one or more of other encoded data than the first encoded data or other original data than the first original data, the method further comprising:
and encoding the other encoded data on the third transmission opportunity, one or more of the first original data and the other original data and the first encoded data A to obtain second encoded data.
4. The method of claim 3, wherein the third transmission opportunity is also used for transmitting the second encoded data.
5. The method of claim 3, wherein the transmission opportunity for transmitting the second encoded data is delayed by Z transmission opportunities compared to a third transmission opportunity, Z being a non-negative integer.
6. The method of any of claims 1-5, wherein the transmission opportunity for transmitting the N first encoded data is delayed by X transmission opportunities from P transmission opportunities for transmitting the M first original data comprises one of:
the transmission opportunity for transmitting the N first coded data is delayed by at least X transmission opportunities compared with a first transmission opportunity in P transmission opportunities for transmitting the M first original data, and X is more than or equal to P-1;
the transmission opportunity for transmitting the N first coded data is delayed by at most X transmission opportunities compared with the first transmission opportunity in P transmission opportunities for transmitting the M first original data, and X is more than or equal to P-1;
a transmission opportunity for transmitting the N first encoded data is delayed by at least X transmission opportunities from a last transmission opportunity of the P transmission opportunities for transmitting the M first original data; or
The transmission opportunity for transmitting the N first encoded data is delayed by at most X transmission opportunities from a last transmission opportunity of the P transmission opportunities for transmitting the M first original data.
7. The method of any of claims 1-5, wherein the transmission opportunity for transmitting the N first encoded data is delayed by no more than Y transmission opportunities relative to P transmission opportunities for transmitting the M first original data, Y being a non-negative integer; the method further comprises one of:
the transmission opportunity for transmitting the N first coded data is delayed by at least X transmission opportunities compared with the first transmission opportunity in the P transmission opportunities for transmitting the M first original data, at most Y transmission opportunities are delayed, and Y is more than or equal to X and more than or equal to P-1;
the transmission opportunity used for transmitting the N first coded data is delayed by at least X transmission opportunities compared with the first transmission opportunity in the P transmission opportunities used for transmitting the M first original data, is delayed by at most Y transmission opportunities compared with the last transmission opportunity in the P transmission opportunities used for transmitting the M first original data, and meets the condition that Y is more than or equal to (X-P + 1) and X is more than or equal to P-1;
the transmission opportunity for transmitting the N first coded data is delayed by at least X transmission opportunities compared with the last transmission opportunity in the P transmission opportunities for transmitting the M first original data, at most Y transmission opportunities are delayed, and Y is larger than or equal to X; or
The transmission opportunity for transmitting the N first coded data is delayed by at least X transmission opportunities compared with the last transmission opportunity in the P transmission opportunities for transmitting the M first original data, is delayed by at most Y transmission opportunities compared with the first transmission opportunity in the P transmission opportunities for transmitting the M first original data, and meets the condition that Y is more than or equal to X + P-1.
8. The method of any of claims 1-7, further comprising, transmitting an indication; the indication information is used for indicating one or more of the following items:
sliding window information of the M first original data, the sliding window information indicating identification information of the M first original data corresponding to the N first encoded data; or
And the group numbers corresponding to the M first original data.
9. The method of claim 8, wherein the indication information is encapsulated in a packet header of the first encoded data.
10. A data receiving method, comprising:
receiving M 'first original data and N' first coded data, wherein M 'is a positive integer and N' is a positive integer;
decoding the M 'first original data and the N' first coded data to obtain M first original data, wherein the number of transmission opportunities used in the M first original data is P, including a first transmission opportunity, and the transmission opportunities used in the N 'first coded data are delayed by X transmission opportunities compared with the P transmission opportunities used in the M first original data, X is a non-negative integer, P is a positive integer and satisfies that P is greater than or equal to 2, M is a positive integer and satisfies that M' + N '≧ M, and M is greater than or equal to M'.
11. The method of claim 10, wherein the first transmission opportunity is also for other raw data than the first raw data.
12. The method according to claim 10 or 11, further comprising:
second encoded data is received.
13. The method of claim 12, wherein the N' first encoded data includes first encoded data a, wherein a third transmission opportunity is used for transmission of the first encoded data a and wherein a third transmission opportunity is also used for transmission of one or more of other encoded data than the first encoded data or other original data than the first original data, and wherein the method further comprises:
decoding the received data on the third transmission opportunity to obtain the first encoded data A, the received data on the third transmission opportunity comprising one or more of:
the first encoded data a, the other encoded data, the first original data, the other original data, and the second encoded data.
14. The method of claim 13, wherein the transmission opportunity for the second encoded data is delayed from the third transmission opportunity by Z 'transmission opportunities, wherein Z' is a non-negative integer.
15. The method of any of claims 10-14, wherein delaying the transmission opportunity for the N' first encoded data by X transmission opportunities over P transmission opportunities for the M first original data comprises one of:
the transmission opportunities for the N' first encoded data are delayed by at least X transmission opportunities compared with a first transmission opportunity of P transmission opportunities for the M first original data, and X ≧ P-1 is satisfied;
the transmission opportunities for the N' first encoded data are delayed by at most X transmission opportunities compared to a first transmission opportunity of the P transmission opportunities for the M first original data, and X ≧ P-1 is satisfied;
the transmission opportunity for the N' first encoded data is delayed by at least X transmission opportunities from a last transmission opportunity of the P transmission opportunities for the M first original data; or
The transmission opportunity for the N' first encoded data is delayed by at most X transmission opportunities from a last transmission opportunity of the P transmission opportunities for the M first original data.
16. The method of any of claims 10-14, wherein the transmission opportunities for the N' first encoded data are delayed by no more than Y transmission opportunities than P transmission opportunities for the M first original data, Y being a non-negative integer; the method further comprises one of:
the transmission opportunities for the N' first coded data are delayed by at least X transmission opportunities and at most Y transmission opportunities compared with the first transmission opportunity in the P transmission opportunities for the M first original data, and Y is more than or equal to X and more than or equal to P-1;
the transmission opportunities for the N' first encoded data are delayed by at least X transmission opportunities as compared to a first transmission opportunity of the P transmission opportunities for the M first original data, and by at most Y transmission opportunities as compared to a last transmission opportunity of the P transmission opportunities for the M first original data, and Y ≧ (X-P + 1) and X ≧ P-1 are satisfied;
the transmission opportunities for the N' first encoded data are delayed by at least X transmission opportunities compared with the last transmission opportunity in the P transmission opportunities for the M first original data, at most Y transmission opportunities are delayed, and Y is larger than or equal to X; or
The transmission opportunities for the N' first encoded data are delayed by at least X transmission opportunities as compared to a last transmission opportunity of the P transmission opportunities for the M first original data, and by at most Y transmission opportunities as compared to a first transmission opportunity of the P transmission opportunities for the M first original data, and Y ≧ X + P-1 is satisfied.
17. The method of any of claims 10-16, further comprising, receiving indication information; the indication information is used for indicating one or more of the following items:
sliding window information of the M first original data, the sliding window information indicating identification information of the M first original data corresponding to the N' first encoded data; or
And the group numbers corresponding to the M first original data.
18. A communications apparatus, comprising: a processing module and an interface module;
the processing module is used for encoding M first original data to obtain N first encoded data, wherein M is a positive integer, and N is a positive integer;
the interface module is configured to send the M first original data and the N first encoded data, where the number of transmission opportunities for transmitting the M first original data is P and includes a first transmission opportunity, and the transmission opportunities for transmitting the N first encoded data are delayed by X transmission opportunities compared with the P transmission opportunities for transmitting the M first original data, X is a non-negative integer, and P is a positive integer and satisfies that P is greater than or equal to 2.
19. A communications apparatus, comprising: a processing module and an interface module;
the interface module is used for receiving M 'first original data and N' first coded data, wherein M 'is a positive integer, and N' is a positive integer;
the processing module is configured to decode the M 'pieces of first original data and the N' pieces of first encoded data to obtain M pieces of first original data, where the number of transmission opportunities used in the M pieces of first original data is P, including a first transmission opportunity, and the transmission opportunities used in the N 'pieces of first encoded data delay X transmission opportunities compared to the P transmission opportunities used in the M pieces of first original data, X is a non-negative integer, P is a positive integer and satisfies that P is greater than or equal to 2, M is a positive integer and satisfies that M' + N '≧ M, and M is greater than or equal to M'.
20. A communications apparatus, comprising: a processor coupled with a memory, the memory to store a program or instructions that, when executed by the processor, cause the apparatus to perform the method of any of claims 1 to 9, or claims 10 to 17.
21. A computer readable storage medium having stored thereon a computer program or instructions, which when executed, cause a computer to perform the method of any of claims 1 to 9, or claims 10 to 17.
22. A computer program product comprising instructions which, when run on a computer, cause the computer to perform the method of any one of claims 1 to 9, or claims 10 to 17.
23. A communication system comprising an apparatus as claimed in claim 18 and an apparatus as claimed in claim 19.
Priority Applications (2)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202110484588.2A CN115278769A (en) | 2021-04-30 | 2021-04-30 | Data transmission method, device and system and readable storage medium |
| PCT/CN2022/090140 WO2022228542A1 (en) | 2021-04-30 | 2022-04-29 | Data transmission method, apparatus, and system, and readable storage medium |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202110484588.2A CN115278769A (en) | 2021-04-30 | 2021-04-30 | Data transmission method, device and system and readable storage medium |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN115278769A true CN115278769A (en) | 2022-11-01 |
Family
ID=83745050
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202110484588.2A Pending CN115278769A (en) | 2021-04-30 | 2021-04-30 | Data transmission method, device and system and readable storage medium |
Country Status (2)
| Country | Link |
|---|---|
| CN (1) | CN115278769A (en) |
| WO (1) | WO2022228542A1 (en) |
Family Cites Families (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| JP4356742B2 (en) * | 2006-12-25 | 2009-11-04 | ソニー株式会社 | Data communication system, data transmission apparatus, and data transmission method |
| WO2011000176A1 (en) * | 2009-07-01 | 2011-01-06 | 慧帝科技(深圳)有限公司 | Coding and decoding method and codec of error correction code |
| CN104753627A (en) * | 2013-12-26 | 2015-07-01 | 中兴通讯股份有限公司 | Multipath transmission method, multipath transmission system, data transmission device and data receiving device |
| CN110768748B (en) * | 2018-07-27 | 2022-05-17 | 瑞昱半导体股份有限公司 | Convolutional code decoder and convolutional code decoding method |
-
2021
- 2021-04-30 CN CN202110484588.2A patent/CN115278769A/en active Pending
-
2022
- 2022-04-29 WO PCT/CN2022/090140 patent/WO2022228542A1/en active Application Filing
Also Published As
| Publication number | Publication date |
|---|---|
| WO2022228542A1 (en) | 2022-11-03 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN109392152B (en) | Communication method and communication device | |
| US10498484B2 (en) | Method and apparatus for allowing different services to coexist in wireless cellular communication system | |
| US20180048421A1 (en) | Apparatus and method for decoding data in mobile communication system | |
| WO2021027518A1 (en) | Data processing method and communication apparatus | |
| EP4161138A1 (en) | Coding method and device | |
| US20220416934A1 (en) | Data processing method and apparatus | |
| WO2022258071A1 (en) | Communication method, apparatus, and readable storage medium | |
| CN115699639A (en) | Radio link control layer feedback reporting for rateless codes | |
| CN115004828A (en) | Communication method and communication device | |
| WO2022137659A1 (en) | Terminal and communication method | |
| CN113271179A (en) | Feedback method and device for hybrid automatic repeat request acknowledgement codebook | |
| CN115347992A (en) | Communication method and device | |
| EP3410619B1 (en) | Device, method and program | |
| EP3952161A1 (en) | Transport block size driven cqi feedback scheme | |
| CN115278769A (en) | Data transmission method, device and system and readable storage medium | |
| US20180034592A1 (en) | Systems and methods for robust data retransmission | |
| CN111726195B (en) | Data transmission method and communication device | |
| CN111726864B (en) | Communication method and device | |
| KR102472160B1 (en) | Method and apparatus for data transmission in wirelss cellular communication system | |
| WO2022011715A1 (en) | Data transmission method and apparatus | |
| CN116418452A (en) | Communication method and device | |
| WO2018160117A1 (en) | Method and radio units for providing and receiving data in a control message | |
| US20240364464A1 (en) | Communication method and apparatus | |
| US20240267923A1 (en) | Partial uplink transmission for multiple uplink transport blocks | |
| CN112423313B (en) | Method and device for determining size of transmission block |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination |