Construction of Regular Rate-Compatible LDPC Convolutional Codes

In this paper, we propose a new method to derive a family of regular rate-compatible low-density parity-check（RC-LDPC） convolutional codes from RC-LDPC block codes. In the RC-LDPC convolutional family, each extended sub-matrix of each extended code is obtained by choosing specified elements from two fixed matrices HE1K and HE1K, which are derived by modifying the extended matrices HE1 and HE2 of a systematic RC-LDPC block code. The proposed method which is based on graph extension simplifies the design, and prevent the defects caused by the puncturing method. It can be used to generate both regular and irregular RC-LDPC convolutional codes. All resulted codes in the family are systematic which simplify the encoder structure and have maximum encoding memories which ensure the property. Simulation results show the family collectively offer a steady improvement in performance with code compatibility over binary-input additive white Gaussian noise channel（BI-AWGNC）.

Two-Stage Constructions for the Rate-Compatible Shortened Polar Codes

In this paper,we propose the two-stage constructions for the rate-compatible shortened polar(RCSP)codes.For the Stage-I construction,the shortening pattern and the frozen bit are jointly designed to make the shortened bits be completely known by the decoder.Besides,a distance-greedy algorithm is presented to improve the minimum Hamming distance of the codes.To design the remaining Stage-II frozen bits,three different construction algorithms are further presented,called the Reed-Muller(RM)construction,the Gaussian Approximation(GA)construction,and the RM-GA construction.Then we give the row weight distribution numerical results of the generator matrix after the Stage-I and Stage-II constructions,which shows that the proposed constructions can efficiently increase the minimum Hamming distance.Simulation results show that the proposed RCSP codes have excellent frame error rate(FER)performances at different code lengths and code rates.More specifically,the RM-GA construction performs best and can achieve at most 0.8 dB gain compared to the Wang14 and the quasi-uniform puncturing(QUP)schemes.The RM construction is designed completely by the distance-constraint without channel evaluation thus has the simplest structure.Interestingly,it still has better FER performance than the existing shortening/puncturing schemes,especially at high signal noise ratio(SNR)region.

Mathematical demonstration of correlation of optical prime code

Starting from the configuration of the optical prime code, a kind of key signature code for the optical code-division multiple access （OCDMA） system, based on the linear congruence theory in the finite Galois field, the correlation properties of the basic prime code, the extended prime code and the modified prime code are mathematically analyzed, the distribution of cross-correlation values is given and the overlap area of ＂1＂s in the case of periodically circularly shifting is indicated. It is mathematically demonstrated that the maximum cross-correlation of the basic prime code is 2, and that of the extended prime code and the modified prime code is 1. The integrated correlation analysis process is proposed. The signal-interfere ratio （SIR） and the BER performance of the systems employing different signature codes are calculated, respectively, and the performances of OCDMA systems employing different signature codes mode are compared.

ANALYSIS OF SPECTRAL PHASE ENCODING OCDMA SYSTEM WITH PSEUDORANDOM CODING

Multiple access interference (MAI) is the most serious interference in spectral phase encoding optical code division multiple access (SPE OCDMA) systems. This paper focuses on the behavior of MAI in SPE OCDMA systems with pseudorandom coding. The statistical expectation of multi access interference (MAI) is derived and plotted. The results confirm that MAI can be suppressed effectively by pseudorandom coding with m sequences.

JOINT SPACE-FREQUENCY MULTIUSER SYMBOL DETECTOR FOR MC-CDMA SYSTEM WITH UNIFORM LINEAR ARRAY

