H03M13/00

ROW ORTHOGONALITY IN LDPC RATE COMPATIBLE DESIGN
20230030277 · 2023-02-02 ·

Certain aspects of the present disclosure generally relate to methods and apparatus for decoding low-density parity check (LDPC) codes, for example, using a parity check matrix having full row-orthogonality. An exemplary method for performing low-density parity-check (LDPC) decoding includes receiving soft bits associated to an LDPC codeword and performing LDPC decoding of the soft bits using a parity check matrix, wherein each row of the parity check matrix corresponds to a lifted parity check of a lifted LDPC code, at least two columns of the parity check matrix correspond to punctured variable nodes of the lifted LDPC code, and the parity check matrix has row orthogonality between each pair of consecutive rows that are below a row to which the at least two punctured variable nodes are both connected.

DECODING METHOD AND APPARATUS, NETWORK DEVICE, AND STORAGE METHOD
20230031031 · 2023-02-02 ·

A decoding method and apparatus, a network device, and a storage medium are provided. The method includes: receiving data before de-interleaving and soft bit encoding locations; dividing the data before de-interleaving to obtain first data banks; acquiring punctured data, and obtaining second data banks according to the punctured data, wherein the data before de-interleaving and the punctured data are determined in encoded data according to the soft bit encoding locations; and performing decoding according to the soft bit encoding locations, the first data banks and the second data banks, so as to obtain decoded data.

Method and apparatus for channel encoding and decoding in a communication system using a low-density parity check code

An apparatus is provided for channel encoding in a communication system using an LDPC code. The apparatus includes at least one processor configured to encode input bits using a Bose-Chaudhuri-Hocquenghem (BCH) code, shorten one or more bits of the encoded input bits according to a number of bit groups to be shortened and an order among a plurality of orders according to which the bit groups are shortened, wherein the number of bit groups to be shortened is based on a number of bits to be shortened which is based on a number of the encoded input bits, encode information bits including the encoded input bits and the shortened one or more bits, using an LDPC code to generate parity bits, and puncture one or more bits in the parity bits based on a puncturing parameter among puncturing parameters; and a transmitter configured to transmit a signal that is generated from the encoded information bits based on the punctured one or more bits. The plurality of orders are based on the puncturing parameters and include a first order and a second order that is different from the first order.

SYSTEMS AND METHODS FOR TRANSITION ENCODING WITH PROTECTED KEY
20230036390 · 2023-02-02 ·

A method for encoding may include receiving, at an encoder, a series of data bits, performing, at the encoder, first transition encoding on the data bits to generate an encoded series of data bits based on a key, performing, at the encoder, protection encoding on the key to generate key protection data, performing, at the encoder, second transition encoding on the key protection data to generate encoded key protection data, and transmitting an encoded series of transmission bits to a receiver, the encoded series of transmission bits including the encoded series of data bits and the encoded key protection data.

Method and apparatus for fast decoding linear code based on soft decision

Disclosed are a method and an apparatus for fast decoding a linear code based on soft decision. The method may comprise sorting received signals in a magnitude order to obtain sorted signals; obtaining hard decision signals by performing hard decision on the sorted signals; obtaining upper signals corresponding to MRBs from the hard decision signals; obtaining a permuted and corrected codeword candidate using the upper signals and an error vector according to a current order; calculating a cost for the current order using a cost function; determining the permuted and corrected codeword candidate as a permuted and corrected codeword according to a result of comparing the calculated cost with a minimum cost; and determining a predefined speeding condition.

TRANSMITTING DATA BETWEEN REGIONS OF VARYING SAFETY INTEGRITY LEVELS IN A SYSTEM ON A CHIP

In various examples, a system includes a memory operating within a first risk level and circuitry operating within a second risk level that indicates more risk than the first risk level. The circuitry reads and/or writes data to a first memory address within the memory, and reads and/or writes an error detection code to a second memory address within the memory.

Maintaining synchronization in wireless networks
11489604 · 2022-11-01 · ·

The present disclosure discloses a system including a controller and a plurality of radio heads communicatively coupled to the controller. The controller transmits a synchronization signal to each of the radio heads to synchronize the local clocks in the radio heads to a master clock in the controller. The controller also transmits packets to the radio heads. Each of the radio heads includes a deframer. For a radio head, upon detecting that a received packet from the controller includes an error, the deframer alters the received packet to maintain the synchronization between the controller and the radio head and transmits data contained within the altered packet.

Transmission device, transmission method, reception device, and reception method
11489545 · 2022-11-01 · ·

The present technology relates to a transmission device, a transmission method, a reception device, and a reception method for securing good communication quality in data transmission using an LDPC code. The LDPC coding is performed on the basis of the parity check matrix of the LDPC code with the code length N of 17280 bits and the coding rate r of 7/16 or 8/16. The LDPC code includes information bits and parity bits, and the parity check matrix includes an information matrix portion corresponding to the information bits and a parity matrix portion corresponding to the parity bits. The information matrix portion is represented by a parity check matrix initial value table, and the parity check matrix initial value table is a table representing positions of elements of 1 of the information matrix for every 360 columns. The present technology can be applied to, for example, data transmission using an LDPC code.

Control Information for a Wirelessly-Transmitted Data Stream

Control information for configuring an audiovisual device to present multimedia content according to a first service type may be generated. A method may include generating first control information for configuring an audiovisual device to decode a multimedia stream, generating first data that indicates a structure of the first control information, and transmitting the first data and the first control information. The first control information may be generated according to a first protocol version. Second data and second control information may be similarly generated and transmitted according to a second protocol version. Disclosed techniques may facilitate receiving devices to determine whether they support received wireless transmissions and decode the transmissions based on the control information.

CYCLIC REDUNDANCY CHECK, CRC,DECODING USING THE INVERSE CRC GENERATOR POLYNOMIAL
20220352901 · 2022-11-03 · ·

A cyclic redundancy check, CRC, decoder circuit having a K-bit input bit sequence, s, comprising information bits and CRC bits; and at least one processor (P) configured to perform a CRC decode computation and configured to: use an inverse of a predefined CRC generator polynomial that encoded the K-bit input bit sequence, s, to produce a data set; compute a CRC syndrome from the data set; and determine whether the CRC syndrome contains any one-valued bits indicative of a CRC error. An LUT stores one or more rows of a CRC generator matrix (G) generated from the inverse of the predefined CRC generator polynomial. A set of mod(−K,P) zero-valued filler bits are appended to an end of the K-bit input bit sequence, wherein an order of the rows in the CRC generator matrix (G) is reversed and aligned with the input bits of the input stream.