US20040019845A1  Method and system for generating low density parity check codes  Google Patents
Method and system for generating low density parity check codes Download PDFInfo
 Publication number
 US20040019845A1 US20040019845A1 US10353230 US35323003A US2004019845A1 US 20040019845 A1 US20040019845 A1 US 20040019845A1 US 10353230 US10353230 US 10353230 US 35323003 A US35323003 A US 35323003A US 2004019845 A1 US2004019845 A1 US 2004019845A1
 Authority
 US
 Grant status
 Application
 Patent type
 Prior art keywords
 ldpc
 parity check
 codes
 method
 nodes
 Prior art date
 Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
 Abandoned
Links
Images
Classifications

 H—ELECTRICITY
 H04—ELECTRIC COMMUNICATION TECHNIQUE
 H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
 H04L27/00—Modulatedcarrier systems
 H04L27/18—Phasemodulated carrier systems, i.e. using phaseshift keying includes continuous phase systems
 H04L27/186—Phasemodulated carrier systems, i.e. using phaseshift keying includes continuous phase systems in which the information is carried by both the individual signal points and the subset to which the individual signal points belong, e.g. coset coding or related schemes

 H—ELECTRICITY
 H03—BASIC ELECTRONIC CIRCUITRY
 H03M—CODING; DECODING; CODE CONVERSION IN GENERAL
 H03M13/00—Coding, decoding or code conversion, for error detection or error correction; Coding theory basic assumptions; Coding bounds; Error probability evaluation methods; Channel models; Simulation or testing of codes
 H03M13/03—Error detection or forward error correction by redundancy in data representation, i.e. code words containing more digits than the source words
 H03M13/05—Error detection or forward error correction by redundancy in data representation, i.e. code words containing more digits than the source words using block codes, i.e. a predetermined number of check bits joined to a predetermined number of information bits
 H03M13/11—Error detection or forward error correction by redundancy in data representation, i.e. code words containing more digits than the source words using block codes, i.e. a predetermined number of check bits joined to a predetermined number of information bits using multiple parity bits
 H03M13/1102—Codes on graphs and decoding on graphs, e.g. lowdensity parity check [LDPC] codes
 H03M13/1105—Decoding
 H03M13/1111—Softdecision decoding, e.g. by means of message passing or belief propagation algorithms

 H—ELECTRICITY
 H03—BASIC ELECTRONIC CIRCUITRY
 H03M—CODING; DECODING; CODE CONVERSION IN GENERAL
 H03M13/00—Coding, decoding or code conversion, for error detection or error correction; Coding theory basic assumptions; Coding bounds; Error probability evaluation methods; Channel models; Simulation or testing of codes
 H03M13/03—Error detection or forward error correction by redundancy in data representation, i.e. code words containing more digits than the source words
 H03M13/05—Error detection or forward error correction by redundancy in data representation, i.e. code words containing more digits than the source words using block codes, i.e. a predetermined number of check bits joined to a predetermined number of information bits
 H03M13/11—Error detection or forward error correction by redundancy in data representation, i.e. code words containing more digits than the source words using block codes, i.e. a predetermined number of check bits joined to a predetermined number of information bits using multiple parity bits
 H03M13/1102—Codes on graphs and decoding on graphs, e.g. lowdensity parity check [LDPC] codes
 H03M13/1105—Decoding
 H03M13/1111—Softdecision decoding, e.g. by means of message passing or belief propagation algorithms
 H03M13/1117—Softdecision decoding, e.g. by means of message passing or belief propagation algorithms using approximations for check node processing, e.g. an outgoing message is depending on the signs and the minimum over the magnitudes of all incoming messages according to the minsum rule
 H03M13/112—Softdecision decoding, e.g. by means of message passing or belief propagation algorithms using approximations for check node processing, e.g. an outgoing message is depending on the signs and the minimum over the magnitudes of all incoming messages according to the minsum rule with correction functions for the minsum rule, e.g. using an offset or a scaling factor

 H—ELECTRICITY
 H03—BASIC ELECTRONIC CIRCUITRY
 H03M—CODING; DECODING; CODE CONVERSION IN GENERAL
 H03M13/00—Coding, decoding or code conversion, for error detection or error correction; Coding theory basic assumptions; Coding bounds; Error probability evaluation methods; Channel models; Simulation or testing of codes
 H03M13/03—Error detection or forward error correction by redundancy in data representation, i.e. code words containing more digits than the source words
 H03M13/05—Error detection or forward error correction by redundancy in data representation, i.e. code words containing more digits than the source words using block codes, i.e. a predetermined number of check bits joined to a predetermined number of information bits
 H03M13/11—Error detection or forward error correction by redundancy in data representation, i.e. code words containing more digits than the source words using block codes, i.e. a predetermined number of check bits joined to a predetermined number of information bits using multiple parity bits
 H03M13/1102—Codes on graphs and decoding on graphs, e.g. lowdensity parity check [LDPC] codes
 H03M13/1105—Decoding
 H03M13/1131—Scheduling of bit node or check node processing
 H03M13/1137—Partly parallel processing, i.e. subblocks or subgroups of nodes being processed in parallel

 H—ELECTRICITY
 H03—BASIC ELECTRONIC CIRCUITRY
 H03M—CODING; DECODING; CODE CONVERSION IN GENERAL
 H03M13/00—Coding, decoding or code conversion, for error detection or error correction; Coding theory basic assumptions; Coding bounds; Error probability evaluation methods; Channel models; Simulation or testing of codes
 H03M13/03—Error detection or forward error correction by redundancy in data representation, i.e. code words containing more digits than the source words
 H03M13/05—Error detection or forward error correction by redundancy in data representation, i.e. code words containing more digits than the source words using block codes, i.e. a predetermined number of check bits joined to a predetermined number of information bits
 H03M13/11—Error detection or forward error correction by redundancy in data representation, i.e. code words containing more digits than the source words using block codes, i.e. a predetermined number of check bits joined to a predetermined number of information bits using multiple parity bits
 H03M13/1102—Codes on graphs and decoding on graphs, e.g. lowdensity parity check [LDPC] codes
 H03M13/1148—Structural properties of the code paritycheck or generator matrix
 H03M13/116—Quasicyclic LDPC [QCLDPC] codes, i.e. the paritycheck matrix being composed of permutation or circulant submatrices
 H03M13/1165—QCLDPC codes as defined for the digital video broadcasting [DVB] specifications, e.g. DVBSatellite [DVBS2]

 H—ELECTRICITY
 H03—BASIC ELECTRONIC CIRCUITRY
 H03M—CODING; DECODING; CODE CONVERSION IN GENERAL
 H03M13/00—Coding, decoding or code conversion, for error detection or error correction; Coding theory basic assumptions; Coding bounds; Error probability evaluation methods; Channel models; Simulation or testing of codes
 H03M13/25—Error detection or forward error correction by signal space coding, i.e. adding redundancy in the signal constellation, e.g. Trellis Coded Modulation [TCM]
 H03M13/255—Error detection or forward error correction by signal space coding, i.e. adding redundancy in the signal constellation, e.g. Trellis Coded Modulation [TCM] with Low Density Parity Check [LDPC] codes

 H—ELECTRICITY
 H03—BASIC ELECTRONIC CIRCUITRY
 H03M—CODING; DECODING; CODE CONVERSION IN GENERAL
 H03M13/00—Coding, decoding or code conversion, for error detection or error correction; Coding theory basic assumptions; Coding bounds; Error probability evaluation methods; Channel models; Simulation or testing of codes
 H03M13/29—Coding, decoding or code conversion, for error detection or error correction; Coding theory basic assumptions; Coding bounds; Error probability evaluation methods; Channel models; Simulation or testing of codes combining two or more codes or code structures, e.g. product codes, generalised product codes, concatenated codes, inner and outer codes
 H03M13/2906—Coding, decoding or code conversion, for error detection or error correction; Coding theory basic assumptions; Coding bounds; Error probability evaluation methods; Channel models; Simulation or testing of codes combining two or more codes or code structures, e.g. product codes, generalised product codes, concatenated codes, inner and outer codes using block codes

 H—ELECTRICITY
 H03—BASIC ELECTRONIC CIRCUITRY
 H03M—CODING; DECODING; CODE CONVERSION IN GENERAL
 H03M13/00—Coding, decoding or code conversion, for error detection or error correction; Coding theory basic assumptions; Coding bounds; Error probability evaluation methods; Channel models; Simulation or testing of codes
 H03M13/35—Unequal or adaptive error protection, e.g. by providing a different level of protection according to significance of source information or by adapting the coding according to the change of transmission channel characteristics
 H03M13/356—Unequal error protection [UEP]

 H—ELECTRICITY
 H03—BASIC ELECTRONIC CIRCUITRY
 H03M—CODING; DECODING; CODE CONVERSION IN GENERAL
 H03M13/00—Coding, decoding or code conversion, for error detection or error correction; Coding theory basic assumptions; Coding bounds; Error probability evaluation methods; Channel models; Simulation or testing of codes
 H03M13/65—Purpose and implementation aspects
 H03M13/6577—Representation or format of variables, register sizes or wordlengths and quantization
 H03M13/6583—Normalization other than scaling, e.g. by subtraction

 H—ELECTRICITY
 H04—ELECTRIC COMMUNICATION TECHNIQUE
 H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
 H04L1/00—Arrangements for detecting or preventing errors in the information received

 H—ELECTRICITY
 H04—ELECTRIC COMMUNICATION TECHNIQUE
 H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
 H04L1/00—Arrangements for detecting or preventing errors in the information received
 H04L1/004—Arrangements for detecting or preventing errors in the information received by using forward error control
 H04L1/0045—Arrangements at the receiver end
 H04L1/0047—Decoding adapted to other signal detection operation
 H04L1/005—Iterative decoding, including iteration between signal detection and decoding operation

 H—ELECTRICITY
 H04—ELECTRIC COMMUNICATION TECHNIQUE
 H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
 H04L1/00—Arrangements for detecting or preventing errors in the information received
 H04L1/004—Arrangements for detecting or preventing errors in the information received by using forward error control
 H04L1/0056—Systems characterized by the type of code used
 H04L1/0057—Block codes

 H—ELECTRICITY
 H04—ELECTRIC COMMUNICATION TECHNIQUE
 H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
 H04L1/00—Arrangements for detecting or preventing errors in the information received
 H04L1/004—Arrangements for detecting or preventing errors in the information received by using forward error control
 H04L1/0056—Systems characterized by the type of code used
 H04L1/0059—Convolutional codes
 H04L1/006—Trelliscoded modulation

 H—ELECTRICITY
 H04—ELECTRIC COMMUNICATION TECHNIQUE
 H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
 H04L1/00—Arrangements for detecting or preventing errors in the information received
 H04L1/004—Arrangements for detecting or preventing errors in the information received by using forward error control
 H04L1/0056—Systems characterized by the type of code used
 H04L1/0061—Error detection codes

 H—ELECTRICITY
 H04—ELECTRIC COMMUNICATION TECHNIQUE
 H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
 H04L1/00—Arrangements for detecting or preventing errors in the information received
 H04L1/004—Arrangements for detecting or preventing errors in the information received by using forward error control
 H04L1/0056—Systems characterized by the type of code used
 H04L1/0064—Concatenated codes
 H04L1/0065—Serial concatenated codes

 H—ELECTRICITY
 H04—ELECTRIC COMMUNICATION TECHNIQUE
 H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
 H04L1/00—Arrangements for detecting or preventing errors in the information received
 H04L1/004—Arrangements for detecting or preventing errors in the information received by using forward error control
 H04L1/0056—Systems characterized by the type of code used
 H04L1/007—Unequal error protection

 H—ELECTRICITY
 H04—ELECTRIC COMMUNICATION TECHNIQUE
 H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
 H04L1/00—Arrangements for detecting or preventing errors in the information received
 H04L1/004—Arrangements for detecting or preventing errors in the information received by using forward error control
 H04L1/0056—Systems characterized by the type of code used
 H04L1/0071—Use of interleaving

 H—ELECTRICITY
 H04—ELECTRIC COMMUNICATION TECHNIQUE
 H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
 H04L27/00—Modulatedcarrier systems
 H04L27/18—Phasemodulated carrier systems, i.e. using phaseshift keying includes continuous phase systems
 H04L27/20—Modulator circuits; Transmitter circuits
 H04L27/2032—Modulator circuits; Transmitter circuits for discrete phase modulation, e.g. in which the phase of the carrier is modulated in a nominally instantaneous manner
 H04L27/2053—Modulator circuits; Transmitter circuits for discrete phase modulation, e.g. in which the phase of the carrier is modulated in a nominally instantaneous manner using more than one carrier, e.g. carriers with different phases

 H—ELECTRICITY
 H03—BASIC ELECTRONIC CIRCUITRY
 H03M—CODING; DECODING; CODE CONVERSION IN GENERAL
 H03M13/00—Coding, decoding or code conversion, for error detection or error correction; Coding theory basic assumptions; Coding bounds; Error probability evaluation methods; Channel models; Simulation or testing of codes
 H03M13/03—Error detection or forward error correction by redundancy in data representation, i.e. code words containing more digits than the source words
 H03M13/05—Error detection or forward error correction by redundancy in data representation, i.e. code words containing more digits than the source words using block codes, i.e. a predetermined number of check bits joined to a predetermined number of information bits
 H03M13/13—Linear codes
 H03M13/15—Cyclic codes, i.e. cyclic shifts of codewords produce other codewords, e.g. codes defined by a generator polynomial, BoseChaudhuriHocquenghem [BCH] codes
 H03M13/151—Cyclic codes, i.e. cyclic shifts of codewords produce other codewords, e.g. codes defined by a generator polynomial, BoseChaudhuriHocquenghem [BCH] codes using error location or error correction polynomials
 H03M13/152—BoseChaudhuriHocquenghem [BCH] codes

 H—ELECTRICITY
 H04—ELECTRIC COMMUNICATION TECHNIQUE
 H04H—BROADCAST COMMUNICATION
 H04H40/00—Arrangements specially adapted for receiving broadcast information
 H04H40/18—Arrangements characterised by circuits or components specially adapted for receiving
 H04H40/27—Arrangements characterised by circuits or components specially adapted for receiving specially adapted for broadcast systems covered by groups H04H20/53  H04H20/95
 H04H40/90—Arrangements characterised by circuits or components specially adapted for receiving specially adapted for broadcast systems covered by groups H04H20/53  H04H20/95 specially adapted for satellite broadcast receiving
