H03M13/251

Methods for encoding and decoding sparse code and orthogonal sparse superposition code

The inventive concept relates to method for encoding and decoding sparse codes and orthogonal sparse superposition codes. A sparse code encoding method which is to be performed by an encoding apparatus, according to an embodiment of the inventive concept may include selecting an index set that is a part of a code block by using an information bit, and mapping a codeword less than a preset size to the selected index set.

Latency minimization for retransmissions in communications systems with multi-level coding and multi-level sequential demodulation and decoding and code block grouping from different component codes

Methods, systems, and devices for wireless communications employing multi-level coding with set partitioning on transmitting side and multi-level sequential decoding on the receiving side for latency minimization are described. In some systems, a transmitting device may transmit a code block group (CBG) to a receiving device including a first set of code blocks associated with a first decoding level and a second set of code blocks associated with a second decoding level. The receiving device may unsuccessfully decode one or more code blocks of the first set or the second set of code blocks and transmit a feedback message to the transmitting device. The transmitting device may determine that the data to be communicated via the CBG is latency-sensitive data and, as such, determine to retransmit both the first set and the second set of code blocks to the receiving device in response to receiving the feedback message.

Adaptive selection and efficient storage of information bit locations for polar codes

According to certain embodiments, a method for use in a transmitter comprises selecting an information set or sequence of information sets for polar encoding. The information set or sequence of information sets are selected from a plurality of information sets based on one or more system parameters and/or one or more link measurements. The method further comprises performing polar encoding for a plurality of data bits to yield encoded data. The polar encoding is performed according to the selected information set or sequence of information sets. The method further comprises transmitting the encoded data to a receiver.

High throughput and area efficient partial parallel hard decoder for low-density parity-check codes
11381254 · 2022-07-05 · ·

A hard decoder includes an input data handler that receives and rearranges a low-density parity-check (LDPC) codeword, and a variable node updater that iteratively updates the rearranged LDPC codeword to generate an updated LDPC codeword during each decoding iteration of the rearranged LDPC codeword. The hard decoder further includes a syndrome generator that generates a syndrome vector associated with the updated LDPC codeword of each decoding iteration. During each decoding iteration, the rearranged LDPC codeword is updated based on a threshold value and the syndrome vector associated with the updated LDPC codeword of a previous decoding iteration and a validity of the updated LDPC codeword of the previous decoding iteration. The hard decoder further includes an output data handler that extracts a message from the updated LDPC codeword that is valid and outputs the extracted message.

TECHNOLOGIES FOR APPLYING A REDUNDANCY ENCODING SCHEME TO SEGMENTED NETWORK PACKETS

Technologies for applying a redundancy encoding scheme to segmented portions of a data block include an endpoint computing device communicatively coupled to a destination computing device. The endpoint computing device is configured to divide a block of data into a plurality of data segments as a function of a transmit window size and a redundancy encoding scheme, and generate redundant data usable to reconstruct each of the plurality of data segments. The endpoint computing device is additionally configured to format a series of network packets that each includes a data segment of the plurality of data segments and generated redundant data for at least one other data segment of the plurality of data segments. Further, the endpoint computing device is configured to transport each of the series of network packets to a destination computing device. Other embodiments are described herein.

CODING AND MODULATION METHOD, DEMODULATION AND DECODING METHOD, APPARATUS, AND DEVICE

Embodiments of this application provide a coding and modulation method, a demodulation and decoding method, an apparatus, and a device. The coding and modulation method includes obtaining K to-be-encoded bits and a modulation scheme, and coding the K to-be-encoded bits, based on M bit levels of the modulation scheme, to obtain M′ code blocks, where M′<M, a code length of an i.sup.th code block is N.sub.i, N.sub.i=M.sub.i*N, M.sub.i is a quantity of bit levels corresponding to the i.sup.th code block, N is a symbol block length, and 1≤i≤M′. The disclosed method further includes modulating the M′ code blocks, according to a mapping relationship between the M′ code blocks and the M bit levels, to obtain and output a modulated symbol sequence, where a code block whose code length is M.sub.i*N corresponds to M.sub.i bit levels in the mapping relationship.

METHODS AND APPARATUS FOR ENCODING AND DECODING OF DATA USING CONCATENATED POLARIZATION ADJUSTED CONVOLUTIONAL CODES
20220103291 · 2022-03-31 ·

An encoder receives a concatenated encoder input block d, splits d into an outer code input array a, and encodes a using outer codes to generate an outer code output array b. The encoder generates, from b, a concatenated code output array x using a layered polarization adjusted convolutional (LPAC) code. A decoder counts layers and carries out an inner decoding operation for a layered polarization adjusted convolutional (LPAC) code to generate an inner decoder decision {tilde over (b)}.sub.i from a concatenated decoder input array y and a cumulative decision feedback ({circumflex over (b)}.sub.1, {circumflex over (b)}.sub.2, . . . , {circumflex over (b)}.sub.i−1). The decoder carries out an outer decoding operation to generate from {tilde over (b)}.sub.i an outer decoder decision â.sub.i, and carries out a reencoding operation to generate a decision feedback {circumflex over (b)}.sub.i from â.sub.i, where the number of layers is an integer greater than one, with a concatenated decoder output block {circumflex over (d)} being generated from outer decoder decisions.

LATENCY MINIMIZATION FOR RETRANSMISSIONS IN COMMUNICATIONS SYSTEMS WITH MULTI-LEVEL CODING AND MULTI-LEVEL SEQUENTIAL DEMODULATION AND DECODING AND CODE BLOCK GROUPING FROM DIFFERENT COMPONENT CODES
20220069941 · 2022-03-03 ·

Methods, systems, and devices for wireless communications employing multi-level coding with set partitioning on transmitting side and multi-level sequential decoding on the receiving side for latency minimization are described. In some systems, a transmitting device may transmit a code block group (CBG) to a receiving device including a first set of code blocks associated with a first decoding level and a second set of code blocks associated with a second decoding level. The receiving device may unsuccessfully decode one or more code blocks of the first set or the second set of code blocks and transmit a feedback message to the transmitting device. The transmitting device may determine that the data to be communicated via the CBG is latency-sensitive data and, as such, determine to retransmit both the first set and the second set of code blocks to the receiving device in response to receiving the feedback message.

METHODS AND DEVICES FOR RATE ADAPTIVE FORWARD ERROR CORRECTION USING A FLEXIBLE IRREGULAR ERROR CORRECTING CODE
20220052712 · 2022-02-17 ·

Methods and devices for performing rate adaptive forward error correction using a flexible irregular error-correcting code, such as a staircase code. Each codeword of the ECC uses one of two or more different encodings, each encoding having a different number of parity bits. By adjusting the proportions of codewords of each encoding included in a data block, the FEC overhead can be finely adjusted, achieving flexible levels of FEC overhead in response to increased or decreased noise or perturbations in a communication channel. Three types of flexible irregular zipper codes are described: general zipper codes, staircase codes, and oFEC codes.

Techniques for improved erasure coding in distributed storage systems

A system and method for erasure coding. The method includes distributing a plurality of data chunks according to a mirroring scheme, wherein the plurality of data chunks is distributed as a plurality of rows among a plurality of non-volatile memory (NVM) nodes, wherein the mirroring scheme defines a plurality of groups, each group including a subset of the plurality of data chunks, wherein each data chunk in a group has a role corresponding to a relative position of the data chunk within the group, wherein data chunks included in the plurality of groups having the same relative positions within their respective groups have the same role, wherein each row of the plurality of rows includes at least one summation data chunk that is a function of at least one data chunk included in the row and of at least one extra data chunk included in at least one other row.