The MultiCarrier Code Division Multiple Access (MC-CDMA) scheme is promising for relieving capacity limit problems of Direct Sequence (DS-) CDMA systems due to serious InterChip Interference (ICI) and MultiUser Interference (MUI) in high-data-rate wireless communication systems. In this paper, the Uniform Linear Array (ULA) is applied to the base station of macrocellular MC-CDMA systems in a frequency-selective fading channel environment. A joint space-frequency multiuser symbol sequence detector is developed for all active users within one macrocell without space-frequency channel estimation. Simultaneously, Directions-Of-Arrivals (DOAs) of all active users can also be estimated. By dividing the ULA into two identical overlapping subarrays, a specific auxiliary matrix is constructed, which includes both symbol sequence and DOA information of all active users. Then, based on the subspace method, performing the eigen decomposition on such auxiliary matrix, the closed-form solution of symbol sequences and DOAs for all active users can be obtained. In comparison with schemes based on channel estimation, our algorithm need not explicitly estimate the space-frequency channel for each active user,so it has lower computation complexity. Extensive computer simulations demonstrate the overall performance of this novel scheme.

THE PERFORMANCE OF MT-CDMA SYSTEM IN THE PRESENCE OF CARRIER FREQUENCY OFFSET

In this letter,the sensitivity of an uplink Multi-Tone Code-Division Multiple Access (MT-CDMA) system to the Carrier Frequency Offset (CFO) is investigated. The analytical expression for the Bit Error Rate (BER) of uplink MT-CDMA in the presence of CFO is derived in a multipath Rayleigh fading channel which is verified through simulations. Both Maximal Ratio Combining (MRC) and Equal Gain Combining (EGC) are considered in combining multipath signals in the analysis. It is found that the BER performance can be improved with the number of multipath increasing in the presence of CFO.

Construction of Rate-Compatible(RC) Low-Density Parity-Check(LDPC) Convolutional Codes Based on RC-LDPC Block Codes

In this paper,a family of rate-compatible(RC) low-density parity-check(LDPC) convolutional codes can be obtained from RC-LDPC block codes by graph extension method.The resulted RC-LDPC convolutional codes,which are derived by permuting the matrices of the corresponding RC-LDPC block codes,are systematic and have maximum encoding memory.Simulation results show that the proposed RC-LDPC convolutional codes with belief propagation(BP) decoding collectively offer a steady improvement on performance compared with the block counterparts over the binary-input additive white Gaussian noise channels(BI-AWGNCs).

AN OPTIMIZED SCHEME FOR FAST HANDOFF IN IP-BASED CDMA WIRELESS COMMUNICATION NETWORKS

This paper proposed an optimized fast handoff scheme for real time applications in next generation IP based CDMA wireless networks. The idea is to utilize optimized IP multicasting handoff (based on PIM SM), which is triggered by CDMA layer 2 functionality. An IP based cellular network model with WCDMA FDD air interface and IP based packet traffic is adopted. No special network entities and signaling for handoff are added in our network model. The simulation results show that low delay and low packet lost rate can be obtained.

Fitness Landscape Analysis for Optimum Multiuser Detection Problem

Optimum multiuser detection （OMD） for CDMA systems is an NP-complete combinatorial optimization problem. Fitness landscape has been proven to be very useful for understanding the behavior of combinatorial optimization algorithms and can help in predicting their performance. This paper analyzes the statistic properties of the fitness landscape of the OMD problem by performing autocorrelation analysis, fitness distance correlation test and epistasis measure. The analysis results explain why some random search algorithms are effective methods for OMD problem and give hints how to design more efficient randomized search heuristic algorithms for OMD.

LOW-COMPLEXITY BLIND MULTIUSER DETECTION OF DS-CDMA SIGNAL IN DISPERSIVE CHANNELS

The problem of blind multiuser detection in dispersive channels of Code-Division Multiple-Access (CDMA) in the presence of both Multiple-Access Interference (MAI) and InterSymbol Interference (ISI) is considered. In practice, it is showed that by incorporating the desired user's signature waveform and the auxiliary vector, the information of the user can be identified using the suboptimal subspace method. The major contribution of this paper is to propose a minimum-mean-square-error detector with the suboptimal subspace-based blind technique for joint suppression of MAI and ISI in the dispersive CDMA channels.

SVM multiuser detection based on heuristic kernel

