Abstract
In this paper, a realization structure for our previously proposed systematic recursive formula for bitwise decomposition of M-ary symbol metric is proposed, which can be applied to reduce the memory space and processing latency of a system where the information sequence is binary-coded and interleaved before M-ary modulated. Different from conventional structure where de-interleaver and decoder are separate circuits, our structure de-interleaves and decodes at the same time.
Original language | English |
---|---|
Pages | 1065-1068 |
Number of pages | 4 |
DOIs | |
State | Published - 6 Dec 2004 |
Event | 2004 IEEE Asia-Pacific Conference on Circuits and Systems, APCCAS 2004: SoC Design for Ubiquitous Information Technology - Tainan, Taiwan Duration: 6 Dec 2004 → 9 Dec 2004 |
Conference
Conference | 2004 IEEE Asia-Pacific Conference on Circuits and Systems, APCCAS 2004: SoC Design for Ubiquitous Information Technology |
---|---|
Country/Territory | Taiwan |
City | Tainan |
Period | 6/12/04 → 9/12/04 |