1-5hit |
The characteristics of the spreading sequence significantly affect the signal-to-interference power ratio (SIR) of the received signal in direct sequence code division multiple access (DS-CDMA) system. In this paper, we analyze the receiver performance of the forward link of a DS-CDMA system in terms of the SIR and bit error rate (BER) when pseudo noise (PN) codes and concatenated orthogonal/PN (OPN) codes are used as the spreading sequence. The use of OPN spreading codes can cancel out the intra-cell interference signals with equal path delay, but the use of PN spreading codes cannot, significantly degrading the performance. As a result, the BER performance of the OPN spreading system is better than that of the PN spreading system. The use of OPN spreading sequences can provide the system capacity at least two times larger than the use of PN spreading sequences in the single-cell environment even when the channel has a large number of multipaths. The two spreading systems also show significant difference in the user capacity even in a multi-cell environment.
The performance of a MIMO-OFDM system significantly depends upon the accuracy of the channel impulse response (CIR) estimates. In the presence of correlation between the CIRs of the transmit or receive antennas, it is desirable to exploit this correlation to improve the performance of CIR estimation. In this letter, we propose a low-complexity channel estimation filter composed of four concatenated one-dimensional Wiener filters which are optimized to the channel characteristics in the time and frequency domains, and the transmit and receiver antenna front ends, respectively. Finally, the performance of the proposed scheme is verified.
The accuracy of channel estimation significantly affects the performance of coherent receiver in a DS-CDMA system. The receiver performance can be improved if an appropriate channel estimation filter is used according to the channel condition. In this paper, we consider the design of channel estimation filters for pilot channel based DS-CDMA systems. When a moving average (MA) FIR filter is used as the channel estimation filter (CEF), the tap size is optimized by minimizing the mean squared error of the estimated channel impulse response. Finally, the analytic design is verified by computer simulation. Numerical results show that the optimum MA FIR CEF provides near optimum performance, i.e., quite similar to that with the use of Wiener filter.
The accuracy of channel estimation significantly affects the performance of coherent rake receiver in DS-CDMA systems. It is desirable for improved channel estimation to employ a channel estimation filter (CEF) whose bandwidth is adjustable to the channel condition. In this paper, we consider the use of moving average (MA) FIR filters as the CEF since it is simple to implement and can provide relatively good receiver performance. First, we optimize the tap size of the MA FIR CEF so as to minimize the mean squared error of the estimated channel impulse response. For practical applications, we propose a low-complexity adaptive channel estimator (ACE), where the tap size of the MA FIR CEF is adjusted based on the estimated channel condition by exploiting the correlation characteristics of the received pilot signal. Numerical results show that the use of the proposed ACE can provide the receiver performance comparable to that of Wiener CEF without exact a priori information on the operating condition.
Ji-Woong CHOI Jungwon LEE Jihwan P. CHOI Hui-Ling LOU
In this paper, we propose a soft-decoding near-ML MIMO demodulation scheme that achieves near optimal performance with fixed and low complexity. Exploiting the regular structure of bit-to-symbol mapping, the proposed scheme performs hard demodulation to find the first candidate symbol for each stream followed by selection of nearby candidate points such that at least one candidate exists for the computation of likelihood information of bit 0 and 1 without intermediate calculation of the Euclidean distance. This demodulation scheme enables an improvement in performance by guaranteeing the existence of candidates and a significant reduction in the number of distance calculations which is a major complexity burden. The performance is evaluated by computer simulation, and computational complexity is also assessed in terms of the number of complex multiplication.