Home About us Contact
|
Home About us Contact | ||
|
|
||
Spreading Sequences (spreading + sequence)
Selected AbstractsTwo-stage detection of partitioned random CDMAEUROPEAN TRANSACTIONS ON TELECOMMUNICATIONS, Issue 5 2008Lukasz Krzymien Random Code Division Multiple Access (CDMA) with low complexity two-stage joint detection/decoding is considered. A sequence partitioning approach is used for modulation, where every spreading sequence is divided into M sections (partitions) which are interleaved prior to transmission. This setup, called partitioned CDMA, can be understood as a generalisation of (chip) interleave division multiple access (IDMA). An analysis of a low-complexity iterative cancellation receiver is presented for arbitrary received power distributions. It is shown that for equal rate and equal power users the asymptotic performance of partitioned CDMA is equal to the performance of CDMA with optimal a posteriori probability (APP) detection for system loads K/N,<,1.49. Effects of asynchronous signal transmission are quantified for standard pulse shaping filters and it is shown that the signal-to-noise ratios achievable in an asynchronous system are improved with respect to fully synchronous transmission. The effect of unequal received powers is examined and considerable gains in performance are obtained by judicious choices of power distributions. For certain power distribution, partitioned CDMA with iterative detection can achieve arbitrary system loads, that is detection is no longer fundamentally interference limited. The practical near-far resistance of the proposed system is illustrated using an example of a receiver with a circular receive footprint and uniformly distributed transmitters (single cell system). Copyright © 2008 John Wiley & Sons, Ltd. [source] Joint data detection and estimation of time-varying multipath rayleigh fading channels in asynchronous DS-CDMA systems with long spreading sequences,EUROPEAN TRANSACTIONS ON TELECOMMUNICATIONS, Issue 2 2007Pei Xiao In this paper, we present a joint approach to data detection and channel estimation for the asynchronous direct-sequence code-division multiple access (DS-CDMA) systems employing orthogonal signaling formats and long scrambling codes. Our emphasis is placed on different channel estimation algorithms since the performance of a communication system depends largely on its ability to retrieve an accurate measurement of the underlying channel. We investigate channel estimation algorithms under different conditions. The estimated channel information is used to enable coherent data detection to combat the detrimental effect of the multiuser interference and the multipath propagation of the transmitted signal. In the considered multiuser detector, we mainly use interference cancellation techniques, which are suitable for long-code CDMA systems. Interference cancellation and channel estimation using soft estimates of the transmitted signal is also proposed in this paper. Different channel estimation schemes are evaluated and compared in terms of mean square error (MSE) of channel estimation and bit error rate (BER) performance. Based on our analysis and numerical results, some recommendations are made on how to choose appropriate channel estimators in practical systems. Copyright © 2006 AEIT [source] A multi-user CDMA receiver utilizing decorrelating detector with additional dummy pilot responseINTERNATIONAL JOURNAL OF COMMUNICATION SYSTEMS, Issue 3 2003Mitsuhiro Tomita Abstract A pilot assisted CDMA system which uses extended spreading sequences with guard sequences under a quasi-synchronous condition is capable of separating the interference components included in the input of a de-correlating receiver by solving a system of linear equations. The performance of such a system, however, depends on the property of the de-correlating matrix consisting of the received pilots, which correspond to the respective user spreading sequences and the multi-path channel conditions. That is, the regularity of the matrix often tends to degrade, and the rank reduces occasionally primarily due to the multi-paths, resulting in solutions that are vulnerable to AWGN. The present paper proposes an effective technique to solve this problem by introducing a virtual user into a group of real users that are to be served. The simulation results indicate a remarkable improvement in the bit-error-rate (BER) performance. In addition, based on the BER performance, the system has a RAKE-like function that has power-sum characteristics. Copyright © 2003 John Wiley & Sons, Ltd. [source] | ||||||||||