Granted Patent B2

US 7,996,746 · App. 11/665,171 · Granted Aug 9, 2011

Abstract

Claims (29)

1. A method for encoding variable sized data using low-density parity-check (LDPC) code and transporting the encoded variable sized data in modulated symbols, the method comprising the steps of:

a) calculating a minimum number of modulated symbols capable for transmitting a data packet;

b) selecting an expanded parity check matrix having a proper codeword size suitable for transmitting the data packet;

c) calculating a number of shortening N shortened bits to be used during transmission of the data packet; and

d) calculating a number of puncturing N punctured bits to be used during transmission of the data packet, to thereby produce a shortened and punctured expanded parity check matrix for transmitting the data packet.

2. The method of claim 1 , further comprising the steps of:

a) constructing one or more than one structured base parity check matrix H=[H d |H P ], H d being a data portion of the parity check matrix, H p being a parity portion of the parity check matrix; and

b) expanding the one or more than one structured base parity check matrix into one or more than one expanded parity check matrix, each of the one or more than one expanded parity check matrix having a different codeword size for use in the selecting step.

3. The method of claim 1 , further comprising the steps of:

a) determining a performance criterion of the shortened and punctured expanded parity check matrix;

b) adding an additional symbol to transmit the encoded data packet in the case when performance criterion is not met; and

c) recalculating the amount of puncturing N punctured bits.

4. The method of claim 3 wherein the performance criterion is selected from the group consisting of a threshold for N punctured , a threshold for N shortened , a threshold for normalized shortening to puncturing ratio, q normalized , and a combination thereof; wherein q normalized is defined as:

q normalized =( N shortened /N punctured )/[ R /(1 −R )]

wherein R is the code rate.

5. The method of claim 4 wherein the threshold for q normalized is set to be in the range of 1.2-1.5.

6. The method of claim 5 wherein the threshold for q normalized is set to be equal to 1.2.

7. The method of claim 1 further comprising the steps of:

a) selecting N shortened variable nodes from the expanded parity check matrix;

b) ensuring a uniform or a close to uniform row weight distribution after removing columns corresponding to the selected N shortened variable nodes; and

c) ensuring a new column weight distribution as close as possible to an original column weight distribution after removing the columns corresponding to the selected N shortened variable nodes from the selected expanded parity check matrix.

8. The method of claim 7 , wherein the selecting N shortened variable nodes step further comprises the step of selecting variable nodes belonging to consecutive columns in the selected expanded parity check matrix.

9. The method of claim 7 , wherein the ensuring a new column weight distribution step further comprises the step of prearranging columns of the data portion H d of the selected expanded parity check matrix.

10. The method of claim 1 further comprising the steps of:

a) selecting N punctured variable nodes from the selected expanded parity check matrix;

b) ensuring each of the selected N punctured variable nodes is connected to fewest possible check nodes; and

c) ensuring that all of the selected N punctured nodes are connected to most possible check nodes.

11. The method of claim 10 wherein step (b) further comprises the step of selecting variable nodes that belong to consecutive columns in the selected expanded parity check matrix.

12. The method of claim 1 further comprising the step of padding the last modulated symbol.

Assignments (16)