Patent classifications
H03M13/136
Methods and Apparatus for Dynamic Acknowledgement List Selection in Detection of Uplink Control Channel Formats
Methods and apparatus for dynamic acknowledgement list selection in detection of uplink control channel formats. In an exemplary embodiment, an apparatus includes a dynamic acknowledgement (ACK) list allocation circuit that generates a dynamic ACK list that includes one or two most likely ACK candidates, and a top-Q candidate CQI bits detector that dynamically allocates a detection branch to each of the one or two most likely ACK candidates to detect top-Q candidate CQI bits. The apparatus also includes a merger circuit that mergers the top-Q candidate CQI bits detected for the one or two most likely ACK candidates to generate a merged list, a top-Q CQI symbol generator that generates top-Q CQI symbols for the top-Q candidate CQI bits detected for the one or two most likely ACK candidates, and a joint detector that detects transmitted CQI bits and ACK bits.
INFORMATION PROCESSING DEVICE, ENCODING METHOD, AND DECODING METHOD
Provided are an information processing device, an encoding method, and a decoding method that implement low latency communication. An information processing device of the present disclosure includes a first processing unit that performs processing of a first protocol layer including processing of generating first coded data by encoding first data with an erasure correction code that is a first code, and provides the first coded data to a second protocol layer lower than the first protocol layer.
Forward Error Correction Coding Using a Tree Structure
A transmitter generates an encoded vector by encoding a data vector, the encoded vector representing payload information and parity information. The encoding is mathematically equivalent to calculating three or more forward error correction (FEC) codewords from the data vector and then calculating the encoded vector from the codewords, at least one codeword being calculated from at least one recursion of a mathematical operation, and at least one codeword comprising more than 6 terms. The transmitter transmits a signal representing the encoded vector over a communication channel. A receiver determines a vector estimate from the signal and recovers the data vector from the vector estimate by sequentially decoding the codewords, wherein at least one codeword that is decoded earlier in the decoding enhances an estimate of at least one codeword that is decoded later in the decoding.
Data processing method and device
A data processing method and apparatus. The data process method includes: determining, by a transmitting node, a code block length N.sub.0 for encoding an information bit sequence to be transmitted according to a data characteristic for representing the information bit sequence to be transmitted and a preset parameter corresponding to the data characteristic; performing, by the transmitting node, polar encoding on the information bit sequence to be transmitted according to the code block length N.sub.0; and transmitting, by the transmitting node, a code block obtained through the polar encoding to a receiving node.
POLARIZATION ADJUSTED CHANNEL CODING DESIGN FOR COMPLEXITY REDUCTION
Methods, systems, and devices for wireless communications are described. A transmitting device may allocate a set of information bits into multiple subsets of bits corresponding to channel instances of a channel. The transmitting device may encode a first subset of bits according to a first channel coding scheme for a first channel instance and a second subset of bits according to a second channel coding scheme for a second channel instance. The transmitting device may input encoded subsets of bits to a polarizing transform, which may output a set of encoded polarized bits that are transmitted to a receiving device. Upon reception of the encoded polarized bits, the receiving device may apply a depolarizing transform to obtain multiple subsets of bits corresponding to channel instances of the channel, and may decode each subset of bits according to a respective channel coding scheme.
Method and apparatus for providing a joint error correction code for a combined data frame comprising first data of a first data channel and second data of a second data channel and sensor system
An apparatus (100) for providing an joint error correction code (140) for a combined data frame (254) comprising first data (112) of a first data channel and second data (122) of a second data channel comprises a first error code generator (110) configured to provide, based on a linear code, information on a first error correction code (114a, 114b) using the first data (112). The apparatus further comprises a second error code generator (120) configured to provide, based on the linear code, information on a second error correction code (124) using the second data (122). The apparatus is configured to provide the joint error correction code (140) using the information on the first error correction code (114a, 114b) and the information on the second error correction code (124).
Forward error correction coding using a tree structure
A transmitter (200) generates (602) an encoded vector (404) by encoding (406) a data vector (402), the encoded vector representing payload information and parity information. The encoding is mathematically equivalent to calculating three or more forward error correction (FEC) codewords from the data vector and then calculating the encoded vector from the codewords, at least one codeword being calculated from at least one recursion of a mathematical operation, and at least one codeword comprising more than 6 terms. The transmitter transmits (604) a signal representing the encoded vector over a communication channel. A receiver (300) determines (702) a vector estimate (502) from the signal and recovers (716) the data vector from the vector estimate by sequentially decoding (706, 710, 714) the codewords, wherein at least one codeword that is decoded earlier in the decoding enhances an estimate of at least one codeword that is decoded later in the decoding.
Methods and Systems for Encoding and Decoding Based on Partitioned Complementary Sequences
A method includes generating, by processing circuitry of a communications device, a partitioned complementary sequence based on information bits for transmission. The partitioned complementary sequence may include zero-valued elements. The method may include encoding a plurality of symbols on a plurality of orthogonal subcarriers using the partitioned complementary sequence. The encoding may include mapping additional information bits on subcarriers associated with the zero-valued elements of the partitioned complementary sequence. Additionally, the method may include controlling a radio of the communications device to transmit the plurality of symbols on the plurality of orthogonal subcarriers via an antenna of the communications device.
SYSTEM AND METHOD FOR DECODING REED-MULLER CODES
Various embodiments are directed to Reed-Muller decoding systems and methods based on recursive projections and aggregations of cosets decoding, exploiting the self-similarity of RM codes, and extended with list-decoding procedures and with outer-code concatenations
INTERLEAVER DESIGN FOR NONCOHERENT REED MULLER CODES
A configuration for a device to interleave a codeword, where the codeword is based on an enhanced noncoherent error correction code. The apparatus encodes a set of bits based on a noncoherent error correction code to generate a first codeword. The apparatus interleaves the first codeword to permute coded bits of the first codeword into a second codeword. The apparatus transmits the second codeword to a second device.