A support vector machine （SVM） based multiuser detection （MUD） scheme in code-division multi- ple-access （CDMA） system is proposed. In this scheme, the equivalent support vector （SV） is obtained through a kernel sparsity approximation algorithm, which avoids the conventional costly quadratic pro-gramming （QP） procedure in SVM. Besides, the coefficient of the SV is attained through the solution to a generalized eigenproblem. Simulation results show that the proposed scheme has almost the same bit er-ror rate （BER） as the standard SVM and is better than minimum mean square error （MMSE） scheme. Meanwhile, it has a low comoutation complexity.

A New Family of Optical Codes Based on Complementary Theory for OCDMA System

A new family of optical codes for Optical Code-division Multiple Access (OCDMA) systems, named as Optical Complementary Codes (OCCs), is proposed in this paper. The constructions of these codes consist of multiple sub-codes, and the codes have an auto-correlation interference constraint as 0 and a cross-correlation interference constraint as 1. Compared with conventional optical codes such as OPCs, OOCs and 2-D OOCs, the OCC has a shorter code length and higher code efficiency with better correlation property.

BLIND MULTIUSER DETECTION FOR V-BLAST CODED MULTICARRIER CDMA SYSTEM

Focusing on the space-time coded multiuser mobile communication systems in the frequency-selective fading environment, this paper proposes a Vertical Bell labs LAyered Space-Time (V-BLAST) coded Multicarrier Code-Division Multiple-Access (MC-CDMA) scheme and its blind channel identification algorithm. This algorithm employs an ESPRIT-like method and the singular value decomposition, and the channels between every transmit antenna of every user and every receive antenna of the base station are blindly estimated with a closed-form solution. Based on it, an equivalent Minimum Mean-Squared Error (MMSE) time-domain multiuser detector is derived. Moreover, the proposed scheme exploits the precoding in the transmitter in order to eliminate the constraint of more receive antennas than transmit ones, required by most conventional V-BLAST codec schemes. Computer simulation results demonstrate the validity of this proposed scheme.

SUCCESSIVE BEAMFORMING,MULTIUSER DETECTION AND DIVERSITY RECEPTION FOR MULTICARRIER DS-CDMA SYSTEM WITH ANTENNA ARRAY

Code-Division Multiple-Access (CDMA) systems are interference limited,and therefore efficient interference management is necessary to enhance the performance of a CDMA system.In this paper,a successive beamforming (spatial filtering),linear decorrelating MultiUser Detection (MUD, temporal filtering) and diversity reception structure for uplink multicarrier Direct Sequence CDMA (DS-CDMA) system with antenna array are proposed.By beamforming,the antenna array suppresses interference according to the distinct array signature.Subsequently,linear decorrelating MUD is ap- plied to separate the signals of different users and eliminate Multiple Access Interference (MAI).Finally, the decorrelated signals at different subcarriers that belong to the same user are combined to achieve frequency diversity.Simulation results show that the proposed structure offers significant Bit Error Rate (BER) performance improvement by successively exploiting the space-time-frequency processing.

Equivalent Time-Domain Representation and Uplink Channel Estimator for Multicarrier CDMA Systems

Many blind channel estimation methods have been proposed for direct sequence (DS) code-division multiple access (CDMA) systems, so we can certainly use them to estimate the finite impulse response (FIR) channel for the multi-carrier (MC-) CDMA system. In this paper, the MC-CDMA system is interpreted as an equivalent time-domain DS-CD-MA system with specific spreading codes. Then, an equivalently time-domain blind channel estimator is derived for the uplink MC-CDMA, which is based on second-order statistics of the received data. By exploiting singular value decomposition (SVD) and the finite alphabet property of transmitted symbols, the time-domain channel impulse response (CIR) for the uplink MC-CDMA can be accurately identified. Computer simulations illustrate both the validity and the overall performance of the proposed estimator.

Tunable Super-Structured Fiber Bragg Gratings with Perfect Sequences Based on m-Sequence

