Nothing Special   »   [go: up one dir, main page]

CN115336210A - Method and system for codeword transmission - Google Patents

Method and system for codeword transmission Download PDF

Info

Publication number
CN115336210A
CN115336210A CN202080099104.6A CN202080099104A CN115336210A CN 115336210 A CN115336210 A CN 115336210A CN 202080099104 A CN202080099104 A CN 202080099104A CN 115336210 A CN115336210 A CN 115336210A
Authority
CN
China
Prior art keywords
codewords
codeword
subset
acknowledgement message
data
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
Application number
CN202080099104.6A
Other languages
Chinese (zh)
Inventor
亚龙·本-阿里
希米·西隆
埃泽尔·梅尔泽
林伟
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Huawei Technologies Co Ltd
Original Assignee
Huawei Technologies Co Ltd
Priority date (The priority date 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 date listed.)
Filing date
Publication date
Application filed by Huawei Technologies Co Ltd filed Critical Huawei Technologies Co Ltd
Publication of CN115336210A publication Critical patent/CN115336210A/en
Pending legal-status Critical Current

Links

Images

Classifications

    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L1/00Arrangements for detecting or preventing errors in the information received
    • H04L1/12Arrangements for detecting or preventing errors in the information received by using return channel
    • H04L1/16Arrangements for detecting or preventing errors in the information received by using return channel in which the return channel carries supervisory signals, e.g. repetition request signals
    • H04L1/1607Details of the supervisory signal
    • H04L1/1614Details of the supervisory signal using bitmaps
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L1/00Arrangements for detecting or preventing errors in the information received
    • H04L1/12Arrangements for detecting or preventing errors in the information received by using return channel
    • H04L1/16Arrangements for detecting or preventing errors in the information received by using return channel in which the return channel carries supervisory signals, e.g. repetition request signals
    • H04L1/1607Details of the supervisory signal
    • H04L1/1628List acknowledgements, i.e. the acknowledgement message consisting of a list of identifiers, e.g. of sequence numbers

