Soft-input decoder for decoding of internally channel coded fiber-optic CDMA communication systems

We propose using a soft-input decoder for the decoding of internally convolutional coded Poisson noise-dominated fiber-optic code-division multiple-access (CDMA) communication systems using optical orthogonal codes. We first compute the coded symbol log-likelihoods at the output of the Poisson noise-dominated channel, which is then used by a soft-input maximum-likelihood decoder, for a fiber-optic CDMA system assuming both on-off keying and binary pulse position modulation schemes. Furthermore, we develop a discrete soft-output channel model for a Poisson noise-dominated channel, with which we evaluate the upper bound on the bit error probability of the internally coded Poisson noise-dominated fiber-optic CDMA system using a soft-input decoder. It is shown that the soft-input decoder significantly outperforms the hard-input decoder. Furthermore, the performance of the soft-input decoder is also evaluated in the presence of different values of dark current.     

Low-rate channel coding scheme for Replica MT-CDMA communication system

In this paper, we analyze bit error rate performance of a special case of multitone CDMA systems that is Replica MT-CDMA system. It is shown that with the same bandwidth, the Replica MT-CDMA outperforms the conventional system that we name it S/P MT-CDMA. We also propose a low-rate bandwidth efficient channel coding scheme for Replica MT-CDMA that by using it, the coded Replica MT-CDMA system needs the same bandwidth as the uncoded one. In this paper, we compare the proposed low-rate coded and uncoded Replica MT-CDMA systems with S/P MT-CDMA system over uplink Rayleigh fading channel. Our results show that with the same bandwidth, the performance of the coded Replica MT-CDMA system with the proposed channel coding scheme is considerably better than that of both uncoded MT-CDMA systems.     

Code-spread CDMA using maximum free distance low-rate convolutionalcodes

In code division multiple-access (CDMA) systems, maximum total throughput assuming a matched filter receiver can be obtained by spreading with low-rate error control codes. Previously, orthogonal, bi-orthogonal and super-orthogonal codes have been proposed for this purpose. We present in this paper a family of rate-compatible low-rate convolutional codes with maximum free distance. The performance of these codes for spectrum spreading in a CDMA system is evaluated and shown to outperform that of orthogonal and super-orthogonal codes as well as conventionally coded and spread systems. We also show that the proposed low rate codes will give simple encoder and decoder implementations. With these codes, any rate 1/n, n⩽512, are obtained for constraint lengths up to 11, resulting in a more flexible and powerful scheme than those previously proposed     

Performance Analysis of Fiber-Optic BPPM CDMA Systems With Single Parity-Check Product Codes

The application of a family of single parity-check (SPC) product codes in the fiber-optic code-division multiple-access (CDMA) systems with binary pulse position modulation (BPPM) is considered in this paper. We evaluate the bit-error probabilities of the coded systems, taking into account the photodetector noise, thermal noise, and the multiple-access interference. In this paper, the performance of the employed coding schemes over a binary-input output-symmetric channel is analyzed, based on the density evolution approach. The validity of the analytically obtained bit-error rates (BERs) over binary symmetric channels (BSCs) for each of the decoding iterations is verified by the system simulation. It is then shown that the application of these coding schemes in the optical BPPM-CDMA communication system, which can be modeled as a BSC, significantly improves the system performance. Particularly, for a certain BER (less than$10^-7$) and bandwidth, the coded systems not only permit a higher number (more than twice) of active users, compared witho the uncoded systems, but also can operate at higher channel bit rate (up to four times) with more than 10% energy saving. Furthermore, by increasing the number of code dimensions, less power (less than 40%) is required to achieve the desired performance.     

Multistage decoding for internally bandwidth efficient coded Poisson fiber-optic CDMA communication systems

