Abstract: Embodiments herein provide data recovery techniques and configurations for solid state memory devices. For example, a method includes identifying a hard error associated with a cell of a solid state memory device, providing a location of the cell having the identified hard error to a decoder to recover data originally programmed to the cell, and recovering the data originally programmed to the cell using the decoder. Other embodiments may be described and/or claimed.

Abstract: Power-saving and area-efficient BCH coding systems are provided that employ hybrid decoder architectures. The BCH decoder architectures comprise both special-purpose hardware and firmware, thereby taking advantage of both the speed of special-purpose hardware and the energy-efficiency of firmware. In particular, the error correction capabilities of the BCH decoders provided herein are split between a hardware component designed to correct a single error and a firmware component designed to correct the remaining errors. In this manner, firmware operation is bypassed in situations where only one error is present and the complexity of the necessary hardware is significantly reduced.

Abstract: In a symbol mapping method, transmission data is encoded to output information bits and redundancy bits. The information bits and the redundancy bits are mapped to a symbol according to a first mapping scheme at a first transmission, and the information bits and the redundancy bits are mapped to a symbol according to a second mapping scheme at a second transmission.

Abstract: The subject technology provides a decoding solution that supports multiple choices of code rates. A decoder may be configured to receive a selected code rate from a plurality of code rates. On the selection of the code rate, the decoder may determine a circulant size based on the code rate, and, on receiving the codeword, update, during one or more parity-check operations, a number of confidence values proportional to the circulant size in each of a plurality of memory units, each number of confidence values corresponding to a portion of the codeword.

Abstract: Systems, devices, and methods are disclosed for a novel edge memory architecture. An architecture is described wherein the extrinsic information typically stored inside the edge memory is reformatted. Instead of storing the extrinsic information for every edge, the novel edge memory stores a set of possible extrinsic information values for a check node in a “value memory.” The edge memory also stores an index for each edge in a second, “index memory,” identifying which value stored in the value memory applies to each respective edge.

Abstract: An error correction apparatus comprises an input for receiving data. The received data includes error-check data. The apparatus also includes a processing resource arranged to calculate parity check data. A data store is coupled to the processing resource for storing look-up data for identifying, when in use, a location of an error in the received data. The look-up data is a compressed form of indexed error location data.

Abstract: A device for protecting a data word against data corruption includes first and second determiners. The first determiner is configured to determine an error correction code cvA associated with a data word a so that cvA=aAT, with A being a generator matrix of a linear systematic base correction code, the columns of which enable performance of an x-bit error correction on replica of the data word a and the associated error correction code cvA. The second determiner is configured to determine an extended error correction code cvE so that (cvA|cvE)=aFT, with F being an extended generator matrix F = ( A E ) of an extended linear systematic correction code, the columns of which enable, using the extension error correction code cvE, performance of an y-bit error correction, with y>x, on a replica of the data word a and the associated error correction code cvA.

Abstract: Efficient secure password protocols are constructed that remain secure against offline dictionary attacks even when a large, but bounded, part of the storage of a server responsible for password verification is retrieved by an adversary through a remote or local connection. A registration algorithm and a verification algorithm accomplish the goal of defeating a dictionary attack. A password protocol where a server, on input of a login and a password, carefully selects several locations from the password files, properly combines their content according to some special function, and stores the result of this function as a tag that can be associated with this password and used in a verification phase to verify access by users.

Abstract: According to exemplary embodiments, a system, method, and computer program product are provided for BER-based wear leveling in a SSD. A block-level BER value for a block in the SSD is determined. An adjusted PE cycle count for the block is incremented or decremented based on the block-level BER value. Wear leveling is then performed in the SSD based on the adjusted PE cycle count.

Abstract: In one embodiment, the present invention includes an error correction method. The error correction method comprises receiving a digital signal and processing the digital signal to perform a first error correction. The first error correction includes a first correction for data insertions or deletions and a first correction of data errors to generate a reference signal. The reference signal corresponds to the digital signal having been corrected to a first correction accuracy. The digital signal and the reference signal may be processed to perform a second correction for data insertions or deletions to generate a synchronized signal. The second correction of the digital signal is based on the reference signal, and the correction accuracy of the second correction is more accurate than the first correction accuracy.

