Waveform synthesis using list-decoding of codes over the real alphabet

This talk extends the theory of list-decoders to derive bounds on the maximum number of survivor paths required for waveform synthesis using noisy codeword decoding of convolutional codes over the real alphabet. This technique gives a noise shaping far superior to that of the conventional /spl Sigma...

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Hauptverfasser:	RaviKiran, G., Collins, O.M.
Format:	Tagungsbericht
Sprache:	eng
Schlagworte:	Algorithm design and analysis Applied sciences Band pass filters Computational complexity Computer science control theory systems Convolutional codes Decoding Digital-analog conversion Exact sciences and technology Information theory Information, signal and communications theory Noise generators Noise shaping Quantization Telecommunications and information theory Viterbi algorithm
Online-Zugang:	Volltext bestellen
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Beschreibung
Zusammenfassung:	This talk extends the theory of list-decoders to derive bounds on the maximum number of survivor paths required for waveform synthesis using noisy codeword decoding of convolutional codes over the real alphabet. This technique gives a noise shaping far superior to that of the conventional /spl Sigma//spl Delta/. The talk also proposes an algorithm for designing short list-decoder friendly encoders/filters.
DOI:	10.1109/ISIT.2004.1365594