We consider the structure and performance of a multistage decoding scheme for an internally bandwidth efficient convolutionally coded Poisson fiber-optic code division multiple access (CDMA) communication system. The decoder is implemented electronically in several stages in which in each stage, the interfering users' coded bit decisions obtained in the previous stage is applied for computing the likelihood of the coded symbols of the desired user. The first stage is a soft-input Viterbi decoder for the internally coded scheme, in which the soft-input coded symbol likelihood values are computed by considering the multiuser interference as a noise signal. The likelihood of coded symbol computed in each stage is then entered into the convolutional decoder for the next bit decisions. The convolutional codes that are used for demonstrating the performance of the multistage decoder are super orthogonal codes (SOCs). We derive the bit error rates (BERs) of the proposed decoder for internally coded Poisson fiber-optic CDMA systems using optical orthogonal codes (OOCs) along with both ON-OFF keying (OOK) and binary pulse position modulation (BPPM) schemes. Our numerical results indicate that the proposed decoding scheme substantially outperforms the single-stage soft-input Viterbi decoder. We also derive the upper bound on the probability of error of a decoder for the known interference case, which is the ultimate performance of a multiuser decoder, and compare the result with that of the soft-input Viterbi decoder.     

Performance Analysis of Space-Time Coded CDMA System Over Nakagami Fading Channels with Perfect and Imperfect CSI

In this paper, the performance of multiuser CDMA systems with different space time code schemes is investigated over Nakagami fading channel. Low-complexity multiuser receiver schemes are developed for space-time coded CDMA systems with perfect and imperfect channel state information (CSI). The schemes can make full use of the complex orthogonality of space-time coding to obtain the linear decoding complexity, and thus simplify the exponential decoding complexity of the existing scheme greatly. Moreover, it can achieve almost the same performance as the existing scheme. Based on the bit error rate (BER) analysis of the systems, the theoretical calculation expressions of average BER are derived in detail for both perfect CSI and imperfect CSI, respectively. As a result, tight closed-form BER expressions are obtained for space-time coded CDMA with orthogonal spreading code, and approximate closed-form BER expressions are attained for space-time coded CDMA with quasi-orthogonal spreading code. Computer simulation for BER shows that the theoretical analysis and simulation are in good agreement. The results show that the space-time coded CDMA systems have BER performance degradation for imperfect CSI.     

Application of convolutional error correcting codes in ultrawideband M-ary PPM signaling

The interference issues related to ultrawideband (UWB) radio pose tight restrictions on the maximum data rate of UWB radio telecommunication systems. A possible solution is to reduce the required signal to interference ratio (SIR) that gives satisfactory performance to the UWB system. In this letter, we propose coded M-ary UWB radio communication systems. Two classes of convolutional codes, namely, low-rate superorthogonal codes and high-rate punctured codes are considered for this purpose. Simulation results on the bit error rate of the proposed system indicates that the system is capable to work in lower SIR's and therefore supports higher data transmission rates in a real interference environment compared to the previously proposed UWB communication systems.     

一种满速率空时分组编码CDMA系统及多用户接收方案

通过引入满速率空时分组码方案, 该文给出一种满速率空时分组编码CDMA系统模型, 并针对现有空时编码CDMA系统过高的译码复杂度, 提出一种低复杂度的多用户接收方案。该方案在通过类似多用户检测方法有效抑制多用户干扰后, 充分利用空时分组码的复正交性来简化原有方案高译码复杂度。与原有指数性译码复杂度相比, 该方案有着线性复杂度, 而且与满分集空时分组编码CDMA系统相比, 可实现满速率、低复杂度和部分分集, 有着相对多的空间冗余信息, 从而级联信道编码后可有效弥补部分分集所带来的性能损失。仿真结果表明在相同系统容量和级联码的情况下, 所给系统比相应的满分集空时编码CDMA系统有着低的误比特率。     

An Iterative Multiuser Detector for Overloaded LDPC Coded CDMA Systems

