Space-time processing for broadband wireless access

Al-Dhahir, Naofal; Fragouli, Christina; Stamoulis, A.; Younis, W.M.; Calderbank, Robert

doi:10.1109/mcom.2002.1031840

Cited by 38 publications

(31 citation statements)

References 13 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…It can be seen that the designed asymptotically optimal codes lies in the bunch that gives the best performance. In fact, only one choice of u = [0, 1,6], in this example, outperforms the designed code. This is not unexpected since the optimal code for regular number of antennas may not necessarily be the asymptotic codes.…”

Section: Simulation Resultsmentioning

confidence: 90%

“…In this example, we choose N t = 3, N r = 4 and adopt the cyclic group codes for demonstration. The performance line of our designed code u = [0, 1,3], as well as those of all other possible u are drawn in Fig. 2.…”

Section: Simulation Resultsmentioning

confidence: 99%

“…For SSD, we assume that both the CFO and the channel do not vary across two blocks, say the (k − 1)th block and the kth block, for ease of exposition 1 . We relax this channel constraint in Section III.…”

Section: ML Detection Of Dustm With Cfomentioning

confidence: 99%

“…Wireless multiple-input multiple-output (MIMO) systems with space time coding (STC) [1] have received much attention due to the potential of increasing the transmission rate and combating fading. Hochwald and Marzetta [2] investigate non-coherent detection for space time modulation on MIMO systems which release the requirement of channel state information (CSI).…”

Section: Introductionmentioning

confidence: 99%

See 3 more Smart Citations

Maximum Likelihood Detection and Optimal Code Design for Differential Unitary Space-Time Modulation with Carrier Frequency Offset

Cui

Gao

Nallanathan

et al. 2007

IEEE GLOBECOM 2007-2007 IEEE Global Telecommunications Conference

View full text Add to dashboard Cite

Abstract-In this paper, we answer the question that "Can conventional differential unitary space time modulation (DUSTM) be applied when there is an unknown carrier frequency offset (CFO)?" and present a maximum likelihood (ML) detection rule for this scenario. We analyze the asymptotical performance of our ML detection and provide the code design criterion by using the modified diversity product. The analysis also brings the insight that our proposed decision rule is a new differential modulation scheme in both temporal and spatial domains. Various simulations are conducted, and the proposed algorithm is shown to be more robust to the CFO drifting than the existing double temporal differential modulation.

show abstract

Section: Simulation Resultsmentioning

confidence: 90%

Section: Simulation Resultsmentioning

confidence: 99%

Section: ML Detection Of Dustm With Cfomentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

Maximum Likelihood Detection and Optimal Code Design for Differential Unitary Space-Time Modulation with Carrier Frequency Offset

Cui

Gao

Nallanathan

et al. 2007

IEEE GLOBECOM 2007-2007 IEEE Global Telecommunications Conference

View full text Add to dashboard Cite

show abstract

“…The use of Space-time block codes (STBCs) along with MIMO is very useful to maximize spatial diversity and introduce high capacity gains [5]. Among these codes we focus on orthogonal space-time block codes (OSTBCs) [6] and quasiorthogonal space-time block codes (QOSTBCs) [7]- [9].…”

Section: Introductionmentioning

confidence: 99%

Reduction of ML decoding complexity for MIMO Sphere Decoding, QOSTBC, and OSTBC

Azzam

Ayanoğlu

2008

2008 Information Theory and Applications Workshop

View full text Add to dashboard Cite

Abstract-In this paper, we discuss three applications of the QR decomposition algorithm to decoding in a number of MultiInput Multi-Output (MIMO) systems. In the first application, we propose a new structure for MIMO Sphere Decoding (SD). We show that the new approach achieves 80% reduction in the overall complexity compared to conventional SD for a 2 × 2 system, and almost 50% reduction for the 4 × 4 and 6 × 6 cases. In the second application, we propose a low complexity Maximum Likelihood Decoding (MLD) algorithm for quasiorthogonal space-time block codes (QOSTBCs). We show that for N = 8 transmit antennas and 16-QAM modulation scheme, the new approach achieves > 97% reduction in the overall complexity compared to conventional MLD, and > 89% reduction compared to the most competitive reported algorithms in the literature. This complexity gain becomes greater when the number of transmit antennas (N ) or the constellation size (L) becomes larger. In the third application, we propose a low complexity Maximum Likelihood Decoding (MLD) algorithm for orthogonal spacetime block codes (OSTBCs) based on the real-valued lattice representation and QR decomposition. For a system employing the well-known Alamouti OSTBC and 16-QAM modulation scheme, the new approach achieves > 87% reduction in the overall complexity compared to conventional MLD. Moreover, we show that for square L-QAM constellations, the proposed algorithm reduces the decoding computational complexity from O(L N/2 ) for conventional MLD to O(L) for systems employing QOSTBCs and from O(L) for conventional MLD to O( √ L) for those employing OSTBCs without sacrificing the performance.

show abstract

A new MAP‐based channel estimation technique for multiple input multiple output diversity schemes

Hoteit

Shayan

Elhakeem

2006

Trans Emerging Tel Tech

View full text Add to dashboard Cite

SUMMARYThis paper presents a channel estimation technique amenable to space-time coding (STC). An array of transmission antennas operates in band-limited channels with intersymbol interference. The effectiveness of STC schemes requires the development of practical and high-performance algorithms for channel estimation. The channel parameters, to be estimated at the reception antennas, are the attenuations and delays incurred by the signals transversal along the different propagation paths. The estimation technique is based on an iterative procedure derived through the maximum a posteriori probability (MAP) approach. Unlike classic estimation techniques, we iterate on the different probabilities of different coefficients rather than the coefficient values themselves. Two practical approaches are proposed, which are simplified versions of the general approach to implement the derived expressions required to estimate the actual channel coefficients. The performance of the two proposed algorithms has been assessed by simulation. Combined analysis/simulation results are presented and compared against those of conventional channel estimation techniques. Simulation results show that the required performance can be achieved with fewer number of iterations compared to conventional techniques.

show abstract

Space-time processing for broadband wireless access

Cited by 38 publications

References 13 publications

Maximum Likelihood Detection and Optimal Code Design for Differential Unitary Space-Time Modulation with Carrier Frequency Offset

Maximum Likelihood Detection and Optimal Code Design for Differential Unitary Space-Time Modulation with Carrier Frequency Offset

Reduction of ML decoding complexity for MIMO Sphere Decoding, QOSTBC, and OSTBC

A new MAP‐based channel estimation technique for multiple input multiple output diversity schemes

Contact Info

Product

Resources

About