Asymptotic error probability analysis of quadratic receivers in Rayleigh-fading channels with applications to a unified analysis of coherent and noncoherent space-time receivers

Brehler, M.; Varanasi, Mahesh K.

doi:10.1109/18.945253

Cited by 190 publications

(188 citation statements)

References 30 publications

(92 reference statements)

Supporting

Mentioning

185

Contrasting

Order By: Relevance

“…It was shown in [4], [5] that the class of unitary space-time constellations is most suitable to achieve the capacity for this type of channels. Furthermore, by evaluating the asymptotic union bound (AUB), it was pointed out in [6] that the use of unitary signal constellations results in the minimization of AUB. Based on the advantages of unitary signal constellations in both information-theoretic and error probability arguments, a few efforts have been devoted to the design of unitary constellations [7]- [10].…”

Section: Introductionmentioning

confidence: 99%

Tight error bound for coded unitary space-time modulation

Tran

Nguyen

Le‐Ngoc

2006

IEEE Wireless Communications and Networking Conference, 2006. WCNC 2006.

View full text Add to dashboard Cite

Abstract-This paper studies the bit error probability (BEP) of coded unitary space-time modulation with iterative decoding where neither the transmitter nor the receiver knows the channel fading coefficients. The tight error bound on the asymptotic performance is first analytically derived for given unitary constellation and mapping rule. Design criterion regarding the choice of unitary constellation and mapping is then established to achieve the best asymptotic performance. Furthermore, using the unitary constellation obtained from orthogonal design and 4-PSK, two mapping rules are proposed. In particular, one mapping is the best mapping for systems with iterative decoding, whereas the other mapping is most suitable for systems that do not implement iteration process. The latter mapping is similar to Gray mapping considered for coherent channels. Analytical and simulation results show that with the proposed mapping of the unitary constellation obtained from orthogonal design, the error performance of the iterative systems can approach very near the performance of the ideal unitary constellation and mapping.

show abstract

Section: Introductionmentioning

confidence: 99%

Tight error bound for coded unitary space-time modulation

Tran

Nguyen

Le‐Ngoc

2006

IEEE Wireless Communications and Networking Conference, 2006. WCNC 2006.

View full text Add to dashboard Cite

show abstract

“…This probability can be expressed as the probability that a single quadratic form in the decision statistics is smaller than some constant (cf. [1], [6])…”

Section: A Bounds On Error Probabilitymentioning

confidence: 99%

Optimum noncoherent multiuser detection for DPSK modulation in generalized diversity Rayleigh fading channels: an asymptotic minimum error probability analysis

Brehler

Varanasi

Globecom '00 - IEEE. Global Telecommunications Conference. Conference Record (Cat. No.00CH37137)

Self Cite

View full text Add to dashboard Cite

-The jointly optimum noncoherent multiuser detector for DPSK modulation in generalized diversity Rayleigh fading channels (GDRF) was presented in [1] and bounds on the error probability were obtained. In the numerical examples of [1] these bounds were seen to converge. This paper examines analytically the behavior of the bounds for high signal-to-noise ratio (SNR) scenarios. Slowly fading channels, where the fading coefficients are essentially constant over two successive symbol intervals, and fast fading channels, where the fading coefficients can vary from one symbol interval to the next, are considered.For slow fading, the asymptotic convergence of the upper bound to the lower bound is proved. The asymptote that is reached for high values of the SNR does not depend on the interfering users' energies, establishing thereby the near-far resistance of the optimum multiuser DPSK detector. For fast fading the error floor reached for high SNRs is bounded from below and above.

show abstract

“…The single-user space-time information symbol matrices Ñ can originate from, for example, the Alamouti scheme [4], orthogonal designs [5], or the algebraic codes of [6], or any other single-user space-time constellation that guarantees full transmit antenna diversity. The dimensions of the single-user space-time constellation are signified by ËÍ and it is well known that to achieve full diversity order AE AE Ì AE Ê at least AE Ì dimensions are necessary [2], [3]. For simplicity, we assume that each user employs the same single-user space-time constellation in this paper.…”

Section: Introductionmentioning

confidence: 99%

“…. This fact is used in [1] to find the asymptotics of the pair-wise error probabilities ÈÖ AE AE by applying the techniques of [3] ( AE AE is the event that the decision statistic AE is smaller than AE given that À is the true hypothesis). For convenience, we restate the result on the asymptotic pair-wise error probabilities here, but need to introduce some assumptions and notation first.…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Low-dimensional spreading matrices for multiuser space-time modulation

Brehler

Varanasi²

Proceedings 2001 IEEE Information Theory Workshop (Cat. No.01EX494)

Self Cite

View full text Add to dashboard Cite

-In [1] we proposed a multiuser space-time modulation scheme that leverages single-user space-time constellations and guarantees both, a full diversity order, as well as an asymptotic (high SNR) single-user like performance for every user. This is achieved by multiplying each user's space-time information matrix symbol by a low-dimensional "spreading matrix." For instance, for AE Ì -transmit antennas per user and if the single-user spacetime constellation employed requires only the minimum dimension AE Ì , no more than AE Ì · ½ dimensions are required for the common signal space of all users, i.e., each user's spreading matrix is of size´AE Ì · ½ µ ¢ AE Ì , independent of the number of users.In this paper, we present a simplified design criterion to obtain these spreading matrices by numerical optimization. Since the columns of each user's spreading matrix are constrained to be orthonormal, we propose to perform the optimization using a parameterization of the Grassmann manifold. A special feature of the simplified criterion, and thus of the resulting spreading matrices, is that they are independent of the particular single-user space-time constellations (of a given dimension), so that different spectral efficiencies can be attained without changing or redesigning the spreading matrices.

show abstract

Asymptotic error probability analysis of quadratic receivers in Rayleigh-fading channels with applications to a unified analysis of coherent and noncoherent space-time receivers

Cited by 190 publications

References 30 publications

Tight error bound for coded unitary space-time modulation

Tight error bound for coded unitary space-time modulation

Optimum noncoherent multiuser detection for DPSK modulation in generalized diversity Rayleigh fading channels: an asymptotic minimum error probability analysis

Low-dimensional spreading matrices for multiuser space-time modulation

Contact Info

Product

Resources

About