Recently, a tunable fiber Bragg grating(FBG) was developed by using stress-responsive colloidal crystals. In this paper, we have simulated the application of these nanoparticles into the super-structured fiber Bragg grating(SSFBG) written with perfect sequences derived from a short maximal-length sequence. A tunable SSFBG will be available to overcome the prohibitive temperature variation of the optical codecs. Nevertheless,we presented a method to implement coherent time spreading optical code-division multiple-access(OCDMA) where a unique code(or perfect sequence) can be reused and mixed with different wavelengths to obtain a tunable wavelength-division multiplexing(WDM)system. In order to maximize the binary throughput, we have selected a unique short maximal-length sequence composed of 7 chips that can be tuned with 7 different optical wavelengths. We found thousands of different tunable combinations that presented power contrast ratios(P/C) higher than 12 dB. When a WDM-OCDMA system used 2 different combinations simultaneously, the perfect binary detection with error correction codes was achieved successfully. The tunable SSFBG with colloidal crystals will be a simple and good alternative choice for fiber-to-the-home(FTTH) communications.

HYBRID ORTHOGONAL/RANDOM MULTIPLE ACCESS SCHEME WITH IMPROVED PERFORMANCE FOR DOWNLINK CDMA SYSTEMS

In this paper, a hybrid orthogonal and random multiple access scheme with improved performance for capacity-enhanced downlink Code-Division Multiple-Access (CDMA) systems is presented, which is in fact a combination of the conventional orthogonal spreading scheme and the synchronous Interleave Division Multiple Access (IDMA) scheme. The proposed scheme can achieve near single user performance for very large number of users by the iterative turbo like detection. Analysis and simulation results show that the proposed scheme performs better than the synchronous IDMA scheme for the same time complexity. Meanwhile, larger capacity can be provided compared with the conventional orthogonal schemes.

PDA DETECTOR FOR DS-CDMA COOPERATIVE SYSTEM

This paper considers the uplink of a cooperative Code-Division Multiple-Access (CDMA) system where parts of mobile nodes serve as source nodes while the others serve as relay nodes at any instant in time. When the non-orthogonal spreading codes are adopted,Multiple Access Interference (MAI) will exist at both the relay nodes and the base node,causing diversity gain to diminish. To mitigate MAI and exploit full advantages of cooperation,the Probabilistic Data Association (PDA) is developed at the relay nodes and the base node. Simulation results demonstrate that some performance gains can be obtained by the PDA detector over the Minimum Mean Square Error (MMSE) detector at high Signal-to-Noise Ratio (SNR) and conversely at low SNR.

On Cross-Layer Design of AMC Based on Rate Compatible Punctured Turbo Codes

This paper extends the work on cross-layer design which combines adaptive modulation and coding at the physical layer and hybrid automatic repeat request protocol at the data link layer. By contrast with previous works on this topic, the present development and the performance analysis as well, is based on rate compatible punctured turbo codes. Rate compatibility provides incremental redundancy in transmission of parity bits for error correction at the data link layer. Turbo coding and iterative decoding gives lower packet error rate values in low signal-to-noise ratio regions of the adaptive modulation and coding (AMC) schemes. Thus, the applied cross-layer design results in AMC schemes can achieve better spectral efficiency than convolutional one while it retains the QoS requirements at the application layer. Numerical results in terms of spectral efficiency for both turbo and convolutional rate compatible punctured codes are presented. For a more comprehensive presentation, the performance of rate compatible LDPC is contrasted with turbo case as well as the performance complexity is discussed for each of the above codes.

A Particle Filter of Blind Equalization and Multiuser Detection in Asynchronous DS/CDMA Systems

The particle filter （PF） is proposed to be the asynchronous direct-sequence code-division multiple-access （DS/CDMA） multiuser detector without knowing the channel state information. The PF performs symbol detection according to the joint posterior density probability of simulated particles including relative delays, fading gains and symbols via sequential importance sample and resample. A simplified scheme is also proposed by separating the indepent relative delays and fading with symbols. These parameters are modeled as the extended aggressive processes and estimated by the Kalman filter, so as to provide their arbitrary distribution for symbol detection. Simulation results show that the bit error rate of the PF is less than conventional detectors. Moreover, the complexity of PF is moderate comparable to other nonlinear suboptimal approaches.