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.     

Iterative multiuser detection/decoding for turbo coded CDMA systems

We propose a novel scheme for iterative multiuser detection and turbo decoding. The multiuser detector and single-user turbo decoders are coupled such that after each turbo decoding iteration the extrinsic information of the interfering users is passed to the multiuser detector, and after each multiuser iteration, updated a posteriori probabilities are passed to the single-user turbo decoders as the soft input metrics. In synchronous systems, the proposed detector approaches the multiuser capacity limit within 1 dB in the low signal-to-noise ratio region     

Performance analysis for coded CDMA systems

This correspondence analyzes the bit-error rate (BER) performance of coded synchronous code-division multiple-access (CDMA) systems assuming perfect channel state information (CSI) and optimal joint multiuser detection/decoding (OJMUDD). Our analysis is conducted in the same framework as that of uncoded systems. First, we derive the precise probability of an error event, then we provide an upper bound on the BER based on the sum of pairwise error probabilities, and, finally, we tighten the upper bound by considering decomposable error events. Many new concepts unique to coded systems are introduced. We propose to use quasi parity checks for identifying permissible error events, introduce the concept of compatible probability of error matrices, extend the list of conditions for identifying decomposable error events, and introduce the concept of conjugate sets to explore the symmetry among indecomposable error events. Simulation results are given along with theoretical predictions.     

Statistical analysis of fiber-optic CDMA communication systems. I. Device modeling

In this paper, we present a new methodology for analysis of all-optical fiber-optic code-division multiple-access (FO-CDMA) networks. In this analysis, we propose statistical models, based on photon-counting techniques, for some basic elements of the network, such as splitters, combiners, star couplers, and FO-CDMA passive encoders/decoders. By following the statistical variation of the photon-count of the string of pulses that constitutes the address sequence in an FO-CDMA network, we will be able to reveal the quantum-limited optical signal-to-noise ratio (OSNR) required at the transmitter output to meet the performance limits. Moreover, considering receiver thermal noise and source extinction ratio, we explore the role of using an optical preamplifier before the detector and the dependence of the performance on the transmitted power and the weight of the employed optical orthogonal codes (OOCs).     

Maximizing the spectral efficiency of coded CDMA under successive decoding

We investigate the spectral efficiency achievable by random synchronous code-division multiple access (CDMA) with quaternary phase-shift keying (QPSK) modulation and binary error-control codes, in the large system limit where the number of users, the spreading factor, and the code block length go to infinity. For given codes, we maximize spectral efficiency assuming a minimum mean-square error (MMSE) successive stripping decoder for the cases of equal rate and equal power users. In both cases, the maximization of spectral efficiency can be formulated as a linear program and admits a simple closed-form solution that can be readily interpreted in terms of power and rate control. We provide examples of the proposed optimization methods based on off-the-shelf low-density parity-check (LDPC) codes and we investigate by simulation the performance of practical systems with finite code block length.     

Noncoherent iterative decoding of spectrally efficient coded modulations

In this paper, we consider possible solutions for noncoherent decoding of concatenated codes with spectrally efficient modulations. Two main classes of schemes are considered. A first class is obtained by concatenating parallel coding schemes with differential encoding. A second class considers serially concatenated coding structures and possible schemes derived from turbo trellis coded modulation (t-tcm), which do not employ differential encoding. In the first case, at the receiver side we consider separate detection and decoding, while in the second case we consider joint detection and decoding. The major problem connected with such an iterative decoding procedure is that taking into account an augmented channel memory leads to an intolerable trellis size, and hence to an impractical decoding complexity. Reduced-complexity techniques suited to iterative decoding become fundamental, and we consider a recently proposed state-reduction technique. This way, the performance of a coherent receiver is approached, by keeping the number of receiver states fixed.     

Iterative reliability-based decoding in bandwidth efficient coding schemes

In this paper, we enhance and investigate the performance of some bandwidth efficient coding schemes with iteratively decodable structure and cycles in their graph representation. In particular, we deal with bit-interleaved coded modulation and transmit diversity, using low-density parity-check and turbo codes as component codes. Simulation results show that the suboptimality of iterative decoding for moderate length codes can be at least partially compensated. Hence they allow us to also measure partially this suboptimality.     

