Reduced table size forward error correcting encoder
US6766490B1 · kind B1 · utility
Assignee
Inventors
Key dates
| Filing date | Mar 3, 2000 |
| Grant date | Jul 20, 2004 |
| Priority date | — |
| Expiry date | Mar 3, 2020 |
Classification
- Technology area (CPC H)Electricity
- CPC primaryH03M13/00
- WIPO fieldBasic communication processes
- WIPO sectorElectrical engineering
Abstract
A method and system for encoding and decoding a sequence of K binary digits using reduced-size lookup tables. The sequence of K binary digits is separated into multiple segments (e.g., a first segment and a second segment). The first segment is used as an index into a first lookup table that contains an encoded version of all combinations of binary digits possible in the first segment. In a similar manner, the second segment is used as an index into a second lookup table that contains an encoded version of all combinations of binary digits possible in the second segment. Using the first lookup table, an encoded sequence is obtained for the first segment, and an encoded sequence is obtained for the second segment using the second lookup table. An encoded sequence for the entire sequence of K binary digits is obtained by combining the encoded sequences for the first and second segments. Two lookup tables are thus used to encode the sequence of K binary digits instead of a single lookup table having 2K entries. The sizes of the two lookup tables are such that, if combined, they would contain fewer than 2K entries, thereby saving memory space in devices with limited memory capacity.
Source: USPTO / EPO open patent data. Objective bibliographic and citation counts.