scispace - formally typeset
Search or ask a question
Journal ArticleDOI

Detection algorithm and initial laboratory results using V-BLAST space-time communication architecture

07 Jan 1999-Electronics Letters (IET)-Vol. 35, Iss: 1, pp 14-16
TL;DR: Using this joint space-time approach, spectral efficiencies ranging from 20-40 bit/s/Hz have been demonstrated in the laboratory under flat fading conditions at indoor fading rates.
Abstract: The signal detection algorithm of the vertical BLAST (Bell Laboratories Layered Space-Time) wireless communications architecture is briefly described. Using this joint space-time approach, spectral efficiencies ranging from 20-40 bit/s/Hz have been demonstrated in the laboratory under flat fading conditions at indoor fading rates. Early results are presented.
Citations
More filters
Journal ArticleDOI
TL;DR: This paper presents a detailed study on recent advances and open research issues in WMNs, followed by discussing the critical factors influencing protocol design and exploring the state-of-the-art protocols for WMNs.

4,205 citations


Cites methods from "Detection algorithm and initial lab..."

  • ...The processing techniques can be based on maximum likelihood detection (MLD), vertical Bell Lab Layered Space–Time (V-BLAST) [51], singular value decomposition (SVD) [13], and space–time coding....

    [...]

Journal ArticleDOI
TL;DR: An overview of progress in the area of multiple input multiple output (MIMO) space-time coded wireless systems is presented and the state of the art in channel modeling and measurements is presented, leading to a better understanding of actual MIMO gains.
Abstract: This paper presents an overview of progress in the area of multiple input multiple output (MIMO) space-time coded wireless systems. After some background on the research leading to the discovery of the enormous potential of MIMO wireless links, we highlight the different classes of techniques and algorithms proposed which attempt to realize the various benefits of MIMO including spatial multiplexing and space-time coding schemes. These algorithms are often derived and analyzed under ideal independent fading conditions. We present the state of the art in channel modeling and measurements, leading to a better understanding of actual MIMO gains. Finally, the paper addresses current questions regarding the integration of MIMO links in practical wireless systems and standards.

2,488 citations


