H03M13/6306

APPARATUS AND METHOD FOR DETERMINING THE CONTENT OF A RETRANSMISSION
20220200729 · 2022-06-23 · ·

Techniques are disclosed for reducing overhead during hybrid automatic repeat request (HARQ) operations performed by a user equipment (UE) during wireless communication. The UE receives a message over the wireless network and obtains a parity check matrix (PCM) associated with a received message. Rows of the PCM are assigned to respective groups of a plurality of groups, where the respective groups have corresponding one or more parity checks as determined by the PCM. The UE generates a feedback message including a plurality of bits, wherein an individual bit of the plurality of bits indicates whether a corresponding respective group of the plurality of groups include one or more unsatisfied parity checks. The UE then transmits the feedback message to a base station of the wireless network.

SYSTEM AND METHOD FOR RECEPTION OF WIRELESS LOCAL AREA NETWORK PACKETS WITH BIT ERRORS
20220200632 · 2022-06-23 ·

A method in a first wireless device (WD) supporting wireless communication with a second WD is described. A plurality of wireless packets is received from the second WD including at least a first wireless packet. At least another wireless packet of the plurality of wireless packets is one of a retry packet and a repeat packet of the first packet. Each wireless packet of the plurality of wireless packets includes a plurality of bits and a first group of bits. For each received wireless packet, the plurality of bits corresponding to the received wireless packet is de-spread, and the first group of bits is correlated with a predetermined group of bits. The method further includes performing a majority vote based on the correlation of the first group of bits of each received wireless packet and creating a corrected packet based in part on the majority vote.

Data encoding and decoding methods and apparatuses

Embodiments of the application provides a method for encoding. The method includes: receiving a to-be-encoded data block; encoding the data block at an aggregation level of 2L, where a formula used during the encoding is as follows: [ u . 2 L u . L ] [ G LN 0 G LN G LN ] = .Math. C . 2 L C

CODING TECHNIQUES FOR REFERENCE SIGNAL INDEX MODULATION COMMUNICATIONS

Methods, systems, and devices for wireless communication are described that support communication of information buts based on reference signal index modulation (RS-IM). A base station and a UE may transmit a number of downlink and uplink information bits (e.g., downlink control bits, uplink control bits) using index modulation schemes applied on references signals. A base station and a UE may transmit reference signal transmissions using reference signal index modulation, in which a set of information bits may be encoded using one or more coding techniques, in conjunction with RS-IM techniques, to enhance reliability of some or all of the information bits. Error detection bits may be added to the information bits, and included when coding is performed. Coding may include channel coding, repetition of reference signals for combining at a receiving device, or any combinations thereof.

Compressive sensing-aided LPWAN MAC layer

A LoRa device for communicating sensor signals in a low power wide area network (LPWAN) includes a physical layer using Hamming encoding and Gray indexing with chirp spread signal (CSS) modulation to encode and modulate the sensor signals and a medium access layer (MAC) including a compressive sensing sub-layer which reduces encoded, modulated signals to sparse vectors. A transmission packet is formed by combining the sparse vectors with a selected set of sparse vectors representing past measurements and the incoming velocity of the sensor signals. A receiver decompresses the transmission packet by reconstructing, at a sparse recovery sub-layer of a receiver MAC layer, the encoded, modulated sensor signals. A decoder path removes the CSS modulation and Gray indexing, and Hamming decodes the sensors signals.

Soft decoding of rate-compatible polar codes

A node receives transmissions associated with a given set of information bits, wherein each of the transmissions use a different polar code and share one or more information bits of the given set of information bits. The node determines, at each of a plurality of polar decoders of the node, soft information for each information bit included in an associated one of the transmissions, wherein each of the plurality of polar decoders is associated with a different transmission of the transmissions. The node provides, from each polar decoder of the plurality to one or more other polar decoders of the plurality, the determined soft information for any information bits shared by their respective associated transmissions, and uses the provided soft information in an iterative decoding process to decode one or more of the received transmissions.

HIGH PERFORMANCE, FLEXIBLE, AND COMPACT LOW-DENSITY PARITY-CHECK (LDPC) CODE
20230275599 · 2023-08-31 ·

Certain aspects of the present disclosure generally relate to techniques for puncturing of structured low-density parity-check (LDPC) codes. Certain aspects of the present disclosure generally relate to methods and apparatus for a high-performance, flexible, and compact LDPC code. Certain aspects can enable LDPC code designs to support large ranges of rates, blocklengths, and granularity, while being capable of fine incremental redundancy hybrid automatic repeat request (IR-HARD) extension while maintaining good floor performance, a high-level of parallelism to deliver high throughout performance, and a low description complexity.

POLAR CODING SYSTEMS, PROCEDURES, AND SIGNALING

Systems, methods, and instrumentalities are disclosed for interleaving coded bits. A wireless transmit/receive unit (WTRU) may generate a plurality of polar encoded bits using polar encoding. The WTRU may divide the plurality of polar encoded bits into sub-blocks of equal size in a sequential manner. The WTRU may apply sub-block wise interleaving to the sub-blocks using an interleaver pattern. The sub-blocks associated with a subset of the sub-blocks may be interleaved, and sub-blocks associated with another subset of the sub-blocks may not be interleaved. The sub-block wise interleaving may include applying interleaving across the sub-blocks without interleaving bits associated with each of the sub-blocks. The WTRU may concatenate bits from each of the interleaved sub-blocks to generate interleaved bits, and store the interleaved bits associated with the interleaved sub-blocks in a circular buffer. The WTRU may select a plurality of bits for transmission from the interleaved bits.

Transmitting method with error correction coding

A loss correction encoding device having an improved capability of loss correction using LDPC-CC includes a rearranging unit that rearranges information data contained in n information packets according to the constraint length Kmax and the encoding rate (q−1)/q of a check polynomial of the loss correction code used in a loss correction encoding unit. Specifically, the rearranging unit rearranges the information data in such a way that continuous Kmax×(q−1) pieces of information data after rearrangement are contained in different information packets. The rearranging unit distributes the information data to information blocks from n information packets, where n satisfies the formula Kmax×(q−1)≤n.

Method and apparatus for processing information, communications device, and communications system

This application discloses a method and an apparatus for processing information, a communications device, and a communications system. The communications device is configured to obtain a starting position of an output bit sequence in a coded block in a circular buffer, and determine the output bit sequence in the coded block based on a length of the output bit sequence and the starting position. A value of the starting position is one of {p.sub.0, p.sub.1, p.sub.2, . . . , p.sub.k.sub.max.sub.−1}, where 0≤p.sub.k<N.sub.CB, p.sub.k is an integer, k is an integer, 0≤k<k.sub.max, N.sub.CB is a size of the coded block, and k.sub.max is an integer greater than or equal to 4.