Landscapes

  • Engineering & Computer Science (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Signal Processing (AREA)
  • Detection And Prevention Of Errors In Transmission (AREA)

Abstract

A method for transmitting data between a sender and a receiver is described. The method comprises the following steps: receiving a data payload comprising a plurality of codewords that encode data in non-overlapping data portions corresponding to information bits of the data payload; decoding the plurality of codewords; generating an acknowledgement message comprising an indication of a correctly decoded subset of codewords; transmitting the acknowledgement message to obtain a codeword retransmission corresponding to an erroneously decoded codeword; receiving one or more codewords in response to the acknowledgement message, the one or more codewords encoding data in at least a portion of the non-overlapping data portions. The acknowledgement message is generated based on an identification of the codeword in the subset and an identification of a codeword in a corresponding subset of correctly decoded non-overlapping data portions having information bits encoded in the codeword in the subset.

Description

Method and system for codeword transmission
Technical Field
The present disclosure relates to a system and method for digital communication, and more particularly, to a method and system for transmitting codewords between a transmitter and a receiver.
Background
In an IEEE802.11 wireless network, a station may be an Access Point (AP) or a non-AP Station (STA), and transmits data to another station. The data payload transmitted between stations includes one or more Media Access Control (MAC) protocol data units (MPDUs). In the case where multiple MPDUs are transmitted in one transmission, the MPDUs may be aggregated into an MPDU aggregate (a-MPDU).
Once the data payload comprising the MPDU (or a-MPDU) is large enough, it is encoded into one or more independently decodable codewords. One or more of the codewords are then modulated and subsequently transmitted over a channel to a receiver. The receiver attempts to decode one or more codewords carried by the received signal, reconstructs the MPDU (or a-MPDU) data, and provides an indicator to the transmitter indicating which MPDUs failed decoding and need retransmission. The indicator may be transmitted through an Acknowledgement (ACK) or Block acknowledgement (Block-ACK) feedback message.
Disclosure of Invention
An object of the present invention is to provide a method for transmitting a codeword between a transmitter and a receiver.
The above and other objects are achieved by the features of the independent claims. Other implementations are apparent from the dependent claims, the description and the drawings.
According to an aspect, a method for transmitting data between a transmitter and a receiver is provided. The method comprises the following steps: receiving a data payload comprising a plurality of codewords that encode data in non-overlapping data portions corresponding to information bits of the data payload; decoding the plurality of codewords; generating an acknowledgement message comprising an indication of a correctly decoded subset of codewords; transmitting the acknowledgement message to obtain a codeword retransmission corresponding to an erroneously decoded codeword; receiving one or more codewords in response to the acknowledgement message, the one or more codewords encoding data in at least a portion of the non-overlapping data portions. The acknowledgement message is generated based on an identification of the codeword in the subset and an identification of a codeword in a corresponding subset of correctly decoded non-overlapping data portions having information bits encoded in the codeword in the subset.
The method of the first aspect provides for efficient retransmission of data of non-overlapping data portions by retransmitting codewords that fail decoding. This reduces overhead compared to retransmitting failed non-overlapping data portions.
According to another aspect, a method for transmitting data between a sender and a receiver is provided. The method comprises the following steps: transmitting a data payload comprising a plurality of codewords that encode data in non-overlapping data portions corresponding to information bits of the data payload; receiving an acknowledgement message comprising an indication of a correctly decoded subset of codewords; generating one or more codewords based on the acknowledgement message, the one or more codewords encoding data in at least a portion of the non-overlapping data portions; transmitting the one or more codewords to the receiver. The acknowledgement message is generated based on an identification of the codeword in the subset and an identification of a codeword in a corresponding subset of correctly decoded non-overlapping data portions having information bits encoded in the codeword in the subset.
According to another aspect, an apparatus is provided. The apparatus comprises: a non-transitory memory including instructions; one or more processors in communication with the memory, wherein the one or more processors execute the instructions to: receiving a data payload comprising a plurality of codewords that encode data in non-overlapping data portions corresponding to information bits of the data payload; decoding the plurality of codewords; generating an acknowledgement message comprising an indication of a correctly decoded subset of codewords; transmitting the acknowledgement message to obtain a codeword retransmission corresponding to an erroneously decoded codeword; receiving one or more codewords in response to the acknowledgement message, the one or more codewords encoding data in at least a portion of the non-overlapping data portions. The acknowledgement message is generated based on an identification of the codeword in the subset and an identification of a codeword in a corresponding subset of correctly decoded non-overlapping data portions having information bits encoded in the codeword in the subset.
According to another aspect, an apparatus is provided. The apparatus comprises: a non-transitory memory including instructions; one or more processors in communication with the memory, wherein the one or more processors execute the instructions to: transmitting a data payload comprising a plurality of codewords that encode data in non-overlapping data portions corresponding to information bits of the data payload; receiving an acknowledgement message comprising an indication of a correctly decoded subset of codewords; generating one or more codewords based on the acknowledgement message, the one or more codewords encoding data in at least a portion of the non-overlapping data portions; transmitting the one or more codewords; the acknowledgement message is generated based on an identification of the codeword in the subset and an identification of a codeword in a corresponding subset of correctly decoded non-overlapping data portions having information bits encoded in the codeword in the subset.
In one implementation, the acknowledgement message includes an indication of the corresponding subset of correctly decoded non-overlapping data portions. The acknowledgement message according to this implementation enables to efficiently identify erroneously decoded non-overlapping data portions based on the acknowledgement message.
In one implementation, the acknowledgement message includes a bitmap including bits of each codeword of the subset. The acknowledgement message according to this implementation enables efficient acknowledgement of correctly decoded codewords and reduces overhead associated with retransmitting codewords of non-overlapping data portions compared to retransmitting the entire failed non-overlapping data portion.
In one implementation, the bitmap does not include bits of each codeword in the corresponding subset of correctly decoded non-overlapping data portions. The acknowledgement message according to this implementation further reduces the overhead associated with retransmission of the codeword.
In one implementation, the acknowledgement message includes a number representing an index of each codeword in the subset. The acknowledgement message according to this implementation of the method reduces the overhead associated with retransmission of the codeword by shortening the acknowledgement message.
In one implementation, the index does not include codewords for the corresponding subset of correctly decoded non-overlapping data portions. The acknowledgement message according to this implementation further reduces the overhead associated with retransmission of the codeword.
In one implementation, the acknowledgement message includes a number representing an increment of an index of each codeword in the subset.
The acknowledgement message according to this implementation reduces overhead associated with retransmission of the codeword by shortening the acknowledgement message.
In one implementation, the increment does not include codewords for the corresponding subset of correctly decoded non-overlapping data portions. The acknowledgement message according to this implementation further reduces the overhead associated with retransmission of the codeword.
In one implementation, the method includes: determining a maximum bit length for representing an increment of the index; for each codeword in the subset, the increment of the index of the codeword is represented using a number having a bit length of at most the maximum bit length. This will generate a shorter acknowledgement message and enable dynamic computation.
In one implementation, the acknowledgement message further includes a length indicator indicating a length of the acknowledgement message.
In one implementation, the acknowledgement message includes an indication of the erroneously decoded codeword. Providing an indication of a incorrectly decoded codeword results in a shorter acknowledgement message in the event that the number of incorrect codewords is less than the number of correctly decoded codewords.
In one implementation, the acknowledgement message includes bits indicating an indication of whether the indication of the codeword in the acknowledgement message corresponds to an indication of a correctly or incorrectly decoded codeword.
In one implementation, the acknowledgment message is a Codeword Block Acknowledgment (CBACK) message.
In one implementation, the codewords of the plurality of codewords are encoded using a Binary Convolutional Coding (BCC) code or a Low Density Parity Check (LDPC) code.
These and other aspects of the invention are apparent from and will be elucidated with reference to one or more embodiments described hereinafter.
Drawings
For a more complete understanding of the present disclosure and the advantages thereof, reference is now made to the following descriptions taken in conjunction with the accompanying drawings, in which:
fig. 1 shows an example provided communication system consisting of a Basic Service Set (BSS);
fig. 2 illustrates a diagram of an exemplary a-MPDU and a plurality of codewords produced thereby;
fig. 3 illustrates an example a-MPDU provided to highlight erroneously decoded codewords;
fig. 4 to 8 show example provided Codeword Blocks ACK (CBACK);
FIG. 9 shows an example of a message and A-MPDU transmitted from a transmitter provided by one example;
FIG. 10 shows a flow diagram of a method for receiving data provided by an example;
FIG. 11 shows a flow diagram of a method for transmitting data provided by an example;
FIG. 12 illustrates an exemplary communication system provided by the exemplary embodiments described herein;
13A and 13B illustrate an exemplary device in which methods and teachings according to the present disclosure may be implemented;
FIG. 14 is a block diagram of a computing system that may be used to implement the apparatus and methods disclosed herein.
Detailed Description
The following description of the exemplary embodiments is provided in sufficient detail to enable those of ordinary skill in the art to make and use the systems and processes described herein. It is important to understand that embodiments may be provided in many alternative forms and should not be construed as limited to the examples set forth herein.
Accordingly, while the embodiments may be modified in various ways and take on various alternative forms, specific embodiments thereof are shown in the drawings and will be described below in detail by way of example. It is not intended to be limited to the particular forms disclosed. On the contrary, the intention is to cover all modifications, equivalents, and alternatives falling within the scope of the appended claims. Elements of the exemplary embodiments are consistently indicated by the same reference numerals throughout the drawings and the appropriate detailed description.
The terminology used herein to describe the embodiments is not intended to be limiting in scope. The articles "a/an" and "the" are singular, since they have only one of the referenced item, but the use of the singular in this document should not exclude the presence of a plurality of the referenced items. In other words, an element referred to in the singular can be one or more in number, unless the context clearly dictates otherwise. It will be further understood that the terms "comprises" and/or "comprising," when used herein, specify the presence of stated features, items, steps, operations, elements, and/or components, but do not preclude the presence or addition of one or more other features, items, steps, operations, elements, components, and/or groups thereof.
Unless otherwise defined, all terms (including technical and scientific terms) used herein are to be interpreted as having a customary usage in the art. It will be further understood that terms of common usage, unless otherwise explicitly defined herein, should also be interpreted as having a customary meaning in the relevant art and should not be interpreted in an idealized or overly formal sense unless expressly so defined herein.
Fig. 1 shows an exemplary communication system 100 comprised of an infrastructure BSS. Communication system 100 includes an Access Point (AP) 105, the AP105 serving a plurality of Stations (STAs) 110, 112, 114, 116, and 118. The AP105 controls aspects of communication with or between its associated stations, such as radio frequency channels, transmission power limitations, authentication, and security. In some cases, in the communication system 100, the transmitter may access wireless resources for uplink transmission (i.e., link from STA to AP) and downlink transmission (i.e., link from AP to STA) based on a distributed contention mechanism commonly referred to as carrier sensing multiple access with collision avoidance (CSMA/CA). In some examples, an AP is referred to as a Node B, an evolved Node B (eNB), a Next Generation (NG) Node B (next generation Node B, gNB), a master eNB (MeNB), a secondary eNB (secondary eNB, seNB), a master gNB (MgNB), a secondary gNB (SgNB), a network controller, a control Node, a base station, an access Node, a Transmission Point (TP), a transmission-reception point (TRP), a cell, a carrier, a macro cell, a femto cell, a pico cell, etc., and an STA may also be generally referred to as a User Equipment (UE), a mobile station, a handset, a terminal, a user, a subscriber, a station, etc. The AP may provide wireless access according to one or more wireless communication protocols, such as Wi-Fi 802.11a/b/G/n/ac/ad/ax/ay/be, third generation partnership project (3 GPP) Long Term Evolution (LTE), LTE advanced (LTE-a), 5G LTE, 5G NR, high Speed Packet Access (HSPA), and so forth. For simplicity, only one AP105 and five stations 110-118 are shown in fig. 1, although it is understood that the communication system may use multiple APs capable of communicating with multiple stations.
In examples described herein, a data payload transmitted from a transmitter to a receiver includes one or more Media Access Control (MAC) protocol data units (MPDUs). An MPDU is an information unit transmitted between two MAC layer entities (e.g., at a transmitting device and a receiving device). If multiple MPDUs are transmitted, the MPDUs are aggregated into an aggregated MPDU (A-MPDU). The receiver attempts to decode the received data and provides an indication of one or more MPDUs that were successfully decoded. The indicator may be sent through an Acknowledgement (ACK) or Block acknowledgement (Block-ACK) feedback message.
In IEEE802.11, data payloads are encoded in a Physical (PHY) layer to provide efficient transmission, error detection capability, error correction capability, or a combination thereof. In IEEE802.11 compliant wireless networks, the data payload may be encoded using Binary Convolutional Coding (BCC) or Low Density Parity Check (LDPC) coding. In the case of BCC coding, the entire information bit stream is fed in sequence to a generator that generates the coded bits. Each successive subset of coded bits is a function of the information bits currently residing in the buffer of the generator, which are typically 6 bits in size. In the case of LDPC coding, several codeword sizes are defined. The information bits are divided into separate, non-overlapping portions. These parts are separately encoded. To align with the predefined LDPC codeword size, the information bits may be padded with so-called shortened bit, forward Error Correction (FEC) pre-padding, or may be fully or partially repeated. The number of shortening, repeating, puncturing, or FEC preamble bits depends on the a-MPDU size, as well as the overall transmission parameters (e.g., overall duration, bandwidth, modulation, etc.).
An MPDU (or a-MPDU) encoded using LDPC may comprise a plurality of codewords, where each codeword may span multiple MPDUs or portions thereof. In contrast, when BCC coding is used, the entire data payload is BCC coded in turn, resulting in essentially a single codeword. In BCC or LDPC, different codewords and corresponding portions of MPDUs are processed independently by an encoder at the transmitter side and a decoder at the receiver side. This independence between codewords or corresponding MPDU portions enables individual codewords to be encoded or decoded individually without requiring bits from other codewords.
The data payload may be divided or partitioned into several parts of predefined length, wherein each part is BCC or LDPC coded separately (but all parts of the data payload use the same coding scheme). There is no overlap between portions of the data payload in terms of encoding. In particular, codewords generated from various portions of the data payload may be generated independently of one another. Examples of portions may include a plurality of data bits used to generate individual codewords or groups of a small number of codewords (e.g., 2, 3, or 4).
In IEEE802.11, when a single bit of an LDPC encoded codeword of an MPDU fails, the corresponding entire MPDU is considered to have failed. Similarly, when a single bit of the BCC encoded portion of an MPDU fails, the entire MPDU fails. The Block acknowledgement (Block-Ack or BACK) mechanism implemented in the IEEE802.11 standard requires the receiver to send an indicator to the transmitter indicating that the MPDU was successfully decoded. This indicator, which may be generally referred to as an acknowledgement, may indicate a decoding success (positive Ack) or failure (negative Ack or Nack). The transmitter in turn retransmits the entire failed MPDU regardless of the number of failed decoding bits in the MPDU. Retransmission of an entire MPDU can create a significant error recovery overhead because, as with many MPDUs failing, only a small number of codewords or portions of the MPDU actually fail.
Generally, in IEEE802.11, the codeword to MPDU correspondence is opaque to the MAC layer of the receiving device before each codeword of the MPDU is confirmed to have been correctly decoded. In particular, when a codeword is decoded in error, the MAC layer cannot identify which MPDUs are decoded in error, or indeed how many MPDUs are decoded in error, since the boundaries of the MPDUs are unknown to the receiver. Conversely, when an MPDU is identified as correctly decoded, the MAC layer determines that all codewords of the MPDU must have been correctly decoded. In the examples described herein, this information is used in the acknowledgement message to reduce the length of the message. In addition, the PHY layer at the receiver may use parity to ensure that the codeword has been correctly decoded.
Fig. 2 illustrates a diagram 200 of an exemplary a-MPDU 205 and the resulting multiple codewords. As shown in fig. 2, the a-MPDU 205 includes four MPDUs 207, 208, 209, 210. The a-MPDU 205 may also include padding bits appended to the end of the MPDU 210 (not shown in fig. 2). The a-MPDU 205 is fed into an encoder which encodes the bits to produce a plurality of codewords 220. In fig. 2, the first three codewords of the plurality of codewords 220 encode information bits of the MPDU 207. A third codeword of the plurality of codewords 220 also encodes bits of the MPDU 208. The next three codewords also encode the bits of MPDU 208. The sixth codeword also encodes the bits of MPDU 209 along with the next two codewords. The eighth codeword together with the last six codewords encodes the bits of the MPDU 210. Typically, as shown in fig. 2, the MPDU boundaries do not exactly correspond to the codeword boundaries. In other words, the MPDU is not encoded using an integer number of codewords. However, in the rest of the description, the MPDU is shown as being encoded using an integer number of codewords. This should not be construed as limiting the scope of the present disclosure in any way, and the examples described herein are equally applicable to MPDUs encoded using non-integer numbers of codewords, and in particular, where the boundaries of the MPDUs do not coincide with the boundaries of the codewords.
In fig. 2, an illustrative example of a codeword 230 is shown. The codeword 230 includes a plurality of information bits 240 and a plurality of parity bits 250 for error detection. As an illustrative example, for an LDPC encoder implementing a code at a coding rate of 1/2 (where k data bits are coded into n =2k coded bits), each LDPC codeword may be 1820 or 1822. The codeword 230 may include 910 information bits and 910 parity bits. Other codewords may have different numbers of information bits or parity bits.
As previously described, a single LDPC codeword (or similarly, a single BCC portion) fails if a single bit of an MPDU fails. However, using a Block Acknowledgement (BACK) mechanism implemented in the existing IEEE802.11 technical standard, the receiver transmits an acknowledgement indicator to the transmitter according to the successfully decoded MPDU. The transmitter retransmits the entire failed MPDU. For example, if a single bit of a first codeword of the multiple codewords 220 shown in fig. 2 fails, but the remaining codewords are successfully decoded, the receiver will send an acknowledgement indicator to the transmitter indicating that the MPDU 208, 209, 210 is successfully decoded. The transmitter will respond by retransmitting MPDU 207.
As described herein, a single codeword of a failed MPDU is transmitted instead of transmitting the entire failed MPDU. Retransmitting portions of the MPDU data reduces error recovery overhead. The receiving device indicates the particular codeword that was decoded correctly, and the transmitting device retransmits the erroneously decoded codeword or portion based on the indicated correctly decoded codeword.
Fig. 3 is a diagram 300 illustrating an a-MPDU 305 similar to the a-MPDU 205 illustrated in fig. 2. In fig. 3, the first coded MPDU 307 includes three codewords 321, 322, 323, while the second coded MPDU 308 includes three codewords 331, 332, 333, the third coded MPDU 309 includes three codewords 341, 342, 343, and the fourth coded MPDU 310 includes seven codewords 351, 352, 353, 354, 355, 356, 357. Although a-MPDU 305 is shown in fig. 3 to consist of four MPDUs, the a-MPDU may have any number of MPDUs. Further, as shown in fig. 3, the MPDUs of the a-MPDU may each have the same or different number of codewords. Further, in fig. 3, each MPDU of the a-MPDU 305 is encoded using an integer number of codewords. However, as previously explained with respect to the a-MPDU 205 shown in fig. 2, this is not the case in general. The example of a-MPDU 305 shown in fig. 3 should not be construed as limiting the scope of the example embodiments.
The a-MPDU 305 received by the receiving device comprises a combination of correctly decoded codewords and incorrectly decoded codewords. For example, the codeword indicated by X in fig. 3 cannot be correctly decoded. That is, the second codeword 322 of the first MPDU 307 is decoded in error, the first codeword 331 and the second codeword 332 of the second MPDU 308 are decoded in error, and the first codeword 351 and the final codeword 357 of the fourth MPDU 310 are decoded in error. All three codewords 341, 342, 343 of the third MPDU 309 are successfully decoded by the receiving device.
If the existing BACK mechanism is used, the receiving device will send an acknowledgement indicator to the transmitting device indicating that only the third MPDU 309 was decoded correctly. In response, the transmitting device will transmit new codewords for the first MPDU 307, the second MPDU 308 and the fourth MPDU 310. However, not every codeword of an MPDU 307, 308, 310 is decoded in error. Two of the three codewords of the first MPDU 307 are successfully decoded and five of the seven codewords of the fourth MPDU 310 are successfully decoded. Therefore, simply retransmitting the MPDU will unnecessarily generate a recovery overhead.
In exemplary embodiments of the methods and systems described herein, a transmitting device is used to transmit a data payload comprising a plurality of codewords. The codeword encodes data in a non-overlapping data portion corresponding to information bits of a data payload. In one embodiment, after receiving a transmission, a receiving device (i.e., the intended receiver of the transmission) decodes the codeword and sends an acknowledgement message that includes an indication of the correctly decoded subset of codewords. The acknowledgement is transmitted by the receiver to obtain a retransmission of the codeword corresponding to the erroneously decoded codeword. The acknowledgement message is generated based on an identification of the codeword in the subset and an identification of a codeword in a corresponding subset of correctly decoded non-overlapping data portions having information bits encoded in the codeword in the subset.
In one embodiment, the receiving device responds to transmissions from the transmitting device with a codeword Block-ACK (CBACK) message. The CBACK message is transmitted to the sending device. As an example, the CBACK message may be a bitmap of a codeword or portion decoded correctly in a transmission, with a first bit value indicating that the associated codeword was decoded correctly and a second bit value indicating that the codeword decoding failed. The position of the bit in the bitmap may correspond to the position of the codeword in the last transmission.
Fig. 4 is a diagram 400 of a first example of an a-MPDU 305 and a codeword block acknowledgement message (CBACK) 410 provided by an embodiment of the present invention. CBACK410 includes a bitmap 415 in which each bit is associated with a codeword of a data payload (e.g., an a-MPDU). In the present exemplary embodiment, bitmap 415 is an acknowledgement message. If a particular bit is set to a first value (e.g., 1), this indicates that the associated codeword was successfully decoded. If a particular bit is set to a second value (e.g., 0), the associated codeword is decoded in error. The values of the bits may be reversed without affecting the scope or spirit of the exemplary embodiments. CBACK410 also includes CBACK mode field 420. The value stored in CBACK mode field 420 indicates the format of the information stored in the acknowledgement message. For example, if CBACK mode field 420 includes a 1, the acknowledgement message is in the form of a bitmap (e.g., bitmap 415). CBACK410 may also include a length field 425. The length field 425 includes a value corresponding to the length of the bitmap 415. In other words, length field 425 specifies the number of codewords acknowledged in CBACK 410. In some examples, the mode field 420 and the length field 425 are included in a header of a BACK message transmitted by the receiver to the transmitter to indicate a correctly decoded MPDU.
As shown in fig. 4, bits of bitmap 415 are associated with codewords of a-MPDU 305. For example, bit 421 corresponds to codeword 321, bit 422 corresponds to codeword 322, bit 423 corresponds to codeword 323, bit 431 corresponds to codeword 331, bit 432 corresponds to codeword 332, and bit 433 corresponds to codeword 333.
In an example of the methods and systems described herein, the bitmap 415 is shortened by excluding bits of codewords for which each codeword of the corresponding MPDU was successfully decoded, as shown in fig. 4. Thus, in the exemplary bitmap 415 shown in fig. 4, bits 451 correspond to codewords 351, rather than codewords 341. Similarly, bit 452 corresponds to bit 352, rather than bit 342, and so on. The MAC layer of the receiving device that generated CBACK410 "knows" that codewords 341, 342, and 343 were all decoded correctly because MPDU 309 was decoded correctly. Therefore, these bits may be excluded from CBACK 410. This shortens the length of CBACK410, thereby reducing recovery overhead. In a network conforming to the IEEE802.11 standard, the transmitter also receives a BACK message indicating a correctly decoded MPDU. The transmitter can infer based on the BACK which bits of bitmap 415 of CBACK410 correspond to which of the plurality of code words 320. The transmitter excludes codewords of correctly decoded MPDUs as indicated in the BACK and determines incorrectly decoded codewords from bitmap 415 of CBACK 410.
In the examples described herein, the acknowledgement message includes a number indicating the index of each codeword in the correctly decoded subset of codewords. These numbers may be ordinal numbers, e.g., corresponding to the positions of successfully decoded codewords among all codewords in the transmission.
FIG. 5 shows a second example of CBACK 510. CBACK 510 includes a list of numbers 525, where each value corresponds to a codeword of a successfully decoded data payload (e.g., an a-MPDU). Each value in the numeric list 525 is an ordinal number associated with a codeword. CBACK 510 also includes a CBACK mode field 526. The value stored in CBACK mode field 526 indicates the format of the information stored in the acknowledgement message. For example, if CBACK mode field 526 includes 2, the acknowledgement message is in the form of a numeric list similar to numeric list 525.
As shown in fig. 5, the numbers in the number list 525 are associated with the codewords of the a-MPDU 305 of fig. 3. The numeric list 525 includes values 0 (included in the value 530), 2 (included in the value 531), 5 (included in the value 532), 6 (included in the value 533), 7 (included in the value 534), 8 (included in the value 535), 10 (included in the value 536), 11 (included in the value 537), 12 (included in the value 538), 13 (included in the value 539), 14 (included in the value 540). These values correspond to codewords 321, 323, 333, 341, 342, 343, 352, 353, 354, 355, and 356, which are all successfully decoded.
Alternatively, the numbers representing the indices in the number list 525 may be ordinals, e.g., corresponding to the positions of codewords that have failed to be decoded correctly. Such a representation may be more efficient, for example, in the case of most codeword or MPDU decoding failures.
In another example described herein, the acknowledgement message includes a number indicating an index of each codeword in the correctly decoded subset of codewords. In this example, the index does not include the codeword for the corresponding subset of the MPDU that is decoded correctly. That is, similar to the bitmap 415, the acknowledgement message is shortened by excluding codewords for which each codeword of the corresponding MPDU was successfully decoded. These numbers may be ordinal numbers, e.g., corresponding to the positions of successfully decoded codewords among all codewords in the transmission.
Fig. 6 shows a diagram 600 of a third exemplary CBACK 610. CBACK 610 includes a list of numbers 625, each value corresponding to a successfully decoded codeword. In the present exemplary embodiment, the numeric listing 625 is an acknowledgement message. Each value in the numeric listing 625 is an ordinal number associated with the codeword. CBACK 610 also includes CBACK mode field 626. The value stored in CBACK mode field 626 indicates the format of the information stored in the acknowledgement message. For example, if the CBACK mode field 626 includes 3, the acknowledgement message is in the form of a numeric list 625.
As shown in fig. 6, the numbers in the number list 625 are associated with the codewords of the a-MPDU 305 of fig. 3. The numeric listing 625 includes values 0 (included in value 630), 2 (included in value 631), 5 (included in value 632), 7 (included in value 633), 8 (included in value 634), 9 (included in value 635), 10 (included in value 6364), 11 (included in value 637). These values correspond to codewords 321, 323, 333, 352, 353, 354, 355, and 356, which are all successfully decoded. Specifically, since MPDU 309 is successfully decoded, the index does not include codewords 341, 342, 343. Note that the index corresponding to codeword 351 is 6, and the codeword decoding fails, and therefore there is no indication in the CBACK. Thus, the next codeword indicated in the acknowledgement message is codeword 352, which has index 7, excluding codewords 341, 342, and 343. This further shortens the length of CBACK 610 compared to CBACK 510, thereby further reducing the overhead associated with retransmission of MPDUs.
Alternatively, like CBACK 510, the numbers in number list 625 may be used to indicate an index corresponding to the location of codewords that failed decoding (rather than those that were successfully decoded). Since the complete MPDU 309 is successfully decoded, the index is still determined based on the exclusion codeword 341, 342, 343. Listing codewords that fail decoding actually results in a shorter CBACK in the case that most codewords are successfully decoded.
In the examples described herein, the acknowledgement message includes a number indicating an increment of the index of each codeword in the correctly decoded subset of codewords. The number representing the index may be an ordinal number, e.g., an increment of the index corresponding to the position of the next codeword successfully decoded among all codewords in the transmission. Using increments of the index rather than the index itself may reduce the number of bits used in the acknowledgement message.
Fig. 7 shows a diagram 700 of a fourth exemplary CBACK 710. CBACK 710 includes a list 725 of numbers, each value corresponding to a successfully decoded codeword. Each value in the numeric list 725 is an ordinal number associated with the codeword. CBACK 710 also includes CBACK mode field 726. The value stored in CBACK mode field 726 indicates the format of the information stored in the acknowledgement message. For example, if CBACK mode field 726 includes 4, the acknowledgement message is in the form of a list of digits similar to list of digits 725.
As shown in fig. 7, a number representing an increment of an index in the number list 725 is associated with the codeword of the a-MPDU 305 of fig. 3. Numeric listing 725 includes values 0 (included in value 730), 2 (included in value 731), 3 (included in value 732), 1 (included in value 733), 1 (included in value 734), 1 (included in value 735), 2 (included in value 736), 1 (included in value 737), 1 (included in value 738), 1 (included in value 739), 1 (included in value 740). These values correspond to codewords 321, 323, 333, 341, 342, 343, 352, 353, 354, 355, and 356, respectively, which are all successfully decoded.
Alternatively, the number representing the increment of the index in the number list 725 may be an ordinal number, e.g., corresponding to the position of the codeword that failed to be decoded correctly.
In another example described herein, the acknowledgement message includes a number indicating an increment of the index of each codeword in the correctly decoded subset of codewords. In this example, the index does not include the codeword for the corresponding subset of the MPDU that is decoded correctly. That is, similar to the bitmap 415 and the number list 625, the acknowledgement message is shortened by excluding codewords for which each codeword of the corresponding MPDU was successfully decoded. The number representing the increment of the index may be an ordinal number, e.g., an increment of the index corresponding to the position of the next codeword decoded successfully among all codewords in the transmission.
Fig. 8 illustrates a fifth exemplary CBACK 810.CBACK 810 includes a list 825 of numbers, each value corresponding to a successfully decoded codeword. Similar to the previous exemplary embodiment, the numeric list 825 in this embodiment is an acknowledgement message. Each value in the numeric list 825 is an ordinal number associated with the codeword. CBACK 810 also includes CBACK mode field 826. The value stored in CBACK mode field 826 indicates the format of the information stored in the acknowledgment message. For example, if CBACK mode field 826 includes 5, then the acknowledgement message is in the form of a number list similar to number list 825.
As shown in fig. 8, a number representing an increment of an index in the number list 825 is associated with a codeword of the a-MPDU 305 of fig. 3. The numeric list 825 includes values 0 (included in the value 830), 2 (included in the value 831), 3 (included in the value 832), 2 (included in the value 833), 1 (included in the value 834), 1 (included in the value 835), 1 (included in the value 836), 1 (included in the value 837). These values correspond to codewords 321, 323, 333, 352, 353, 354, 355, and 356, which are all successfully decoded. Specifically, the increment of the index does not include codewords 341, 342, 343 due to successful decoding of MPDU 309. Note that the increment of the index from codeword 333 to codeword 352 (excluding codewords 341, 342, 343) is 2 (included in value 833). This further shortens the length of CBACK 610 compared to CBACK 710, thereby further reducing the overhead associated with retransmission of MPDUs.
Alternatively, similar to CBACK 710, number list 825 may be used to represent an index corresponding to the position of the codeword that failed to decode (rather than those that decoded successfully). Since the complete MPDU 309 is successfully decoded, the index is still determined based on the exclusion codeword 341, 342, 343. As with the previous CBACK, listing codewords that failed decoding results in a shorter CBACK in the event that most codewords were successfully decoded.
According to an exemplary embodiment, a transmitting device receives an acknowledgement message from a receiving device. The acknowledgement message includes an indication of a correctly decoded subset of codewords. The transmitting device generates one or more codewords based on the acknowledgement message, the one or more codewords encoding data in at least a portion (e.g., MPDUs) of a data payload of a non-overlapping data portion initially transmitted to the receiver. The transmitting device transmits one or more codewords to the receiver. As one illustrative example, a transmitting device generates a message that includes a codeword or portion that was not decoded correctly and transmits the message.
Fig. 9 shows a diagram 900 of an a-MPDU 305 and an exemplary message 910 transmitted from a transmitting device to a receiver. The message includes codewords 922, 931, 932, 951, 957 that encode data encoded by incorrectly decoded codewords 322, 331, 332, 351, and 357. In some examples, codewords 922, 931, 932, 951, 957 include the same coded bits as codewords 322, 331, 332, 351, and 357. Message 910 includes a codeword retransmission (CW-RETX) field 915 that includes an indicator that message 910 includes a retransmission of an incorrectly decoded codeword. The indicator may be a multi-value indicator, a first value indicating that the message includes a retransmission of the incorrectly decoded codeword, and a second value indicating that the message does not include a retransmission of the incorrectly decoded codeword. The field 915 may include a CBACK mode field similar to the CBACK mode fields 726, 826. The value stored in the CBACK mode field indicates the format of the information stored in the acknowledgement message.
Fig. 10 shows a flow chart of an example provided method 1000. The method 1000 indicates operations that occur in a receiving device when the receiving device receives and decodes a data payload.
The method 1000 includes receiving a data payload (e.g., an a-MPDU) including a plurality of codewords (block 1010). The codeword encodes data in a non-overlapping data portion corresponding to information bits of a data payload. In block 1020, a plurality of codewords are decoded. In block 1030, an acknowledgement message is generated that includes an indication of the correctly decoded subset of codewords. For example, the acknowledgement message may be similar to the acknowledgement messages shown in fig. 4-8. The acknowledgement message is generated based on an identification of a codeword in the correctly decoded subset of codewords and an identification of a codeword in the corresponding subset of correctly decoded non-overlapping data portions having information bits encoded in the codeword in the correctly decoded subset of codewords. For example, an acknowledgement message is transmitted to the transmitting device to obtain a retransmission of the codeword corresponding to the erroneously decoded codeword (block 1040). A response to the acknowledgement message is received, including one or more codewords encoding data in at least a portion of the non-overlapping data portions (block 1050).
According to an example, the acknowledgement message may also (implicitly or explicitly) indicate the corresponding subset of correctly decoded non-overlapping data portions. The acknowledgement message may be in the form of a bitmap, a single bit in the bitmap representing a codeword of non-overlapping data portions, the bitmap not including bits of each codeword of a corresponding subset of correctly decoded non-overlapping data portions. The acknowledgement message may also include a length indicator indicating the length of the acknowledgement message.
In some embodiments, the acknowledgement message includes a number representing an index of each codeword in the subset. The index may not include codewords for the corresponding subset of correctly decoded non-overlapping data portions. In other cases, the acknowledgement message includes a number representing the increment of each codeword index in the subset. The delta may not include codewords for the corresponding subset of correctly decoded non-overlapping data portions. In some cases, method 1000 includes: determining a maximum bit length for representing an increment of the index; for each codeword in the subset, increments of the index of the codeword are represented using a number having a bit length of at most the maximum bit length.
According to an example, the receiving device decodes the retransmission, not shown in fig. 10. In some cases, more than one retransmission of a codeword occurs before a receiving device implementing method 1000 successfully decodes all non-overlapping data portions.
Fig. 11 shows a flow diagram of an example provided method 1100. Method 1000 indicates operations that occur in a transmitting device when the transmitting device encodes and transmits a data payload.
The method 1100 includes transmitting a data payload including a plurality of codewords that encode data (e.g., a-MPDUs) in non-overlapping data portions of information bits (block 1110). In block 1120, an acknowledgement message is received that includes an indication of a correctly decoded subset of codewords. The acknowledgement message is generated based on an identification of a codeword in the correctly decoded subset of codewords and an identification of a codeword in the corresponding subset having a correctly decoded non-overlapping data portion of the information bits encoded in the codeword in the correctly decoded subset of codewords. In block 1130, one or more codewords are generated based on the acknowledgement message, the one or more codewords encoding data in at least a portion of the non-overlapping data portions. One or more codewords are transmitted to a receiver (block 1140).
The described methods and systems provide an acknowledgement message for a failed codeword. In contrast to the standard BACK mechanism, correctly received codewords are not retransmitted. After a correct reception of the acknowledgement message, the transmitter retransmits the data from the codeword that was received in error in the last transmission. These methods provide shorter retransmissions compared to previous methods. The duration of the acknowledgement message is shorter and the overall duration is shortened.
Fig. 12 illustrates an exemplary communication system 1200. In general, the system 1200 enables multiple wireless or wired users to send and receive data and other content. System 1200 may implement one or more channel access methods such as Code Division Multiple Access (CDMA), time Division Multiple Access (TDMA), spatial Division Multiple Access (SDMA), frequency Division Multiple Access (FDMA), orthogonal FDMA (OFDMA), single carrier FDMA (SC-FDMA), non-orthogonal multiple access (NOMA), or some combination thereof.
In this example, the communication system 1200 includes Electronic Devices (EDs) 1210 a-1210 c, radio Access Networks (RANs) 1220a and 1220b, a core network 1230, a Public Switched Telephone Network (PSTN) 1240, the internet 1250, and other networks 1260. Although fig. 12 shows a certain number of these components or elements, any number of these components or elements may be included in system 1200.
The EDs 1210 a-1210 c are used for operation or communication in the system 1200. For example, the EDs 1210 a-1210 c are configured to transmit or receive over a wireless or wired communication channel. Each ED 1210 a-1210 c represents any suitable end-user device, and may include the following (or may be referred to as): user Equipment (UE), wireless transmit or receive unit (WTRU), mobile station, fixed or mobile subscriber unit, cellular telephone, personal Digital Assistant (PDA), smart phone, laptop computer, touch pad, wireless sensor, or consumer electronic device.
Here, RANs 1220a and 1220b include base stations 1270a and 1270b, respectively. Each base station 1270a and 1270b is configured to wirelessly connect with one or more of the EDs 1210 a-1210 c to enable access to the core network 1230, the PSTN1240, the internet 1250, and/or other networks 1260. For example, the base stations 1270a and 1270B may include (or be) one or more of several well-known devices, such as a Base Transceiver Station (BTS), a Node-B (NodeB), an evolved NodeB (eNodeB), a Next Generation (NG) NodeB (next generation Node B, gNB), a home NodeB, a home eNodeB, a site controller, an Access Point (AP), or a wireless router. The EDs 1210 a-1210 c are used to connect and communicate with the internet 1250 and may access a core network 1230, PSTN1240, or other networks 1260.
In the embodiment shown in fig. 12, the base station 1270a forms a portion of a RAN 1220a, which RAN 1220a may include other base stations, elements, or devices. In addition, base station 1270b forms a portion of RAN 1220b, and RAN 1220b may include other base stations, elements, and/or devices. Each base station 1270a and 1270b is configured to transmit or receive wireless signals within a particular geographic area (sometimes referred to as a "cell"). In some embodiments, multiple-input multiple-output (MIMO) technology may be used, with multiple transceivers per cell.
Base stations 1270a and 1270b communicate with one or more of EDs 1210a through 1210c over one or more air interfaces using wireless communication links. These air ports may use any suitable wireless access technology.
It is contemplated that system 1200 may employ multi-channel access functionality, including schemes described above. In particular embodiments, the base station and the ED implement IEEE802.11 (Wi-Fi), 5G New Radio (NR), LTE-A, or LTE-B. Of course, other multiple access schemes and wireless protocols may be used.
RANs 1220a and 1220b communicate with a core network 1230 to provide ED 1210 a-1210 c with Voice, data, applications, voice over IP (VoIP) or other services. It is to be appreciated that RANs 1220a and 1220b or core network 1230 may be in direct or indirect communication with one or more other RANs (not shown). The core network 1230 may also serve as a gateway access for other networks, such as the PSTN1240, the internet 1250, and other networks 1260. Additionally, some or all of the EDs 1210 a-1210 c may include functionality to communicate with different wireless networks over different wireless links using different wireless technologies and/or protocols. Instead of (or in addition to) wireless communication, the ED may also communicate with a service provider or switch (not shown) and with the internet 1250 via wired communication channels.
Although fig. 12 shows one example of a communication system, various changes may be made to fig. 12. For example, in any suitable arrangement, communication system 1200 may include any number of EDs, base stations, networks, or other components.
13A and 13B illustrate exemplary devices that may implement the methods and teachings provided by the present disclosure. In particular, fig. 13A shows an exemplary ED 1310 and fig. 13B shows an exemplary base station 1370. These components may be used in system 1300 or any other suitable system.
As shown in fig. 13A, ED 1310 includes at least one processing unit 1300. Processing unit 1300 implements various processing operations of ED 1310. For example, processing unit 1300 may perform signal coding, data processing, power control, input/output processing, or any other function that enables ED 1310 to operate in system 1200. The processing unit 1300 also supports the methods and teachings described in more detail above. Each processing unit 1300 includes any suitable processing or computing device for performing one or more operations. For example, each processing unit 1300 may include a microprocessor, microcontroller, digital signal processor, field programmable gate array, or application specific integrated circuit.
The ED 1310 also includes at least one transceiver 1302. The transceiver 1302 is configured to modulate data or other content for transmission over at least one antenna or Network Interface Controller (NIC) 1304. The transceiver 1302 is also configured to demodulate data or other content received by at least one antenna 1304. Each transceiver 1302 includes any suitable structure for generating signals for wireless or wired transmission or for processing signals received wirelessly or wired. Each antenna 1304 includes any suitable structure for transmitting or receiving wireless or wired signals. One or more transceivers 1302 may be used for the ED 1310, and one or more antennas 1304 may be used for the ED 1310. Although shown as a single functional unit, the transceiver 1302 may also be implemented using at least one transmitter and at least one separate receiver.
The ED 1310 also includes one or more input/output devices 1306 or interfaces (e.g., a wired interface to the internet 1250). The input/output devices 1306 facilitate interaction with users or other devices in the network (network communications). Each input/output device 1306 includes any suitable structure for providing information to or receiving information from a user, such as a speaker, microphone, keypad, keyboard, display, or touch screen, including network interface communications.
In addition, ED 1310 includes at least one memory 1308. Memory 1308 stores instructions and data used, generated, or collected by ED 1310. For example, the memory 1308 may store software or firmware instructions executed by the one or more processing units 1300, as well as data for reducing or eliminating interference in incoming signals. Each memory 1308 includes any suitable one or more volatile or non-volatile storage and retrieval devices. Any suitable type of memory may be used, such as Random Access Memory (RAM), read Only Memory (ROM), hard disk, optical disk, subscriber Identity Module (SIM) card, memory stick, secure Digital (SD) memory card, and so forth.
As shown in fig. 13B, the base station 1370 includes at least one processing unit 1350, at least one transceiver 1352 (including the functionality of a transmitter and a receiver), one or more antennas 1356, at least one memory 1358, and one or more input/output devices or interfaces 1366. A scheduler, as will be appreciated by those skilled in the art, may be coupled to the processing unit 1350. The scheduler may be included within base station 1370 or operate separate from base station 1370. The processing unit 1350 implements various processing operations for the base station 1370, such as signal coding, data processing, power control, input/output processing, or any other functions. The processing unit 1350 may also support the methods and teachings described in more detail above. Each processing unit 1350 includes any suitable processing or computing device for performing one or more operations. For example, each processing unit 1350 may include a microprocessor, microcontroller, digital signal processor, field programmable gate array, or application specific integrated circuit.
Each transceiver 1232 includes any suitable structure for generating signals for transmission, wirelessly or by wire, to one or more EDs or other devices. Each transceiver 1352 also includes any suitable structure for processing signals received wirelessly or by wire from one or more EDs or other devices. Although the transmitter and receiver are shown combined as a transceiver 1352, they may be separate components. Each antenna 1356 includes any suitable structure for transmitting or receiving wireless or wired signals. Although a common antenna 1356 is shown here coupled to the transceivers 1352, one or more antennas 1356 can be coupled to one or more of the transceivers 1352, thereby enabling separate antennas 1356 to be coupled to both the transmitter and the receiver (when both are separate components). Each memory 1358 includes any suitable one or more volatile or non-volatile storage and retrieval devices. Each input/output device 1366 facilitates interaction (network communication) with users or other devices in the network. Each input/output device 1366 includes any suitable structure for providing information to, or receiving/providing information from, a user, including network interface communications.
FIG. 14 is a block diagram of a computing system 1400 that may be used to implement the apparatus and methods disclosed herein. For example, the computing system may be any entity of a UE, AN Access Network (AN), mobility Management (MM), session Management (SM), user Plane Gateway (UPGW), or Access Stratum (AS). A particular device may use all of the illustrated components or only a subset of the components, and the degree of integration between devices may vary. Further, a device may include multiple instances of a component, such as multiple processing units, processors, memories, transmitters, receivers, etc. Computing system 1400 includes a processing unit 1402. The processing unit includes a Central Processing Unit (CPU) 1414, a memory 1408, and may also include a mass storage 1404, a video adapter 1410, and an I/O interface 1412, which are coupled to bus 1420.
The bus 1420 may be one or more of any type of several bus architectures including a memory bus or memory controller, a peripheral bus, or a video bus. The CPU 1414 may include any type of electronic data processor. The memory 1408 may include any type of non-transitory system memory, such as Static Random Access Memory (SRAM), dynamic Random Access Memory (DRAM), synchronous DRAM (SDRAM), read-only memory (ROM), or a combination thereof. In one embodiment, memory 1408 may include ROM for use at boot-up and DRAM for storing programs and data for use during program execution.
Mass storage 1404 may include any type of non-transitory storage device for storing data, programs, and other information and making the data, programs, and other information accessible via bus 1420. The mass storage 1404 may include, for example, one or more of a solid state disk, a hard disk drive, a magnetic disk drive, or an optical disk drive.
The video adapter 1410 and the I/O interface 1412 provide interfaces to couple external input and output devices to the processing unit 1402. As shown, examples of input and output devices include a display 1418 coupled to the video adapter 1410 and a mouse, keyboard, or printer 1416 coupled to the I/O interface 1412. Other devices may be coupled to the processing unit 1402, and more or fewer interface cards may be used. For example, a serial interface (not shown) such as a Universal Serial Bus (USB) may be used to interface the external devices.
The processing unit 1402 also includes one or more network interfaces 1406, which can include wired links such as ethernet cables to access nodes or different networks, or wireless links. The network interface 1406 may enable the processing unit 1402 to communicate with remote units over a network. For example, the network interface 1406 may provide wireless communication via one or more transmitters/transmit antennas and one or more receivers/receive antennas. In one embodiment, the processing unit 1402 is coupled to a local area network 1422 or a wide area network for data processing and communication with remote devices, such as other processing units, the internet, or remote storage facilities.
It should be understood that one or more steps of the embodiment methods provided herein may be performed by corresponding units or modules. For example, the signal may be transmitted by a transmitting unit or a transmitting module. The signal may be received by a receiving unit or a receiving module. The signals may be processed by a processing unit or processing module. Other steps may be performed by a decoding unit or module, or a determining unit or module. The respective units/modules may be hardware, software or a combination thereof. For example, one or more units or modules may be integrated circuits, such as Field Programmable Gate Arrays (FPGAs) or application-specific integrated circuits (ASICs).
Although the present disclosure and its advantages have been described in detail, it should be understood that various changes, substitutions and alterations can be made herein without departing from the spirit and scope of the disclosure as defined by the appended claims.
The present invention may be embodied in other specific apparatus and/or methods. The described embodiments are to be considered in all respects only as illustrative and not restrictive. In particular, the scope of the invention is indicated by the appended claims rather than by the description and drawings herein. All changes which come within the meaning and range of equivalency of the claims are to be embraced within their scope.

Claims (18)

1. A method for transmitting data between a transmitter and a receiver, the method comprising:
receiving a data payload comprising a plurality of codewords that encode data in non-overlapping data portions corresponding to information bits of the data payload;
decoding the plurality of codewords;
generating an acknowledgement message comprising an indication of a correctly decoded subset of codewords;
transmitting the acknowledgement message to obtain a codeword retransmission corresponding to an erroneously decoded codeword;
receiving one or more codewords in response to the acknowledgement message, the one or more codewords encoding data in at least a portion of the non-overlapping data portions;
wherein the confirmation message is generated based on an identification of the codeword in the subset and an identification of a codeword in a corresponding subset having a correctly decoded non-overlapping data portion of information bits encoded in the codeword in the subset.
2. The method of claim 1, wherein the acknowledgement message comprises an indication of the corresponding subset of correctly decoded non-overlapping data portions.
3. The method of claim 1 or 2, wherein the acknowledgement message comprises a bitmap comprising bits for each codeword of the subset.
4. The method of claim 3, wherein the bitmap does not include bits for each codeword in the corresponding subset of correctly decoded non-overlapping data portions.
5. A method according to claim 1 or 2, wherein the acknowledgement message comprises a number representing the index of each codeword in the subset.
6. The method of claim 5, wherein the index does not include codewords for the corresponding subset of correctly decoded non-overlapping data portions.
7. A method according to claim 1 or 2, wherein the acknowledgement message comprises a number indicating an increment of the index of each codeword in the subset.
8. The method of claim 7, wherein the increment does not include codewords for the corresponding subset of correctly decoded non-overlapping data portions.
9. The method according to claim 7 or 8, comprising:
determining a maximum bit length for representing an increment of the index; for each of the code words in the subset,
representing the increment of the index of the codeword using a number having a bit length of at most the maximum bit length.
10. The method according to any of claims 1 to 9, wherein the acknowledgement message further comprises a length indicator indicating a length of the acknowledgement message.
11. The method according to any of claims 1 to 10, wherein the acknowledgement message comprises an indication of the erroneously decoded codeword.
12. The method of claim 11, wherein the acknowledgement message comprises bits indicating an indication of whether the codeword in the acknowledgement message corresponds to an indication of a correctly or incorrectly decoded codeword.
13. The method of any one of claims 1 to 12, wherein the acknowledgement message is a Codeword Block Acknowledgement (CBACK) message.
14. The method of any one of claims 1-13, wherein the codewords in the plurality of codewords are encoded using a Binary Convolutional Coding (BCC) code or a Low Density Parity Check (LDPC) code.
15. The method according to any one of claims 1 to 14, comprising: decoding the one or more codewords received in response to the acknowledgement message.
16. A method for transmitting data between a transmitter and a receiver, the method comprising:
transmitting a data payload comprising a plurality of codewords that encode data in non-overlapping data portions corresponding to information bits of the data payload;
receiving an acknowledgement message comprising an indication of a correctly decoded subset of codewords;
generating one or more codewords based on the acknowledgement message, the one or more codewords encoding data in at least a portion of the non-overlapping data portions;
transmitting the one or more codewords to the receiver,
wherein the confirmation message is generated based on an identification of the codeword in the subset and an identification of a codeword in a corresponding subset having a correctly decoded non-overlapping data portion of information bits encoded in the codeword in the subset.
17. An apparatus, comprising:
a non-transitory memory comprising instructions;
one or more processors in communication with the memory, wherein the one or more processors execute the instructions to:
receiving a data payload comprising a plurality of codewords that encode data in non-overlapping data portions corresponding to information bits of the data payload;
decoding the plurality of codewords;
generating an acknowledgement message comprising an indication of a correctly decoded subset of codewords;
transmitting the acknowledgement message to obtain a codeword retransmission corresponding to an erroneously decoded codeword;
receiving one or more codewords in response to the acknowledgement message, the one or more codewords encoding data in at least a portion of the non-overlapping data portions;
wherein the confirmation message is generated based on an identification of the codeword in the subset and an identification of a codeword in a corresponding subset of correctly decoded non-overlapping data portions having information bits encoded in the codewords in the subset.
18. An apparatus, comprising:
a non-transitory memory comprising instructions;
one or more processors in communication with the memory, wherein the one or more processors execute the instructions to:
transmitting a data payload comprising a plurality of codewords that encode data in non-overlapping data portions corresponding to information bits of the data payload;
receiving an acknowledgement message comprising an indication of a correctly decoded subset of codewords;
generating one or more codewords based on the acknowledgement message, the one or more codewords encoding data in at least a portion of the non-overlapping data portions;
transmitting the one or more codewords;
wherein the confirmation message is generated based on an identification of the codeword in the subset and an identification of a codeword in a corresponding subset of correctly decoded non-overlapping data portions having information bits encoded in the codewords in the subset.
CN202080099104.6A 2020-04-03 2020-04-03 Method and system for codeword transmission Pending CN115336210A (en)

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
PCT/EP2020/059487 WO2021197609A1 (en) 2020-04-03 2020-04-03 Method and system for codeword transmission

Publications (1)

Publication Number Publication Date
CN115336210A true CN115336210A (en) 2022-11-11

Family

ID=70189950

Family Applications (1)

Application Number Title Priority Date Filing Date
CN202080099104.6A Pending CN115336210A (en) 2020-04-03 2020-04-03 Method and system for codeword transmission

Country Status (2)

Country Link
CN (1) CN115336210A (en)
WO (1) WO2021197609A1 (en)

Family Cites Families (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO2008085992A2 (en) * 2007-01-08 2008-07-17 Interdigital Technology Corporation Method and apparatus for multicasting with feedback information
US20160173662A1 (en) * 2013-08-20 2016-06-16 Lg Electronics Inc. Method and device for transmitting and receiving short frame fragment in wireless lan system
US10873942B2 (en) * 2017-07-12 2020-12-22 Qualcomm Incorporated Code block group feedback techniques for multiple carriers or transmission time intervals
US10999014B2 (en) * 2018-08-10 2021-05-04 Qualcomm Incorporated Hybrid automatic repeat request (HARQ) in a wireless local area network (WLAN)

Also Published As

Publication number Publication date
WO2021197609A1 (en) 2021-10-07

Similar Documents

Publication Publication Date Title
US11929832B2 (en) Hybrid automatic repeat request acknowledgement [HARQ-ACK] feedback techniques
US10972228B2 (en) Base station device, user equipment, wireless communication system, and communication method
EP2540024B1 (en) System and method for transmitting and receiving acknowledgement information
US11165541B2 (en) Retransmission protocol based on forward error correction codewords
EP3476068B1 (en) Enhanced feedback signalling
TW201519596A (en) Systems and methods for smart HARQ for WiFi
US11469859B2 (en) Hybrid automatic repeat request (HARQ) technique based on receiver processing capability
US20230354370A1 (en) Data receiving method and apparatus and data sending method and apparatus
EP3440790B1 (en) Radio-network node, wireless device and methods performed therein
EP3780447B1 (en) Harq technology-based communication method, device, and system
US20210036809A1 (en) Hybrid automatic repeat request (harq) with sliding window feedback
US20230269026A1 (en) Rateless coding at layer two protocol layer
US20230139754A1 (en) Coding method and apparatus
EP4406158A1 (en) Channel state information reporting of code block group based transport blocks
CN112491512A (en) Method and communication device for retransmitting data
CN115486013A (en) Soft combining for hybrid automatic repeat request feedback
US11581984B2 (en) Retransmission technique with compressed feedback in a wireless communication system
CN110140317B (en) Decoding partial radio transmissions
WO2020076380A1 (en) System and method for retransmission of individual codewords
CN115336210A (en) Method and system for codeword transmission
US20230327801A1 (en) Information processing device and information processing method
US20230327800A1 (en) Information processing device and decoding method
US20220345262A1 (en) Method for harq transmission
WO2022050020A1 (en) Information processing device, encoding method, and decoding method
CN118614020A (en) Method and apparatus for network coding based HARQ retransmission with scrambling

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