Conference Paper

Multipath channel estimation for asynchronous random-code-division multiple-access

Inst. for Telecommun. Res., Univ. of South Australia, The Levels, SA
DOI: 10.1109/VETEC.1997.605830 Conference: Vehicular Technology Conference, 1997, IEEE 47th, Volume: 3
Source: IEEE Xplore

ABSTRACT An estimator for slowly varying multipath channels for each user
in a random-code-division multiple-access communications system is
constructed and analysed. The estimator requires no training sequence
and we compare the performance to the case when such a sequence is
available. We show that mean square error in estimation decreases as the
inverse of the sample size. It is also shown that the proposed method
performs better than other known techniques applied to equivalent
fixed-code systems

0 Bookmarks
 · 
43 Views
  • [Show abstract] [Hide abstract]
    ABSTRACT: The problem of joint data detection and channel estimation for a code division multiple access system adopting aperiodic spreading codes is considered. Assuming that each transmitted data frame contains a short preamble of known symbols, a detection strategy is proposed that relies on an iterative exchange of information between the data detector and the channel estimator. This strategy, which is termed "multipass," is shown to be capable of alleviating, at the price of some attendant increase in the computational complexity (or, equivalently, in the detection delay), the performance degradation induced by the lack of prior knowledge about the channel state and the users' timing offsets. Both the mobile-to-base (uplink) and base-to-mobile (downlink) communication hauls are considered, and algorithms suited for each of these scenarios are proposed. Analytical findings and extensive computer simulations confirm that the proposed strategy achieves excellent results.
    IEEE Transactions on Wireless Communications 04/2004; · 2.42 Impact Factor
  • [Show abstract] [Hide abstract]
    ABSTRACT: This paper investigates the main correlation properties of some spreading sequences when applied to a system using nonlinear OQPSK-type modulations, since this is an important topic for present and future wireless communications. These signals, that include as special cases CPM schemes (Continuous-Phase Modulation), can be designed to have very low envelope fluctuations or even a constant envelope, making them compatible with a very low cost and power efficient grossly nonlinear amplification. We use an analytical method to derive both the autocorrelation and the cross-correlation of those signals. The resulting expressions are then applied to Maximum-Length (ML) sequences, Gold Codes and TCH (Tomlinson, Cercas, Hughes) sequences. It is shown that TCH sequences have better autocorrelation and cross-correlation properties when submitted to a nonlinear system. These results can be applied in multi-user detection, spreading, synchronization, channel estimation and many other relevant issues for the radio interface of any communication system.
    Proceedings of EUROCON 2011, International Conference on Computer as a Tool, 27-29 April 2011, Lisbon, Portugal; 01/2011
  • [Show abstract] [Hide abstract]
    ABSTRACT: The correlation properties of some spreading sequences when applied to a system using nonlinear OQPSK-type signals is the main focus of this paper. These signals include, as special cases, CPM schemes (Continuous-Phase Modulation), which can be designed to have very low envelope fluctuations or even a constant envelope, making them compatible with a very low cost and power efficient grossly nonlinear amplification. We use an analytical method to derive both the autocorrelation and the cross-correlation of those signals. The resulting expressions are then applied to Gold Codes, Maximum-Length Sequences (MLS) and TCH (Tomlinson, Cercas, Hughes) sequences. It is shown that TCH sequences have better autocorrelation and cross-correlation properties than the other spreading sequences.
    Proceedings of the 73rd IEEE Vehicular Technology Conference, VTC Spring 2011, 15-18 May 2011, Budapest, Hungary; 01/2011