Change search
ReferencesLink to record
Permanent link

Direct link
Polynomial Based Analog Source-Channel Codes
KTH, School of Electrical Engineering (EES), Communication Theory. KTH, School of Electrical Engineering (EES), Centres, ACCESS Linnaeus Centre.
KTH, School of Electrical Engineering (EES), Communication Theory. KTH, School of Electrical Engineering (EES), Centres, ACCESS Linnaeus Centre.ORCID iD: 0000-0002-7926-5081
Department of Electronics and Telecommunications, Norwegian University of Science and Technology, NTNU.
2009 (English)In: IEEE Transactions on Communications, ISSN 0090-6778, E-ISSN 1558-0857, Vol. 57, no 9, 2600-2606 p.Article in journal (Refereed) Published
Abstract [en]

In many communication applications one is interested in transmitting a time-discrete analog-valued (i.e. continuous alphabet) source over a time-discrete analog channel. We study this problem in the case of bandwidth expansion, in the sense that one source sample, X, is transmitted over N orthogonal channels. An analog source-channel code based on orthogonal polynomials is proposed and analyzed. The code can be generated using a Gram-Schmidt procedure, to fit virtually any source distribution.

Place, publisher, year, edition, pages
2009. Vol. 57, no 9, 2600-2606 p.
Keyword [en]
Modulation, nonlinear functions, source coding, channel coding, error correction
National Category
URN: urn:nbn:se:kth:diva-8443DOI: 10.1109/TCOMM.2009.09.080114ISI: 000269798600020ScopusID: 2-s2.0-70350407185OAI: diva2:13767

QC 20100917. Uppdaterad från submitted till published (20100917).

Available from: 2008-05-15 Created: 2008-05-15 Last updated: 2014-10-07Bibliographically approved
In thesis
1. Source-Channel Coding in Networks
Open this publication in new window or tab >>Source-Channel Coding in Networks
2008 (English)Doctoral thesis, comprehensive summary (Other scientific)
Abstract [en]

The aim of source coding is to represent information as accurately as possible using as few bits as possible and in order to do so redundancy from the source needs to be removed. The aim of channel coding is in some sense the contrary, namely to introduce redundancy that can be exploited to protect the information when being transmitted over a nonideal channel. Combining these two techniques leads to the area of joint source-channel coding which in general makes it possible to achieve a better performance when designing a communication system than in the case when source and channel codes are designed separately. In this thesis four particular areas in joint source-channel coding are studied: analog (i.e. continuous) bandwidth expansion, distributed source coding over noisy channels, multiple description coding (MDC) and soft decoding.

A general analog bandwidth expansion code based on orthogonal polynomials is proposed and analyzed. The code has a performance comparable with other existing schemes. However, the code is more general in the sense that it is implementable for a larger number of source distributions.

The problem of distributed source coding over noisy channels is studied. Two schemes are proposed and analyzed for this problem which both work on a sample by sample basis. The first code is based on scalar quantization optimized for a certain channel characteristics. The second code is nonlinear and analog.

Two new MDC schemes are proposed and investigated. The first is based on sorting a frame of samples and transmitting, as side-information/redundancy, an index that describes the resulting permutation. In case that some of the transmitted descriptors are lost during transmission this side information (if received) can be used to estimate the lost descriptors based on the received ones. The second scheme uses permutation codes to produce different descriptions of a block of source data. These descriptions can be used jointly to estimate the original source data. Finally, also the MDC method multiple description coding using pairwise correlating transforms as introduced by Wang et al. is studied. A modi fication of the quantization in this method is proposed which yields a performance gain.

A well known result in joint source-channel coding is that the performance of a communication system can be improved by using soft decoding of the channel output at the cost of a higher decoding complexity. An alternative to this is to quantize the soft information and store the pre-calculated soft decision values in a lookup table. In this thesis we propose new methods for quantizing soft channel information, to be used in conjunction with soft-decision source decoding. The issue on how to best construct finite-bandwidth representations of soft information is also studied.

Place, publisher, year, edition, pages
Stockholm: KTH, 2008. viii, 44 p.
Trita-EE, ISSN 1653-5146 ; 2008:028
source coding, channel coding, joint source-channel coding, bandwidth expansion, distributed source coding, multiple description coding, soft decoding
National Category
urn:nbn:se:kth:diva-4751 (URN)978-91-7415-002-5 (ISBN)
Public defence
2008-06-03, F3, KTH, Lindstedtsv 25, Stockholm, 13:15
QC 20100920Available from: 2008-05-15 Created: 2008-05-15 Last updated: 2010-09-20Bibliographically approved

Open Access in DiVA

No full text

Other links

Publisher's full textScopus

Search in DiVA

By author/editor
Wernersson, NiklasSkoglund, Mikael
By organisation
Communication TheoryACCESS Linnaeus Centre
In the same journal
IEEE Transactions on Communications

Search outside of DiVA

GoogleGoogle Scholar
The number of downloads is the sum of all downloads of full texts. It may include eg previous versions that are now no longer available

Altmetric score

Total: 91 hits
ReferencesLink to record
Permanent link

Direct link