Abstract
Description
 This application is related to, and claims the benefit of the earlier filing date under 35 U.S.C. §119(e) of, U.S. Provisional Patent Application (Serial No. 60/398,760) filed Jul. 26, 2002 (Attorney Docket: PD202101), entitled “Code Design and Implementation Improvements for Low Density Parity Check Codes,” U.S. Provisional Patent Application (Serial No. 60/403,812) filed Aug. 15, 2002 (Attorney Docket: PD202105), entitled “Power and Bandwidth Efficient Modulation and Coding Scheme for Direct Broadcast Satellite and Broadcast Satellite Communications,” U.S. Provisional Patent Application (Serial No. 60/421,505), filed Oct. 25, 2002 (Attorney Docket: PD202101), entitled “Method and System for Generating Low Density Parity Check Codes,” U.S. Provisional Patent Application (Serial No. 60/421,999), filed Oct. 29, 2002 (Attorney Docket: PD202105), entitled “Satellite Communication System Utilizing Low Density Parity Check Codes” and U.S. Provisional Patent Application (Serial No. 60/423,710), filed Nov. 4, 2002 (Attorney Docket: PD202101), entitled “Code Design and Implementation Improvements for Low Density Parity Check Codes”; the entireties of which are incorporated herein by reference.
 The present invention relates to communication systems, and more particularly to coded systems.
 Communication systems employ coding to ensure reliable communication across noisy communication channels. These communication channels exhibit a fixed capacity that can be expressed in terms of bits per symbol at certain signal to noise ratio (SNR), defining a theoretical upper limit (known as the Shannon limit). As a result, coding design has aimed to achieve rates approaching this Shannon limit. One such class of codes that approach the Shannon limit is Low Density Parity Check (LDPC) codes.
 Traditionally, LDPC codes have not been widely deployed because of a number of drawbacks. One drawback is that the LDPC encoding technique is highly complex. Encoding an LDPC code using its generator matrix would require storing a very large, nonsparse matrix. Additionally, LDPC codes require large blocks to be effective; consequently, even though parity check matrices of LDPC codes are sparse, storing these matrices is problematic. From an implementation perspective, storage is an important reason why LDPC codes have not become widespread in practice. A key challenge in LDPC code implementation has been how to achieve the connection network between several processing engines (nodes) in the decoder.
 Therefore, there is a need for a LDPC communication system that employs simple encoding and decoding processes. There is also a need for using LDPC codes efficiently to support high data rates, without introducing greater complexity. There is also a need to improve performance of LDPC encoders and decoders. There is a also need to minimize storage requirements for implementing LDPC coding. There is a further need for a scheme that simplifies the communication between processing nodes in the LDPC decoder.
 These and other needs are addressed by the present invention, wherein an approach for generating a structured Low Density Parity Check (LDPC) codes is provided. Structure of the LDPC codes is provided by restricting portion part of the parity check matrix to be lower triangular and/or satisfying other requirements such that the communication between processing nodes of the decoder becomes very simple. Also, the approach can advantageously exploit the unequal error protecting capability of LDPC codes on transmitted bits to provide extra error protection to more vulnerable bits of high order modulation constellations (such as 8PSK (Phase Shift Keying)). Additionally, the parity check matrix can be algorithmically generated using prestored constants and bitwise operations.
 According to one aspect of an embodiment of the present invention, a method for generating low density parity check (LDPC) codes is provided. The method includes transforming a received input message into a LDPC codeword using only a parity check matrix of the LDPC codes without using a generator matrix of the LDPC codes, and outputting the LDPC codeword.
 According to another aspect of an embodiment of the present invention, a method for supporting encoding of linear block codes is provided. The method includes mapping higher order signal constellation bits to bit nodes of a parity check matrix corresponding to the linear block codes. Vulnerable bits of the signal constellation are mapped to the bit nodes with at least three edges.
 According to another aspect of an embodiment of the present invention, a method for supporting encoding of linear block codes is disclosed. The method includes mapping higher order signal constellation bits to bit nodes of a parity check matrix corresponding to the linear block code. The vulnerable bits of the signal constellation are mapped to the bit nodes with number of edges no less than that of more reliable bits.
 According to another aspect of an embodiment of the present invention, a method for generating low density parity check (LDPC) codes is provided. The method includes transforming a received input message into a LDPC codeword using only a parity check matrix of the LDPC codes without using a generator matrix of the LDPC codes. The method also includes applying an outer code to the LDPC codeword, and outputting the LDPC codeword with the applied outer code.
 According to another aspect of an embodiment of the present invention, a method for generating low density parity check (LDPC) code is disclosed. The method includes placing contents of edges for a group of bit nodes next to one another in memory. The method also includes simultaneously placing contents of edges for a group of check nodes next to one another in the memory.
 According to another aspect of an embodiment of the present invention, a system for generating low density parity check (LDPC) codes is disclosed. The system includes means for transforming a received input message into a LDPC codeword using only a parity check matrix of the LDPC codes without using a generator matrix of the LDPC codes. The system also includes means for outputting the LDPC codeword.
 According to yet another aspect of an embodiment of the present invention, a method for processing low density parity check (LDPC) codes is disclosed. The method includes decoding via a LDPC decoder received LDPC codes. The method also includes iteratively regenerating signal constellation bit metrics into the LDPC decoder after every or several LDPC decoder iterations.
 Still other aspects, features, and advantages of the present invention are readily apparent from the following detailed description, simply by illustrating a number of particular embodiments and implementations, including the best mode contemplated for carrying out the present invention. The present invention is also capable of other and different embodiments, and its several details can be modified in various obvious respects, all without departing from the spirit and scope of the present invention. Accordingly, the drawing and description are to be regarded as illustrative in nature, and not as restrictive.
 The present invention is illustrated by way of example, and not by way of limitation, in the figures of the accompanying drawings and in which like reference numerals refer to similar elements and in which:
 FIG. 1 is a diagram of a communications system configured to utilize Low Density Parity Check (LDPC) codes, according to an embodiment of the present invention;
 FIG. 2 is a diagram of an exemplary transmitter in the system of FIG. 1;
 FIG. 3 is a diagram of an exemplary receiver in the system of FIG. 1;
 FIG. 4 is a diagram of a sparse parity check matrix, in accordance with an embodiment of the present invention;
 FIG. 5 is a diagram of a bipartite graph of an LDPC code of the matrix of FIG. 4;
 FIG. 6 is a diagram of a submatrix of a sparse parity check matrix, wherein the submatrix contains parity check values restricted to the lower triangular region, according to an embodiment of the present invention;
 FIG. 7 is a graph showing performance between codes utilizing unrestricted parity check matrix (H matrix) versus restricted H matrix having a submatrix as in FIG. 6;
 FIGS. 8A and 8B are, respectively, a diagram of a nonGray 8PSK modulation scheme, and a Gray 8PSK modulation, each of which can be used in the system of FIG. 1;
 FIG. 9 is a graph showing performance between codes utilizing Gray labeling versus nonGray labeling;
 FIG. 10 is a flow chart of the operation of the LDPC decoder using nonGray mapping, according to an embodiment of the present invention;
 FIG. 11 is a flow chart of the operation of the LDPC decoder of FIG. 3 using Gray mapping, according to an embodiment of the present invention;
 FIGS.12A12C are diagrams of the interactions between the check nodes and the bit nodes in a decoding process, according to an embodiment of the present invention;
 FIGS.13A13C are graphs showing simulation results of LDPC codes generated in accordance with various embodiments of the present invention;
 FIGS. 14A and 14B are diagrams of the top edge and bottom edge, respectively, of memory organized to support structured access as to realize randomness in LDPC coding, according to an embodiment of the present invention; and
 FIG. 15 is a diagram of a computer system that can perform the processes of encoding and decoding of LDPC codes, in accordance with embodiments of the present invention.
 A system, method, and software for efficiently generating structured Low Density Parity Check (LDPC) codes are described. In the following description, for the purposes of explanation, numerous specific details are set forth in order to provide a thorough understanding of the present invention. It is apparent, however, to one skilled in the art that the present invention may be practiced without these specific details or with an equivalent arrangement. In other instances, wellknown structures and devices are shown in block diagram form in order to avoid unnecessarily obscuring the present invention.
 FIG. 1 is a diagram of a communications system configured to utilize Low Density Parity Check (LDPC) codes, according to an embodiment of the present invention. A digital communications system100 includes a transmitter 101 that generates signal waveforms across a communication channel 103 to a receiver 105. In this discrete communications system 100, the transmitter 101 has a message source that produces a discrete set of possible messages; each of the possible messages has a corresponding signal waveform. These signal waveforms are attenuated, or otherwise altered, by communications channel 103. To combat the noise channel 103, LDPC codes are utilized.
 The LDPC codes that are generated by the transmitter101 enables high speed implementation without incurring any performance loss. These structured LDPC codes output from the transmitter 101 avoid assignment of a small number of check nodes to the bit nodes already vulnerable to channel errors by virtue of the modulation scheme (e.g., 8PSK).
 Such LDPC codes have a parallelizable decoding algorithm (unlike turbo codes), which advantageously involves simple operations such as addition, comparison and table lookup. Moreover, carefully designed LDPC codes do not exhibit any sign of error floor.
 According to one embodiment of the present invention, the transmitter101 generates, using a relatively simple encoding technique, LDPC codes based on parity check matrices (which facilitate efficient memory access during decoding) to communicate with the receiver 105. The transmitter 101 employs LDPC codes that can outperform concatenated turbo+RS (ReedSolomon) codes, provided the block length is sufficiently large.
 FIG. 2 is a diagram of an exemplary transmitter in the system of FIG. 1. A transmitter200 is equipped with an LDPC encoder 203 that accepts input from an information source 201 and outputs coded stream of higher redundancy suitable for error correction processing at the receiver 105. The information source 201 generates k signals from a discrete alphabet, X. LDPC codes are specified with parity check matrices. On the other hand, encoding LDPC codes require, in general, specifying the generator matrices. Even though it is possible to obtain generator matrices from parity check matrices using Gaussian elimination, the resulting matrix is no longer sparse and storing a large generator matrix can be complex.
 Encoder203 generates signals from alphabet Y to a modulator 205 using a simple encoding technique that makes use of only the parity check matrix by imposing structure onto the parity check matrix. Specifically, a restriction is placed on the parity check matrix by constraining certain portion of the matrix to be triangular. The construction of such a parity check matrix is described more fully below in FIG. 6. Such a restriction results in negligible performance loss, and therefore, constitutes an attractive tradeoff.
 Modulator205 maps the encoded messages from encoder 203 to signal waveforms that are transmitted to a transmit antenna 207, which emits these waveforms over the communication channel 103. Accordingly, the encoded messages are modulated and distributed to a transmit antenna 207. The transmissions from the transmit antenna 207 propagate to a receiver, as discussed below.
 FIG. 3 is a diagram of an exemplary receiver in the system of FIG. 1. At the receiving side, a receiver300 includes a demodulator 301 that performs demodulation of received signals from transmitter 200. These signals are received at a receive antenna 303 for demodulation. After demodulation, the received signals are forwarded to a decoder 305, which attempts to reconstruct the original source messages by generating messages, X′, in conjunction with a bit metric generator 307. With nonGray mapping, the bit metric generator 307 exchanges probability information with the decoder 305 back and forth (iteratively) during the decoding process, which is detailed in FIG. 10. Alternatively, if Gray mapping is used (according to one embodiment of the present invention), one pass of the bit metric generator is sufficient, in which further attempts of bit metric generation after each LDPC decoder iteration are likely to yield limited performance improvement; this approach is more fully described with respect to FIG. 11. To appreciate the advantages offered by the present invention, it is instructive to examine how LDPC codes are generated, as discussed in FIG. 4.
 FIG. 4 is a diagram of a sparse parity check matrix, in accordance with an embodiment of the present invention. LDPC codes are long, linear block codes with sparse parity check matrix H_{(n−k)xn}. Typically the block length, n, ranges from thousands to tens of thousands of bits. For example, a parity check matrix for an LDPC code of length n=8 and rate ½ is shown in FIG. 4. The same code can be equivalently represented by the bipartite graph, per FIG. 5.
 FIG. 5 is a diagram of a bipartite graph of an LDPC code of the matrix of FIG. 4. Parity check equations imply that for each check node, the sum (over GF (Galois Field)(2)) of all adjacent bit nodes is equal to zero. As seen in the figure, bit nodes occupy the left side of the graph and are associated with one or more check nodes, according to a predetermined relationship. For example, corresponding to check node m_{1}, the following expression exists n_{1}+n_{4}+n_{5}+n_{8}=0 with respect to the bit nodes.
 Returning the receiver303, the LDPC decoder 305 is considered a message passing decoder, whereby the decoder 305 aims to find the values of bit nodes. To accomplish this task, bit nodes and check nodes iteratively communicate with each other. The nature of this communication is described below.
 From check nodes to bit nodes, each check node provides to an adjacent bit node an estimate (“opinion”) regarding the value of that bit node based on the information coming from other adjacent bit nodes. For instance, in the above example if the sum of n_{4}, n_{5 }and n_{8 }“looks like” 0 to m_{1}, then m_{1 }would indicate to n_{1}, that the value of n_{1}, is believed to be 0 (since n_{1}+n_{4}+n_{5}+n_{8}=0); otherwise m_{1 }indicate to n_{1 }that the value of n_{1 }is believed to be 1. Additionally, for soft decision decoding, a reliability measure is added.
 From bit nodes to check nodes, each bit node relays to an adjacent check node an estimate about its own value based on the feedback coming from its other adjacent check nodes. In the above example n_{1 }has only two adjacent check nodes m_{1 }and m_{3}. If the feedback coming from m_{3 }to n_{1 }indicates that the value of n_{1 }is probably 0, then n_{1 }would notify m_{1 }that an estimate of n_{1}'s own value is 0. For the case in which the bit node has more than two adjacent check nodes, the bit node performs a majority vote (soft decision) on the feedback coming from its other adjacent check nodes before reporting that decision to the check node it communicates. The above process is repeated until all bit nodes are considered to be correct (i.e., all parity check equations are satisfied) or until a predetermined maximum number of iterations is reached, whereby a decoding failure is declared.
 FIG. 6 is a diagram of a submatrix of a sparse parity check matrix, wherein the submatrix contains parity check values restricted to the lower triangular region, according to an embodiment of the present invention. As described previously, the encoder203 (of FIG. 2) can employ a simple encoding technique by restricting the values of the lower triangular area of the parity check matrix. According to an embodiment of the present invention, the restriction imposed on the parity check matrix is of the form:
 H _{(n−k)xn} =[A _{(n−k)xk} B _{(n−k)x(n−k)}]
 ,where B is lower triangular.
 Any information block i=(i_{0},i_{1}, . . . , i_{k−1}) is encoded to a codeword c=(i_{0},i_{1},i_{k−1},p_{0},p_{1}, . . . p_{n−k−1}) using Hc^{T}=0, and recursively solving for parity bits; for example,
 and similarly for p_{2}, p_{3}, . . . ,p_{n−k−1. }
 FIG. 7 is a graph showing performance between codes utilizing unrestricted parity check matrix (H matrix) versus restricted H matrix of FIG. 6. The graph shows the performance comparison between two LDPC codes: one with a general parity check matrix and the other with a parity check matrix restricted to be lower triangular to simplify encoding. The modulation scheme, for this simulation, is 8PSK. The performance loss is within 0.1 dB. Therefore, the performance loss is negligible based on the restriction of the lower triangular H matrices, while the gain in simplicity of the encoding technique is significant. Accordingly, any parity check matrix that is equivalent to a lower triangular or upper triangular under row and/or column permutation can be utilized for the same purpose.
 FIGS. 8A and 8B are, respectively, a diagram of a nonGray 8PSK modulation scheme, and a Gray 8PSK modulation, each of which can be used in the system of FIG. 1. The nonGray 8PSK scheme of FIG. 8A can be utilized in the receiver of FIG. 3 to provide a system that requires very low Frame Erasure Rate (FER). This requirement can also be satisfied by using a Gray 8PSK scheme, as shown in FIG. 8B, in conjunction with an outer code, such as Bose, Chaudhuri, and Hocquenghem (BCH), Hamming, or ReedSolomon (RS) code.
 Alternatively, the Gray 8PSK scheme of FIG. 8B can be implemented with an outer code. Under this scheme, there is no need to iterate between the LDPC decoder305 (FIG. 3) and the bit metric generator 307, which may employ 8PSK modulation. In the absence of an outer code, the LDPC decoder 305 using Gray labeling exhibit an earlier error floor, as shown in FIG. 9 below.
 FIG. 9 is a graph showing performance between codes utilizing Gray labeling versus nonGray labeling of FIGS. 8A and 8B. The error floor stems from the fact that assuming correct feedback from LDPC decoder305, regeneration of 8PSK bit metrics is more accurate with nonGray labeling since the two 8PSK symbols with known two bits are further apart with nonGray labeling. This can be equivalently seen as operating at higher SignaltoNoise Ratio (SNR). Therefore, even though error asymptotes of the same LDPC code using Gray or nonGray labeling have the same slope (i.e., parallel to each other), the one with nonGray labeling passes through lower FER at any SNR.
 On the other hand, for systems that do not require very low FER, Gray labeling without any iteration between LDPC decoder305 and 8PSK bit metric generator 307 may be more suitable because regenerating 8PSK bit metrics before every LDPC decoder iteration causes additional complexity. Moreover, when Gray labeling is used, regenerating 8PSK bit metrics before every LDPC decoder iteration yields only very slight performance improvement. As mentioned previously, Gray labeling without iteration may be used for systems that require very low FER, provided an outer code is implemented.
 The choice between Gray labeling and nonGray labeling depends also on the characteristics of the LDPC code. Typically, the higher bit or check node degrees, the better it is for Gray labeling, because for higher node degrees, the initial feedback from LDPC decoder305 to 8PSK (or similar higher order modulation) bit metric generator 307 deteriorates more with nonGray labeling.
 When 8PSK (or similar higher order) modulation is utilized with a binary decoder, it is recognized that the three (or more) bits of a symbol are not received “equally noisy”. For example with Gray 8PSK labeling, the third bit of a symbol is considered more noisy to the decoder than the other two bits. Therefore, the LDPC code design does not assign a small number of edges to those bit nodes represented by “more noisy” third bits of 8PSK symbol so that those bits are not penalized twice.
 FIG. 10 is a flow chart of the operation of the LDPC decoder using nonGray mapping, according to an embodiment of the present invention. Under this approach, the LDPC decoder and bit metric generator iterate one after the other. In this example, 8PSK modulation is utilized; however, the same principles apply to other higher modulation schemes as well. Under this scenario, it is assumed that the demodulator301 outputs a distance vector, d, denoting the distances between received noisy symbol points and 8PSK symbol points to the bit metric generator 307, whereby the vector components are as follows:
