| Paper: | SPCOM-P4.1 | ||
| Session: | Iterative Decoding Algorithms and Architectures | ||
| Time: | Wednesday, May 19, 09:30 - 11:30 | ||
| Presentation: | Poster | ||
| Topic: | Signal Processing for Communications: Compression, Coding, and Modulation | ||
| Title: | CONTRACTIVITY IN TURBO ITERATIONS | ||
| Authors: | Phillip Regalia; Institut National des Télécommunications | ||
| Abstract: | The turbo decoding algorithm has met with intense study over the past decade, in an attempt to harness the full power of the ``turbo principle''. Here we consider applying contractivity arguments to the turbo decoding algorithm, to study convergence even for short block lengths. | ||
| Back | |||
Home -||-
Organizing Committee -||-
Technical Committee -||-
Technical Program -||-
Plenaries
Paper Submission -||-
Special Sessions -||-
ITT -||-
Paper Review -||-
Exhibits -||-
Tutorials
Information -||-
Registration -||-
Travel Insurance -||-
Housing -||-
Workshops