Abstract: A data modulation method and a data error correction method are provided. The data modulation method includes generating a channel sequence for an input sequence, determining whether or not the channel sequence violates a Run Length Limit (RLL) constraint, and performing, when the channel sequence violates the RLL constraint, bit flip at a position prior to a position at which the RLL constraint is violated among positions of bits included in the channel sequence. The data error correction method includes detecting an error bit of received data using a parity check matrix, determining whether or not the error bit is an error caused by bit flip, and correcting the error bit when the error bit is an error caused by bit flip for applying an RLL constraint.

Abstract: Systems and methods are provided for correcting absorb sets and near absorb sets in the (2048, 1723) LDPC code used in 10 GBase-T transmission systems. Absorb sets and near absorb sets correspond to error patterns that, due to the structure and imperfections of the LDPC code, cannot easily be corrected using standard correction methods. To correct these error patterns, a set of failed syndrome checks associated with the error pattern can be identified, and the 4, 8, 12, or 16 error patterns associated with the failed syndrome checks can be determined. The codeword may then be corrected based on the error pattern that most likely occurred.

Abstract: According to some embodiments, a turbo decoder configured for High-Speed Packet Access (HSPA) and Long Term Evolution (LTE) is provided, comprising: a plurality of maximum a posteriori (MAP) engines; a plurality of extrinsic memory banks accessible by a MAP engine of the plurality of MAP engines; and wherein when the turbo decoder is operating in HSDPA mode the plurality of extrinsic memory banks is configured such that during a first half of a decoding iteration, the MAP engine is able to read a first dataset from and write second dataset to the plurality of extrinsic memory banks in natural row and column order, and during a second half of the decoding iteration, the MAP engine is able to read a third dataset from and write a fourth dataset to the plurality of extrinsic memory banks in a predetermined row and column order in accordance with an interleaver table using a read column buffer and a write column buffer.

Abstract: In one embodiment, an LDPC decoder attempts to recover an originally-encoded LDPC codeword based on a set of channel soft-output values. If the decoder observes a trapping set, then the decoder compares the observed trapping set to known trapping sets stored in a trapping-set database to determine whether or not the observed trapping set is a known trapping set. If the observed trapping set is not known, then the decoder selects a most-dominant trapping set from the trapping-set database and identifies the locations of erroneous bit nodes in the selected trapping set. Then, the decoder adjusts the channel soft-output values corresponding to the identified erroneous bit nodes. Adjustment is performed by inverting some or all of the hard-decision bits of the corresponding channel soft-output values and setting the confidence value of each corresponding channel soft-output value to maximum. Decoding is then restarted using the adjusted channel soft-output values.

Abstract: In iterative decoding, a data recovery scheme corrects for corrupted or defective data by incorporating results from a previous decoding iteration. In one embodiment, a final multiplexer selects between the final detector output or a previous detector output based on the absence or presence of defective data. In another embodiment, the branch metrics for the defective data, which otherwise would be combined with a priori LLRs from an outer decoder of a prior stage, are ignored so that the a priori LLRs themselves are used alone. The two embodiments can be used together.

Abstract: Certain embodiments of the present invention are methods for the organization of trapping-set profiles in ROM and for the searching of those profiles during (LDPC) list decoding. Profiles are ranked by dominance, i.e., by their impact on the error-floor characteristics of a decoder. More-dominant trapping-set profiles contain information about both unsatisfied check nodes (USCs) and mis-satisfied check nodes (MSCs), while less-dominant trapping-set profiles contain information about only USCs. Trapping-set profile information is organized into a number of linked, hierarchical data tables which allow for the rapid location and retrieval of most-dominant matching trapping-set profiles using a pointer-chase search.

Abstract: The disclosure is directed to a multi-channel encoder. The multi-channel encoder is configured to generate an encoded data stream. The multi-channel encoder includes a plurality of channel encoders, and a processor configured to allocate time slots in the encoded data stream to each of the channel encoders to vary the rate of data provided by each of the channel encoders into the encoded data stream.

Abstract: Methods and apparatus are provided for more efficiently implementing error checking code circuitry on a programmable chip. In one example, Cyclic Redundancy Check (CRC) exclusive OR (XOR) circuitry is decomposed to allow efficient implementation on lookup tables (LUTs) of various sizes on a device. XOR cancellation factoring is used to break up wide CRC XORs into blocks that fit in various LUTs while maintaining focus on minimizing logic depth and logic area. Simulated annealing is used to further reduce logic area cost.