${d}_{i}=\frac{{E}_{s}}{{N}_{0}}\ue89e\left\{{\left({r}_{x}{S}_{i,x}\right)}^{2}+{\left({r}_{y}{s}_{i,y}\right)}^{2}\right\}\ue89e\text{\hspace{1em}}\ue89ei=0,1,\text{\hspace{1em}}\ue89e\dots \ue89e\text{\hspace{1em}}\ue89e7.$  The 8PSK bit metric generator307 communicates with the LDPC decoder 305 to exchange a priori probability information and a posteriori probability information, which respectively are represented as u, and a. That is, the vectors u and a respectively represent a priori and a posteriori probabilities of log likelihood ratios of coded bits.
 The 8PSK bit metric generator307 generates the a priori likelihood ratios for each group of three bits as follows. First, extrinsic information on coded bits is obtained:
 e _{j} =a _{j} −u _{j } j=0,1,2.
 Next, 8PSK symbol probabilities, p_{i }i=0,1, . . . ,7, are determined.
 * y_{j}=−ƒ(0,e_{j}) j=0,1,2 where ƒ(a,b)=max(a,b)+LUT_{ƒ}(a,b) with LUT_{ƒ(a,b)=ln(}1=e^{−a−b})
*p_{0 }= x_{0 }+ x_{1 }+ x_{2} p_{1 }= x_{0 }+ x_{1 }+ y_{2} p_{2 }= x_{0 }+ y_{1 }+ x_{2} p_{3 }= x_{0 }+ y_{1 }+ y_{2} p_{4 }= y_{0 }+ x_{1 }+ x_{2} p_{5 }= y_{0 }+ x_{1 }+ y_{2} p_{6 }= y_{0 }+ y_{1 }+ x_{2} p_{7 }= y_{0 }+ y_{1 }+ y_{2}  Next, the bit metric generator307 determines a priori log likelihood ratios of the coded bits as input to LDPC decoder 305, as follows:
 u _{0}=ƒ(d _{0} +p _{0} ,d _{1} +p _{1} ,d _{2} +p _{2} ,d _{3} +p _{3})−ƒ(d _{4} +p _{4} ,d _{5} +p _{5} ,d _{6} +p _{6} ,d _{7} +p _{7})−e _{0}
 u _{1}=ƒ(d _{0} +p _{0} ,d _{1} +p _{1} ,d _{4} +p _{4} ,d _{5} +p _{5})−ƒ(d _{2} +p _{2} ,d _{3} +p _{3} ,d _{6} +p _{6} ,d _{7} +p _{7})−e _{1}
 u _{2}=ƒ(d _{0} +p _{0} ,d _{2} +p _{2} ,d _{4} +p _{4} ,d _{6} +p _{6})−ƒ(d _{1} +p _{1} ,d _{3} +p _{3} ,d _{5} +p _{5} ,d _{7} +p _{7})−e _{2}
 It is noted that the function ƒ(.) with more than two variables can be evaluated recursively; e.g. ƒ(a,b,c)=ƒ(ƒ(a,b),c).
 The operation of the LDPC decoder305 utilizing nonGray mapping is now described. In step 1001, the LDPC decoder 305 initializes log likelihood ratios of coded bits, v, before the first iteration according to the following (and as shown in FIG. 12A): v_{n→k} _{ i }=u_{n}, n=0,1, . . . , N−1, i=1,2, . . . , deg(bit node n) Here, v_{n→k} _{ i }denotes the message that goes from bit node n to its adjacent check node k_{i}, u_{n }denotes the demodulator output for the bit n and N is the codeword size.
 In step1003, a check node, k, is updated, whereby the input v yields the output w. As seen in FIG. 12B, the incoming messages to the check node k from its d_{c }adjacent bit nodes are denoted by v_{n} _{ 1 } _{→k}, v_{n} _{ 2 } _{ →k }, . . . , v_{n} _{ dc } _{ →k }. The goal is to compute the outgoing messages from the check node k back to d_{c }adjacent bit nodes. These messages are denoted by w_{k→n} _{ 1 },w_{k→n} _{ 2 }, . . . w_{k→n} _{ dc }, where w_{k→n} _{ 1 }=g(v_{n} _{ 1 } _{ →k },v_{n} _{ 2 } _{ →k }, . . . , v_{n} _{ i−1 } _{ →k }, v_{n} _{ i−1 } _{ →k }, . . . , v_{n} _{ dc } _{ →k }). The function g( ) is defined as follows:
 g(a,b)=sign(a)×sign(b)×{min(a,b)}+LUT _{g}(a,b),
 where LUT_{g(a,b)=ln(}1+e^{−a+b})−ln(1+e^{−a−b}). Similar to function ƒ, function g with more than two variables can be evaluated recursively.



 The above approach is appropriate when nonGray labeling is utilized. However, when Gray labeling is implemented, the process of FIG. 11 is executed.
 FIG. 11 is a flow chart of the operation of the LDPC decoder of FIG. 3 using Gray mapping, according to an embodiment of the present invention. When Gray labeling is used, bit metrics are advantageously generated only once before the LDPC decoder, as regenerating bit metrics after every LDPC decoder iteration may yield nominal performance improvement. As with steps1001 and 1003 of FIG. 10, initialization of the log likelihood ratios of coded bits, v, are performed, and the check node is updated, per steps 1101 and 1103. Next, the bit node n is updated, as in step 1105. Thereafter, the decoder outputs the a posteriori probability information (step 1107). In step 1109, a determination is made whether all of the parity check equations are satisfied; if so, the decoder outputs the hard decision (step 1111). Otherwise, steps 11031107 are repeated.
 FIGS.13A13C are graphs showing simulation results of LDPC codes generated in accordance with various embodiments of the present invention. In particular, FIGS. 13A13C show the performance of LDPC codes with higher order modulation and code rates of 3/4 (QPSK, 1.485 bits/symbol), 2/3 (8PSK, 1.980 bits/symbol), and 5/6 (8PSK, 2.474 bits/symbol).
 Two general approaches exist to realize the interconnections between check nodes and bit nodes: (1) a fully parallel approach, and (2) a partially parallel approach. In fully parallel architecture, all of the nodes and their interconnections are physically implemented. The advantage of this architecture is speed.
 The fully parallel architecture, however, may involve greater complexity in realizing all of the nodes and their connections. Therefore with fully parallel architecture, a smaller block size may be required to reduce the complexity. In that case, for the same clock frequency, a proportional reduction in throughput and some degradation in FER versus Es/No performance may result.
 The second approach to implementing LDPC codes is to physically realize only a subset of the total number of the nodes and use only these limited number of “physical” nodes to process all of the “functional” nodes of the code. Even though the LDPC decoder operations can be made extremely simple and can be performed in parallel, the further challenge in the design is how the communication is established between “randomly” distributed bit nodes and check nodes. The decoder305, of FIG. 3, according to one embodiment of the present invention, addresses this problem by accessing memory in a structured way, as to realize a seemingly random code. This approach is explained with respect to FIGS. 14A and 14B.
 FIGS. 14A and 14B are diagrams of the top edge and bottom edge, respectively, of memory organized to support structured access as to realize randomness in LDPC coding, according to an embodiment of the present invention. Structured access can be achieved without compromising the performance of a truly random code by focusing on the generation of the parity check matrix. In general, a parity check matrix can be specified by the connections of the check nodes with the bit nodes. For example, the bit nodes are divided into groups of 392 (392 is provided for the purposes of illustration). Additionally, assuming the check nodes connected to the first bit node of degree3, for instance, are numbered as a, b and c, then the check nodes connected to the second bit node are numbered as a+p, b+p and c+p, the check nodes connected to the third bit node are numbered as a+2p, b+2p and c+2p etc. For the next group of 392 bit nodes, the check nodes connected to the first bit node are different from a, b, c so that with a suitable choice of p, all the check nodes have the same degree. A random search is performed over the free constants such that the resulting LDPC code is cycle4 and cycle6 free.
 The above arrangement facilitates memory access during check node and bit node processing. The values of the edges in the bipartite graph can be stored in a storage medium, such as random access memory (RAM). It is noted that for a truly random LDPC code during check node and bit node processing, the values of the edges would need to be accessed one by one in a random fashion. However, such an access scheme would be too slow for a high data rate application. The RAM of FIGS. 14A and 14B are organized in a manner, whereby a large group of relevant edges in one clock cycle; accordingly, these values are placed “together” in memory. It is observed that, in actuality, even with a truly random code, for a group of check nodes (and respectively bit nodes), the relevant edges can be placed next to one another in RAM, but then the relevant edges adjacent to a group of bit nodes (respectively check nodes) will be randomly scattered in RAM. Therefore, the “togetherness,” under the present invention, stems from the design of the parity check matrices themselves. That is, the check matrix design ensures that the relevant edges for a group of bit nodes and check nodes are simultaneously placed together in RAM.
 As seen in FIGS. 14A and 14B, each box contains the value of an edge, which is multiple bits (e.g., 6). Edge RAM, according to one embodiment of the present invention, is divided into two parts: top edge RAM (FIG. 14A) and bottom edge RAM (FIG. 14B). Bottom edge RAM contains the edges between bit nodes of degree 2, for example, and check nodes. Top edge RAM contains the edges between bit nodes of degree greater than 2 and check nodes. Therefore, for every check node, 2 adjacent edges are stored in the bottom RAM, and the rest of the edges are stored in the top edge RAM.
 Continuing with the above example, a group of 392 bit nodes and 392 check nodes are selected for processing at a time. For 392 check node processing, q consecutive rows are accessed from the top edge RAM, and 2 consecutive rows from the bottom edge RAM. In this instance, q+2 is the degree of each check node. For bit node processing, if the group of 392 bit nodes has degree 2, their edges are located in 2 consecutive rows of the bottom edge RAM. If the bit nodes have degree d>2, their edges are located in some d rows of the top edge RAM. The address of these d rows can be stored in nonvolatile memory, such as ReadOnly Memory (ROM). The edges in one of the rows correspond to the first edges of 392 bit nodes, the edges in another row correspond to the second edges of 392 bit nodes, etc. Moreover for each row, the column index of the edge that belongs to the first bit node in the group of 392 can also be stored in ROM. The edges that correspond to the second, third, etc. bit nodes follow the starting column index in a “wrapped around” fashion. For example, if the j^{th }edge in the row belongs to the first bit node, then the (j+1)st edge belongs to the second bit node, (j+2)nd edge belongs to the third bit node, . . . , and (j−1)st edge belongs to the 392^{th }bit node.
 With the above organization (shown in FIGS. 14A and 14B), speed of memory access is greatly enhanced during LDPC coding.
 FIG. 15 illustrates a computer system1500 upon which an embodiment according to the present invention can be implemented. The computer system 1500 includes a bus 1501 or other communication mechanism for communicating information, and a processor 1503 coupled to the bus 1501 for processing information. The computer system 1500 also includes main memory 1505, such as a random access memory (RAM) or other dynamic storage device, coupled to the bus 1501 for storing information and instructions to be executed by the processor 1503. Main memory 1505 can also be used for storing temporary variables or other intermediate information during execution of instructions to be executed by the processor 1503. The computer system 1500 further includes a read only memory (ROM) 1507 or other static storage device coupled to the bus 1501 for storing static information and instructions for the processor 1503. A storage device 1509, such as a magnetic disk or optical disk, is additionally coupled to the bus 1501 for storing information and instructions.
 The computer system1500 may be coupled via the bus 1501 to a display 1511, such as a cathode ray tube (CRT), liquid crystal display, active matrix display, or plasma display, for displaying information to a computer user. An input device 1513, such as a keyboard including alphanumeric and other keys, is coupled to the bus 1501 for communicating information and command selections to the processor 1503. Another type of user input device is cursor control 1515, such as a mouse, a trackball, or cursor direction keys for communicating direction information and command selections to the processor 1503 and for controlling cursor movement on the display 1511.
 According to one embodiment of the invention, generation of LDPC codes is provided by the computer system1500 in response to the processor 1503 executing an arrangement of instructions contained in main memory 1505. Such instructions can be read into main memory 1505 from another computerreadable medium, such as the storage device 1509. Execution of the arrangement of instructions contained in main memory 1505 causes the processor 1503 to perform the process steps described herein. One or more processors in a multiprocessing arrangement may also be employed to execute the instructions contained in main memory 1505. In alternative embodiments, hardwired circuitry may be used in place of or in combination with software instructions to implement the embodiment of the present invention. Thus, embodiments of the present invention are not limited to any specific combination of hardware circuitry and software.
 The computer system1500 also includes a communication interface 1517 coupled to bus 1501. The communication interface 1517 provides a twoway data communication coupling to a network link 1519 connected to a local network 1521. For example, the communication interface 1517 may be a digital subscriber line (DSL) card or modem, an integrated services digital network (ISDN) card, a cable modem, or a telephone modem to provide a data communication connection to a corresponding type of telephone line. As another example, communication interface 1517 may be a local area network (LAN) card (e.g. for Ethernet™ or an Asynchronous Transfer Model (ATM) network) to provide a data communication connection to a compatible LAN. Wireless links can also be implemented. In any such implementation, communication interface 1517 sends and receives electrical, electromagnetic, or optical signals that carry digital data streams representing various types of information. Further, the communication interface 1517 can include peripheral interface devices, such as a Universal Serial Bus (USB) interface, a PCMCIA (Personal Computer Memory Card International Association) interface, etc.
 The network link1519 typically provides data communication through one or more networks to other data devices. For example, the network link 1519 may provide a connection through local network 1521 to a host computer 1523, which has connectivity to a network 1525 (e.g. a wide area network (WAN) or the global packet data communication network now commonly referred to as the “Internet”) or to data equipment operated by service provider. The local network 1521 and network 1525 both use electrical, electromagnetic, or optical signals to convey information and instructions. The signals through the various networks and the signals on network link 1519 and through communication interface 1517, which communicate digital data with computer system 1500, are exemplary forms of carrier waves bearing the information and instructions.
 The computer system1500 can send messages and receive data, including program code, through the network(s), network link 1519, and communication interface 1517. In the Internet example, a server (not shown) might transmit requested code belonging to an application program for implementing an embodiment of the present invention through the network 1525, local network 1521 and communication interface 1517. The processor 1503 may execute the transmitted code while being received and/or store the code in storage device 159, or other nonvolatile storage for later execution. In this manner, computer system 1500 may obtain application code in the form of a carrier wave.
 The term “computerreadable medium” as used herein refers to any medium that participates in providing instructions to the processor1503 for execution. Such a medium may take many forms, including but not limited to nonvolatile media, volatile media, and transmission media. Nonvolatile media include, for example, optical or magnetic disks, such as storage device 1509. Volatile media include dynamic memory, such as main memory 1505. Transmission media include coaxial cables, copper wire and fiber optics, including the wires that comprise bus 1501. Transmission media can also take the form of acoustic, optical, or electromagnetic waves, such as those generated during radio frequency (RF) and infrared (IR) data communications. Common forms of computerreadable media include, for example, a floppy disk, a flexible disk, hard disk, magnetic tape, any other magnetic medium, a CDROM, CDRW, DVD, any other optical medium, punch cards, paper tape, optical mark sheets, any other physical medium with patterns of holes or other optically recognizable indicia, a RAM, a PROM, and EPROM, a FLASHEPROM, any other memory chip or cartridge, a carrier wave, or any other medium from which a computer can read.
 Various forms of computerreadable media may be involved in providing instructions to a processor for execution. For example, the instructions for carrying out at least part of the present invention may initially be borne on a magnetic disk of a remote computer. In such a scenario, the remote computer loads the instructions into main memory and sends the instructions over a telephone line using a modem. A modem of a local computer system receives the data on the telephone line and uses an infrared transmitter to convert the data to an infrared signal and transmit the infrared signal to a portable computing device, such as a personal digital assistance (PDA) and a laptop. An infrared detector on the portable computing device receives the information and instructions borne by the infrared signal and places the data on a bus. The bus conveys the data to main memory, from which a processor retrieves and executes the instructions. The instructions received by main memory may optionally be stored on storage device either before or after execution by processor.
 Accordingly, the various embodiments of the present invention provide an approach for generating structured Low Density Parity Check (LDPC) codes, as to simplify the encoder and decoder. Structure of the LDPC codes is provided by restricting the parity check matrix to be lower triangular. Also, the approach can advantageously exploit the unequal error protecting capability of LDPC codes on transmitted bits to provide extra error protection to more vulnerable bits of high order modulation constellations (such as 8PSK (Phase Shift Keying)). Additionally, the parity check matrix can be algorithmically generated using prestored constants and bitwise operations. Efficient decoding of the LDPC can be achieved by storing information representing consecutive edges from the check nodes to the bit nodes of the parity check matrix in consecutive slots of memory. The above approach advantageously yields reduced complexity without sacrificing performance.
 While the present invention has been described in connection with a number of embodiments and implementations, the present invention is not so limited but covers various obvious modifications and equivalent arrangements, which fall within the purview of the appended claims.