Decision-feedback soft-input/soft-output multiuser detector foriterative decoding of coded CDMA

The optimal decoding scheme for a code-division multiple-access (CDMA) system that employs convolutional codes results in a prohibitive computational complexity. To reduce the computational complexity, an iterative receiver structure was proposed for decoding multiuser data in a convolutional coded CDMA system. At each iteration, extrinsic information is exchanged between a soft-input/soft-output (SISO) multiuser detector and a bank of single-user SISO channel decoders. However, a direct implementation of the full-complexity SISO multiuser detector also has the exponential computational complexity in terms of the number of users. This paper proposes a low-complexity SISO multiuser detector based on tentative hard decisions that are made and fed back from the channel decoders in the previous iteration. The computational complexity of the proposed detector is linear in terms of the number of users and can be adjusted according to the complexity/performance tradeoff. Simulation results show that even with this simple feedback scheme, the performance of the coded multiuser system approaches that of the single-user system for moderate to high signal-to-noise ratios (SNRs)     

CDMA fiber-optic systems with optical hard limiters

The code-division multiple-access (CDMA) technique has recently received substantial attention for fiber-optic communication systems. Simultaneous users are allowed to send their data asynchronously in CDMA fiber-optic systems through the assignment of unique “signature codes.” The multiple-access interference (MAI), which increases with the number of simultaneous users, severely limits the user capacity of the systems. An optical hard limiter can be placed at the front end of the desired receiver to reduce the effects of the MAI. We obtain the bit error probability for the CDMA fiber-optic systems with optical hard limiters. The exact performance analysis is performed and the result is a generalization of a previous analysis. For λ_c=1 codes, the result is not restricted to the case for threshold Th=w, yielding a more general and useful result than that obtained previously. The improvement in the performance from using a hard limiter with prime code and extended prime code is shown. The effect on the choice of decision threshold Th is also examined     

Statistical analysis of fiber-optic CDMA communication systems. II. Incorporating multiple optical amplifiers

For pt. I see ibid., vol.20, no.8, p.1304-16 (2002). In this paper, we study and elaborate on the architectural consideration of using multiple optical amplifiers in an all-optical fiber-optic code-division multiple-access (FO-CDMA) network. Our study and considerations are based on obtaining the statistical characteristic functions for photon-counts of a string of output pulses that constitutes the address code in a FO-CDMA network. Optical orthogonal codes (OOCs) with minimum auto-and cross correlation are employed as the address or signature sequence codes. Our analysis is based on chip-synchronous interference only, which provides an upper bound on the system performance. Shot noise, thermal noise, and extinction ratio are considered in this analysis. Bit error rate (BER) results are obtained using two methods, namely, saddle-point and Gaussian approximations. From our BER analysis, we develop some insight into the optimum distribution of optical amplifiers and their corresponding gain setting parameter. Moreover, the effects of source power, code weight, number of users, bit rate, and amplified spontaneous emission noise are investigated.     

Design of coded CPFSK modulation systems for bandwidth and energyefficiency

Consideration is given to the problems related to the design of M-ary continuous-phase frequency-shift keying (CPFSK) systems with modulation index h=J/M, combined with eternal rate r binary convolution encoders. The following questions are raised and answered: (1) how should different encoder-modulator systems be compared and how can comparable systems be recognized from the system parameters, i.e. M, h, and r?; (2) what are the limits on the information rate per unit bandwidth, versus signal-to-noise ratio, when reliable transmission is required?; (3) how does one choose the system parameters M, h, and r when the overall system has to achieve a specified performance?; and (4) how does one design the external rate r binary convolutional encoder to put in front of the M-ary CPFSK modulation system with h=J/M ? A simple approximation for the bandwidth of a CPFSK signal is given and shown to be sufficiently accurate for system design purposes. The design of the external convolutional encoder is carried out in a novel way that leads to fewer states in the combined encoder-modulator system and thus yields improved performance for a given demodulation-decoding complexity compared to previous approaches for the design of coded CPFSK systems     

Lattice decoding for joint detection in direct-sequence CDMA systems

