Quasi-static Channels Research Articles

Performance Enhancement of Space-Time Trellis Codes When Encountering AWGN and Ricean Channels

Space-time trellis codes (STTCs) have been designed for quasi-static Rayleigh channels. When these codes are directly used for additive white Gaussian noise (AWGN) channels or Ricean channels with a high K factor, their frame error-rate (FER) performance is no longer optimal. We propose open-loop (no feedback) preprocessing methods for improving the error-rate performance of these codes when used in channels with a high K. For K=0 (Rayleigh channels), these open-loop schemes generally do not alter the FER performance of the STTCs. The preprocessing operation at the transmitter is either to rotate the constellation points in one of the transmit antennas relative to the other by some angle, or suitably divide (unequally) the total power between the two transmit antennas. The angle of rotation and power division is optimized by maximizing the d/sub free/ of the STTCs. Simulation results show that for AWGN or Ricean fading channels with a large K, the FER performance can be significantly improved by doing either rotation or power division at the transmitter. While the FER performance is nearly unchanged for quasi-static Rayleigh channels, the improvement in performance is between 1 to 3 dB for Ricean or AWGN channels.

A Unified Construction of Space–Time Codes With Optimal Rate–Diversity Tradeoff

The problem of constructing space-time (ST) block codes over a fixed, desired signal constellation is considered. In this situation, there is a tradeoff between the transmission rate as measured in constellation symbols per channel use and the transmit diversity gain achieved by the code. The transmit diversity is a measure of the rate of polynomial decay of pairwise error probability of the code with increase in the signal-to-noise ratio (SNR). In the setting of a quasi-static channel model, let n/sub t/ denote the number of transmit antennas and T the block interval. For any n/sub t/ /spl les/ T, a unified construction of (n/sub t/ /spl times/ T) ST codes is provided here, for a class of signal constellations that includes the familiar pulse-amplitude (PAM), quadrature-amplitude (QAM), and 2/sup K/-ary phase-shift-keying (PSK) modulations as special cases. The construction is optimal as measured by the rate-diversity tradeoff and can achieve any given integer point on the rate-diversity tradeoff curve. An estimate of the coding gain realized is given. Other results presented here include i) an extension of the optimal unified construction to the multiple fading block case, ii) a version of the optimal unified construction in which the underlying binary block codes are replaced by trellis codes, iii) the providing of a linear dispersion form for the underlying binary block codes, iv) a Gray-mapped version of the unified construction, and v) a generalization of construction of the -ary case corresponding to constellations of size /sup K/. Items ii) and iii) are aimed at simplifying the decoding of this class of ST codes.

Performance Analysis of Transmit Beamforming

Using the theory of random matrices, a performance analysis is given for uncoded binary transmission over multiple-input multiple-output channels, under the assumption that transmitter beamforming is used. In particular, exact finite antenna expressions are found for the average bit error rate (in the case of ergodic channels) for both noncoherent and coherent detection. Expressions for the the outage probability (in the case of quasi-static channels) are also given.

Independently Driven DG MOSFETs for Mixed-Signal Circuits: Part II—Applications on Cross-Coupled Feedback and Harmonics Generation

Circuit applications utilizing the tight quasi-static and nonquasi-static channel coupling in independently driven double-gate (IDDG) MOSFETs are presented. The performances of cross-coupled differential amplifiers and mixers with IDDG are compared with those of the SDDG counterparts. The quasi-static coupling in IDDG increases output voltage swing and improves voltage waveform symmetry in the cross-coupled differential amplifier. The nonquasi-static coupling in IDDG provides fast feedback in the differential amplifiers, and allows higher frequencies in the input signals for harmonic generation in mixers. We have identified plausible advantages in IDDG that cannot be readily implemented by SDDG, which justifies the fabrication cost and parasitic capacitance penalty of IDDG.

On the Performance Analysis of Space–Time Codes in Quasi-Static Rayleigh-Fading Channels

In this paper, we analyze the performance of space-time codes by deriving a new approximation of the frame error probabilities for space-time trellis-coded modulations over quasi-static Rayleigh-fading channels. We take advantage of two techniques, the modified bounding technique and the limiting-before-averaging technique, to tighten the upper bound. In addition, we establish a theorem that enables us to reduce the computation and memory needed to calculate the frame error rate (FER) approximation. The newly derived approximation is very tight, requires only the distance spectrum of the space-time code, and can be computed through single numerical integration. Numerical results exhibit that the new approximation is much closer to the simulation results than other existing bounds are, especially in the case of one receive antenna.

Decision feedback differential detection for differential orthogonal space-time modulation with APSK signals over flat-fading channels

