In digital mobile communications efficient compression algorithms are needed to encode speech or audio signals. As the determined source parameters are highly sensitive to transmission errors, robust source and channel decoding schemes are required. This contribution deals with an iterative source-channel decoding approach where a simple channel decoder and a softbit-source decoder are concaten...

In digital mobile communications efficient compression algorithms are needed to encode speech or audio signals. As the determined source parameters are highly sensitive to transmission errors, robust source and channel decoding schemes are required. This contribution deals with an iterative source-channel decoding approach where a simple channel decoder and a softbit-source decoder are concaten...

Concatenation is a method of building long codes out of shorter ones, it attempts to meet the problem of decoding complexity by breaking the required computation into manageable segments. Concatenated Continuous Phase Frequency Shift Keying (CPFSK) facilitates powerful error correction. CPFSK also has the advantage of being bandwidth efficient and compatible with non-linear amplifiers. Bandwidt...

In this paper we consider a Multi Carrier Code Division Multiplex (MC–CDM) scheme. At the receiver side the Maximum A Posteriori Symbol–by–Symbol Estimator (MAPSSE) is used for the detection of the CDM signal. Therefore the influence of the spreading factor on the overall Bit Error Rate (BER) is investigated. We concatenate the MAPSSE with the channel decoder which allows for iterative decoding...

This paper is concerned with linear superposition systems in which all components of the superimposed signal are coded with an identical binary low-density parity-check (LDPC) code. We focus on the design of decoding and computing algorithms. The main contributions of this paper include: 1) we present three types of iterative multistage decoding/computing algorithms, which are referred to as de...

In this paper we investigate iterative source-channel decoding for robust JPEG coded images transmission over noisy channels. Huffman codes used as the variable-length coding scheme in JPEG coding can be represented by an irregular trellis structure proposed by Balakirsky (1997). State transition probabilities can be derived from the irregular trellis and can be used as a priori information to ...

A receiver structure suitable for coded M-ary DPSK signals on static and time-varying channels is investigated. The transmitter consists of a convolutional code, an interleaver, and a diierential encoder, and hence represents a type of \serial turbo code". In the receiver, the kernel is an a posteriori probability (APP) demodulator. A priori information is accepted and reliability outputs are p...