A new joint detection method based on sphere packing lattice decoding is presented in this paper. The algorithm is suitable for both synchronous and asynchronous multiple access direct-sequence code-division multiple-access (DS-CDMA) systems, and it may jointly detect up to 64 users with a reasonable complexity. The detection complexity is independent of the modulation size and large M-PAM or M-QAM constellations can be used. Furthermore, a theoretical gain analysis is performed in which the multiple-access system performance is derived from the lattice parameters.     

Turbo编码DS/CDMA系统中的迭代多用户接收器

本文提出了一种用于Turbo编码DS/CDMA系统的迭代多用户接收器。该接收器由一个软输入/软输出（SISO）的多用户检测器和一组单用户SISO信道译码器组成。每次迭代过程中，多用户检测器和信道译码器都输出信息作为下一代迭代的先验信息，仿真结果表明，这种接收器的比特误码性能接近Turbo编码系统的单用户限。     

Reduced-complexity MAP-based iterative multiuser detection for coded multicarrier CDMA systems

In recent years, combining multiuser detection (MUD) and channel decoding has received considerable attention. The maximum a posteriori (MAP) criterion-based iterative multiuser detector greatly improves the system performance and can approach the performance of single-user coded systems. However, its complexity increases exponentially with the number of users and can become prohibitive for systems with a medium-to-large number of users. In this paper, a reduced complexity MAP-based iterative MUD based on the use of a soft sensitive bits algorithm is proposed for coded multicarrier code-division multiple-access systems. It is shown that it can greatly reduce the computational complexity with a minimal penalty in performance compared to the conventional optimal scheme.     

Fast synchronization method for CDMA communication systems

The synchronization phase of a code division multiple access communication system might pose a limitation on the performance of the system, since unlike other communication systems it is required to obtain the state (i.e., sequence phase) of a linear feedback shift register (LFSR). Usually the state is obtained by using a brute force exhaustive search over all possibilities, which might be a computationally demanding task. In this paper, we suggest a new method for LFSR sequence phase acquisition. Our method is suitable for practical systems in which an unknown frequency drift may be present. Simulation results for the IS-95/CDMA-2000 standard show a dramatic reduction in the time required to acquire synchronization when using the new algorithm compared to the standard synchronization method     

塑料光纤连接的智能家庭光纤通信系统

文章分析了石英玻璃光纤应用于光纤到户时存在的问题,并介绍了一些发达国家塑料光纤、器件和系统的最新研究情况.氟化聚合物的梯度折射率分布的塑料光纤因为具有良好的性价比,所以在光纤到户中正在逐渐得到应用.现在,人们已经清楚,光纤到户用的塑料光纤质量的优劣主要在于其衰减和色散等性能.文章最后列出了一些用塑料光纤连接的单信道、波分复用和智能家庭光纤通信系统的典型实例.     

Iterative PDF estimation and decoding for CDMA systems withnon-Gaussian characterisation

An iterative probability density function estimation and decoding scheme is proposed for code division multiple access (CDMA) systems when the global noise is non-Gaussian distributed. It provides superior performance over Gaussian approximation for CDMA systems with only a small number of high-power interfering users     

Adaptive nonlinear compensation for CDMA communication systems

This paper deals with nonlinear compensation in code-division multiple-access communications systems. We analyze the performance of the generalized cerebellar model articulation controller neural network in two problems: predistortion in nonlinear transmitters and adaptive interference cancellation in multiuser and multipath scenarios. Our examples demonstrate the performance of the compensators in typical mobile channels     

Dynamic bandwidth recycle algorithm for OVSF–CDMA systems

This paper presents a dynamic bandwidth recycle algorithm in the downlink of a WCDMA system using orthogonal variable spreading factor codes (OVSF). It consists of a bandwidth recycle algorithm and a bandwidth reservation algorithm. The bandwidth recycle algorithm is used to recycle bandwidth from current serviced connections when the system does not have enough available bandwidth to support a bandwidth request. The bandwidth reservation algorithm is used to reduce transmission delay caused by suddenly increasing bandwidth requests. Four traffic classes, conversational, streaming, interactive, and background classes, defined by universal mobile telecommunication system (UMTS) are considered. Simulation results show that the bandwidth utilization and block rate are improved, the bandwidth guaranteed to conversational and streaming classes are protected, and the delay time of interactive and background classes are kept under an acceptable value even when the traffic load is heavy. Copyright © 2005 John Wiley & Sons, Ltd.