Cites background or methods from "Detection algorithm and initial lab..."

  • ...The matrix inversion process in nulling and canceling is performed in layers where one estimates a row from , subtracts the symbol estimates from, and continues the decoding successively [9]....

    [...]

  • ...Spatial multiplexing, of which V-BLAST [2], [9] is a particular implementation approach, can be regarded as a special class of STBCs where streams of independent data are transmitted over different antennas, thus maximizing the average data rate over the MIMO system....

    [...]

  • ...Iterative versions of this detection algorithm can be used to enhance performance, as was proposed in [9] (see later in this paper for...

    [...]

  • ...However, intuition is perhaps best given by a simple example of such a transmission algorithm over MIMO often referred to in the literature as V-BLAST 2 [9], [10]...

    [...]

Journal ArticleDOI
TL;DR: This work compute a lower bound on the capacity of a channel that is learned by training, and maximize the bound as a function of the received signal-to-noise ratio (SNR), fading coherence time, and number of transmitter antennas.
Abstract: Multiple-antenna wireless communication links promise very high data rates with low error probabilities, especially when the wireless channel response is known at the receiver. In practice, knowledge of the channel is often obtained by sending known training symbols to the receiver. We show how training affects the capacity of a fading channel-too little training and the channel is improperly learned, too much training and there is no time left for data transmission before the channel changes. We compute a lower bound on the capacity of a channel that is learned by training, and maximize the bound as a function of the received signal-to-noise ratio (SNR), fading coherence time, and number of transmitter antennas. When the training and data powers are allowed to vary, we show that the optimal number of training symbols is equal to the number of transmit antennas-this number is also the smallest training interval length that guarantees meaningful estimates of the channel matrix. When the training and data powers are instead required to be equal, the optimal number of symbols may be larger than the number of antennas. We show that training-based schemes can be optimal at high SNR, but suboptimal at low SNR.

2,466 citations


Cites background from "Detection algorithm and initial lab..."

  • ...A similar conclusion is drawn in [3] when training for BLAST....

    [...]

  • ...An example of a training-based scheme that has ttracted recent attention is BLAST [2] where an experimental prototype has achieved 20 bits/sec/Hz datarates with 8 transmit and 12 receive antennas....

    [...]

  • ...As side results, we obtain the worst-case power-constrained additive noise in a matrix-valued additive noise channel, and show that training-based schemes are highly suboptimal at low SNR. Index terms—BLAST, space-time coding, transmit diversity, receive diversity, high-rate wireless communications...

    [...]

  • ...809594 example of a training-based scheme that has attracted recent attention is BLAST [4], [5], where an experimental prototype has achieved 20-b/s/Hz data rates with eight transmit and twelve receive antennas....

    [...]

Journal ArticleDOI
TL;DR: This work provides a simple method to iteratively detect and decode any linear space-time mapping combined with any channel code that can be decoded using so-called "soft" inputs and outputs and shows that excellent performance at very high data rates can be attained with either.
Abstract: Recent advancements in iterative processing of channel codes and the development of turbo codes have allowed the communications industry to achieve near-capacity on a single-antenna Gaussian or fading channel with low complexity. We show how these iterative techniques can also be used to achieve near-capacity on a multiple-antenna system where the receiver knows the channel. Combining iterative processing with multiple-antenna channels is particularly challenging because the channel capacities can be a factor of ten or more higher than their single-antenna counterparts. Using a "list" version of the sphere decoder, we provide a simple method to iteratively detect and decode any linear space-time mapping combined with any channel code that can be decoded using so-called "soft" inputs and outputs. We exemplify our technique by directly transmitting symbols that are coded with a channel code; we show that iterative processing with even this simple scheme can achieve near-capacity. We consider both simple convolutional and powerful turbo channel codes and show that excellent performance at very high data rates can be attained with either. We compare our simulation results with Shannon capacity limits for ergodic multiple-antenna channel.

2,291 citations


Cites methods from "Detection algorithm and initial lab..."

  • ...As we show below, sphere decoding uses the same Cholesky factorization of the channel matrix as in V-BLAST nulling/cancelling algorithm described in [ 10 ], but it makes a joint decision on the symbols....

    [...]

  • ...If the information bits in the blocks are uncoded, then decisions on the bits can be made either by nulling/cancelling [ 10 ] or ML on a block-by-block basis....

    [...]

  • ...The sphere decoder is introduced for space‐time processing in [9], where it is used to compute the maximum-likelihood (ML) symbol estimate with complexity comparable, at a high signal-to-noise ratio (SNR), to the vertical (V)-BLAST nulling/cancelling algorithm [ 10 ]....

    [...]

Dissertation
24 Apr 2002
TL;DR: Results show that remarkable energy and spectral efficiencies are achievable by combining concepts drawn from space-time coding, multiuser detection, array processing and iterative decoding.
Abstract: Space-time codes (STC) are a class of signaling techniques, offering coding and diversity gains along with improved spectral efficiency. These codes exploit both the spatial and the temporal diversity of the wireless link by combining the design of the error correction code, modulation scheme and array processing. STC are well suited for improving the downlink performance, which is the bottleneck in asymmetric applications such as downstream Internet. Three original contributions to the area of STC are presented in this dissertation. First, the development of analytic tools that determine the fundamental limits on the performance of STC in a variety of channel conditions. For trellis-type STC, transfer function based techniques are applied to derive performance bounds over Rayleigh, Rician and correlated fading environments. For block-type STC, an analytic framework that supports various complex orthogonal designs with arbitrary signal cardinalities and array configurations is developed. In the second part of the dissertation, the Virginia Tech Space-Time Advanced Radio (VT-STAR) is designed, introducing a multi-antenna hardware laboratory test bed, which facilitates characterization of the multiple-input multiple-output (MIMO) channel and validation of various space-time approaches. In the third part of the dissertation, two novel space-time architectures paired with iterative processing principles are proposed. The first scheme extends the suitability of STC to outdoor wireless communications by employing iterative equalization/decoding for time dispersive channels and the second scheme employs iterative interference cancellation/decoding to solve the error propagation problem of Bell-Labs Layered Space-Time Architecture (BLAST). Results show that remarkable energy and spectral efficiencies are achievable by combining concepts drawn from space-time coding, multiuser detection, array processing and iterative decoding.

2,286 citations


Cites methods from "Detection algorithm and initial lab..."

  • ...Two linear nulling criteria were considered in the literature including the Minimum-Mean Squared Error (MMSE) [20] and Zero-Forcing (ZF) decorrelator [116]....

    [...]

References
More filters
Book
01 Jan 1983

34,729 citations

Journal ArticleDOI
TL;DR: In this article, the authors examined the performance of using multi-element array (MEA) technology to improve the bit-rate of digital wireless communications and showed that with high probability extraordinary capacity is available.
Abstract: This paper is motivated by the need for fundamental understanding of ultimate limits of bandwidth efficient delivery of higher bit-rates in digital wireless communications and to also begin to look into how these limits might be approached. We examine exploitation of multi-element array (MEA) technology, that is processing the spatial dimension (not just the time dimension) to improve wireless capacities in certain applications. Specifically, we present some basic information theory results that promise great advantages of using MEAs in wireless LANs and building to building wireless communication links. We explore the important case when the channel characteristic is not available at the transmitter but the receiver knows (tracks) the characteristic which is subject to Rayleigh fading. Fixing the overall transmitted power, we express the capacity offered by MEA technology and we see how the capacity scales with increasing SNR for a large but practical number, n, of antenna elements at both transmitter and receiver. We investigate the case of independent Rayleigh faded paths between antenna elements and find that with high probability extraordinary capacity is available. Compared to the baseline n = 1 case, which by Shannon‘s classical formula scales as one more bit/cycle for every 3 dB of signal-to-noise ratio (SNR) increase, remarkably with MEAs, the scaling is almost like n more bits/cycle for each 3 dB increase in SNR. To illustrate how great this capacity is, even for small n, take the cases n = 2, 4 and 16 at an average received SNR of 21 dB. For over 99% of the channels the capacity is about 7, 19 and 88 bits/cycle respectively, while if n = 1 there is only about 1.2 bit/cycle at the 99% level. For say a symbol rate equal to the channel bandwith, since it is the bits/symbol/dimension that is relevant for signal constellations, these higher capacities are not unreasonable. The 19 bits/cycle for n = 4 amounts to 4.75 bits/symbol/dimension while 88 bits/cycle for n = 16 amounts to 5.5 bits/symbol/dimension. Standard approaches such as selection and optimum combining are seen to be deficient when compared to what will ultimately be possible. New codecs need to be invented to realize a hefty portion of the great capacity promised.

10,526 citations

Journal ArticleDOI
Gerard J. Foschini1
TL;DR: This paper addresses digital communication in a Rayleigh fading environment when the channel characteristic is unknown at the transmitter but is known (tracked) at the receiver with the aim of leveraging the already highly developed 1-D codec technology.
Abstract: This paper addresses digital communication in a Rayleigh fading environment when the channel characteristic is unknown at the transmitter but is known (tracked) at the receiver. Inventing a codec architecture that can realize a significant portion of the great capacity promised by information theory is essential to a standout long-term position in highly competitive arenas like fixed and indoor wireless. Use (n T , n R ) to express the number of antenna elements at the transmitter and receiver. An (n, n) analysis shows that despite the n received waves interfering randomly, capacity grows linearly with n and is enormous. With n = 8 at 1% outage and 21-dB average SNR at each receiving element, 42 b/s/Hz is achieved. The capacity is more than 40 times that of a (1, 1) system at the same total radiated transmitter power and bandwidth. Moreover, in some applications, n could be much larger than 8. In striving for significant fractions of such huge capacities, the question arises: Can one construct an (n, n) system whose capacity scales linearly with n, using as building blocks n separately coded one-dimensional (1-D) subsystems of equal capacity? With the aim of leveraging the already highly developed 1-D codec technology, this paper reports just such an invention. In this new architecture, signals are layered in space and time as suggested by a tight capacity bound.

6,812 citations

Proceedings ArticleDOI
29 Sep 1998
TL;DR: This paper describes a wireless communication architecture known as vertical BLAST (Bell Laboratories Layered Space-Time) or V-BLAST, which has been implemented in real-time in the laboratory and demonstrated spectral efficiencies of 20-40 bps/Hz in an indoor propagation environment at realistic SNRs and error rates.
Abstract: Information theory research has shown that the rich-scattering wireless channel is capable of enormous theoretical capacities if the multipath is properly exploited In this paper, we describe a wireless communication architecture known as vertical BLAST (Bell Laboratories Layered Space-Time) or V-BLAST, which has been implemented in real-time in the laboratory Using our laboratory prototype, we have demonstrated spectral efficiencies of 20-40 bps/Hz in an indoor propagation environment at realistic SNRs and error rates To the best of our knowledge, wireless spectral efficiencies of this magnitude are unprecedented and are furthermore unattainable using traditional techniques

3,925 citations

Journal ArticleDOI
TL;DR: This paper shows that the presence of multipath greatly improves achievable data rate if the appropriate communication structure is employed, and an adaptive-lattice trellis-coding technique is suggested as a method for coding across the space and frequency dimensions that exist in the DMMT channel.
Abstract: Multipath signal propagation has long been viewed as an impairment to reliable communication in wireless channels. This paper shows that the presence of multipath greatly improves achievable data rate if the appropriate communication structure is employed. A compact model is developed for the multiple-input multiple-output (MIMO) dispersive spatially selective wireless communication channel. The multivariate information capacity is analyzed. For high signal-to-noise ratio (SNR) conditions, the MIMO channel can exhibit a capacity slope in bits per decibel of power increase that is proportional to the minimum of the number multipath components, the number of input antennas, or the number of output antennas. This desirable result is contrasted with the lower capacity slope of the well-studied case with multiple antennas at only one side of the radio link. A spatio-temporal vector-coding (STVC) communication structure is suggested as a means for achieving MIMO channel capacity. The complexity of STVC motivates a more practical reduced-complexity discrete matrix multitone (DMMT) space-frequency coding approach. Both of these structures are shown to be asymptotically optimum. An adaptive-lattice trellis-coding technique is suggested as a method for coding across the space and frequency dimensions that exist in the DMMT channel. Experimental examples that support the theoretical results are presented.

1,593 citations