Abstract: In a particular embodiment, at a controller coupled to a memory array, a method includes receiving an indication that a first group of data bits read from the memory array includes errors that are uncorrectable by an error correction coding (ECC) engine. A count of the first group of data bits having a particular bit value may be compared to a prior count of data bits having the particular bit value. In response to determining that the count exceeds the prior count, a bit of the first group of data bits that has the particular bit value and that corresponds to a same memory cell as a corrected data bit of a second group of data bits is identified. A value of the identified bit of the first group may be changed to generate an adjusted group of data bits. The adjusted group of data bits may be provided to the ECC engine.

Abstract: A method and apparatus are provided for generating a parity check matrix used to generate a linear block code in a communication system. The method includes determining a basic parameter of a second parity check matrix satisfying a rule predetermined with respect to a given first parity check matrix, generating a submatrix corresponding to a parity part of the second parity check matrix, using the basic parameter; and generating a submatrix corresponding to an information word part of the second parity check matrix, using the first parity check matrix and the basic parameter.

Abstract: A method and communication system for selecting a mode for encoding data for transmission in a wireless communication channel between a transmit unit and a receive unit. The data is initially transmitted in an initial mode and the selection of the subsequent mode is based on a selection of first-order and second-order statistical parameters of short-term and long-term quality parameters. Suitable short-term quality parameters include signal-to-interference and noise ratio (SINR), signal-to-noise ratio (SNR), power level and suitable long-term quality parameters include error rates such as bit error rate (BER) and packet error rate (PER). The method of the invention can be employed in Multiple Input Multiple Output (MIMO), Multiple Input Single Output (MISO), Single Input Single Output (SISO) and Single Input Multiple Output (SIMO) communication systems to make subsequent mode selection faster and more efficient.

Abstract: A method and system are provided to detect and correct errors in the Interlaken block code overhead bits. Specifically, a method is provided for determining the original transmitted information with a very high probability of correct interpretation. These approaches can also characterized by their minimal complexity. Further, such a method can operate on the received information in a manner that does not require consideration of special cases. Also, the method does not require the source to send any extra information or alter its current behavior in any way. Thus, the approaches described herein are compatible with all existing Interlaken sources and can provide immediate benefits.

Abstract: A search sphere-based linear block decoder is provided. A received vector, v, is decoded by computing a syndrome vector, S, corresponding to the received vector, v; (S=vH); obtaining a set of all possible error vectors, e, corresponding to the computed syndrome vector, S, wherein the set of all possible error vectors, e, is obtained from a pre-computed error table and has a specified maximum number of bit errors; calculating a set of all possible received vectors, x, based on the received vector, v, and the set of all possible error vectors, e; determining a k-bit code-vector x that is closest to the received vector, v; and determining an n-bit data-vector, d, associated with the k-bit code-vector x. The pre-computed error table can be generated by multiplying all possible error vectors by a Syndrome Matrix, to obtain all possible syndrome vectors associated with all possible error vectors.

Abstract: Asset data is loaded or entered into an asset management system using a Web service or a manual load, or both. The asset data may be discovered using a third-party asset discovery application. As a first loading option, an inbound asynchronous Web service is used to process the discovered data. As a second loading option, exposed tables are used for loading discovered data and processing through a run control. These entry points provide for additional data validation and error handling of invalid data. They provide ways for data to enter the asset management system and can also streamline the data integration, the reconciliation processes, and additionally automatically address or fix specific exceptions.

Abstract: Systems and methodologies are described that facilitate automatically generating interleaved addresses during turbo decoding. An efficient recursive technique can be employed in which layers of nested loops enable the computation of a polynomial and a modular function given interleaved parameters “a” and “b” from a look up table. With the recursive technique, interleaved addresses can be generated, one interleaved address per clock cycle which can maintain turbo decoding performance.

Abstract: Methods and systems to identify a codeword associated with samples of a signal from spectral content of the samples, and to estimate a frequency offset from the spectral contents. The samples may correspond to a physical layer header of a data frame. Modulation may be removed from the samples in accordance with each of a plurality of modulation sequences, each sequence associated with a corresponding codeword. Power levels in spectral contents of the modulation-removed samples are examined to identify a peak power level indicative of a match between a modulation sequence and the samples. The corresponding codeword is identified as being associated with the header, and transmission parameters associated with the identified codeword are used to decode a corresponding frame. An estimated frequency offset may be determined from a frequency associated with the peak power level.