Claims (21)
 1. A method for generating low density parity check (LDPC) codes, the method comprising:transforming a received input message into a LDPC codeword using only a parity check matrix of the LDPC codes without using a generator matrix of the LDPC codes; andoutputting the LDPC codeword.
 2. A method according to
claim 1 , wherein a predetermined triangular portion of the parity check matrix in the transforming step has zero values, the method further comprising:storing values of the parity check matrix to facilitate generation of the parity bits associated with the LDPC codes.  3. A method according to
claim 1 , wherein a predetermined triangular portion of the parity check matrix in the transforming step has zero values after row or column permutation, the method further comprising:storing values of the parity check matrix to facilitate generation of the parity bits associated with the LDPC codes.  4. A method according to
claim 1 , further comprising:modulating the LDPC code according to a modulation scheme including one of 8PSK (Phase Shift Keying), 16QAM (Quadrature Amplitude Modulation), and QPSK (Quadrature Phase Shift Keying).  5. A computerreadable medium bearing instructions for generating linear block codes, said instruction, being arranged, upon execution, to cause one or more processors to perform the method of
claim 1 .  6. A method for supporting encoding of linear block codes, the method comprising:mapping higher order signal constellation bits to bit nodes of a parity check matrix corresponding to the linear block codes,wherein vulnerable bits of the signal constellation are mapped to the bit nodes with at least three edges.
 7. A method according to claims 6, wherein the signal constellation includes one of 8PSK (Phase Shift Keying), 16QAM (Quadrature Amplitude Modulation), and QPSK (Quadrature Phase Shift Keying).
 8. A computerreadable medium bearing instructions for generating linear block codes, said instruction, being arranged, upon execution, to cause one or more processors to perform the method of