Maximum number of users in a Code Division Multiple Access (CDMA) system, disregarding the type of used signature sequences, is equal to the processing gain; but in overloaded CDMA systems, it is tried to use some special methods of applying signature sequences so that the number of users exceeds the processing gain of the system. This growth in capacity is gain at the cost of decrease in performance of the conventional systems; and usually it is tried to use channel coding methods or multi-user detectors to compensate this decrease. Because of advantages of using coding methods joined with multiuser detectors in achieving better performance and also because of some benefits of using (Low Density Parity Check) LDPC method in comparison with similar capacity achieving coding methods, in this article, an iterative multi-user detector for an overloaded LDPC Coded CDMA system is proposed. This receiver consists of a combination of matched filters in the first stage and a linear (Minimum Mean Square Error) MMSE detector and an Interference Cancellation (IC) scheme in the successive stages. In the suggested method, a bank of LDPC decoders gives the soft information to the IC blocks, which help for the better interference cancellation. Comparing the performance of the proposed system with that of Turbo coded system shows that the proposed system, in addition to advantages of using LDPC codes instead of Turbo codes, has better bit error rate performance.     

GF(2p)LDPC编码的相位调制OFDM系统在瑞利衰落信道的性能

OFDM是一项能有效对抗高速无线通信中多径衰落的关键技术，为了进一步提高OFDM系统的误码性能，许多信道编码技术已被应用于OFDM系统中，二元域LDPC码以其近香农限的误码性能和较低的译码复杂度成为研究的热点。在AWGN信道下，多元域LDPC码比等效码长的二元域LDPC码有更好的纠错性能。本文提出了一种将多元域LDPC码经过MPSK调制后用于OFDM系统的新方法。仿真结果表明，在多径衰落信道下，通过合理选择多元LDPC码域的阶数和调制的方法，多元域LDPC编码的高阶调制OFDM系统比等效码长的二元域LDPC编码OFDM系统具有更好的性能，并且由于采用了多元域LDPC的快速BP译码，译码复杂度只是稍有增加。     

Low-rate channel coding with complex-valued block codes

This paper addresses aspects of channel coding in orthogonal frequency-division multiplexing-code-division multiple access (OFDM-CDMA) uplink systems where each user occupies a bandwidth much larger than the information bit rate. This inherent bandwidth expansion allows the application of powerful low-rate codes under the constraint of low decoding costs. Three different coding strategies are considered: the combination of convolutional and repetition codes, the code-spread system consisting of one single very low-rate convolutional code and a serial concatenation of convolutional, Walsh-Hadamard and repetition code. The latter scheme is improved by combining the Walsh-Hadamard codes with an additional M-phase-shift keying modulation resulting in complex-valued Walsh-Hadamard codes (CWCs). Analytical performance evaluations will be given for these codes for the first time. The application of CWCs as inner codes in a serial code concatenation is also addressed. We derive a symbol-by-symbol maximum a posteriori decoding algorithm in the complex signal space in order to enable iterative decoding for the entire code. A comprehensive performance analysis by simulation of all the proposed coding schemes shows that the Walsh-Hadamard-based schemes are the best choice for low-to-medium system load. Note that even for fully loaded OFDM-CDMA systems, the concatenation with an inner complex-valued Walsh-Hadamard code leads to a bit-error rate less than 10/sup -5/ for an E/sub b//N/sub 0/ of about 6 dB.     

Robust Transmission of Multistage Vector Quantized Sources Over Noisy Communication Channels—Applications to MELP Speech Codec

Joint source-channel coding is an effective approach for the design of bandwidth efficient and error resilient communication systems with manageable complexity. An interesting research direction within this framework is the design of source decoders that exploit the residual redundancy for effective signal reconstruction at the receiver. Such source decoders are expected to replace the traditionally heuristic error concealment units that are elements of most multimedia communication systems. In this paper, we consider the reconstruction of signals encoded with a multistage vector quantizer (MSVQ) and transmitted over a noisy communications channel. The MSVQ maintains a moderate complexity and, due to its successive refinement feature, is a suitable choice for the design of layered (progressive) source codes. An approximate minimum mean squared error source decoder for MSVQ is presented, and its application to the reconstruction of the linear predictive coefficient (LPC) parameters in mixed excitation linear prediction (MELP) speech codec is analyzed. MELP is a low-rate standard speech codec suitable for bandwidth-limited communications and wireless applications. Numerical results demonstrate the effectiveness of the proposed schemes     

Perfect difference codes for synchronous fiber-optic CDMAcommunication systems