Abstract: Systems and methods are provided for correcting absorb sets and near absorb sets in the (2048, 1723) LDPC code used in 10GBase-T transmission systems. Absorb sets and near absorb sets correspond to error patterns that, due to the structure and imperfections of the LDPC code, cannot easily be corrected using standard correction methods. To correct these error patterns, a set of failed syndrome checks associated with the error pattern can be identified, and the 4, 8, 12, or 16 error patterns associated with the failed syndrome checks can be determined. The codeword may then be corrected based on the error pattern that most likely occurred.

Abstract: Power-saving and area-efficient BCH coding systems are provided that employ hybrid decoder architectures. The BCH decoder architectures comprise both special-purpose hardware and firmware, thereby taking advantage of both the speed of special-purpose hardware and the energy-efficiency of firmware. In particular, the error correction capabilities of the BCH decoders provided herein are split between a hardware component designed to correct a single error and a firmware component designed to correct the remaining errors. In this manner, firmware operation is bypassed in situations where only one error is present and the complexity of the necessary hardware is significantly reduced.

Abstract: The invention is directed to a method and apparatus for decoding encoded data symbols. The invention is also directed to corresponding encoding methods. The decoder arrangement comprises an input for receiving encoded data and an identifier associated with a coding scheme used to create said encoded data. A processor in the decoding arrangement determines from the identifier, a mapping between said encoded data and the original data. A decoder uses the mapping to extract the original data from the encoded data. The operation of the decoder is independent of the coding scheme used in the encoding process.

Abstract: A system and method are provided for creating codewords using common partial parity products. The method initially accepts an algorithm for creating p indexed parity bit positions, where the parity bit for each position is calculated from mathematical operations performed on bits from n indexed user word positions. A first group of parity bit positions is found, where the parity bit for each position in the first group is calculated using at least a first number of common mathematical operations. A second group of parity bit positions is found, where the parity bit for each position in the second group is calculated using at least a second number of common mathematical operations. The common mathematical operations are subtracted from the first and second group of parity bit position calculations, so that unique mathematical operations can be found, associated with each parity bit position calculation in the first and second group.

Abstract: In iterative decoding, a data recovery scheme corrects for corrupted or defective data by incorporating results from a previous decoding iteration. In one embodiment, a final multiplexer selects between the final detector output or a previous detector output based on the absence or presence of defective data. In another embodiment, the branch metrics for the defective data, which otherwise would be combined with a priori LLRs from an outer decoder of a prior stage, are ignored so that the a priori LLRs themselves are used alone. The two embodiments can be used together.

Abstract: Systems and methods for processing and decoding TCM/BCM-coded signal vectors. A multi-dimensional signal vector is received by, for example, a TCM or BCM decoder. The TCM/BCM decoder identifies the closest signal points in the signal constellation set, or “nearest neighbors,” for each dimension of the received signal vector. The TCM/BCM decoder then forms a test set that includes a plurality of multi-dimensional test vectors, where each dimension of each test vector is based on an identified nearest neighbor. In particular, each test point in the test set is based on a different combination of the nearest neighbors. The TCM/BCM decoder can compute branch metrics based on only the test points in the test set, and can make detection decisions using the computed branch metrics.

Abstract: The invention provides a method of decoding a decided signal received from a decision circuit to supply a decoded signal, said method comprising: a step of detecting a word of N bits in said received decided signal to supply a detected word; a step of selecting an admissible word of N bits in a dictionary of the error correction code used for encoding in accordance with a criterion of the shortest distance between said detected word and said selected admissible word; and a step of decoding a word of L bits constituting said decoded signal from said selected admissible word. According to the invention, the distance used in the selection step takes account of the relative reliabilities of 2K sequences of K bits, 0<K<N.

Abstract: Data bits stored in memory cells are recognized by an ECC generator as data bit strings in a first direction and data bit strings in a second direction such that each data bit string in the first direction and each data bit string in the second direction share one data bit in common. The ECC controller identifies a data bit string in the first direction having more than one data bit in error based on a respective correction code in the first direction and identifies a data bit string in the second direction having more than one data bit in error based on a respective correction code in the second direction, and causes the data bit shared by the identified data bit string in the first direction and the identified data bit string in the second direction to be changed.

