Low complexity channel decoders
First Claim
Patent Images
1. A method for decoding channel-encoded date comprising:
- (a) receiving encoded symbols;
(b) compressing the encoded symbols to obtain compressed symbols;
(c) decoding the compressed symbols using a first look-up table that stores information approximating output of an algorithmic decoding process to obtain decoded symbols;
(d) arithmetically combining the compressed symbols with the decoded symbols to obtain a first result;
(e) decompressing the first result to obtain a decompressed first result(f) interleaving the decompressed first result to obtain an interleaved first result;
(g) compressing the interleaved first result to obtain a compressed, interleaved first result;
(h) decoding the compressed, interleaved first result using a second look-up table that stores information approximating output of an algorithmic decoding process to obtain a decoded first result(i) arithmetically combining the decoded first result with the compressed, interleaved first result to obtain a second result;
(j) decompressing the second result to obtain a decompressed second result; and
(k) de-interleaving the decompressed second result.
2 Assignments
0 Petitions
Accused Products
Abstract
A packet of encoded data is received and decoded using a look-up table that stores information approximating output of an algorithmic decoding process.
-
Citations
7 Claims
-
1. A method for decoding channel-encoded date comprising:
-
(a) receiving encoded symbols; (b) compressing the encoded symbols to obtain compressed symbols; (c) decoding the compressed symbols using a first look-up table that stores information approximating output of an algorithmic decoding process to obtain decoded symbols; (d) arithmetically combining the compressed symbols with the decoded symbols to obtain a first result; (e) decompressing the first result to obtain a decompressed first result (f) interleaving the decompressed first result to obtain an interleaved first result; (g) compressing the interleaved first result to obtain a compressed, interleaved first result; (h) decoding the compressed, interleaved first result using a second look-up table that stores information approximating output of an algorithmic decoding process to obtain a decoded first result (i) arithmetically combining the decoded first result with the compressed, interleaved first result to obtain a second result; (j) decompressing the second result to obtain a decompressed second result; and (k) de-interleaving the decompressed second result. - View Dependent Claims (2)
-
-
3. An apparatus for decoding channel-encoded data comprising:
-
memory storing a first look-up table with information approximating output of a first algorithmic decoding process and a second look-up table with information approximating output of a second algorithmic decoding process; and a processor configured to (a) compress a packet of received encoded symbols to obtain compressed symbols; (b) decode the compressed symbols using the first look-up table to obtain decoded symbols; (c) arithmetically combine the compressed symbols with the decoded symbols to obtain a first result; (d) decompress the first result to obtain a decompressed first result (e) interleave the decompressed first result to obtain an interleaved first result; (f) compress the interleaved first result to obtain a compressed, interleaved first result; (g) decode the compressed, interleaved first result using the second look-up table to obtain a decoded first result; (h) arithmetically combine the decoded first result with the compressed, interleaved first result to obtain a second result; (i) decompress the second result to obtain a decompressed second result; and (j) de-interleave the decompressed second result. - View Dependent Claims (4)
-
-
5. An article comprising a computer-readable medium that stores computer-executable instructions for causing a computer system, in response to receiving a channel-encoded data packet, to:
-
(a) compress a packet of received encoded symbols to obtain compressed symbols; (b) decode the compressed symbols using a first look-up table approximating output of an algorithmic decoding process to obtain decoded symbols; (c) arithmetically combine the compressed symbols with the decoded symbols to obtain a first result; (d) decompress the first result to obtain a decompressed first result (e) interleave the decompressed first result to obtain an interleaved first result; (f) compress the interleaved first result to obtain a compressed, interleaved first result; (g) decode the compressed, interleaved first result using a second look-up table approximating output of an algorithmic decoding process to obtain a decoded first result; (h) arithmetically combine the decoded first result with the compressed, interleaved first result to obtain a second result; (i) decompress the second result; and (j) de-interleave the decompressed second result. - View Dependent Claims (6, 7)
-
Specification