In this paper, we introduce the perfect difference sets and propose a synchronous fiber-optic code-division multiple-access system (CDMA) using these sets to generate the signature codes. Two interesting properties of these codes are discussed: (1) any two different codes are cyclic-shifted with each other; and (2) the cross correlation between any two different codes is exactly one. Thus, we may treat these codes as quasi-orthogonal codes. Using the first property of these codes, we can simplify design of the transmitter. In the receiver, we can use the second property to effectively eliminate the multiple-user interference (MUI) without reducing the number of usable codes. Based on the proposed transmitter and receiver, the system performance is derived. The numerical examples reveal that the proposed system can provide reliable communication even under heavy load. We believe that the proposed system using perfect difference codes outperforms any other synchronous fiber-optic CDMA systems     

Synchronous fiber-optic CDMA using hard-limiter and BCH codes

In this paper, synchronons code division multiple access (S/CDMA) for fiber-optic local area networks is considered. The performance of the fiber-optic S/CDMA network with negligible thermal and shot noises is interference limited. Here we derive the bit error rate of the S/CDMA system as a function of code length and number of active users, and the performance characteristics are also discussed. Furthermore, we analyze the performance of the fiber-optic S/CDMA system with an ideal optical hard-limiter, and the error probability with error control coding is also derived. In addition, the optimization between the S/CDMA and BCH codes of a constant bandwidth system is presented. The results show that by using an ideal hard-limiter in conjunction with BCH codes in this system, the influence of interference arising from other users can be greatly reduced, and the number of active users can also be increased significantly     

Coded modulation for a coherent DS-CDMA system employing an MMSE receiver in a fading channel

Previous results have shown that high rate codes tend to yield a lower average bit-error rate than low rate codes when employing a minimum mean-square error (MMSE) receiver for a direct-sequence code-division multiple-access (CDMA) system in either an additive white Gaussian noise channel or a flat Rayleigh fading channel. we consider the use of larger signal constellations with both trellis-coded modulation and bit-interleaved coded modulation (BICM) to determine if further gains can be achieved in either the Rayleigh or Ricean fading channel. The average bit-error probability is derived for both coding schemes using the general Ricean fading channel model, based upon the common assumptions of infinite interleaving, perfect channel state information, and optimal MMSE receiver coefficients. New bounds are presented for BICM with 8-PSK and 16-QAM symbols, which take advantage of the symmetries inherent in the signal constellations with Gray code mapping. In addition, simulation results are presented which show the important effect a finite interleaving delay constraint has on the comparison of various codes. The results show that there are cases when coded modulation does yield a significant improvement in performance for a CDMA system using an MMSE receiver, compared to standard convolutional coding. However, the best coding strategy depends upon several factors, including the nature of the fading process (Rayleigh or Ricean), the operating signal-to-noise ratio, the interleaving delay constraint, the time-variability of the channel, the number of users in the system, and the severity of the near-far problem.     

Rateless codes with adaptive parity allocation for satellite systems

In this paper, we propose efficient parity allocation schemes when rateless codes are used in satellite communication systems in conjunction with an adaptive coding and modulation (ACM) scheme. ACM schemes are widely used in modern satellite communication systems to maintain the required error rate performance under channel impairment (such as rain fading observed in high‐frequency bands). The performance enhancement of ACM can be achieved by providing a good channel prediction and mode allocation method. In the case of a channel prediction or allocation error, rateless codes can be used as an effective means of retransmission to compensate for the performance degradation. After investigating the performance behaviour of rateless codes combined with ACM, we derive a mathematical formula to find the optimum parity length of the rateless code to be retransmitted to satisfy the target performance requirements. Simulation results described in this paper show that the proposed method can be used to enhance the error performance as well as spectral efficiency.     

Joint Source and Channel Coding using Punctured Ring Convolutional Coded CPM

