摘要:
An apparatus and method for transmitting and receiving data in a wireless communication is provided. The method includes Low Density Parity Check (LDPC)-encoding LDPC information bits to generate a codeword, determining a number (Npunc) of bits to be punctured in parity bits of the codeword, determining a number (Npunc—group) of parity bit groups in which all bits are punctured, and puncturing the all bits within 0th to (Npunc—group−1)th parity bit groups indicated by a puncturing pattern, wherein the puncturing pattern is defined as an order of the parity bit groups defined as 29, 45, 43, 27, 32, 35, 40, 38, 0, 19, 8, 16, 41, 4, 26, 36, 30, 2, 13, 42, 46, 24, 37, 1, 33, 11, 44, 28, 20, 9, 34, 3, 17, 6, 21, 14, 23, 7, 22, 47, 5, 10, 12, 15, 18, 25, 31 and 39.
摘要:
A custom decoding algorithm is introduced, in connection with a corresponding decoding structure, to resolve many complexity and large memory requirements of known decoders. A system. A variable node forms a confidence vector of four components, one component for each state of a memory cell, and passes the current primary component (e.g., the largest) to one or more check nodes. The check nodes calculate a temporary component and corresponding index based on all components received from the variable nodes, which they pass back to the respective variable nodes. The variable node updates the confidence vector based on the temporary nodes received from respective check nodes, and determines the correct state for corresponding memory cell based on which component in the confidence vector is currently the primary component.
摘要:
An apparatus and method for transmitting and receiving data in a wireless communication is provided. The method includes Low Density Parity Check (LDPC)-encoding LDPC information bits to generate a codeword, determining a number (Npunc) of bits to be punctured in parity bits of the codeword, determining a number (Npunc—group) of parity bit groups in which all bits are punctured, and puncturing the all bits within 0th to (Npunc—group−1)th parity bit groups indicated by a puncturing pattern, wherein the puncturing pattern is defined as an order of the parity bit groups defined as 29, 45, 43, 27, 32, 35, 40, 38, 0, 19, 8, 16, 41, 4, 26, 36, 30, 2, 13, 42, 46, 24, 37, 1, 33, 11, 44, 28, 20, 9, 34, 3, 17, 6, 21, 14, 23, 7, 22, 47, 5, 10, 12, 15, 18, 25, 31 and 39.
摘要:
A low-density parity check (LDPC) code decoding method may be provided. The LDPC code decoding method may linearize or perform step-approximation on a natural logarithm hyperbolic cosine function included in a check node updating equation of a sum-product algorithm used for decoding an LDPC code, and may convert the linearized function to correspond to a check node updating equation of a min-sum algorithm.
摘要:
An apparatus and method for transmitting and receiving data in a wireless communication is provided. The method includes determining a number of zero-padding bits, determining a number (Npad) of bit groups in which all bits are padded with zeros, padding the all bits within 0th to (Npad−1)th bit groups indicated by a shortening pattern with zeros, mapping information bits to bit positions which are not padded in Bose Chaudhuri Hocquenghem (BCH) information bits, BCH encoding the BCH information bits to generate Low Density Parity Check (LDPC) information bits, and LDPC encoding the LDPC information bits to generate a zero-padded codeword, wherein the shortening pattern is defined as an order of bit groups defined as 6, 5, 4, 9, 3, 2, 1, 8, 0, 7, 10 and 11.
摘要:
A custom decoding algorithm is introduced, in connection with a corresponding decoding structure, to resolve many complexity and large memory requirements of known decoders. A system. A variable node forms a confidence vector of four components, one component for each state of a memory cell, and passes the current primary component (e.g., the largest) to one or more check nodes. The check nodes calculate a temporary component and corresponding index based on all components received from the variable nodes, which they pass back to the respective variable nodes. The variable node updates the confidence vector based on the temporary nodes received from respective check nodes, and determines the correct state for corresponding memory cell based on which component in the confidence vector is currently the primary component.
摘要:
A low-density parity check (LDPC) code decoding method may be provided. The LDPC code decoding method may linearize or perform step-approximation on a natural logarithm hyperbolic cosine function included in a check node updating equation of a sum-product algorithm used for decoding an LDPC code, and may convert the linearized function to correspond to a check node updating equation of a min-sum algorithm.
摘要:
A method and system to improve the performance and/or reliability of a solid-state drive (SSD). In one embodiment of the invention, the SSD has logic compress a block of data to be stored in the SSD. If it is not possible to compress the block of data below the threshold, the SSD stores the block of data without any compression. If it is possible to compress the block of data below the threshold, the SSD compresses the block of data and stores the compressed data in the SSD. In one embodiment of the invention, the SSD has logic to dynamically adjust or select the strength of the error correcting code of the data that is stored in the SSD. In another embodiment of the invention, the SSD has logic to provide intra-page XOR protection of the data in the page.
摘要:
Overlapping sub-matrix based LDPC (Low Density Parity Check) decoder. Novel decoding approach is presented, by which, updated bit edge messages corresponding to a sub-matrix of an LDPC matrix are immediately employed for updating of the check edge messages corresponding to that sub-matrix without requiring storing the bit edge messages; also updated check edge messages corresponding to a sub-matrix of the LDPC matrix are immediately employed for updating of the bit edge messages corresponding to that sub-matrix without requiring storing the check edge messages. Using this approach, twice as many decoding iterations can be performed in a given time period when compared to a system that performs updating of all check edge messages for the entire LDPC matrix, then updating of all bit edge messages for the entire LDPC matrix, and so on. When performing this overlapping approach in conjunction with min-sum processing, significant memory savings can also be achieved.
摘要:
An error correction coding method using a low-density parity-check code includes: dividing an information bit sequence to be processed for error correction coding, into (m−r) pieces of first blocks each comprising a bit sequence having a length n and r pieces of second blocks comprising respective bit sequences having lengths k1, k2, . . . , kr; a first arithmetic operation for performing polynomial multiplication on the (m−r) pieces of first blocks, and outputting r pieces of bit sequences having a length n; and a second arithmetic operation for performing a polynomial division and a polynomial multiplication on the r pieces of second blocks and r pieces of operation results of the first arithmetic operation, and outputting a bit sequence including redundant bit sequences having respective lengths n−k1, n−k2, . . . , n−kr.