Improved Decoding of Shannon-Kotel'nikov Mappings

Authors:

Rüngeler, M. ,  Schotsch, B. ,  Vary, P.

Book Title:

Proceedings of International Symposium on Information Theory and its Applications (ISITA)

Organization:

Society of Information Theory and its Applications (SITA)

Pages:

p.p. 633-638

Date:

Oct. 2010

ISBN:

978-1-42446-016-8

DOI:

10.1109/ISITA.2010.5649697

Language:

English

Abstract

In some applications, transmission of discrete-time but continuous-amplitude (or multilevel) source symbols is required which might be more bandwidth efficient than conventional digital transmission. An appropriate method is to apply a source channel mapping (SCM) of M source symbols to N channel symbols. A geometrical approach for SCM has been introduced by Shannon and Kotel'nikov (Shannon-Kotel'nikov mappings). These systems are used to map continuous-amplitude and discrete-time source symbols to continuous-amplitude and discrete-time channel symbols without the intermediate step of a binary representation. These schemes are usually decoded using a maximum likelihood (ML) decoder which leads to optimum results in the mean square error sense for very good channels, but is suboptimal for noisy channels. In this paper the performance of an improved decoder, the minimum mean square error (MMSE) decoder is assessed. As a special case of a 1:2 expansion case (rate 1/2) Shannon-Kotel'nikov mapping, the Archimedes spiral is considered. The properties of the ML and MMSE decoder are examined and a graphical interpretation for the superior performance of the MMSE decoder is given. Furthermore the robustness of the MMSE decoder w.r.t. inaccurate estimation of the channel quality is determined. The concepts of the MMSE decoder which lead to a superior performance to the ML decoder can be generalized and applied to all Shannon- Kotel'nikov mappings.

Download

BibTeX

Copyright © by IKS
ruengeler2010b.pdf

This material is presented to ensure timely dissemination of scholarly and technical work. Copyright and all rights therein are retained by authors or by other copyright holders. All persons copying this information are expected to adhere to the terms and constraints invoked by each author's copyright. In most cases, these works may not be reposted without the explicit permission of the copyright holder.

---