Differential orthogonal space-time modulation (DOSTM) with amplitude/phase shift keying (APSK) signals has been recently proposed to improve the data throughput of the DOSTM with PSK signals over quasi-static channels. In this letter, decision feedback differential detection (DF-DD) based on linear prediction is presented for the DOSTM with APSK Signals (DOSTM-APSK) over flat-fading channels. The proposed DF-DD offers better performance than the differential detection when the channel experiences fast fading. The coefficients of the linear prediction based DF-DD can be obtained by an adaptive recursive least-squares algorithm, where the channel statistics are not needed. The proposed DF-DD is also applicable to the general unitary differential space-time modulation.

Space-Time Trellis-Coded Transmissions With Parallel Sequences Over Time-Varying Channels

In this letter, we investigate the performance of space-time trellis codes in a time-varying channel of a multiple-access wireless system where symbols of a user are transmitted using parallel sequences. Using rank and determinant criteria, it is shown that space-time trellis codes originally designed for quasi-static channels are efficient codes for this system as well. Simulation results demonstrate that the proposed transmission scheme can exploit spatial and temporal diversities to achieve performance gains at practical decoding complexity levels.

Signal Reception for Space-Time Differentially Encoded Transmissions over FIR Rich Multipath Channels

With sophisticated signal and information processing algorithms, air interfaces with space-time (ST) coding and multiple reception antennas substantially improve the reliability of wireless links. This paper proposes a new receiver algorithm for differential ST coded transmissions over the finite-impulse-response (FIR) rich multipath fading channels. The symbol detection introduced in this paper is a deterministic subspace-based approach in a multiple-input and multiple-output (MIMO) system framework. The receiver (i) operates in a blind fashion without estimating the channel or its inverse and (ii) is able to work with a small number of signal samples and hence can be applied in the quasistatic channels. The proposed scheme employs multiple antennas at both sides of the transceiver and exploits both the antenna diversity and the multiple constant modulus (MCM) characteristics of the signaling. The receiver is able to blindly mitigate the intersymbol interference (ISI) in a rich multipath propagation environment, and this has been verified through the extensive Monte Carlo simulations.

Adaptive Stochastic Iterative Rate Selection for Wireless Channels

A stochastic algorithm for channel adaptive rate selection (modulation and coding scheme or MCS) is proposed. The algorithm learns the optimal policy by iteratively augmenting a rate selection probability vector. While simple to implement, this technique requires no explicit channel estimation phase. The single bit ACK/NACK signal feedback from the data link layer is used as the input to the stochastic algorithm. As shown in the convergence theorems, the algorithm achieves the optimal rate in static channels. A time varying channel is seen as a quasi-static channel, and adaptively converged to optimal rates as channel state changes.

Low-Complexity Decoding of Block Turbo-Coded System with Antenna Diversity

The goal of this paper is to reduce the decoding complexity of space-time block turbo-coded system with low performance degradation. Two block turbo-coded systems with antenna diversity are considered. These include the simple serial concatenation of error control code with space-time block code, and the recently proposed transmit antenna diversity scheme using forward error correction techniques. It is shown that the former performs better when compared to the latter in terms of bit error rate (BER) under the same spectral efficiency (up to 7 dB at the BER of 10-5 for quasistatic channel with two transmit and two receive antennas). For the former system, a computationally efficient decoding approach is proposed for the soft decoding of space-time block code. Compared to its original maximum likelihood decoding algorithm, it can reduce the computation by up to 70% without any performance degradation. Additionally, for the considered outer code block turbo code, through reduction of test patterns scanned in the Chase algorithm and the alternative computation of its extrinsic information during iterative decoding, extra 0.3 dB to 0.4 dB coding gain is obtained if compared with previous approaches with negligible hardware overhead. The overall decoding complexity is approximately ten times less than that of the near-optimum block turbo decoder with coding gain loss of 0.5 dB at the BER of 10-5 over AWGN channel.

Stratified diagonal layered space-time architectures: signal processing and information theoretic aspects

We consider a multielement antenna system that uses M transmit and N receive antennas [an (M,N) wireless link] impaired by additive white Gaussian noise in a quasistatic flat-fading channel environment. The transmitter, which is subject to a power constraint, does not know the random outcome of the matrix channel but does know the channel statistics. The link operates under a probability of outage constraint. We present a novel architecture using stratified space-time diagonals to express a message for efficient communications. The special message arrangement, which is termed stratified-diagonal-BLAST (SD-BLAST), enables receiver signal processing that substantially mutes self interference caused by multipath without incurring waste of space-time. We investigate the proposed communication structure in important downlink categories, showing that, in theory, the message architecture is optimally efficient for all (M, 1) systems and extremely efficient when M/spl Gt/N. We quantify the capacity performance of SD-BLAST using empirically generated complementary cumulative distribution functions (CCDFs) for (16, 5), (8, 3), and (4, 2) systems to exhibit near optimal performance most especially for the (16, 5) system.