claim 6 .  9. A method for supporting encoding of linear block codes, the method comprising:mapping higher order signal constellation bits to bit nodes of a parity check matrix corresponding to the linear block code,wherein vulnerable bits of the signal constellation are mapped to the bit nodes with number of edges no less than that of more reliable bits.
 10. A method according to
claim 9 , wherein the signal constellation includes one of 8PSK (Phase Shift Keying), 16QAM (Quadrature Amplitude Modulation), and QPSK (Quadrature Phase Shift Keying).  11. A computerreadable medium bearing instructions for generating linear block codes, said instruction, being arranged, upon execution, to cause one or more processors to perform the method of
claim 9 .  12. A method for generating low density parity check (LDPC) codes, the method comprising:transforming a received input message into a LDPC codeword using only a parity check matrix of the LDPC codes without using a generator matrix of the LDPC codes;applying an outer code to the LDPC codeword; andoutputting the LDPC codeword with the applied outer code.
 13. A method according to
claim 12 , wherein the outer code in the applying step includes one of a Bose, Chaudhuri, and Hocquenghem (BCH) code, a ReedSolomon (RS) code, and a Hamming code.  14. A method for generating low density parity check (LDPC) code, the method comprising:placing contents of edges for a group of bit nodes next to one another in memory; andsimultaneously placing contents of edges for a group of check nodes next to one another in the memory.
 15. A method according to
claim 14 , further comprising:accessing the memory to retrieve edge values associated with a group of bit nodes or a group of check nodes in a single clock cycle.  16. A computerreadable medium bearing instructions for generating linear block codes, said instruction, being arranged, upon execution, to cause one or more processors to perform the method of
claim 14 .  17. A system for generating low density parity check (LDPC) codes, the system comprising:means for transforming a received input message into a LDPC codeword using only a parity check matrix of the LDPC codes without using a generator matrix of the LDPC codes; andmeans for outputting the LDPC codeword.
 18. A system according to
claim 17 , wherein a predetermined triangular portion of the parity check matrix has zero values, the system further comprising:means for storing values of the parity check matrix to facilitate generation of the parity bits associated with the LDPC codes.  19. A system according to
claim 17 , wherein a predetermined triangular portion of the parity check matrix has zero values after row or column permutation, the system further comprising:means for storing values of the parity check matrix to facilitate generation of the parity bits associated with the LDPC codes.  20. A system according to
claim 17 , further comprising:modulating the LDPC code according to a modulation scheme including one of 8PSK (Phase Shift Keying), 16QAM (Quadrature Amplitude Modulation), and QPSK (Quadrature Phase Shift Keying).  21. A method for processing low density parity check (LDPC) codes, the method comprising:decoding via a LDPC decoder received LDPC codes; anditeratively regenerating signal constellation bit metrics into the LDPC decoder after every or several LDPC decoder iterations.
Priority Applications (6)
Application Number  Priority Date  Filing Date  Title 

US39876002 true  20020726  20020726  
US40381202 true  20020815  20020815  
US42150502 true  20021025  20021025  
US42199902 true  20021029  20021029  
US42371002 true  20021104  20021104  
US10353230 US20040019845A1 (en)  20020726  20030128  Method and system for generating low density parity check codes 
Applications Claiming Priority (13)
Application Number  Priority Date  Filing Date  Title 

