WO2004062112A2 - Method and apparatus to encode linear block codes - Google Patents

Method and apparatus to encode linear block codes Download PDF

Info

Publication number
WO2004062112A2
WO2004062112A2 PCT/US2003/041435 US0341435W WO2004062112A2 WO 2004062112 A2 WO2004062112 A2 WO 2004062112A2 US 0341435 W US0341435 W US 0341435W WO 2004062112 A2 WO2004062112 A2 WO 2004062112A2
Authority
WO
WIPO (PCT)
Prior art keywords
matrix
triangular matrix
code
computing
intermediate vector
Prior art date
Application number
PCT/US2003/041435
Other languages
French (fr)
Other versions
WO2004062112A3 (en
Inventor
Ilan Sutskover
Original Assignee
Intel Corporation
Priority date (The priority date 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 date listed.)
Filing date
Publication date
Application filed by Intel Corporation filed Critical Intel Corporation
Priority to AU2003302335A priority Critical patent/AU2003302335A1/en
Priority to EP03810891A priority patent/EP1579580A2/en
Publication of WO2004062112A2 publication Critical patent/WO2004062112A2/en
Publication of WO2004062112A3 publication Critical patent/WO2004062112A3/en

Links

Classifications

    • HELECTRICITY
    • H03ELECTRONIC CIRCUITRY
    • H03MCODING; DECODING; CODE CONVERSION IN GENERAL
    • H03M13/00Coding, 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/03Error detection or forward error correction by redundancy in data representation, i.e. code words containing more digits than the source words
    • H03M13/05Error 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/11Error 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/1102Codes on graphs and decoding on graphs, e.g. low-density parity check [LDPC] codes
    • H03M13/1148Structural properties of the code parity-check or generator matrix
    • H03M13/118Parity check matrix structured for simplifying encoding, e.g. by having a triangular or an approximate triangular structure
    • H03M13/1182Parity check matrix structured for simplifying encoding, e.g. by having a triangular or an approximate triangular structure wherein the structure of the parity-check matrix is obtained by reordering of a random parity-check matrix

Definitions

  • Error correction using an error correction code, improves the reliability communication systems and devices.
  • an encoder at the transmission end of a communication encodes an input word, for example, a block or vector of a given length, to produce a codeword of the error correction code.
  • a decoder at the receiving end of the communication decodes a received word (block), yielding an estimation of the codeword that may indicate the original input word.
  • a linear block code, C, having length n, may be described by a parity-check matrix, H m x mecanic_ whose null space is block code C.
  • Such encoding may generally be performed by applying generator matrix G to word v to produce x.
  • Block codes having sparse parity check matrices are known in the art by the name of Low-Density Parity-Check (LDPC) codes. Such block codes may provide excellent decoding performance.
  • LDPC codes an encoder was proposed in Richardson and Urbanke, "Efficient encoding of low-density parity-check codes", IEEE Transactions on information theory, Vol.47, No.2, pp.6 ' 38-656, Feb.2001. (“the RU encoder”). However, this encoder is not efficient for encoding certain classes of LDPC codes.
  • the RU encoder is not useful for classes (for example, ensembles) of LDPC codes where only a small fraction of the columns of matrix H, for example, up to one percent of the columns, or none of the columns, contain exactly 2 non-zero entries.
  • classes for example, ensembles
  • Such ensembles are referred to herein as ⁇ 2 - ⁇ 0 classes or ensembles of LDPC codes.
  • Fig. 1 is a schematic block diagram of a communication system including at least one communication device in accordance with exemplary embodiments of the present invention
  • Fig. 2 is a schematic block diagram illustrating an encoder in accordance with exemplary embodiments of the invention.
  • FIG. 3 is a schematic block diagram of a method of encoding linear block codes in accordance with exemplary embodiments of the invention.
  • embodiments of the present invention may be used in variety of applications. Although the scope of the present invention is not limited in this respect, the circuits and techniques disclosed herein may be used in many apparatuses such as receivers of a radio system. Receivers intended to be included within the scope of the present invention include, by a way of example only, cellular radiotelephone receivers, spread spectrum receivers, digital system receivers and the like.
  • Types of cellular radiotelephone receivers intended to be within the scope of the present invention mclude, although not limited to, Code Division Multiple Access (CDMA), CDMA 2000 and wideband CDMA (WCD ⁇ lA) cellular radiotelephone, receivers for receiving spread spectrum signals, and the like.
  • CDMA Code Division Multiple Access
  • WCD ⁇ lA wideband CDMA
  • Devices, systems and methods incorporating aspects of embodiments of the invention are also suitable for computer communication network applications, for example, intranet and Internet applications.
  • Embodiments of the invention may be implemented in conjunction with hardware and/or software adapted to interact with a computer communication network, for example, a local area network (LAN), wide area network (WAN), or a global communication network, for example, the Internet.
  • LAN local area network
  • WAN wide area network
  • global communication network for example, the Internet.
  • FIG. 1 is a simplified block-diagram illustration of an exemplary communication system, in accordance with some embodiments of the present invention.
  • a communication device 100 is able to communicate with a communication device 102 over a commumcation channel 104.
  • communication devices 100, 102 may comprise wire or wireless or cable modems of computers and communication channel 104 may be a wide-area-network (WAN) or local-area-network (LAN).
  • the system may be a wireless LAN system or a digital subscriber line (DSL) system.
  • the communication system shown in Fig. 1 may be part of a cellular communication system, with one of communication devices 100, 102 being a base station and the other a mobile station or with both communication devices 100, 102 being mobile stations, a pager communication system, a personal digital assistant (PDA) and a server, etc.
  • PDA personal digital assistant
  • -communication devices 100 and 102 may each comprise a radio frequency antenna, 101 and 111, respectively, as is known in the art.
  • the communication system shown in Fig. 1 may be a 3 rd Generation Partnership Project (3 GPP), such as, for example, Frequency Domain Duplexing (FDD), Wideband Code Division Multiple Access (WCDMA) cellular system and the like.
  • 3 GPP 3 rd Generation Partnership Project
  • Communication device 100 may comprise a ttans itter 106, which may comprise an encoder 108 in accordance with embodiments of the invention, as described in detail below.
  • Communication device 102 may comprise a receiver 110, which may comprise a decoder 112.
  • Encoder 108 may encode an input word (for example, a block or vector) v, based on a linear block code, to produce a codeword, x, as described in detail below.
  • the linear block code may be represented by a parity-check matrix, H, as described below.
  • Codeword x may be modulated, up-converted and transmitted through comrminir.atir.r_ channel 104, which may be a noisy channel, as is known in the art.
  • Receiver 110 may receive a signal from communication channel 104, which signal, after down-conversion and demodulation, may be identified as a received word, r.
  • decoder 112 may use the parity-check matrix in an attempt to determine from received word r a word v' (or codeword x') that should correspond to the original word v (or codeword x) encoded by encoder 108.
  • FIG. 2 is a simplified block-diagram illustration of an exemplary encoder 200, in accordance with some embodiments of the present invention.
  • Encoder 200 may comprise a computing unit 210 and a memory 220 coupled to computing unit 210.
  • computing- unit 210 may be an application specific integrated-circuit (ASIC), a reduced instruction set circuit (RISC), a digital signal processor (DSP) or a central processing unit (CPU). Instructions to enable computing unit to perform methods of embodiments of the present invention may be stored in memory 220.
  • ASIC application specific integrated-circuit
  • RISC reduced instruction set circuit
  • DSP digital signal processor
  • CPU central processing unit
  • Encoder 200 may implement an encoding algorithm using components of a sparse parity check matrix, H.
  • the encoding method according to embodiments of the invention enables encoding of various classes of Low-Density Parity-Check (LDPC) codes, for example, ⁇ 2 ⁇ 0 ensembles of LDPC, as well as encoding of other classes of LDPC codes, while maintaining a low computational complexity, for example, on the order of 0(n).
  • the encoding method according to embodiments of the present invention may also be used for encoding of codes whose parity check matrix may not be sparse, but where, for example, a sub-matrix derived from the parity check matrix may be sparse.
  • embodiments of the invention may also be suitable for encoding of codes whose parity-check matrix may not have a sparse sub-matrix.
  • an encoder for encoding LDPC codes which codes may be randomly selected over a given ensemble.
  • the encoder in accordance with embodiments of the invention may provide a solution with a computational complexity on the order of 0(n) for encoding LDPC codes of classes having a low block error rate, for example, a block error rate on the order of the bit error rate, for example, ⁇ 2 ⁇ 0 type ensembles.
  • encoder 200 may have stored therein, or in the memory 220 associated therewith, a Lower Upper (LU) decomposition of a sub-matrix derived from H, for example, a sub-matrix representing non-systematic symbols of the code being encoded.
  • LU Lower Upper
  • the LU decomposition operation may be performed offline, for example, using decomposition methods as are known in the art. It will be appreciated that, once a suitable LU decomposition is obtained, the decomposed elements may be used repeatedly by the encoder. Therefore, the complexity of computation- involved in- deriving a suitable decomposition of H is generally inconsequential to the computational complexity of the method of some embodiments of the present invention.
  • a lower triangular matrix is a matrix with entries ⁇ y such that ify>- then ⁇ y— 0.
  • matrix B may have more than one possible LU decomposition, in which case any valid LU decomposition may be used for encoding according to embodiments of the invention.
  • a LU decomposition of a given matrix refers to any decomposition where a lower triangular component and an upper triangular component, neither of which is a unity matrix, are derived from the given matrix.
  • matrices L, U and B' are not necessarily square matrices.
  • sub-matrix B' is not necessarily invertible.
  • matrices L and U may be derived from any other LU-decomposable sub-matrix of H.
  • any other method of deriving at least one lower triangular matrix (L) and at least one upper triangular matrix (U) from parity-check matrix H may be used in conjunction with alternative embodiments of the present invention.
  • a sub-matrix of H may be decomposed using an Upper/Lower (UL) decomposition similar to the LU decomposition described herein.
  • UL Upper/Lower
  • a decomposition of the form LDU or UDL, where D is a diagonal matrix may be derived from parity-check matrix H.
  • a decomposition of the form ALBUC may be derived from parity-check matrix H.
  • pre-calculated data representing sub-matrices A, L and U may be stored in memory, for example, memory 220 of encoder 200 (Fig. 2), or otherwise made available to encoder 200.
  • the output signal may then be further processed and transmitted via a communication network, for example, as described above with reference to Fig. 1.
  • a method in accordance with embodiments of the invention may include the preliminary stage of decomposing a sparse LDPC matrix H to obtain sparse A, L and U matrices, or any other matrices or sub-matrices derived from H, having similar properties.
  • Such a system has been simulated successfully.
  • the process of obtaining sparse A, L and U matrices from a given sparse LDPC matrix H m is a preliminary stage of the encoding process, i.e., it may be carried out only once per code and, therefore, the computational complexity of this stage is not significant to the actual encoding process.
  • the encoder of Fig. 2 and the encoding method of Fig. 3 describe exemplary implementation of encoders in accordance with embodiments of the invention. However, it should be appreciated that various other encoder designs and encoding methods are also within the scope of the present invention, for example " , any encoder or encoding method utilizing the sparseness of parity check matrix H by applying a sparse decomposition comprising at least one lower triangular matrix L and at least one upper triangular matrix U, either to an m x m matrix or to any / x I sparse matrix deduced from H, wherein I ⁇ m. It will be appreciate that the encoder of Fig.
  • classes of LDPC codes are useful in many coding applications, for example, Internet-related coding applications.
  • the encoder of embodiments of the invention may be useful for encoding other categories of LDPC codes in addition to LDPC codes defined above, as well as for additional types of codes.