In this paper, a novel trellis source encoding scheme based on punctured ring convolutional codes is presented. Joint source and channel coding (JSCC) using trellis coded continuous phase modulation (CPM) with punctured convolutional codes over rings is investigated. The channels considered are the additive white gaussian noise (AWGN) channel and the Rayleigh fading channel. Optimal soft decoding for the proposed JSCC scheme is studied. The soft decoder is based on the a posteriori probability (APP) algorithm for trellis coded CPM with punctured ring convolutional codes. It is shown that these systems with soft decoding outperform the same systems with hard decoding especially when the systems operate at low to medium signal-to-noise ratio (SNR). Furthermore, adaptive JSCC approaches based on the proposed source coding scheme are investigated. Compared with JSCC schemes with fixed source coding rates, the proposed adaptive approaches can achieve much better performance in the high SNR region. The novelties of this work are the development of a trellis source encoding method based on punctured ring convolutional codes, the use of a soft decoder, the APP algorithm for the combined systems and the adaptive approaches to the JSCC problem.     

Superposition Coding with Unequal Error Protection for the Uplink of Overloaded DS-CDMA System

The overloaded CDMA schemes exploited in direct sequence CDMA (DS-CDMA) systems are mainly to accommodate a greater number of users than the available spreading factor N. In this paper, a superposition coding CDMA (SPC-CDMA) with unequal error protection (UEP) is proposed as one of the overloaded CDMA schemes for the next generation mobile communication systems. It exploits the available power control in most base stations to adapt the transmitted power of active users in the uplink channel. In this scheme, the active users are divided into G groups and each group consists of K users. The K users share the same spreading sequence and are distinguished by different received power levels. At the receiver side, the system first performs despreading for group detection followed by multiuser receiver to estimate the K user signals in each group. It is shown through simulations that better performance are achieved compared to the conventional DS-CDMA and existing overloaded collaborative spreading CDMA (CS-CDMA) schemes, in additive white Gaussian noise (AWGN) and fading channels. Hence, the proposed scheme maximizes the system capacity K-fold compared to conventional DS-CDMA system without requiring extra spreading codes, with average signal to noise ratio (SNR) cost of only 1dB and 2 dB over AWGN and fading channels respectively at BER of 10^?3. On the other hand, for the same N, K and power constraints, SPC-CDMA scheme achieves twofold increase in data rate with 0.7 and 4 dB gains over AWGN and fading channels respectively, compared with overloaded CS-CDMA scheme in the same system capacity. In addition, the proposed scheme can also attain different levels of UEP for different users?? requirements by adjusting their fractions of transmitted powers.     

Mitigating multiple access interference and intersymbol interference in uncoded CDMA systems with chip-level interleaving

The presence of intersymbol interference (ISI), in addition to multiple access interference, severely hampers the performance of a code-division multiple-access (CDMA) communication system. In such a situation, channel coding can be used to obtain better performance, but at the cost of a reduction in rate of flow of information. In this paper, it is shown with the help of simulation results that the chip-interleaved CDMA system effectively combats ISI without requiring additional channel coding. The system differs from the conventional CDMA system in the sense that, the chip sequence resulting from the pseudo noise (PN) sequence modulation is interleaved before transmission. Two receivers are proposed, one based on the turbo equalization method which employs a maximum a posteriori equalizer of exponential complexity and the other based on minimum-mean square error-optimized iterative interference cancellation principles which is of linear complexity. Simulation results are provided which show that error rates close to the no-ISI single-user case can be obtained. The shortcomings of the coded CDMA with turbo detection system in the presence of ISI are also discussed.     

Optimal reception, performance bound, and cutoff rate analysis ofreferences-assisted coherent CDMA communications with applications

Coherent spread-spectrum communications with transmitted reference-based, also called pilot-based, channel estimation is considered for code-division multiple-access (CDMA) communications over fading channels. Both noncontiguous time-division multiplexed reference symbol-based and continuous code-division multiplexed channel-based schemes are described. Assuming mean square error or optimal robust channel estimation, we derive the optimal receiver structure with a maximum-likelihood convolutional decoder. In addition, the Bhattacharyya bound and the cutoff rate of the reference-assisted coherent communications are derived. These analytical results are used for evaluating system performance and for selecting parameters such as coding rate and the data to reference power ratio to optimize system performance. Simulation results are given showing that the reverse link performance in a CDMA system can be significantly improved by using the reference-assisted coherent communication instead of noncoherent reception of orthogonally coded signal