Abstract: Error correction is tailored for the use of an ECC for correcting asymmetric errors with low magnitude in a data device, with minimal modifications to the conventional data device architecture. The technique permits error correction and data recovery to be performed with reduced-size error correcting code alphabets. For particular cases, the technique can reduce the problem of constructing codes for correcting limited magnitude asymmetric errors to the problem of constructing codes for symmetric errors over small alphabets. Also described are speed up techniques for reaching target data levels more quickly, using more aggressive memory programming operations.

Abstract: One embodiment of the present invention sets forth a technique for performing RAID-6 computations using simple arithmetic functions and two-dimensional table lookup operations. A set of threads within a multi-threaded processor are assigned to perform RAID-6 computations in parallel on a stripe of RAID-6 data. A set of lookup tables are stored within the multi-threaded processor for access by the threads in performing the RAID-6 computations. During normal operation of a related RAID-6 disk array, RAID-6 computations may be performed by the threads using a small set of simple arithmetic operations and a set of lookup operations to the lookup tables. Greater computational efficiency is gained by reducing the RAID-6 computations to simple operations that are performed efficiently on a multi-threaded processor, such as a graphics processing unit.

Abstract: Erasure information associated with a received group of encoded and interleaved data in a digital video broadcasting system is stored in a much compacted form. An erasure flag and an address of a last byte associated with the received group of encoded and interleaved data (a record) encapsulated in an MPE-FEC column will be stored in an erasure table. All bytes in the column preceding the last byte of the record will have the same erasure flag as the last byte. Erasure information deinterleaver 524 reads out the content of the erasure table (i.e., the erasure information) in a de-interleaving fashion; and the de-interleaved erasure information 525 are then applied with the de-interleaved coded signals 511 to an FEC decoder 526 to enhance the FEC decoding performance.

Abstract: Certain aspects of a method and system for interlocking data integrity for network adapters are disclosed. Aspects of one method may include executing a plurality of interlocking checks within a network adapter. Each interlocking check may comprise receiving a plurality of input check values associated with a plurality of input data packets corresponding to a first protocol. A plurality of check values may be generated which are associated with the plurality of input data packets and a plurality of output data packets corresponding to a second protocol. The data integrity of the plurality of input data packets and the plurality of output data packets may be validated based on one or more comparisons between one or more of the generated plurality of check values and one or more of the received plurality of input check values.

Abstract: A receiver (120) is configured to receive data over a communications link. A decapsulator (122) is coupled to the receiver and configured to create datagrams and erasure attributes associated with the datagrams. A decoder (124) is coupled to the decapsulator and configured to store the datagrams in a frame table (400) and to create codewords, the decoder storing the datagrams in table columns to create codewords in table rows, correcting the codewords, and configured to store the erasure attributes in an erasure table (552). The erasure table is characterized in that it comprises a plurality of entries (560), each of which is associated with a column of the frame table. Each entry is comprised of a plurality of elements (570).

Abstract: A maximum likelihood decoder creates a decoding target data string and provides error candidates that are effective for an error correction circuit. The decoder has a detector for creating a decoding target data string, and an error candidate extractor for extracting the bit positions of which likelihood of each bit shows a high probability of error as the error candidates of the decoding target data string based on the likelihood information from the detector. Since only the bit positions of which error probability is high are extracted as error candidates, a correction circuit can extract the error candidates in the sequence of the lower likelihood, and the number of times of sorting in the sequence of likelihood can be decreased.

Abstract: Additional routing information is added to a transaction packet without recalculating an ECRC by inserting the additional routing information at predetermined bit positions in the transaction packet known to have predetermined bit values. The modified transaction packet can then be routed using the additional routing information. The predetermined bit values can subsequently be reinstated at the predetermined bit positions in the packet.

Abstract: Provided is an apparatus and method for decoding a Low Density Parity Check (LDPC) code based on prototype parity check matrixes. The apparatus, includes: a parity check matrix selecting means for determining multiple prototype parity check matrixes according to a sub-matrix size and a parallelization figure for processing the parity check matrix; a bit input means for receiving a log likelihood probability value for input bit according to the sub-matrix size and the parallelization figure; a check matrix process means for sequentially performing a partial parallel process on the parity check matrix based on the received log likelihood probability value and the determined multiple prototype parity check matrixes; and a bit process means for determining a bit level based on the partial-parallel processed parity check matrix value and recovering the input bit according to the sub-matrix size and the parallelization figure.