Landscapes

  • Physics & Mathematics (AREA)
  • Mathematical Physics (AREA)
  • Probability & Statistics with Applications (AREA)
  • Engineering & Computer Science (AREA)
  • Theoretical Computer Science (AREA)
  • Error Detection And Correction (AREA)

Abstract

A method of encoding a linear block code including receiving an input word and computing at least a significant portion of a codeword of the linear block code by applying a sequence of operations including at least one forward substitution using a lower triangular matrix derived from a sub-matrix of a parity check matrix of the linear block code and at least one backward substitution using an upper triangular matrix derived from the sub-matrix. The encoding method has a low computational complexity and is suitable for encoding a broad range of low-density parity-check (LDPC) codes.

Description

METHOD AND APPARATUS TO ENCODE LINEAR BLOCK CODES
BACKGROUND OF THE INVENTION
[001] Error correction, using an error correction code, improves the reliability communication systems and devices. In existing encoding methods, an encoder at the transmission end of a communication encodes an input word, for example, a block or vector of a given length, to produce a codeword of the error correction code. A decoder at the receiving end of the communication decodes a received word (block), yielding an estimation of the codeword that may indicate the original input word. A linear block code, C, having length n, may be described by a parity-check matrix, Hm x „_ whose null space is block code C. Alternatively, block code C may be described by a generator matrix GjrX m, wherein k+m=n, whose rows span all the codewords of code C. During the encoding process, an information sequence v = (vι,...,Vjj) is encoded to yield a corresponding codeword, x — (xι,...,Xn), in which k elements may represent the input word (block), for example, (xι,...,Xk) = (vι,...,Vk), and the remaining m elements may represent a new block, for example, (Xk.-i.- - -.Xn) = (Pi.- - -sPm)- Such encoding may generally be performed by applying generator matrix G to word v to produce x. This encoding method typically requires a number of numerical operations on the order of 0(n2), which may be prohibitively complex for large block lengths, for example, n > 10,000. [002] Block codes having sparse parity check matrices are known in the art by the name of Low-Density Parity-Check (LDPC) codes. Such block codes may provide excellent decoding performance. For LDPC codes, an encoder was proposed in Richardson and Urbanke, "Efficient encoding of low-density parity-check codes", IEEE Transactions on information theory, Vol.47, No.2, pp.6 '38-656, Feb.2001. ("the RU encoder"). However, this encoder is not efficient for encoding certain classes of LDPC codes. For example, the RU encoder is not useful for classes (for example, ensembles) of LDPC codes where only a small fraction of the columns of matrix H, for example, up to one percent of the columns, or none of the columns, contain exactly 2 non-zero entries. Such ensembles are referred to herein as λ2-≡0 classes or ensembles of LDPC codes.
[003] There are also specific solutions known in the art for encoding additional classes of LDPC codes, for example, codes based on finite geometries. However, such additional classes are of less interest in most cases, for example, because they do not provide the code-design flexibility generally enabled by LDPC codes.
[004] There is thus a need for an encoding method having a low computational complexity, for example, of order 0(n), suitable for encoding a broad range of LDPC codes.
BRD2F DESCRIPTION OF THE DRAWINGS
[005] The subject matter regarded as the invention is particularly pointed out and distinctly claimed in the concluding portion of the specification. The invention, however, both as to organization and method of operation, together with objects, features and advantages thereof, may best be understood by reference to the following detailed description when read with the accompanied drawings in which: [006] Fig. 1 is a schematic block diagram of a communication system including at least one communication device in accordance with exemplary embodiments of the present invention; [007] Fig. 2 is a schematic block diagram illustrating an encoder in accordance with exemplary embodiments of the invention; and
[008] Fig. 3 is a schematic block diagram of a method of encoding linear block codes in accordance with exemplary embodiments of the invention. [009] It will be appreciated that for simplicity and clarity of illustration, elements shown in the figures have not necessarily been drawn to scale. For example, the dimensions of some of the elements may be exaggerated relative to other elements for clarity. Further, where considered appropriate, reference numerals may be repeated among the figures to indicate corresponding or analogous elements.
DETAILED DESCRIPTION OF THE INVENTION
[0010] In the following detailed description, numerous specific details are set forth in order to provide a thorough understanding of the invention. However it will be understood by those of ordinary skill in the art that the present invention may be practiced without these specific details. In other instances, well-known methods, procedures, components and circuits have not been described in detail so as not to obscure the present invention.
[0011] Some portions of the detailed description that follows are presented in terms of algorithms and symbolic representations of operations on data bits or binary digital signals within a computer memory. These algorithmic descriptions and representations may be the techniques used by those skilled in the data processing arts to convey the substance of their work to others skilled in the art.
[0012] Unless specifically stated otherwise, as apparent from the following discussions, it is appreciated that throughout the specification discussions utilizing terms such as "processing," "computing," "calculating," "determining," or the like, refer to the action and/or processes of a computer or computing system, or similar electronic computing device, that manipulate and/or transform data represented as physical, such as electronic, quantities within the computing system's registers and/or memories into other data similarly represented as physical quantities within the computing system's memories, registers or other such information storage, transmission or display devices.
[0013] It should be understood that embodiments of the present invention may be used in variety of applications. Although the scope of the present invention is not limited in this respect, the circuits and techniques disclosed herein may be used in many apparatuses such as receivers of a radio system. Receivers intended to be included within the scope of the present invention include, by a way of example only, cellular radiotelephone receivers, spread spectrum receivers, digital system receivers and the like.
[0014] Types of cellular radiotelephone receivers intended to be within the scope of the present invention mclude, although not limited to, Code Division Multiple Access (CDMA), CDMA 2000 and wideband CDMA (WCDλlA) cellular radiotelephone, receivers for receiving spread spectrum signals, and the like. [0015] Devices, systems and methods incorporating aspects of embodiments of the invention are also suitable for computer communication network applications, for example, intranet and Internet applications. Embodiments of the invention may be implemented in conjunction with hardware and/or software adapted to interact with a computer communication network, for example, a local area network (LAN), wide area network (WAN), or a global communication network, for example, the Internet. As is known in the art, the use of LDPC ensembles of error correction codes may be particularly advantageous in such applications. [0016] Fig. 1 is a simplified block-diagram illustration of an exemplary communication system, in accordance with some embodiments of the present invention. A communication device 100 is able to communicate with a communication device 102 over a commumcation channel 104.
[0017] Although the scope of the present invention is not limited in this respect, communication devices 100, 102 may comprise wire or wireless or cable modems of computers and communication channel 104 may be a wide-area-network (WAN) or local-area-network (LAN). For example, the system may be a wireless LAN system or a digital subscriber line (DSL) system. Alternatively, although the scope of the present invention is not limited in this respect, the communication system shown in Fig. 1 may be part of a cellular communication system, with one of communication devices 100, 102 being a base station and the other a mobile station or with both communication devices 100, 102 being mobile stations, a pager communication system, a personal digital assistant (PDA) and a server, etc. In such cases, although the scope of the present invention is in no way limited in this respect, -communication devices 100 and 102 may each comprise a radio frequency antenna, 101 and 111, respectively, as is known in the art. In the case of a cellular wireless communication system, according to some embodiments of the invention, the communication system shown in Fig. 1 may be a 3rd Generation Partnership Project (3 GPP), such as, for example, Frequency Domain Duplexing (FDD), Wideband Code Division Multiple Access (WCDMA) cellular system and the like. [0018] Communication device 100 may comprise a ttans itter 106, which may comprise an encoder 108 in accordance with embodiments of the invention, as described in detail below. Communication device 102 may comprise a receiver 110, which may comprise a decoder 112.
[0019] Encoder 108 may encode an input word (for example, a block or vector) v, based on a linear block code, to produce a codeword, x, as described in detail below. The linear block code may be represented by a parity-check matrix, H, as described below. Codeword x may be modulated, up-converted and transmitted through comrminir.atir.r_ channel 104, which may be a noisy channel, as is known in the art. [0020] Receiver 110 may receive a signal from communication channel 104, which signal, after down-conversion and demodulation, may be identified as a received word, r. Although the scope of the present invention is not limited in this respect, the noise from communication channel 104 may be an additive noise, and received word r may thus be represented by r = x + noise. As is known in the art, decoder 112 may use the parity-check matrix in an attempt to determine from received word r a word v' (or codeword x') that should correspond to the original word v (or codeword x) encoded by encoder 108.
[0021] Methods according to some embodiments of the present invention may be implemented in encoders using software, hardware or any suitable combination of software and/or hardware in accordance with specific implementations of embodiments of the invention. Fig. 2 is a simplified block-diagram illustration of an exemplary encoder 200, in accordance with some embodiments of the present invention. Encoder 200 may comprise a computing unit 210 and a memory 220 coupled to computing unit 210. Although the scope of the present invention is not limited in this respect, computing- unit 210 may be an application specific integrated-circuit (ASIC), a reduced instruction set circuit (RISC), a digital signal processor (DSP) or a central processing unit (CPU). Instructions to enable computing unit to perform methods of embodiments of the present invention may be stored in memory 220.
[0022] Encoder 200 may implement an encoding algorithm using components of a sparse parity check matrix, H. The encoding method according to embodiments of the invention, as described below, enables encoding of various classes of Low-Density Parity-Check (LDPC) codes, for example, λ2≡0 ensembles of LDPC, as well as encoding of other classes of LDPC codes, while maintaining a low computational complexity, for example, on the order of 0(n). The encoding method according to embodiments of the present invention may also be used for encoding of codes whose parity check matrix may not be sparse, but where, for example, a sub-matrix derived from the parity check matrix may be sparse. However, embodiments of the invention may also be suitable for encoding of codes whose parity-check matrix may not have a sparse sub-matrix.
[0023] It will be appreciated by persons skilled in the art that embodiments of the present invention, using devices and methods as described herein, provide an encoder for encoding LDPC codes, which codes may be randomly selected over a given ensemble. Furthermore, the encoder in accordance with embodiments of the invention may provide a solution with a computational complexity on the order of 0(n) for encoding LDPC codes of classes having a low block error rate, for example, a block error rate on the order of the bit error rate, for example, λ2≡0 type ensembles.
[0024] Variations of encoders according to embodiments of the present invention have been simulated successfully, demonstrating the low computational complexity, i.e., 0(n), made possible by embodiments of the present invention.
[0025] In accordance with embodiments of the invention, encoder 200 may have stored therein, or in the memory 220 associated therewith, a Lower Upper (LU) decomposition of a sub-matrix derived from H, for example, a sub-matrix representing non-systematic symbols of the code being encoded. As discussed below, the LU decomposition operation may be performed offline, for example, using decomposition methods as are known in the art. It will be appreciated that, once a suitable LU decomposition is obtained, the decomposed elements may be used repeatedly by the encoder. Therefore, the complexity of computation- involved in- deriving a suitable decomposition of H is generally inconsequential to the computational complexity of the method of some embodiments of the present invention.
[0026] As is known in the art, systematic encoding (mapping) refers to any encoding process in which the equation (xj^. -. Xjk) = (vι,...,Vk) is satisfied for all vectors v_= (vι,...,Vk) and for a certain sub-group of coordinates {jι,...jk} being mapped. As is known in the art, for any given mapping of any linear block code, there exists a corresponding systematic mapping with the same performance. Thus, the parity check matrix H in accordance with some embodiments of the invention may be represented in the form:
H = (A|B) (1) wherein Am x corresponds to the systematic part and Bm x m is an invertible matrix corresponding to the non-systematic part. In this representation, matrix A constitutes the first k columns of H and matrix B constitutes the remaining columns. It should be further noted that if matrix H is sparse, then matrices A and B must also be sparse. [0027] According to an embodiment of the invention, rearranging and rewriting the elements in matrix H in the form (xi,..., Xk k+i,- -- χn) = (vι.-- ->vk-Xk+ι,...,χn)> it maY De shown that, for any valid codeword, the following equation holds: t t
-ACvL- . -.Vk) = B(xk+1,...,xn) (2) where t represents the transpose.
[0028]By calculating a first vector s, defined by the matrix equation (sι,...,Sπι) =
-A(vι,...,V ) , the matrix equation B(x +ι,. - -,Xn) = (si,...,sm) may be solved to obtain the non-systematic symbols (Xk+i,- • • xn). also referred to herein asp = (pi,...,pm)
[0029] A lower triangular matrix is a matrix with entries αy such that ify>- then αy— 0. An upper triangular matrix is a matrix with entries αy such that if j<i then αy=Q. [0030] If matrix B, or any sub-matrix (for example, B') of B, has at least one LU decomposition, namely, Lm x mUm X ffl = B, where L is a lower triangular matrix and U is an upper triangular matrix (or L/ x /U/ x ι = B', where l<m), then the following two equations hold:
L(zl 5...,zm) = (sι,...,sm) (3) and
U(xk+1,...,xn) = (zι,...,zm) (4) wherein a second vector z=(zι, ... ,zm) is introduced as defined by Equations 3 and 4.
[0031]It is noted that matrix B, or sub-matrix B', may have more than one possible LU decomposition, in which case any valid LU decomposition may be used for encoding according to embodiments of the invention. For the purposes of this detailed description, a LU decomposition of a given matrix refers to any decomposition where a lower triangular component and an upper triangular component, neither of which is a unity matrix, are derived from the given matrix. It is further noted that matrices L, U and B' are not necessarily square matrices. Similarly, sub-matrix B' is not necessarily invertible.
[0032] It is further noted that the separation of matrix H into matrices A and B is demonstrated for explanatory purposes only and is in no way intended to limit the scope of the present invention. For example, in alternative embodiments of the invention, matrices L and U may be derived from any other LU-decomposable sub-matrix of H. Furthermore, any other method of deriving at least one lower triangular matrix (L) and at least one upper triangular matrix (U) from parity-check matrix H may be used in conjunction with alternative embodiments of the present invention. For example, a sub-matrix of H may be decomposed using an Upper/Lower (UL) decomposition similar to the LU decomposition described herein. In another example, a decomposition of the form LDU or UDL, where D is a diagonal matrix, may be derived from parity-check matrix H. In a further example, a decomposition of the form ALBUC may be derived from parity-check matrix H. It will be appreciated by persons of ordinary skill in the art how to modify Equations (3) and (4) according to the precise derivation of L and U from parity-check matrix H. [0033] The process of uncovering an appropriate LU-decomposable matrix B, or sub-matrix of B, according to embodiments of the invention, may involve a complexity higher than the order of 0(n). However, as discussed above and below, such complex calculations (if necessary) may be performed only once, typically off-line,. and therefore, such calculations do not affect the computational complexity of the encoding process. [0034] As is known in the art, an equation of the form Lz = s, such as Equation 3 above, may be solved by means of forward substitution, and an equation of the form Ux = z, such as Equation 4 above, may be solved by means of backward substitution. In the example above, if matrices A, L and U are all sparse, then the following computation complexities hold: multiplication of input word v by matrix A, to obtain first vector s, requires a number of operations on the order of 0(n); solving Equation 3 for elements Zι,...,zm of second vector z, using forward substitution, as is known in the art, requires a number of operations on the order of 0(n); and solving Equation 4 for elements Xk+ι,...,xn, also denoted p = (pι,...,Pm)j using backward substitution, as is known in the art, requires a number of operation on the order of 0(n). [0035] There are well known solutions in the theory of sparse matrices for the general mathematical problem of solving sparse linear equations using LU decomposition, i.e., for solving a sparse linear equation system by LU decomposition. Further, as is known in the art, for example, as explained in C. Fu, X. Jiao and T. Yang, "Efficient sparse LU factorization with partial pivoting on distributed memory architectures", IEEE Transactions on parallel and distributed systems, Vol. 9, No.2, pp. 109-125, Feb. 1998, if matrix H is sparse (and thus sub-matrix A is also sparse), it is likely that a sparse LU decomposition of H, i.e., a decomposition in which triangular matrices L and U are also sparse, may be obtained.
[0036] Referring to the schematic flow chart of Fig. 3, a method of encoding a linear block code according to embodiments of the present invention is shown. As indicated at block 300, prior to implementing the encoder of embodiments of the present invention, pre-calculated data representing sub-matrices A, L and U may be stored in memory, for example, memory 220 of encoder 200 (Fig. 2), or otherwise made available to encoder 200.
[0037] As indicated at block 302, the method in accordance with embodiments of the invention may begin with receiving input word v =
Figure imgf000011_0001
which may be a vector representing a non-encoded word. [0038]Then, as indicated at block 304, first vector s = (sι,...,sm) may be obtained by multiplying word v by the negative of the systematic-part matrix, -A, as defined above. [0039] As indicated at block 306, the elements of second vector z, as defined above, may be obtained by solving the equation s = z for z\,...,zm, using forward substitution, as discussed above. [0040] Then, as indicated at block 308, vector p, representing the unsystematic elements Xk+ι,...,xn of codeword x, may be obtained by solving the equation z=Up for pι,...,pm. using backward substitution, as discussed above.
[0041] Finally, as indicated at block 310, the method may generate a codeword x = (yjp), including both the original non-encoded block, represented by sub-vector v, as well as the new encoded elements, represented by sub-vector p. The method may then generate an output signal corresponding to codeword x = (x ,...,xn). The output signal may then be further processed and transmitted via a communication network, for example, as described above with reference to Fig. 1. [0042] As mentioned above, a method in accordance with embodiments of the invention may include the preliminary stage of decomposing a sparse LDPC matrix H to obtain sparse A, L and U matrices, or any other matrices or sub-matrices derived from H, having similar properties. Such a system has been simulated successfully. It will be appreciated by persons skilled in the art that the process of obtaining sparse A, L and U matrices from a given sparse LDPC matrix H m accordance with embodiments of the invention is a preliminary stage of the encoding process, i.e., it may be carried out only once per code and, therefore, the computational complexity of this stage is not significant to the actual encoding process. Further, this decomposition process may be performed off-line. [0043] The encoder of Fig. 2 and the encoding method of Fig. 3 describe exemplary implementation of encoders in accordance with embodiments of the invention. However, it should be appreciated that various other encoder designs and encoding methods are also within the scope of the present invention, for example", any encoder or encoding method utilizing the sparseness of parity check matrix H by applying a sparse decomposition comprising at least one lower triangular matrix L and at least one upper triangular matrix U, either to an m x m matrix or to any / x I sparse matrix deduced from H, wherein I < m. It will be appreciate that the encoder of Fig. 1 falls into this category of encoders in accordance with embodiments of the mvention. [0044] It will be appreciated by persons skilled in the art that, the encoder of embodiments of the present invention provides a significantly improved encoder for various classes of codes, for example, LDPC codes of λ2=0 classes (i.e., λ2--_0 ensembles), using a sparse parity check matrix. Such classes of LDPC codes are useful in many coding applications, for example, Internet-related coding applications. Furthermore, the encoder of embodiments of the invention may be useful for encoding other categories of LDPC codes in addition to LDPC codes defined above, as well as for additional types of codes. Furthermore, the encoder of embodiments of the invention may be used in conjunction with non-sparse parity-check matrices. [0045] While certain features of the invention have been illustrated and described herein, many modifications, substitutions, changes, and equivalents will now occur to those of ordinary skill in the art. It is, therefore, to be understood that the appended claims are intended to cover all such modifications and changes as fall within the true spirit of the invention.

