Claims
- 1. A method for puncturing bits of an encoded data word to reduce a total number of bits in said encoded data word to be transmitted by a transmitter of a communications system, said bits including information bits and parity bits, the method comprising the steps of:determining a final amount of said bits to be transmitted in said encoded data word; determining a respective number of said parity bits associated with each respective number of said information bits; establishing a first variable for identifying positions of said information bits in said data word; establishing a respective parity variable associated with each of said respective number of parity bits; and eliminating certain of said parity bits from transmission in said encoded word based on values of said first variable and each said respective parity variable so that said final amount of bits remain in said encoded data word.
- 2. A method as claimed in claim 1, further comprising the step of:organizing said bits into groups, each groups including an amount of said parity bits equal to said respective number of said parity bits and an amount of said information bits equal to said respective number of information bits.
- 3. A method as claimed in claim 2, wherein said eliminating step includes the step of:selecting certain of said groups as selected groups based on said final number of bits; and eliminating at least one of said parity bits from each of said selected groups.
- 4. A method as claimed in claim 1, wherein said eliminating step includes the steps of:periodically changing said values of said first variable and each said respective parity variable based on at least one constant which has been determined based on said final amount; and determining whether to eliminate any of said parity bits during each period in which said values of said first variable and each said respective parity variable are changed.
- 5. A method as claimed in claim 1, wherein:when said encoded word is rate k/n encoded, said each respective number of information bits equals k and said respective number of parity bits equals n minus k.
- 6. A method as claimed in claim 5, wherein:when said encoded word rate is ⅓ encoded, said each respective number of information bits equals 1 and said respective number of parity bits equals 2; and said parity variable establishing step establishes two of said respective parity variables.
- 7. A method as claimed in claim 1, wherein:said encoded data word is a turbo encoded data word.
- 8. A computer readable medium of instructions, adapted to control a processor to puncture bits of an encoded data word to reduce a total number of bits in said encoded data word to be transmitted by a transmitter of a communications system, said bits including information bits and parity bits, the computer readable medium of instructions comprising:a first set of instructions, adapted to control said processor to determine a final amount of said bits to be transmitted in said encoded data word; a second set of instructions, adapted to control said processor to determine a respective number of said parity bits associated with each respective number of said information bits; a third set of instructions, adapted to control said processor to establish a first variable for identifying positions of said information bits in said data word; a fourth set of instructions, adapted to control said processor to establish a respective parity variable associated with each of said respective number of parity bits; and a fifth set of instructions, adapted to control said processor to eliminate certain of said parity bits from transmission in said encoded word based on values of said first variable and each said respective parity variable so that said final amount of bits remain in said encoded data word.
- 9. A computer readable medium of instructions as claimed in claim 8, further comprising:a sixth set of instructions, adapted to control said processor to organize said bits into groups, each groups including an amount of said parity bits equal to said respective number of said parity bits and an amount of said information bits equal to said respective number of information bits.
- 10. A computer readable medium of instructions as claimed in claim 9, wherein said fifth set of instructions is further adapted to control said processor to:select certain of said groups as selected groups based on said final number of bits; and eliminate at least one of said parity bits from each of said selected groups.
- 11. A computer readable medium of instructions as claimed in claim 8, wherein said fifth set of instructions is further adapted to control said processor to:periodically change said values of said first variable and each said respective parity variable based on at least one constant which has been determined based on said final amount; and determine whether to eliminate any of said parity bits during each period in which said values of said first variable and each said respective parity variable are changed.
- 12. A computer readable medium of instructions as claimed in claim 8, wherein:when said encoded word is rate k/n encoded, said each respective number of information bits equals k and said respective number of parity bits equals n minus k.
- 13. A computer readable medium of instructions as claimed in claim 12, wherein:when said encoded word rate is ⅓ encoded, said each respective number information bits equals 1 and said respective number of parity bits equals 2; and said fourth set of instructions controls said processor to establish two of said respective parity variables.
- 14. A computer readable medium of instructions as claimed in claim 8, wherein:said encoded data word is a turbo encoded data word.
- 15. A system for puncturing bits of an encoded data word to reduce a total number of bits in said encoded data word to be transmitted by a transmitter of a communications system, said bits including information bits and parity bits, the system comprising:a first determiner, adapted to determine a final amount of said bits to be transmitted in said encoded data word; a second determiner, adapted to determine a respective number of said parity bits associated with each respective number of said information bits; a first variable component, adapted to establish a first variable for identifying positions of said information bits in said data word; a parity variable component, adapted to establish a respective parity variable associated with each of said respective number of parity bits; and a bit eliminator, adapted to eliminate certain of said parity bits from transmission in said encoded word based on values of said first variable and each said respective parity variable so that said final amount of bits remain in said encoded data word.
- 16. A system as claimed in claim 15, further comprising:a bit organizer, adapted to organize said bits into groups, each groups including an amount of said parity bits equal to said respective number of said parity bits and an amount of said information bits equal to said respective number of information bits.
- 17. A system as claimed in claim 16, wherein said bit eliminator is further adapted to:select certain of said groups as selected groups based on said final number of bits; and eliminate at least one of said parity bits from each of said selected groups.
- 18. A system as claimed in claim 15, wherein said bit eliminator is further adapted to:periodically change said values of said first variable and each said respective parity variable based on at least one constant which has been determined based on said final amount; and determine whether to eliminate any of said parity bits during each period in which said values of said first variable and each said respective parity variable are changed.
- 19. A system as claimed in claim 15, wherein:when said encoded word is rate k/n encoded, said each respective number of information bits equals k and said respective number of parity bits equals n minus k.
- 20. A system as claimed in claim 19, wherein:when said encoded word rate is ⅓ encoded, said each respective number of information bits equals 1 and said respective number of parity bits equals 2; and said parity variable establishing step establishes two of said respective parity variables.
- 21. A system as claimed in claim 15, wherein:said encoded data word is a turbo encoded data word.
- 22. A system as claimed in claim 15, wherein:at least one of said first determiner, said second determiner, said first variable component, said parity variable component, and said bit eliminator are employed in a VLSI configuration.
Parent Case Info
The present invention claims benefit under 35 U.S.C. §119(e) of a U.S. provisional application of A Roger Hammons entitled “Rate Matching Algorithm Providing Near Optimal Puncturing Patterns for Turbo Codes”, Ser. No. 60/131,315, filed Apr. 27, 1999, the entire contents of which is incorporated herein by reference.
US Referenced Citations (5)
Foreign Referenced Citations (1)
Number |
Date |
Country |
WO 0041343 |
Jul 2000 |
WO |
Non-Patent Literature Citations (1)
Entry |
LGIC, “Puncturing Algorithm for Turbo”, 3GPP/TSG/RAN/WG1#4 TDOC 338/99, Apr. 19-20, 1999, pp. 1-6, Yokohama, Japan, p. 1, line 1—p. 6, last line; figure 2. |
Provisional Applications (1)
|
Number |
Date |
Country |
|
60/131315 |
Apr 1999 |
US |