Abstract: A method for detecting topology changes of a computer network, includes the following steps of acquisition of the raw data from the configuration tables of the network elements during successive primary pollings, the following steps being carried out between two successive primary pollings: calculation and storage of a checksum value for each network element having raw data which are considered to be sensitive, at least one secondary polling, allowing the sensitive data to be retrieved again from each corresponding element, comparison of the previously-stored checksum value, at each secondary polling and for each element termed sensitive, with a new checksum value calculated with the new sensitive data, for each sensitive element, when the two checksum values differ, updating in a topology database only the topology data relative to the corresponding element.

Abstract: A routing multiplexer system provides p outputs based on a selected permutation of p inputs. Each of a plurality of modules has two inputs, two outputs and a control input and is arranged to supply signals at the two inputs to the two outputs in a direct or transposed order based on a value of a bit at the control input. A first p/2 group of the modules are coupled to the n inputs and a second p/2 group of the modules provide the n outputs. A plurality of control bit tables each contains a plurality of bits in an arrangement based on a respective permutation. The memory is responsive to a selected permutation to supply bits to the respective modules based on respective bit values of a respective control bit table, thereby establishing a selected and programmable permutation of the inputs to the outputs.

Abstract: In iterative decoding, a data recovery scheme corrects for corrupted or defective data by incorporating results from a previous decoding iteration. In one embodiment, a final multiplexer selects between the final detector output or a previous detector output based on the absence or presence of defective data. In another embodiment, the branch metrics for the defective data, which otherwise would be combined with a priori LLRs from an outer decoder of a prior stage, are ignored so that the a priori LLRs themselves are used alone. The two embodiments can be used together.

Abstract: An error correction circuit coupled to a plurality of memory cells in a memory device includes an error correcting code (“ECC”) generator and an ECC controller. The ECC generator is coupled to the memory cells and recognizes data bits stored in the memory cells as a plurality of data bit strings in a first direction and as a plurality of data bit strings in a second direction such that each data bit string in the first direction and each data bit string in the second direction share one data bit in common. The ECC generator generates a respective correction code in the first direction for each data bit string in the first direction and also generates a respective correction code in the second direction for each data bit string in the second direction. The ECC controller is coupled to the memory cells and the ECC generator.

Abstract: A regular quasi-cyclic matrix is prepared, a conditional expression for assuring a predetermined minimum loop in a parity check matrix is derived, and a mask matrix for converting a specific cyclic permutation matrix into a zero-matrix based on the conditional expression and a predetermined weight distribution is generated. The specific cyclic permutation matrix is converted into the zero-matrix to generate an irregular masking quasi-cyclic matrix. An irregular parity check matrix in which the masking quasi-cyclic matrix and a matrix in which the cyclic permutation matrices are arranged in a staircase manner are arranged in a predetermined location.

Abstract: A data processing method includes the steps of: initializing a syndrome vector to be an (n?1)th symbol; finding a corresponding mask based on the syndrome vector, wherein the mask is zero when the (n?1)th symbol is zero; correcting a known constant, which is zero when the syndrome vector is zero, based on the mask; inputting the syndrome vector to a log look-up table to correspondingly find log data; performing a modulo addition operation corresponding to log maximum data to find a log sum based on the log data and a log known constant; and inputting the log sum to an anti-log look-up table to correspondingly find operational data.

Abstract: Source nodes in an International Mobile Telecommunications (IMT)-advanced 4G network transmit data on uplink channels to a relay node and a BS using a channel code. The relay node decodes independently the data received from each source node, and applies network coding to data correctly decoded, and transmits the encoded data to the BS. The BS decodes the encoded data transmitted by the sources nodes and the relay nodes cooperatively via a turbo decoding process. The data from each source node are decoded by soft-input soft-output single user decoders and are decoded, together with the data from the relay node, by a soft-input soft-output multi-user decoder.

Abstract: A low density parity check (LDPC) coding method, and more particularly, a method of executing LDPC coding using a parity check matrix is disclosed. The present invention comprises providing an information bit stream for channel encoding, and encoding the information bit stream by using a first parity check matrix including at least one row generated by combining at least two rows of a second parity check matrix.