Name
Abstract | ||
|---|---|---|
Convolutional codes defined over the integers modulo a power of two, an arithmetic structure used for fixed-point arithmetic computations, employ well-known binary convolutional codes as their underlying generators. A recursive decoding technique that exploits binary expansion components of the code symbols uses any binary decoding algorithm valid for the underlying code. |
Year | DOI | Venue |
|---|---|---|
2004 | 10.1109/TCOMM.2004.829567 | IEEE Transactions on Communications |
Keywords | Field | DocType |
fixed point arithmetic,vectors,decoding,convolutional codes,power generation,binary codes,convolutional code,fault tolerance,digital signal processing,feedback | Discrete mathematics,Combinatorics,Concatenated error correction code,Sequential decoding,Convolutional code,Computer science,Turbo code,Serial concatenated convolutional codes,Block code,Expander code,Linear code | Journal |
Volume | Issue | ISSN |
52 | 6 | 0090-6778 |
Citations | PageRank | References |
0 | 0.34 | 7 |
Authors | ||
1 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| G. Robert Redinbo | 1 | 54 | 15.28 |