Further results on differential space-time modulations

Some novel results on the space-time differential modulation schemes described by B.M. Hochwald and W. Sweldens (see ibid., vol.48, p.2041-52, 2000) and V. Tarokh and H. Jafarkhani (IEEE J. Select. Areas Commun., vol.18, p.1169-74, 2000), are derived under the assumption of a quasi-static multiple-antenna channel. First, the optimality (in the maximum-likelihood sense) of the one-shot detection algorithms of Hochwald and Sweldens and of Tarokh and Jafarkhani is proved. Then, the expression of the pairwise error probability for these detectors is derived, and, as a particular case, the bit-error rate is computed for the binary phase-shift keyed scheme of Tarokh and Jafarkhani. Finally, a per-survivor processing (PSP) detection algorithm for this class of modulations is illustrated. Numerical results evidence both the superiority of the PSP strategy over the one-shot space-time differential detectors and the accuracy of the above-mentioned bit-error rate formula.

Serially concatenated space-time codes with iterative decoding and performance limits of block-fading channels

This work considers space-time channel coding for systems with multiple-transmit and a single-receive antenna, over space uncorrelated block-fading (quasi-static) channels. Analysis of the outage probability over such channels reveals the existence of a threshold phenomenon. The outage probability can be made arbitrary small by increasing the number of transmit antennas, only if the E <sub xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">b</sub> /N/sub 0/ is above a threshold which depends on the coding rate. Furthermore, it is shown that when the number of transmit antennas is increased, the /spl epsi/-capacity of a block-fading Rayleigh channel tends to the Shannon capacity of an additive white Gaussian noise channel. This paper also presents space-time codes constructed as a serial concatenation of component convolutional codes separated by an interleaver. These schemes provide full transmit diversity and are suitable for iterative decoding. The rate of these schemes is less than 1 bit/s/Hz, but can be made arbitrary close to 1 bit/s/Hz by the use of Wyner-Ash codes as outer components. Comparison of these schemes with structures from literature shows that performance gains can be obtained at the expense of a small decrease in rate. Computer simulation results over block-fading Rayleigh channels show that the frame-error rate of several of these schemes is within 2-3 dB from the theoretical outage probability.

On low-complexity space-time coding for quasi-static channels

We propose a new space-time coding scheme for the quasi-static multiple-antenna channel with perfect channel state information at the receiver and no channel state information at the transmitter. In our scheme, codewords produced by a trellis encoder are formatted into space-time codeword arrays such that decoding can be implemented efficiently by minimum mean-square error (MMSE) decision-feedback interference mitigation coupled with Viterbi decoding, through the use of per-survivor processing. We discuss the code design for the new scheme, and show that finding codes with optimal diversity is much easier than for conventional trellis space-time codes (STCs). We provide an upper bound on the word-error rate (WER) of our scheme which is both accurate and easy to evaluate. Then, we find upper and lower bounds on the information outage probability with discrete independent and identically distributed (i.i.d). inputs (as opposed to Gaussian inputs, as in most previous works) and we show that the MMSE front-end yields a large advantage over the whitened matched filter (i.e., zero-forcing) front-end. Finally, we provide a comprehensive performance/complexity comparison of our scheme with coded vertical Bell Labs layered space-time (V-BLAST) architecture and with the recently proposed threaded space-time codes. We also discuss the concatenation of our scheme with block space-time precoders, such as the linear dispersion codes.

Decentralized dynamic power control for cellular CDMA systems

The control of transmit power has been recognized as an essential requirement in the design of cellular code-division multiple-access (CDMA) systems. Indeed, power control allows for mobile users to share radio resources equitably and efficiently in a multicell environment. Much of the work on power control for CDMA systems found in the literature assumes a quasi-static channel model, i.e., the channel gains of the users are assumed to be constant over a sufficiently long period of time for the control algorithm to converge. In this paper, the design of dynamic power control algorithms for CDMA systems is considered without the quasi-static channel restriction. The design problem is posed as a tradeoff between the desire for users to maximize their individual quality of service and the need to minimize interference to other users. The dynamic nature of the wireless channel for mobile users is incorporated in the problem definition. Based on a cost minimization framework, an optimal multiuser solution is derived. The multiuser solution is shown to decouple, and effectively converge, to a single-user solution in the large system asymptote, where the number of users and the spreading factor both go to infinity with their ratio kept constant. In a numerical study, the performance of a simple threshold policy is shown to be near that of the optimal single-user policy. This offers support to the threshold decision rules that are employed in current cellular CDMA systems.

