Space-time processing can improve network capacity, coverage, and quality by reducing co-channel interference (CCI) while enhancing diversity and array gain. This article focuses largely on the receive (mobile-to-base station) time-division multiple access (TDMA) (nonspread modulation) application for high-mobility networks. We describe a large (macro) cell propagation channel and discuss different physical effects such as path loss, fading delay spread, angle spread, and Doppler spread. We also develop a signal model incorporating channel effects. Both forward-link (transmit) and reverse-link (receive) channels are considered and the relationship between the two is discussed. Single- and multiuser models are treated for four important space-time processing problems, and the underlying spatial and temporal structure are discussed as are different algorithmic approaches to reverse link space-time professing with blind and nonblind methods for single- and multiple-user cases. We cover forward-link space-time algorithms and we outline methods for estimation of multipath parameters. We also discuss applications of space-time processing to CDMA, applications of space-time techniques to current cellular systems, and industry trends.

Space-time processing for wireless communications

This paper deals with carrier-frequency estimation for burst transmissions over frequency-selective channels. Three estimation schemes are proposed, all based on the use of known training sequences. The first scheme employs an arbitrary sequence and provides joint maximum-likelihood (ML) estimates of the carrier frequency and the channel response. Its implementation complexity is relatively high but its accuracy achieves the Cramer-Rao bound. The second scheme is still based on the ML criterion, but the training sequence is periodic, which helps to reduce the computational load. The third scheme also employs periodic sequences, but its structure comes from heuristic reasoning. Theoretical analysis and simulations are employed to assess the performance of the three schemes.

Carrier-frequency estimation for transmissions over selective channels

This is a concise presentation of the concepts underlying the design of digital communication systems, without the detail that can overwhelm students. Many examples, from the basic to the cutting-edge, show how the theory is used in the design of modern systems and the relevance of this theory will motivate students. The theory is supported by practical algorithms so that the student can perform computations and simulations. Leading edge topics in coding and wireless communication make this an ideal text for students taking just one course on the subject. Fundamentals of Digital Communications has coverage of turbo and LDPC codes in sufficient detail and clarity to enable hands-on implementation and performance evaluation, as well as 'just enough' information theory to enable computation of performance benchmarks to compare them against. Other unique features include space-time communication and geometric insights into noncoherent communication and equalization.

/pdf/fundamentals-of-digital-communication-4y5kzt1fpu.pdf

Fundamentals of digital communication

By using a pulse-amplitude-modulation representation of binary continuous-phase-modulation signals, the authors develops a novel optimum Viterbi sequence detector and a near-optimum Viterbi receiver with low complexity. For modulation index 0.5, where a linear receiver can be used, a minimum-mean-squared-error linear receiver filter is derived. The performance of all of these is analyzed, using the Gaussian minimum-shift-keying signal (GMSK) for illustration. It is shown that a GMSK receiver consisting of two matched filters and a four-state Viterbi algorithm performs with less than 0.24-dB degradation compared with the optimal receiver. The linear receiver is optimum for all values of E/sub b//N/sub 0/ (bit-energy-to-noise one-sided spectral density ratio). A design method for its filter is given. The filter is equivalent to a cascade of a matched filter and a Wiener filter estimator. Both upper and lower bounds for the bit-error probability are calculated. Simulation results which confirm the analysis are given. >

Simple coherent receivers for partial response continuous phase modulation

It is widely known that minimum shift keying (MSK) may be seen as a PAM signaling scheme and that the same is true, albeit approximately, with MSK-like modulations. It is also known (perhaps not so widely) that any binary continuous phase-modulated (CPM) signal may be exactly decomposed into the sum of a few PAM waveforms. In this paper we show that this property extends to multilevel CPM signaling. Features of a PAM decomposition are discussed as a function of the alphabet size, the modulation index, and the frequency response of the system. It is found that, especially with signaling schemes with a long memory, the decomposition has so many terms that it becomes unmanageable. For these cases an approximation is proposed with a limited number of terms. >

Decomposition of M-ary CPM signals into PAM waveforms

Minimum shift keying and offset QPSK are two well-known modulations which can be interpreted as a set of time/phase-shifted AM pulses. We show in this paper that any constant amplitude binary phase modulation can also be expressed as a sum of a finite number of time limited amplitude modulated pulses (AMP decomposition). New methods for computing autocorrelation and power frequency spectrum are derived, which give very simple results for half-integer index modulations. We also show that the signal can be built with good accuracy using only one optimized pulse ("main pulse"). This synthesis is particularly satisfactory for modulations that have good spectral characteristics and/ or low index.

P. Laurent

Papers

Exact and Approximate Construction of Digital Phase Modulations by Superposition of Amplitude Modulated Pulses (AMP)