US10353230 US20040019845A1 (en)  20020726  20030128  Method and system for generating low density parity check codes 
KR20030039765A KR100543154B1 (en)  20020726  20030619  Method and system for generating low density parity check codes 
JP2003176330A JP4422436B2 (en)  20020726  20030620  Method and system for generating low density parity check code 
DE2003613832 DE60313832T2 (en)  20020726  20030707  Method and system for generating Low Density Parity Check (LDPC) codes 
DK03254308T DK1385270T3 (en)  20020726  20030707  A method and system for generating low density parity check codes (LDPC codes) 
ES03254308T ES2285049T3 (en)  20020726  20030707  Method and system for generating parity check codes low density (LDPC). 
DE2003613832 DE60313832D1 (en)  20020726  20030707  Method and system for generating Low Density Parity Check (LDPC) codes 
AT03254308T AT362675T (en)  20020726  20030707  A method and system for generating low density parity check (LDPC) codes 
EP20030254308 EP1385270B1 (en)  20020726  20030707  Method and system for generating low density parity check (LDPC) codes 
CN 03132883 CN1481130A (en)  20020726  20030724  Method and system for generating low density parity code 
CN 200910006878 CN101515804B (en)  20020726  20030724  Method and system for generating low density parity check codes 
US11938016 US8095854B2 (en)  20020726  20071109  Method and system for generating low density parity check codes 
JP2009234228A JP2010050994A (en)  20020726  20091008  Method and system for generating low density parity check code 
Related Child Applications (1)
Application Number  Title  Priority Date  Filing Date 

US11938016 Division US8095854B2 (en)  20020726  20071109  Method and system for generating low density parity check codes 
Publications (1)
Publication Number  Publication Date 

US20040019845A1 true true US20040019845A1 (en)  20040129 
Family
ID=30773784
Family Applications (2)
Application Number  Title  Priority Date  Filing Date 

US10353230 Abandoned US20040019845A1 (en)  20020726  20030128  Method and system for generating low density parity check codes 
US11938016 Active 20260109 US8095854B2 (en)  20020726  20071109  Method and system for generating low density parity check codes 
Family Applications After (1)
Application Number  Title  Priority Date  Filing Date 

US11938016 Active 20260109 US8095854B2 (en)  20020726  20071109  Method and system for generating low density parity check codes 
Country Status (1)
Country  Link 

US (2)  US20040019845A1 (en) 
Cited By (22)
Publication number  Priority date  Publication date  Assignee  Title 

US20050060635A1 (en) *  20030904  20050317  Hughes Electronics  Method and system for providing short block length low density parity check (LDPC) codes 
US20050091570A1 (en) *  20031027  20050428  Mustafa Eroz  Method and system for providing long and short block length low density parity check (LDPC) codes 
US20050240853A1 (en) *  20030513  20051027  Takashi Yokokawa  Decoding device, decoding method, and program 
US20070101233A1 (en) *  20051014  20070503  Mustafa Eroz  System, method and computer program product for implementing rate 3/4 low density parity check code 
US20070294607A1 (en) *  20040913  20071220  Shigeru Uchida  LdpcCode Generating Method, Communication Apparatus, And CodeString Generating Method 
KR100800775B1 (en)  20050727  20080201  삼성전자주식회사  A Channel coding method and apparatus in mobile communication system 
US7500168B2 (en)  20040630  20090303  Kabushiki Kaisha Toshiba  Decoder and decoding method for decoding lowdensity paritycheck codes with parity check matrix 
US20090100311A1 (en) *  20060429  20090416  Timi Technologies Co., Ltd.  Method of Constructing Low Density Parity Check Code, Method of Decoding the Same and Transmission System For the Same 
US20090122903A1 (en) *  20050906  20090514  Kddi Corporation  Data Transmissiom System And Data Transmission Method 
US7539920B2 (en)  20041216  20090526  Electronics And Telecommunications Research Institute  LDPC decoding apparatus and method with low computational complexity algorithm 
KR100918741B1 (en)  20040727  20090924  삼성전자주식회사  Apparatus and method for channel coding in mobile communication system 
WO2010024914A1 (en) *  20080829  20100304  Thomson Licensing  System and method for reusing dvbs2 ldpc codes in dvbc2 
US20100287440A1 (en) *  20090507  20101111  Ramot At Tel Aviv University Ltd.  Matrix structure for block encoding 
US20110202820A1 (en) *  20100218  20110818  Hughes Network Systems, Llc  Method and system for providing low density parity check (ldpc) encoding and decoding 
KR101191196B1 (en)  20060607  20121015  엘지전자 주식회사  Method of encoding and decoding using a parity check matrix 
US8683292B2 (en)  20100112  20140325  Hughes Network Systems, Llc  Method and system for providing low density parity check (LDPC) coding for scrambled coded multiple access (SCMA) 
US8782489B2 (en)  20100218  20140715  Hughes Network Systems, Llc  Method and system for providing Low Density Parity Check (LDPC) encoding and decoding 
US8887024B2 (en)  20130210  20141111  Hughes Network Systems, Llc  Apparatus and method for improved modulation and coding schemes for broadband satellite communications systems 
US8972834B2 (en)  20120828  20150303  Hughes Network Systems, Llc  System and method for communicating with low density parity check codes 
US9203431B2 (en)  20130315  20151201  Hughes Networks Systems, Llc  Low density parity check (LDPC) encoding and decoding for small terminal applications 
US9246634B2 (en)  20130210  20160126  Hughes Network Systems, Llc  Apparatus and method for improved modulation and coding schemes for broadband satellite communications systems 
US9294131B2 (en)  20130210  20160322  Hughes Network Systems, Llc  Apparatus and method for improved modulation and coding schemes for broadband satellite communications systems 
Families Citing this family (6)
Publication number  Priority date  Publication date  Assignee  Title 

US8130228B2 (en) *  20080613  20120306  International Business Machines Corporation  System and method for processing low density parity check codes using a deterministic caching apparatus 
US8370711B2 (en)  20080623  20130205  Ramot At Tel Aviv University Ltd.  Interruption criteria for block decoding 
US20090319860A1 (en) *  20080623  20091224  Ramot At Tel Aviv University Ltd.  Overcoming ldpc trapping sets by decoder reset 
CN103236861B (en) *  20130510  20160316  电子科技大学  Triangular ldpc method of the class code Galois field check matrix 
US9606868B2 (en) *  20150504  20170328  International Business Machines Corporation  Encoding and writing of data on multitrack tape 
US9712188B2 (en)  20150504  20170718  International Business Machines Corporation  Decoding data stored with three orthogonal codewords 
Citations (46)
Publication number  Priority date  Publication date  Assignee  Title 

US4709377A (en) *  19850313  19871124  Paradyne  Viterbi decoder for wireline modems 
US5099484A (en) *  19890609  19920324  Digital Equipment Corporation  Multiple bit error detection and correction system employing a modified ReedSolomon code incorporating address parity and catastrophic failure detection 
US5371471A (en) *  19931029  19941206  General Electric Company  Low complexity adaptive equalizer radio receiver employing direct reference state updates 
US5467132A (en) *  19921130  19951114  Deutsche Forschungsansalt Fur LuftUnd Raumfahrt E.V.  Method for digital transmission of hierarchical HDTV, EDTV and SDTV television signals 
US5559990A (en) *  19920214  19960924  Advanced Micro Devices, Inc.  Memories with burst mode access 
US5949796A (en) *  19960619  19990907  Kumar; Derek D.  Inband onchannel digital broadcasting method and system 
US6031874A (en) *  19970926  20000229  Ericsson Inc.  Unequal error protection in coded modulation schemes 
US6075408A (en) *  19981230  20000613  International Business Machines Corp.  OQPSK phase and timing detection 
US6115427A (en) *  19960426  20000905  At&T Corp.  Method and apparatus for data transmission using multiple transmit antennas 
US6216200B1 (en) *  19941014  20010410  Mips Technologies, Inc.  Address queue 
US6292917B1 (en) *  19980930  20010918  Agere Systems Guardian Corp.  Unequal error protection for digital broadcasting using channel classification 
US20020021770A1 (en) *  20000503  20020221  Beerel Peter A.  Reducedlatency softin/softout module 
US20020048329A1 (en) *  20000912  20020425  Tran Hau Thien  Method and apparatus for min star calculations in a map decoder 
US20020051501A1 (en) *  20000428  20020502  Victor Demjanenko  Use of turbolike codes for QAM modulation using independent I and Q decoding techniques and applications to xDSL systems 
US20020051499A1 (en) *  20000905  20020502  Cameron Kelly B.  Quasi error free (QEF) communication using turbo codes 
US6405338B1 (en) *  19980211  20020611  Lucent Technologies Inc.  Unequal error protection for perceptual audio coders 
US20020071504A1 (en) *  20000619  20020613  Xiaopeng Chen  Method for iterative and noniterative data detection using reducedstate softinput/softoutput algorithms for complexity reduction 
US6438180B1 (en) *  19970509  20020820  Carnegie Mellon University  Soft and hard sequence detection in ISI memory channels 
US20020136318A1 (en) *  20010116  20020926  Alexei Gorokhov  Transmission system for transmitting a multilevel signal 
US6510536B1 (en) *  19980601  20030121  Her Majesty The Queen In Right Of Canada, As Represented By The Minister Of Industry Through The Communications Research Centre  Reducedcomplexity maxlogAPP decoders and related turbo decoders 
US6518892B2 (en) *  20001106  20030211  Broadcom Corporation  Stopping criteria for iterative decoding 
US20030033570A1 (en) *  20010509  20030213  Khannanov Roman R.  Method and apparatus for encoding and decoding low density parity check codes and low density turbo product codes 
US6539367B1 (en) *  20000526  20030325  Agere Systems Inc.  Methods and apparatus for decoding of general codes on probability dependency graphs 
US6633856B2 (en) *  20010615  20031014  Flarion Technologies, Inc.  Methods and apparatus for decoding LDPC codes 
US20030207696A1 (en) *  20020506  20031106  Serge Willenegger  Multimedia broadcast and multicast service (MBMS) in a wireless communications system 
US6718508B2 (en) *  20000526  20040406  Her Majesty The Queen In Right Of Canada, As Represented By The Minister Of Industry Through The Communication Research Centre  Highperformance errorcorrecting codes with skew mapping 
US20040098659A1 (en) *  20021118  20040520  Bjerke Bjorn A.  Ratecompatible LDPC codes 
US6751770B2 (en) *  20001011  20040615  Sony Corporation  Decoder for iterative decoding of binary cyclic codes 
US6769091B2 (en) *  20001017  20040727  Motorola, Inc.  Encoding method and apparatus using squished trellis codes 
US6785863B2 (en) *  20020918  20040831  Motorola, Inc.  Method and apparatus for generating paritycheck bits from a symbol set 
US6829308B2 (en) *  20020703  20041207  Hughes Electronics Corporation  Satellite communication system utilizing low density parity check codes 
US6857097B2 (en) *  20010516  20050215  Mitsubishi Electric Research Laboratories, Inc.  Evaluating and optimizing errorcorrecting codes using a renormalization group transformation 
US6895547B2 (en) *  20010711  20050517  International Business Machines Corporation  Method and apparatus for low density parity check encoding of data 
US6901119B2 (en) *  20010222  20050531  International Business Machines Corporation  Method and apparatus for implementing softinput/softoutput iterative detectors/decoders 
US6950461B2 (en) *  20010521  20050927  Pctel, Inc.  Modems utilizing low density parity check codes 
US6985536B2 (en) *  20010112  20060110  International Business Machines Corporation  Block coding for multilevel data communication 
US7000177B1 (en) *  20000628  20060214  Marvell International Ltd.  Parity check matrix and method of forming thereof 
US7017106B2 (en) *  20020815  20060321  Broadcom Corporation  Low density parity check (LDPC) code decoder using min*, min**, max* or max** and their respective inverses 
US7116710B1 (en) *  20000518  20061003  California Institute Of Technology  Serial concatenation of interleaved convolutional codes forming turbolike codes 
US7178082B2 (en) *  20030429  20070213  Samsung Electronics Co., Ltd.  Apparatus and method for encoding a low density parity check code 
US7184486B1 (en) *  20000427  20070227  Marvell International Ltd.  LDPC encoder and decoder and method thereof 
US7191378B2 (en) *  20020703  20070313  The Directv Group, Inc.  Method and system for providing low density parity check (LDPC) encoding 
US20080189589A1 (en) *  20070202  20080807  Samsung Electronics Co., Ltd.  Apparatus and method for receiving signal in a communication system 
US20100269011A1 (en) *  20071212  20101021  Electronics And Telecommunications Research Institute  Apparatus and method for decoding low density parity check code using prototype matrix 
US20110138248A1 (en) *  20091209  20110609  National Chip Implementation Center National Applied Research Laboratories  Method for arranging memories of lowcomplexity ldpc decoder and lowcomplexity ldpc decoder using the same 
US20110252286A1 (en) *  20100408  20111013  Shu Li  Nonbinary ldpc code decoder 
Family Cites Families (42)
Publication number  Priority date  Publication date  Assignee  Title 

