This paper considers a wireless coherent system that enables high-speed-data transmission in the presence of carrier phase error over an additive white Gaussian noise (AWGN) channel. Carrier phase noise is caused by imperfect carrier tracking of the coherent demodulation. The channel characteristics of the system were modeled using phase noise whose stochastic process followed the Tikhonov distribution. For this model, we first propose an optimum detector that produces the most suitable decoding metric for a soft-input/soft-output (SISO) decoder, and then develop some simpler forms of the optimum detector to obtain efficient implementation at close to optimal performance. Those simple detectors that have a wide range of performance/complexity tradeoffs are promising in various applications. To evaluate the effectiveness of the proposed detectors, we have applied them to a bandwidth-efficient turbo-coded modulation scheme in which a component decoder based on SISO principles necessitates more exact channel measurement than is possible with a conventional decoder based on Viterbi decoding. Simulation results have demonstrated that the optimum detector enables excellent bit error rate (BER) performance that exceeds that with a normal detector designed for AWGN channels by more than 1 dB at a BER of 10-6 under a severe phase noise environment.

Fading in mobile satellite communications severely degrades the performance of data transmission. It is commonly modeled with non-frequency selective Rayleigh fading. For this type of channel, a new structure for a bit-interleaved coded modulation (BICM) scheme is presented and evaluated to determine its effectiveness compared to previously proposed schemes. This scheme is referred to as rate-compatible punctured BICM (RCP-BICM), in that its BICM encoder is able to yield a wide range of data rates by using a punctured convolutional code obtained by periodically perforating parity bits from the output of a low-rate-1/2 systematic convolutional code. A trellis-coded modulation (TCM) scheme and a turbo TCM (TTCM) scheme are discussed and evaluated for comparison with the RCP-BICM scheme. Simulation results demonstrate that the RCP-BICM scheme with hard-decision iterative decoding is superior to the TCM scheme by 3 dB at a bit error rate (BER) of 10-5 over an Rayleigh fading channel, and comes at a BER of 10-5 within 1 dB of the TCM scheme over an additive white Gaussian noise (AWGN) channel.

We present the channel capacity, specifically the mutual information, of an additive white Gaussian noise (AWGN) channel in the presence of phase noise, and investigate the effect of phase noise impairment on powerful error-correcting codes (ECCs) that normally operate in low signal-to-noise ratio (SNR) regions. This channel-induced impairment is common in digital coherent transmission systems and is caused by imperfect carrier tracking of the phase error detector for coherent demodulation. It is shown through semi-analytical derivation that decreasing the information rate from its ideal capacity to an information rate lower than its inherent capacity significantly mitigates the impairment caused by phase noise, and that operating systems in the low SNR region also lessen the phase noise impairment by transforming typical phase noise behavior into Gaussian-like behavior. We also demonstrate by computer simulation using turbo-trellis coded modulation (TTCM) with high-order quadrature amplitude modulation (QAM) signals that the use of capacity-approaching codes (CACs) makes transmission systems invulnerable to phase noise. To verify the effect of CACs on phase noise, simulation results of TTCM are also compared to that of trellis-coded modulation (TCM), which is used as an example of a conventional ECC operating at a relatively high SNR.

This paper considers a high-rate turbo code which employs high-rate convolutional codes as component codes, and presents a novel method of reducing the decoding complexity of the codes. By eliminating some of branches that have the lowest reliabilities among all the branches entering each node, the proposed algorithm reduces the complexity in the process of the add-compare-select (ACS) between the consecutive stages of iterative decoding. That is, the complexity gradually decreases as the number of iterations increases. We compare the unpunctured high-rate turbo code with a classical punctured high-rate turbo code in terms of performance/complexity trade-off under the same code rate. Simulation results show that the proposed approach with a good trade-off provides an alternative coding scheme to the classical punctured high-rate turbo coding for the application to high-data-rate wireless communication systems.

The effects of noisy estimates of fading on turbo-coded modulation are studied in the presence of flat Rayleigh fading, and the channel capacity of the system is calculated to determine the limit above which no reliable transmission is guaranteed. This limit is then compared to the signal-to-noise ratio required for a turbo-coded modulation scheme to achieve a bit-error-rate of 10-5. Numerical results are obtained, especially for QAM signals. Our results show that even slightly noisy estimates significantly degrade the theoretical limits related to channel capacities, and that an effective use of capacity-approaching codes can lower the sensitivity to noisy estimates, though noise that exceeds a certain threshold cannot be offset by the performance improvement associated with error-correcting capability.

Soft-in/soft-out Viterbi algorithm (SOVA) originally proposed for rate 1/n code is applied to rate m/(m+1) trellis-coded modulation (TCM). In TCM, 2m branches merge into a node in a code trellis. After pruning the branches on path with less path-metric until two best paths remain, SOVA is applied to the pruned trellis. Based on the pruned trellis, an iterative decoding algorithm of turbo TCM is developed. Effects of path memory length and scaling of a value transferred between decoding stages are investigated through simulation. Turbo TCM over 8 PSK and 16 QAM channel with Gaussian noise realize a bit error rate (BER) of 10-5 within 1 dB from the Shannon limit.