Claims

[0046] What is claimed is:
1. A method comprising: based on an input word, computing a first intermediate vector using a first non-unity triangular matrix derived from a parity check matrix of a code; and computing a second intermediate vector based on said first intermediate vector and a second non-unity triangular matrix derived from said parity check matrix, wherein one of said first matrix and said second matrix is a lower triangular matrix and the other of said first matrix and said second matrix is an upper triangular matrix.
2. The method of claim 1, further comprising: generating a codeword of said code, said codeword including said input word and said second intermediate vector.
3. The method of claim 1, further comprising: computing a third intermediate vector by applying a systematic part of said parity-check matrix to said input word, wherein computing said first intermediate vector comprises computing said first intermediate vector based on said third intermediate vector and said first triangular matrix.
4. The method of claim 1, wherein computing said first intermediate vector comprises computing said first intermediate vector using forward substitution, and wherein computing said second intermediate vector comprises computing said second intermediate vector using backward substitution. — -
5. The method of claim 1, wherein said code is a low-density parity-check code.
6. The method of claim 5, wherein said low-density parity-check code is a class λ -=0 low-density parity-check code.
7. The method of claim 1, wherein said lower triangular matrix is a component of a sub-matrix of said parity check matrix and said upper triangular matrix is another component of said sub-matrix.
8. The method of claim 7, wherein said sub-matrix is substantially sparse.
9. An apparatus comprising: an encoder to compute at least a portion of a codeword of a code based on an input word, a non-unity lower triangular matrix, and a non-unity upper triangular matrix, the lower triangular matrix and the upper triangular matrix both derived from a parity-check matrix of the code.
10. The apparatus of claim 9, wherein said lower triangular matrix is a component of a sub-matrix of said parity check matrix and said upper triangular matrix is another component of said sub-matrix.
11. The apparatus of claim 9, wherein said encoder further comprises circuitry for fransmitting said codeword.
12. The apparatus of claim 9, further comprising a memory associated with said encoder to store said lower triangular matrix and said upper triangular matrix.
13. A communication device comprising: transmission circuitry; and an encoder comprising a computing unit to compute at least a portion of a codeword of a code based on an input word, a non-unity lower triangular matrix, and a non-unity upper triangular matrix, the lower triangular matrix and the upper triangular matrix both derived from a parity-check matrix of the code.
14. The communication device of claim 13, further comprising: a memory coupled to said computing unit, said memory able to store therein a representation of said lower triangular matrix and said upper triangular matrix.
15. The communication device of claim 14, wherein said computing unit comprises a digital signal processor.
16. The communication device of claim 13, wherein said lower triangular matrix is a component of a sub-matrix of said parity check matrix and said upper triangular matrix is another component of said sub-matrix
17. A communication system comprising: a first communication device to transmit through a communication channel a signal including a codeword of a linear block code, said communication device comprising an encoder comprising a computing unit to compute at least a portion of a codeword of a code based on an input word, a non-unity lower triangular matrix, and a non-unity upper triangular matrix, the lower triangular matrix and the upper triangular matrix both derived from a parity-check matrix of the code; and a second communication device able to receive said signal.
18. The communication system of claim 17, wherein said lower triangular matrix is a component of a sub-matrix of said parity check matrix and said upper triangular matrix is another component of said sub-matrix
19. The commumcation system of claim 17, wherein said communication channel is a wide-area-network and said first communication device comprises a modem.
20. The communication system of claim 17, wherein said communication channel is a local-area-network and said first communication device comprises a modem.
21. The communication system of claim 17, wherein said signal is a radio frequency signal.
22. A communication system comprising: a communication device to transmit through a communication channel a signal including a codeword of a linear block code, said communication device comprising an encoder comprising a computing unit to compute at least a portion of a codeword of a code based on an input word, a non-unity lower triangular matrix, and a non-unity upper triangular matrix, the lower triangular matrix and the upper triangular matrix both derived from a parity-check matrix of the code; and a Wideband Code Division Multiple Access communication device able to receive said signal.
23. The communication system of claim 22, wherein said code is a low-density parity-check code.
24. An article comprising a storage medium having stored thereon instructions that, when executed by a computing platform, result in: based on an input word, computing a first intermediate vector using a first non-unity triangular matrix derived from a parity-check matrix of a code; and computing a second intermediate vector based on said first intermediate vector and a second non-unity triangular matrix derived from said parity check matrix, wherein one of said first matrix and said second matrix is a lower triangular matrix and the other of said first matrix and said second matrix is an upper triangular matrix.
25. The article of claim 24, wherein the instructions, when executed, further result in: generating a codeword of said code, said codeword including said input word and said second intermediate vector.
26. The article of claim 24, wherein the instructions, when executed, further result in: computing a third intermediate vector by applying a systematic part of said parity-check matrix to said input word, wherein computing said first intermediate vector comprises computing said first intermediate vector based on said third intermediate vector and said first triangular matrix.
27. The article of claim 24, wherein said lower triangular matrix is a component of a sub-matrix of said parity check matrix and said upper triangular matrix is another component of said sub-matrix.
28. The article of claim 27, wherein said sub-matrix is substantially sparse.
29. The article of claim 24, wherein computing said first intermediate vector comprises computing said first intermediate vector using forward substitution, and wherein computing said second intermediate vector comprises computing said second intennediate vector using backward substitution.
30. The article of claim 24, wherein said code is a low-density parity-check code.
31. The article of claim 30 wherein said low-density parity-check code is a class λ2Ξθ low-density parity-check code.
PCT/US2003/041435 2002-12-31 2003-12-29 Method and apparatus to encode linear block codes WO2004062112A2 (en)