CA2263277A1 (en) *  19980304  19990904  International Mobile Satellite Organization  Carrier activation for data communications 
US6553535B1 (en) *  19980821  20030422  Massachusetts Institute Of Technology  Powerefficient communication protocol 
DE19902520B4 (en) *  19990122  20051006  Siemens Ag  Hybrid power MOSFET 
FR2799592B1 (en)  19991012  20030926  Thomson Csf  Method for construction and simple and systematic coding codes ldpc 
US7000174B2 (en) *  19991220  20060214  Research In Motion Limited  Hybrid automatic repeat request system and method 
CA2310186A1 (en)  20000602  20011202  Jeffrey P. Castura  Method and system for decoding 
US20020002695A1 (en) *  20000602  20020103  Frank Kschischang  Method and system for decoding 
KR20100046063A (en) *  20000616  20100504  어웨어, 인크.  System and methods for ldpc coded modulation 
US6965652B1 (en) *  20000628  20051115  Marvell International Ltd.  Address generator for LDPC encoder and decoder and method thereof 
US7072417B1 (en) *  20000628  20060704  Marvell International Ltd.  LDPC encoder and method thereof 
JP2002094450A (en)  20000919  20020329  Easter Egg:Kk  Bar code distribution system utilizing internet function of portable information terminal (including portable telephone) 
US20040196861A1 (en) *  20010112  20041007  Joseph Rinchiuso  Packet data transmission within a broadband communication system 
US7003045B2 (en) *  20010131  20060221  Motorola, Inc.  Method and apparatus for error correction 
US20020150167A1 (en) *  20010217  20021017  Victor Demjanenko  Methods and apparatus for configurable or assymetric forward error correction 
WO2002099976B1 (en)  20010606  20040408  Seagate Technology Llc  A method and coding apparatus using low density parity check codes for data storage or data transmission 
US6938196B2 (en) *  20010615  20050830  Flarion Technologies, Inc.  Node processors for use in parity check decoders 
US7673223B2 (en) *  20010615  20100302  Qualcomm Incorporated  Node processors for use in parity check decoders 
EP1402673B1 (en)  20010621  20080116  Philips Electronics N.V.  Transmission method and apparatus in a radio communications network 
US6789227B2 (en) *  20010705  20040907  International Business Machines Corporation  System and method for generating low density parity check codes using bitfilling 
US6928602B2 (en) *  20010718  20050809  Sony Corporation  Encoding method and encoder 
US7000167B2 (en) *  20010801  20060214  International Business Machines Corporation  Decoding low density parity check codes 
US7246304B2 (en) *  20010901  20070717  Dsp Group Inc  Decoding architecture for low density parity check codes 
US6842872B2 (en) *  20011001  20050111  Mitsubishi Electric Research Laboratories, Inc.  Evaluating and optimizing errorcorrecting codes using projective analysis 
US6948109B2 (en) *  20011024  20050920  Vitesse Semiconductor Corporation  Lowdensity parity check forward error correction 
US7023936B2 (en) *  20011029  20060404  Intel Corporation  Method and apparatus for decoding lattice codes and multilevel coset codes 
US7028230B2 (en) *  20011105  20060411  Nokia Corporation  Partially filling block interleaver for a communication system 
US7068729B2 (en) *  20011221  20060627  Digital Fountain, Inc.  Multistage code generator and decoder for communication systems 
JP4042841B2 (en) *  20020329  20080206  富士通株式会社  Matrix calculation processing unit 
FR2838581B1 (en)  20020416  20050708  Universit De Bretagne Sud  coding method and / or correction code decoding error, devices and corresponding signal 
US6847678B2 (en) *  20020425  20050125  Raytheon Company  Adaptive air interface waveform 
US7864869B2 (en) *  20020726  20110104  Dtvg Licensing, Inc.  Satellite communication system utilizing low density parity check codes 
US7178080B2 (en) *  20020815  20070213  Texas Instruments Incorporated  Hardwareefficient low density parity check code for digital communications 
US7222289B2 (en) *  20020930  20070522  Certance Llc  Channel processor using reduced complexity LDPC decoder 
KR101058324B1 (en)  20030226  20110822  콸콤 인코포레이티드  Multilowdensity parity check using the level permutation (ldpc) method for performing the operation code and the device 
US7296208B2 (en) *  20030703  20071113  The Directv Group, Inc.  Method and system for generating parallel decodable low density parity check (LDPC) codes 
KR20050046471A (en) *  20031114  20050518  삼성전자주식회사  Apparatus for encoding/decoding using parallel concatenation low density parity check code and the method thereof 
US7395495B2 (en) *  20040112  20080701  Intel Corporation  Method and apparatus for decoding forward error correction codes 
KR100981503B1 (en) *  20040213  20100910  삼성전자주식회사  Apparatus and method for encoding/decoding low density parity check code with maximum error correction/error detection capacity 
US7165205B2 (en) *  20040514  20070116  Motorola, Inc.  Method and apparatus for encoding and decoding data 
US20050265387A1 (en) *  20040601  20051201  Khojastepour Mohammad A  General code design for the relay channel and factor graph decoding 
KR100640399B1 (en) *  20041027  20061030  삼성전자주식회사  Puncturing method for ldpc channel code 
US7620880B2 (en) *  20051220  20091117  Samsung Electronics Co., Ltd.  LDPC concatenation rules for IEEE 802.11n system with packets length specified in OFDM symbols 
Patent Citations (47)
Publication number  Priority date  Publication date  Assignee  Title 

US4709377A (en) *  19850313  19871124  Paradyne  Viterbi decoder for wireline modems 
US5099484A (en) *  19890609  19920324  Digital Equipment Corporation  Multiple bit error detection and correction system employing a modified ReedSolomon code incorporating address parity and catastrophic failure detection 
US5559990A (en) *  19920214  19960924  Advanced Micro Devices, Inc.  Memories with burst mode access 
US5467132A (en) *  19921130  19951114  Deutsche Forschungsansalt Fur LuftUnd Raumfahrt E.V.  Method for digital transmission of hierarchical HDTV, EDTV and SDTV television signals 
US5371471A (en) *  19931029  19941206  General Electric Company  Low complexity adaptive equalizer radio receiver employing direct reference state updates 
US6216200B1 (en) *  19941014  20010410  Mips Technologies, Inc.  Address queue 
US6115427A (en) *  19960426  20000905  At&T Corp.  Method and apparatus for data transmission using multiple transmit antennas 
US5949796A (en) *  19960619  19990907  Kumar; Derek D.  Inband onchannel digital broadcasting method and system 
US6438180B1 (en) *  19970509  20020820  Carnegie Mellon University  Soft and hard sequence detection in ISI memory channels 
US6031874A (en) *  19970926  20000229  Ericsson Inc.  Unequal error protection in coded modulation schemes 
US6405338B1 (en) *  19980211  20020611  Lucent Technologies Inc.  Unequal error protection for perceptual audio coders 
US6510536B1 (en) *  19980601  20030121  Her Majesty The Queen In Right Of Canada, As Represented By The Minister Of Industry Through The Communications Research Centre  Reducedcomplexity maxlogAPP decoders and related turbo decoders 
US6292917B1 (en) *  19980930  20010918  Agere Systems Guardian Corp.  Unequal error protection for digital broadcasting using channel classification 
US6075408A (en) *  19981230  20000613  International Business Machines Corp.  OQPSK phase and timing detection 
US7184486B1 (en) *  20000427  20070227  Marvell International Ltd.  LDPC encoder and decoder and method thereof 
US20020051501A1 (en) *  20000428  20020502  Victor Demjanenko  Use of turbolike codes for QAM modulation using independent I and Q decoding techniques and applications to xDSL systems 
US20020021770A1 (en) *  20000503  20020221  Beerel Peter A.  Reducedlatency softin/softout module 
US7116710B1 (en) *  20000518  20061003  California Institute Of Technology  Serial concatenation of interleaved convolutional codes forming turbolike codes 
US6718508B2 (en) *  20000526  20040406  Her Majesty The Queen In Right Of Canada, As Represented By The Minister Of Industry Through The Communication Research Centre  Highperformance errorcorrecting codes with skew mapping 
US6539367B1 (en) *  20000526  20030325  Agere Systems Inc.  Methods and apparatus for decoding of general codes on probability dependency graphs 
US20020071504A1 (en) *  20000619  20020613  Xiaopeng Chen  Method for iterative and noniterative data detection using reducedstate softinput/softoutput algorithms for complexity reduction 
US7000177B1 (en) *  20000628  20060214  Marvell International Ltd.  Parity check matrix and method of forming thereof 
US20020051499A1 (en) *  20000905  20020502  Cameron Kelly B.  Quasi error free (QEF) communication using turbo codes 
US20020048329A1 (en) *  20000912  20020425  Tran Hau Thien  Method and apparatus for min star calculations in a map decoder 
US6751770B2 (en) *  20001011  20040615  Sony Corporation  Decoder for iterative decoding of binary cyclic codes 
US6769091B2 (en) *  20001017  20040727  Motorola, Inc.  Encoding method and apparatus using squished trellis codes 
US6518892B2 (en) *  20001106  20030211  Broadcom Corporation  Stopping criteria for iterative decoding 
US6985536B2 (en) *  20010112  20060110  International Business Machines Corporation  Block coding for multilevel data communication 
US20020136318A1 (en) *  20010116  20020926  Alexei Gorokhov  Transmission system for transmitting a multilevel signal 
US6901119B2 (en) *  20010222  20050531  International Business Machines Corporation  Method and apparatus for implementing softinput/softoutput iterative detectors/decoders 
US20030033570A1 (en) *  20010509  20030213  Khannanov Roman R.  Method and apparatus for encoding and decoding low density parity check codes and low density turbo product codes 
US6857097B2 (en) *  20010516  20050215  Mitsubishi Electric Research Laboratories, Inc.  Evaluating and optimizing errorcorrecting codes using a renormalization group transformation 
US6950461B2 (en) *  20010521  20050927  Pctel, Inc.  Modems utilizing low density parity check codes 
US20050278606A1 (en) *  20010615  20051215  Tom Richardson  Methods and apparatus for decoding ldpc codes 
US6633856B2 (en) *  20010615  20031014  Flarion Technologies, Inc.  Methods and apparatus for decoding LDPC codes 
US6895547B2 (en) *  20010711  20050517  International Business Machines Corporation  Method and apparatus for low density parity check encoding of data 
US20030207696A1 (en) *  20020506  20031106  Serge Willenegger  Multimedia broadcast and multicast service (MBMS) in a wireless communications system 
US7191378B2 (en) *  20020703  20070313  The Directv Group, Inc.  Method and system for providing low density parity check (LDPC) encoding 
US6829308B2 (en) *  20020703  20041207  Hughes Electronics Corporation  Satellite communication system utilizing low density parity check codes 
US7017106B2 (en) *  20020815  20060321  Broadcom Corporation  Low density parity check (LDPC) code decoder using min*, min**, max* or max** and their respective inverses 
US6785863B2 (en) *  20020918  20040831  Motorola, Inc.  Method and apparatus for generating paritycheck bits from a symbol set 
US20040098659A1 (en) *  20021118  20040520  Bjerke Bjorn A.  Ratecompatible LDPC codes 
US7178082B2 (en) *  20030429  20070213  Samsung Electronics Co., Ltd.  Apparatus and method for encoding a low density parity check code 
US20080189589A1 (en) *  20070202  20080807  Samsung Electronics Co., Ltd.  Apparatus and method for receiving signal in a communication system 
US20100269011A1 (en) *  20071212  20101021  Electronics And Telecommunications Research Institute  Apparatus and method for decoding low density parity check code using prototype matrix 
US20110138248A1 (en) *  20091209  20110609  National Chip Implementation Center National Applied Research Laboratories  Method for arranging memories of lowcomplexity ldpc decoder and lowcomplexity ldpc decoder using the same 
US20110252286A1 (en) *  20100408  20111013  Shu Li  Nonbinary ldpc code decoder 
Cited By (39)
Publication number  Priority date  Publication date  Assignee  Title 

