Abstract:
A transmitter is provided that shapes uniformly-distributed bits into a non-uniformly distributed bits according to a parity check matrix of a linear code such that a product of the parity check matrix and the non-uniformly distributed bits equals the uniformly-distributed bits. Similarly, receiver is provided that recovers the uniformly-distributed bits from the non-uniformly distributed bits through a multiplication of the non-uniformly-distributed bits with the parity check matrix.
Abstract:
Various aspects of the present disclosure generally relate to wireless communication. In some aspects, a transmitting node may determine a set of geometry-specific parameters based at least in part on a symbol sequence length n and a target distribution. The transmitting node may determine a sequence of K bits based at least in part on a plurality of information bits and a bit sequence length K. The transmitting node may map, based at least in part on a composition selected from a plurality of compositions, the sequence of K bits to a sequence of n symbols using arithmetic coding based at least in part on the set of geometry-specific parameters. The transmitting node may transmit the sequence of n symbols to a receiving node. Numerous other aspects are described.
Abstract:
Wireless communications systems and methods related to an efficient arithmetic coding based multiple composition distribution matcher (MCDM) are provided. A wireless communication device selects, based on a first value representing a sequence of bits, a first composition from a plurality of compositions. Each composition of the plurality of compositions includes a different modulation symbol distribution associated with a modulation scheme. The wireless communication device encodes, based on the first composition, the sequence of bits into a sequence of symbols using arithmetic coding. The wireless communication device transmits a communication signal including the sequence of symbols.
Abstract:
Various aspects of the present disclosure generally relate to wireless communication. In some aspects, a first node may transmit a set of first values indicating a first estimated value at the first node and a first reliability value associated with the first estimated value, the set of first values being based at least in part on channel state information (CSI) associated with the first node and a set of user equipments (UEs). The first node may receive, from a set of second nodes, a set of second values indicating a second estimated value at the second node and a second reliability value associated with the second estimated value. The first node may transmit, to the set of second nodes, a set of third values indicating a third estimated value at the first node and a third reliability value associated with the third estimated value. Numerous other aspects are described.
Abstract:
Certain aspects of the present disclosure relate to techniques and apparatus for improving decoding latency and performance of Polar codes. An exemplary method generally includes generating a codeword by encoding information bits using a first code of length K to obtain bits for transmission via K channels, wherein the first code comprises a polar code, further encoding the bits in each of the K channels using a second code of length M, and transmitting the codeword.
Abstract:
A method, an apparatus, and a computer program product for wireless communication are provided. The device may receive a signal on each of N channels from another device. The N channels may include a first channel. The device may determine a frequency response of each of the N channels based on the received signals. The device may transform, from a frequency domain to a time domain, the N frequency responses in order to generate a transformed signal. The frequency response of an nth channel of the N channels may be adjusted by a channel offset of the nth channel with respect to the first channel for n being each integer from 2 to N. The device may then estimate the channel offset for each of the N channels other than the first channel based on the transformed signal.
Abstract:
Methods, systems, and devices for wireless communications are described herein. A transmitting device (e.g., a user equipment (UE), a network entity) may generate a low-density parity-check code according to a base graph, which may be defined by variable nodes and check nodes. The base graph may support second degree variable nodes in the information nodes of the base graph and a larger quantity of second degree nodes associated with higher significance bits than with lower significance bits. Higher significance levels (e.g., bits) may correspond to higher channel reliabilities. The base graph may be a universal base graph or may include additional rules specific to probabilistic shaping. In some examples, an interleaver may be defined to map the base graph to symbols. In some cases, the UE may report its capability to support one or more interleavers, or the network entity may configure the UE with an interleaver.
Abstract:
A low-density parity-check encoder is provided that encodes a plurality of information bits according to a low-density parity-check matrix. The encoder generates auxiliary bits from the information bits, and the transmitter punctures the auxiliary bits while transmitting the information bits, thereby preserving a shape of the information bits.
Abstract:
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-HARQ) extension while maintaining good floor performance, a high-level of parallelism to deliver high throughout performance, and a low description complexity.
Abstract:
Certain aspects of the present disclosure relate to methods and apparatus for optimizing delivery of a transport block (TB) using code rate dependent segmentation.