3 research outputs found
Non-iterative joint decoding and signal processing: universal coding approach for channels with memory
A non-iterative receiver is proposed to achieve near capacity performance on intersymbol
interference (ISI) channels. There are two main ingredients in the proposed
design. i) The use of a novel BCJR-DFE equalizer which produces optimal soft
estimates of the inputs to the ISI channel given all the observations from the channel
and L past symbols exactly, where L is the memory of the ISI channel. ii) The
use of an encoder structure that ensures that L past symbols can be used in the
DFE in an error free manner through the use of a capacity achieving code for a
memoryless channel. Computational complexity of the proposed receiver structure
is less than that of one iteration of the turbo receiver. We also provide the proof
showing that the proposed receiver achieves the i.i.d. capacity of any constrained
input ISI channel. This DFE-based receiver has several advantages over an iterative
(turbo) receiver, such as low complexity, the fact that codes that are optimized for
memoryless channels can be used with channels with memory, and finally that the
channel does not need to be known at the transmitter. The proposed coding scheme
is universal in the sense that a single code of rate r; optimized for a memoryless
channel, provides small error probability uniformly across all AWGN-ISI channels of
i.i.d. capacity less than r:
This general principle of a proposed non-iterative receiver also applies to other
signal processing functions, such as timing recovery, pattern-dependent noise whiten ing, joint demodulation and decoding etc. This makes the proposed encoder and
receiver structure a viable alternative to iterative signal processing. The results show
significant complexity reduction and performance gain for the case of timing recovery
and patter-dependent noise whitening for magnetic recording channels
Capacity -based parameter optimization of bandwidth constrained CPM
Continuous phase modulation (CPM) is an attractive modulation choice for bandwidth limited systems due to its small side lobes, fast spectral decay and the ability to be noncoherently detected. Furthermore, the constant envelope property of CPM permits highly power efficient amplification. The design of bit-interleaved coded continuous phase modulation is characterized by the code rate, modulation order, modulation index, and pulse shape. This dissertation outlines a methodology for determining the optimal values of these parameters under bandwidth and receiver complexity constraints. The cost function used to drive the optimization is the information-theoretic minimum ratio of energy-per-bit to noise-spectral density found by evaluating the constrained channel capacity. The capacity can be reliably estimated using Monte Carlo integration. A search for optimal parameters is conducted over a range of coded CPM parameters, bandwidth efficiencies, and channels. Results are presented for a system employing a trellis-based coherent detector. To constrain complexity and allow any modulation index to be considered, a soft output differential phase detector has also been developed.;Building upon the capacity results, extrinsic information transfer (EXIT) charts are used to analyze a system that iterates between demodulation and decoding. Convergence thresholds are determined for the iterative system for different outer convolutional codes, alphabet sizes, modulation indices and constellation mappings. These are used to identify the code and modulation parameters with the best energy efficiency at different spectral efficiencies for the AWGN channel. Finally, bit error rate curves are presented to corroborate the capacity and EXIT chart designs