USRE44420E1 (en)  20030513  20130806  Sony Corporation  Decoding apparatus, decoding method, and program to decode low density parity check codes 
US20050240853A1 (en) *  20030513  20051027  Takashi Yokokawa  Decoding device, decoding method, and program 
US7299397B2 (en) *  20030513  20071120  Sony Corporation  Decoding apparatus, decoding method, and program to decode low density parity check codes 
US7334181B2 (en) *  20030904  20080219  The Directv Group, Inc.  Method and system for providing short block length low density parity check (LDPC) codes 
US7673226B2 (en)  20030904  20100302  The Directv Group, Inc.  Method and system for providing short block length low density parity check (LDPC) codes 
US20080082894A1 (en) *  20030904  20080403  The Directv Group, Inc.  Method and system for providing short block length low density parity check (ldpc) codes 
US20050060635A1 (en) *  20030904  20050317  Hughes Electronics  Method and system for providing short block length low density parity check (LDPC) codes 
US8069393B2 (en)  20031027  20111129  Dtvg Licensing, Inc.  Method and system for providing long and short block length low density parity check (LDPC) codes 
US20080065972A1 (en) *  20031027  20080313  The Directv Group, Inc.  Method and system for providing long and short block length low density parity check (ldpc) codes 
US7376883B2 (en)  20031027  20080520  The Directv Group, Inc.  Method and system for providing long and short block length low density parity check (LDPC) codes 
US7483496B2 (en)  20031027  20090127  The Directv Group, Inc.  Method and system for providing long and short block length low density parity check (LDPC) codes 
US20090158117A1 (en) *  20031027  20090618  The Directv Group, Inc.  Method and system for providing long and short block length low density parity check (ldpc) codes 
US20050091570A1 (en) *  20031027  20050428  Mustafa Eroz  Method and system for providing long and short block length low density parity check (LDPC) codes 
US7500168B2 (en)  20040630  20090303  Kabushiki Kaisha Toshiba  Decoder and decoding method for decoding lowdensity paritycheck codes with parity check matrix 
KR100918741B1 (en)  20040727  20090924  삼성전자주식회사  Apparatus and method for channel coding in mobile communication system 
US7805653B2 (en)  20040903  20100928  Mitsubishi Electric Corporation  LDPCcode generating method, communication apparatus, and codestring generating method 
US20070294607A1 (en) *  20040913  20071220  Shigeru Uchida  LdpcCode Generating Method, Communication Apparatus, And CodeString Generating Method 
US7539920B2 (en)  20041216  20090526  Electronics And Telecommunications Research Institute  LDPC decoding apparatus and method with low computational complexity algorithm 
KR100800775B1 (en)  20050727  20080201  삼성전자주식회사  A Channel coding method and apparatus in mobile communication system 
US8229021B2 (en)  20050906  20120724  Kddi Corporation  Data transmission system and data transmission method 
US20090122903A1 (en) *  20050906  20090514  Kddi Corporation  Data Transmissiom System And Data Transmission Method 
US7581162B2 (en)  20051014  20090825  Hughes Network Systems, Llc  System, method and computer program product for implementing rate ¾ low density parity check code 
US20070101233A1 (en) *  20051014  20070503  Mustafa Eroz  System, method and computer program product for implementing rate 3/4 low density parity check code 
US8176383B2 (en)  20060429  20120508  Timi Technologies Co., Ltd.  Method of constructing low density parity check code, method of decoding the same and transmission system for the same 
US20090100311A1 (en) *  20060429  20090416  Timi Technologies Co., Ltd.  Method of Constructing Low Density Parity Check Code, Method of Decoding the Same and Transmission System For the Same 
KR101191196B1 (en)  20060607  20121015  엘지전자 주식회사  Method of encoding and decoding using a parity check matrix 
WO2010024914A1 (en) *  20080829  20100304  Thomson Licensing  System and method for reusing dvbs2 ldpc codes in dvbc2 
US20100287440A1 (en) *  20090507  20101111  Ramot At Tel Aviv University Ltd.  Matrix structure for block encoding 
US8464123B2 (en)  20090507  20130611  Ramot At Tel Aviv University Ltd.  Matrix structure for block encoding 
US8683292B2 (en)  20100112  20140325  Hughes Network Systems, Llc  Method and system for providing low density parity check (LDPC) coding for scrambled coded multiple access (SCMA) 
US8402341B2 (en)  20100218  20130319  Mustafa Eroz  Method and system for providing low density parity check (LDPC) encoding and decoding 
US20110202820A1 (en) *  20100218  20110818  Hughes Network Systems, Llc  Method and system for providing low density parity check (ldpc) encoding and decoding 
US8782489B2 (en)  20100218  20140715  Hughes Network Systems, Llc  Method and system for providing Low Density Parity Check (LDPC) encoding and decoding 
US8972834B2 (en)  20120828  20150303  Hughes Network Systems, Llc  System and method for communicating with low density parity check codes 
US9118353B2 (en)  20120828  20150825  Hughes Network Systems, Llc  System and method for communicating with low density parity check codes 
US8887024B2 (en)  20130210  20141111  Hughes Network Systems, Llc  Apparatus and method for improved modulation and coding schemes for broadband satellite communications systems 
US9246634B2 (en)  20130210  20160126  Hughes Network Systems, Llc  Apparatus and method for improved modulation and coding schemes for broadband satellite communications systems 
US9294131B2 (en)  20130210  20160322  Hughes Network Systems, Llc  Apparatus and method for improved modulation and coding schemes for broadband satellite communications systems 
US9203431B2 (en)  20130315  20151201  Hughes Networks Systems, Llc  Low density parity check (LDPC) encoding and decoding for small terminal applications 
Also Published As
Publication number  Publication date  Type 

US8095854B2 (en)  20120110  grant 
US20080082895A1 (en)  20080403  application 
Similar Documents
Publication  Publication Date  Title 

US7293222B2 (en)  Systems and processes for fast encoding of hamming codes  
US8010869B2 (en)  Method and device for controlling the decoding of a LDPC encoded codeword, in particular for DVBS2 LDPC encoded codewords  
US6895547B2 (en)  Method and apparatus for low density parity check encoding of data  
US20050166132A1 (en)  IPHD (iterative parallel hybrid decoding) of various MLC (multilevel code) signals  
US20050229087A1 (en)  Decoding apparatus for lowdensity paritycheck codes using sequential decoding, and method thereof  
Lin et al.  Error control coding  
US8069390B2 (en)  Universal error control coding scheme for digital communication and data storage systems  
US20020122502A1 (en)  Method and system for utilizing spacetime overlays for convolutionally coded systems  
US20040093549A1 (en)  Encoding method using a low density parity check code with a column weight of two  
US20070162818A1 (en)  Bandwidth efficient coded modulation scheme based on MLC (multilevel code) signals having multiple maps  
Wicker et al.  An introduction to ReedSolomon codes  
US20040258177A1 (en)  Multidimensional space Gray code maps for multidimensional phase modulation as applied to LDPC (Low Density Parity Check) coded modulation  
US20040194007A1 (en)  Layered low density parity check decoding for digital communications  
US20060085720A1 (en)  Message passing memory and barrel shifter arrangement in LDPC (Low Density Parity Check) decoder supporting multiple LDPC codes  
US20040252791A1 (en)  LDPC (Low Density Parity Check) coded modulation hybrid decoding using nonGray code maps for improved performance  
US20020042899A1 (en)  Systems and methods for LDPC coded modulation  
US20090070652A1 (en)  Apparatus and method for channel encoding/decoding in communication system using variablelength ldpc codes  
US20120266040A1 (en)  Method of error floor mitigation in lowdensity paritycheck codes  
US20040128696A1 (en)  Turbo coding for upstream and downstream transmission in cable systems  
US20020002695A1 (en)  Method and system for decoding  
US20060206779A1 (en)  Method and device for decoding DVBS2 LDPC encoded codewords  
US20060045197A1 (en)  LDPC (Low Density Parity Check) coded 128 DSQ (Double Square QAM) constellation modulation and associated labeling  
US7296212B1 (en)  Multidimensional irregular array codes and methods for forward error correction, and apparatuses and systems employing such codes and methods  
US8369448B2 (en)  Bit mapping scheme for an LDPC coded 32APSK system  
JP2007006494A (en)  Device and method for data transmission/reception in communications system using structural lowdensity parity check code 
Legal Events
Date  Code  Title  Description 

AS  Assignment 
Owner name: HUGHES ELECTRONICS CORPORATION, CALIFORNIA Free format text: ASSIGNMENT OF ASSIGNORS INTEREST;ASSIGNORS:EROZ, MUSTAFA;SUN, FENGWEN;LEE, LINNAN;REEL/FRAME:014602/0696;SIGNING DATES FROM 20030404 TO 20030409 

AS  Assignment 
Owner name: DTVG LICENSING, INC., CALIFORNIA Free format text: ASSIGNMENT OF ASSIGNORS INTEREST;ASSIGNOR:HUGHES ELECTRONICS CORPORATION;REEL/FRAME:022668/0373 Effective date: 20090512 Owner name: DTVG LICENSING, INC.,CALIFORNIA Free format text: ASSIGNMENT OF ASSIGNORS INTEREST;ASSIGNOR:HUGHES ELECTRONICS CORPORATION;REEL/FRAME:022668/0373 Effective date: 20090512 