Priority Applications (2)

Application Number Priority Date Filing Date Title
AU2003302335A AU2003302335A1 (en) 2002-12-31 2003-12-29 Method and apparatus to encode linear block codes
EP03810891A EP1579580A2 (en) 2002-12-31 2003-12-29 Method and apparatus to encode linear block codes

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
US10/331,635 2002-12-31
US10/331,635 US20040128607A1 (en) 2002-12-31 2002-12-31 Method and apparatus to encode linear block codes

Publications (2)

Publication Number Publication Date
WO2004062112A2 true WO2004062112A2 (en) 2004-07-22
WO2004062112A3 WO2004062112A3 (en) 2004-09-02

Family

ID=32654789

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/US2003/041435 WO2004062112A2 (en) 2002-12-31 2003-12-29 Method and apparatus to encode linear block codes

Country Status (5)

Country Link
US (1) US20040128607A1 (en)
EP (1) EP1579580A2 (en)
CN (1) CN1732626A (en)
AU (1) AU2003302335A1 (en)
WO (1) WO2004062112A2 (en)

Cited By (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101459430B (en) * 2007-12-14 2010-12-08 中兴通讯股份有限公司 Encoding method and apparatus for low density generation matrix code
US8291288B2 (en) 2007-10-19 2012-10-16 Zte Corporation Method and device for encoding the low density generator matrix code
US8464123B2 (en) 2009-05-07 2013-06-11 Ramot At Tel Aviv University Ltd. Matrix structure for block encoding

Families Citing this family (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US7681110B2 (en) * 2006-08-30 2010-03-16 Microsoft Corporation Decoding technique for linear block codes
CN102194247B (en) * 2010-03-11 2015-07-15 新奥特(北京)视频技术有限公司 Method for judging graphic element information in modeling process of vector word triangular plate
CN103780268A (en) * 2014-01-23 2014-05-07 长安大学 LDPC encoding algorithm based on optimization sparse LU factorization
US11016844B2 (en) * 2019-03-15 2021-05-25 Toshiba Memory Corporation Error correction code structure

Citations (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US3705409A (en) * 1970-12-09 1972-12-05 Ibm Tableau network design system
CA2310186A1 (en) * 2000-06-02 2001-12-02 Jeffrey P. Castura Method and system for decoding

Family Cites Families (6)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US6243413B1 (en) * 1998-04-03 2001-06-05 International Business Machines Corporation Modular home-networking communication system and method using disparate communication channels
US6601217B1 (en) * 2000-04-13 2003-07-29 Sun Microsystems, Inc. System and method for error correction in an electronic communication
US20020150167A1 (en) * 2001-02-17 2002-10-17 Victor Demjanenko Methods and apparatus for configurable or assymetric forward error correction
DE60129111T2 (en) * 2001-05-29 2008-02-28 Lucent Technologies Inc. Channel estimation in a CDMA system with coded control symbols as additional pilot symbols
US7178080B2 (en) * 2002-08-15 2007-02-13 Texas Instruments Incorporated Hardware-efficient low density parity check code for digital communications
US6961888B2 (en) * 2002-08-20 2005-11-01 Flarion Technologies, Inc. Methods and apparatus for encoding LDPC codes

Patent Citations (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US3705409A (en) * 1970-12-09 1972-12-05 Ibm Tableau network design system
CA2310186A1 (en) * 2000-06-02 2001-12-02 Jeffrey P. Castura Method and system for decoding

Non-Patent Citations (3)

* Cited by examiner, † Cited by third party
Title
ECHARD R ET AL: "THE PI-ROTATION LOW-DENSITY PARITY CHECK CODES" GLOBECOM'01. 2001 IEEE GLOBAL TELECOMMUNICATIONS CONFERENCE. SAN ANTONIO, TX, NOV. 25 - 29, 2001, IEEE GLOBAL TELECOMMUNICATIONS CONFERENCE, NEW YORK, NY: IEEE, US, vol. 2 OF 6, 25 November 2001 (2001-11-25), pages 980-984, XP001099251 ISBN: 0-7803-7206-9 *
MACKAY D J C: "Good error-correcting codes based on very sparse matrices" IEEE TRANSACTIONS ON INFORMATION THEORY, IEEE INC. NEW YORK, US, vol. 45, no. 2, March 1999 (1999-03), pages 399-431, XP002143042 ISSN: 0018-9448 *
RICHARDSON T J ET AL: "Efficient encoding of low-density parity-check codes" IEEE TRANSACTIONS ON INFORMATION THEORY, IEEE INC. NEW YORK, US, vol. 47, no. 2, February 2001 (2001-02), pages 638-656, XP002965294 ISSN: 0018-9448 cited in the application *

Cited By (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US8291288B2 (en) 2007-10-19 2012-10-16 Zte Corporation Method and device for encoding the low density generator matrix code
CN101459430B (en) * 2007-12-14 2010-12-08 中兴通讯股份有限公司 Encoding method and apparatus for low density generation matrix code
US8464123B2 (en) 2009-05-07 2013-06-11 Ramot At Tel Aviv University Ltd. Matrix structure for block encoding

Also Published As

Publication number Publication date
WO2004062112A3 (en) 2004-09-02
AU2003302335A1 (en) 2004-07-29
EP1579580A2 (en) 2005-09-28
CN1732626A (en) 2006-02-08
US20040128607A1 (en) 2004-07-01

Similar Documents

Publication Publication Date Title
JP5231218B2 (en) In-place transform with application to encoding and decoding of various code classes
KR100502609B1 (en) Encoder using low density parity check code and encoding method thereof
JP3917624B2 (en) Routing method and system in a low density parity check (LDPC) decoder
JP3917563B2 (en) Method and system for decoding low density parity check (LDPC) codes
TWI406510B (en) Method for efficient encoding and decoding quantized sequence in wyner-ziv coding of video
CN101079638B (en) Low density parity check decoding system and method for reducing complexity
US20120117440A1 (en) Low density parity check (ldpc) code
US20080065947A1 (en) Method and system for decoding low density parity check (ldpc) codes
US20130091406A1 (en) Method and system for routing in low density parity check (ldpc) decoders
US20080313523A1 (en) Encoding low density parity check (ldpc) codes through an ldpc decoder
US20080082895A1 (en) Method and system for generating low density parity check codes
EP1712027B1 (en) Method and apparatus for implementing a low density parity check code in a wireless system
JP2010050994A (en) Method and system for generating low density parity check code
US10892848B2 (en) Devices and methods implementing polar codes
CN108540260B (en) Method and device for determining Polar code encoding and decoding and storage medium
CN108270510B (en) Communication method and communication equipment based on LDPC code
JP6817414B2 (en) Coding and decoding of polar codes extended to non-powers of 2
CN106998240B (en) Decoding method and decoder
US20040128607A1 (en) Method and apparatus to encode linear block codes
KR101636965B1 (en) Method and device for communicating data across noisy media
KR100938068B1 (en) Apparatus and method for receiving signal in a communication system
Vaezi et al. Distributed lossy source coding using real-number codes
EL KAIME et al. A survey of polar codes
US7814392B2 (en) System, apparatus and methods of dynamically determined error correction codes in communication systems
KR20070084951A (en) Apparatus and method for receiving signal in a communication system

Legal Events

Date Code Title Description
AK Designated states

Kind code of ref document: A2

Designated state(s): AE AG AL AM AT AU AZ BA BB BG BR BY BZ CA CH CN CO CR CU CZ DE DK DM DZ EC EE ES FI GB GD GE GH GM HR HU ID IL IN IS JP KE KG KP KR KZ LC LK LR LS LT LU LV MA MD MG MK MN MW MX MZ NO NZ OM PH PL PT RO RU SC SD SE SG SK SL TJ TM TN TR TT TZ UA UG UZ VC VN YU ZA ZM ZW

AL Designated countries for regional patents

Kind code of ref document: A2

Designated state(s): BW GH GM KE LS MW MZ SD SL SZ TZ UG ZM ZW AM AZ BY KG KZ MD RU TJ TM AT BE BG CH CY CZ DE DK EE ES FI FR GB GR HU IE IT LU MC NL PT RO SE SI SK TR BF BJ CF CG CI CM GA GN GQ GW ML MR NE SN TD TG

121 Ep: the epo has been informed by wipo that ep was designated in this application
WWE Wipo information: entry into national phase

Ref document number: 2003810891

Country of ref document: EP

WWE Wipo information: entry into national phase

Ref document number: 20038A77636

Country of ref document: CN

WWP Wipo information: published in national office

Ref document number: 2003810891

Country of ref document: EP

WWW Wipo information: withdrawn in national office

Ref document number: 2003810891

Country of ref document: EP

NENP Non-entry into the national phase

Ref country code: JP

WWW Wipo information: withdrawn in national office

Country of ref document: JP