An efficient implementation of a maximum-likelihood detector for space - time block coded systems

We investigate maximum-likelihood (ML) sequence estimation for space-time block coded systems without assuming channel knowledge. The quadratic form of the ML receiver in this case does not readily lend itself to efficient implementation. However, under quasi-static channel conditions, the likelihood function reduces to a simple form similar to the classical correlation receiver in matrix notation. It also allows the development of a recursive expression that can be easily implemented by a Viterbi-type algorithm with a reasonable complexity. Although the receiver is suboptimum for the nonstatic case, its performance is close to the optimum for a range of signal-to-noise ratios.

4-PSK space-time trellis codes with five and six transmit antennas for slow Rayleigh fading channels

Novel space-time trellis codes for five and six transmit antennas which best satisfy an optimal design criteria for quasi-static flat fading channels are presented. The codes are constructed through a reduced code-search method, and their performance is evaluated in terms of frame error probabilities.

On the design of algebraic space-time codes for MIMO block-fading channels

The availability of multiple transmit antennas allows for two-dimensional channel codes that exploit the spatial transmit diversity. These codes were referred to as space-time codes by Tarokh et al. (see ibid., vol.44, p.744-765, Mar. 1998) Most prior works on space-time code design have considered quasi-static fading channels. We extend our earlier work on algebraic space-time coding to block-fading channels. First, we present baseband design criteria for space-time codes in multi-input multi-output (MIMO) block-fading channels that encompass as special cases the quasi-static and fast fading design rules. The diversity advantage baseband criterion is then translated into binary rank criteria for phase shift keying (PSK) modulated codes. Based on these binary criteria, we construct algebraic space-time codes that exploit the spatial and temporal diversity available in MIMO block-fading channels. We also introduce the notion of universal space-time codes as a generalization of the smart-greedy design rule. As a part of this work, we establish another result that is important in its own right: we generalize the full diversity space-time code constructions for quasi-static channels to allow for higher rate codes at the expense of minimal reductions in the diversity advantage. Finally, we present simulation results that demonstrate the excellent performance of the proposed codes.

Cochannel interference reduction and path-diversity reception technique using CMA adaptive array antenna in digital land mobile communications

This paper describes a cochannel interference (CCI) reduction and path-diversity reception technique using a constant modulus algorithm (CMA) adaptive array antenna in digital land mobile communications. In this technique, the incident signals are individually recovered by using a multistage constant modulus (CM) array that consists of a multistage cascade of signal recovering and canceling processes. The recovered signals are sorted into the desired signal and CCI signal, and then the desired signals are combined in order to obtain the path-diversity gain, Performance is evaluated for a Gaussian filtered minimum shift keying signal and /spl pi//4-shifted quadrature phase-shift keying signal. Each signal processing is carried out using block demodulation (e.g., CMA adaptive signal recovering process and signal canceling process). Computer simulation results show that CCI can be reduced efficiently for a high-bit-rate time-division multiple-access system for quasi-static and fading channel conditions and that the bit error rate (BER) performance is improved by combining the desired signals. The extent of the improvement in BER performance indicates the difference in diversity gain between maximal ratio combining and selective combining. This suggests that a CMA adaptive array antenna is equivalent to selective combining diversity reception.

Performance analysis of maximal ratio combining and comparison with optimum combining for mobile radio communications with cochannel interference

The performance of maximal ratio combining for space diversity reception in digital cellular mobile radio systems is studied for communications in the presence of multiple cochannel interference (CCI) sources and is compared to optimum combining. The main contribution of the paper is that the analysis accounts for fading of the signal of interest (SOI) as well as the cochannel interference (CCI). The paper considers BPSK signalling in flat, quasi-static channels. Rayleigh or Rice fading is assumed for the SOI, while CCI is assumed subject to Rayleigh fading. Channels associated with interference sources are assumed independent and identically distributed. Using a multivariate statistical analysis approach and assuming equal-power interference sources, analytical expressions are derived for the density function of the array output signal-to-interference ratio (SIR), the outage probability, and the average probability of bit error with maximal ratio combining. Earlier results obtained for optimum combining and Rayleigh fading are extended to the case when the SOI is subject to Rice fading. A limited analysis of the equal gain combiner is also presented.