Abstract: Layered decoding of low-density parity check (LDPC) codes are decoded by selecting one or more of a plurality of check nodes (CNs) based on degree in priority, where the degree in priority for each of the plurality of CNs is based on a number of variable nodes (VNs) connected to the respective CN. Layered decoding for an LDPC code is performed based on applying a sum-product algorithm and an approximated sum-product algorithm. The sum-product algorithm is applied to at least some of the selected one or more CNs among the plurality of CNs. The approximated sum-product algorithm is applied to one or more remaining CNs, other than the selected one or more CNs, among the plurality of CNs.

Abstract: Decoding low-density parity check (LDPC) codes in a communication system includes identifying a set of indices of variable nodes (VNs) having log-likelihood ratios (LLRs) greater than a threshold, Indices of parity check matrix (PCM) rows are divided into subsets each including a same number of non-zero row elements at indices of punctured VNs. The subsets of the indices of the PCM rows are ordered based on the number of non-zero row elements at the indices of the punctured VNs. A schedule is generated based on the ordered subsets of the indices of the PCM rows. Layered LDPC decoding is performed according to the schedule.

Abstract: Decoding low-density parity check (LDPC) codes in a communication system includes identifying a first set of indices of variable nodes (VNs) having log-likelihood ratios (LLRs) greater than a threshold. A second set of indices that includes the first set of indices, indices of shortening VNs, and indices of single parity check (SPC) VNs is created. LDPC decoding proceeds by iteratively updating check-to-variable (C2V) messages and variable-to-check (V2C) messages, with updates for a VN being skipped when an index of the respective VN belongs to the second set of indices.

Abstract: Error-correcting performance of polar codes is improved by assigning parity check bits to small, reliable indices. Zeros are assigned to message indices not among a most-reliable set of the message indices, information bits and parity check bits are assigned to the most-reliable set of the message indices, with the parity check bits generated on the information bits assigned to the smallest of the most-reliable set and then assigned to the smallest indices of the most-reliable set that follow the information bits on which the parity check pits are generated. During successive cancellation list decoding, the parity check bits allow error events to be promptly corrected during decoding.

Abstract: An electronic apparatus includes a processor configured to construct a set of equivalent puncturing pattern (EPP) sequences for polar-coded HARQ transmissions. The set of EPP sequences include an initial sequence and a set of permuted sequences. Each sequence includes elements representing a sub-block puncturing pattern. The processor is also configured to select an EPP sequence from the set of EPP sequences. The electronic apparatus also includes a transceiver operatively coupled to the processor. The transceiver is configured to transmit a polar-coded HARQ transmission. The polar-coded HARQ transmission is punctured according to the selected EPP sequence.

Abstract: Error-correcting performance of polar codes is improved by assigning parity check bits to small, reliable indices. Zeros are assigned to message indices not among a most-reliable set of the message indices, information bits and parity check bits are assigned to the most-reliable set of the message indices, with the parity check bits generated on the information bits assigned to the smallest of the most-reliable set and then assigned to the smallest indices of the most-reliable set that follow the information bits on which the parity check pits are generated. During successive cancellation list decoding, the parity check bits allow error events to be promptly corrected during decoding.

Abstract: Methods and apparatuses for UE initiated reporting in a wireless communication system. A method of operating a UE includes: transmitting UE capability information supporting a FTN; generating data modulation symbols including a set of zero symbols, wherein the data modulation symbols are up-sampled or zero-padded; performing, to obtain DFT output signal, a DFT spread operation on the up-sampled or the zero-padded data modulation symbols; performing, based on a target FTN compression rate and a SC allocation, a discarding or a down sampling operation on the DFT output signal, wherein the discarding or the down sampling operation generates a subset of DFT symbols; mapping the subset of DFT symbols to a set of SCs; and performing an IFFT operation on the subset of DFT symbols to obtain an FTN-DFT-S-OFDM signal including the target FTN compression rate comprising a positive rational number smaller than one.

Abstract: Error-correcting performance of polar codes is improved by reducing low-weight codewords through partial repetition. A threshold for weights of rows with indices belonging to an information set is obtained in a polar coding generator matrix, and a smallest index of the information set with a weight less than or equal to the threshold is obtained. A first candidate index is selected based on a frozen index that is larger than the smallest index, and a second candidate index is selected based on information indices that are smaller than a largest candidate frozen index and that corresponds to a weight less than or equal to the threshold. Support of the first candidate index is determined to be distinct from support of the second candidate index in at least two elements, based on which at least one bit from the second candidate index is repeated to the first candidate index.

Abstract: Error-correcting performance of polarization-adjusted convolutional codes is improved by refreezing low weight indices. For information bits (k), where k is a positive integer, a plurality of convolutionally encoded bits (n) are generated by performing a convolutional encoding operation on the plurality of information bits and a plurality of frozen bits (n?k), where n is a positive integer. A refreezing operation is performed on the convolutionally encoded bits, including dynamically assigning zeros to selected frozen indices such that a number of low weight codewords is reduced. Polar encoded bits are generated by performing a polar encoding operation on an output of the refreezing operation, providing polar encoded bits for transmission or storage.