Performance of space-time codes: Gallager bounds and weight enumeration
File(s)
Author(s)
Ling, Cong
Li, Kwok H
Kot, Alex C
Type
Journal Article
Abstract
Since the standard union bound for space–time codes
may diverge in quasi-static fading channels, the limit-before-average (LBA) technique has been exploited to derive tight performance bounds. However, it suffers from the computational burden arising from a multidimensional integral. In this paper, efficient bounding techniques for space–time codes are developed in the framework of Gallager bounds. Two closed-form upper bounds, the ellipsoidal bound and the spherical bound, are proposed that come close to simulation results within a few tenths of a decibel. In addition, two novel methods of weight enumeration operating on a further reduced state diagram are presented, which, in conjunction with the bounding techniques, give a thorough treatment of performance bounds for space–time codes.
may diverge in quasi-static fading channels, the limit-before-average (LBA) technique has been exploited to derive tight performance bounds. However, it suffers from the computational burden arising from a multidimensional integral. In this paper, efficient bounding techniques for space–time codes are developed in the framework of Gallager bounds. Two closed-form upper bounds, the ellipsoidal bound and the spherical bound, are proposed that come close to simulation results within a few tenths of a decibel. In addition, two novel methods of weight enumeration operating on a further reduced state diagram are presented, which, in conjunction with the bounding techniques, give a thorough treatment of performance bounds for space–time codes.
Date Issued
2008-08-01
Citation
IEEE Transactions on Information Theory, 2008, 54 (8), pp.3592-3610
ISSN
1053-587X
Publisher
IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC
Start Page
3592
End Page
3610
Journal / Book Title
IEEE Transactions on Information Theory
Volume
54
Issue
8
Copyright Statement
© 2008 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works.
Identifier
http://gateway.webofknowledge.com/gateway/Gateway.cgi?GWVersion=2&SrcApp=PARTNER_APP&SrcAuth=LinksAMR&KeyUT=000261310900011&DestLinkType=FullRecord&DestApp=ALL_WOS&UsrCustomerID=1ba7043ffcc86c417c072aa74d649202
Subjects
Science & Technology
Technology
Engineering, Electrical & Electronic
Engineering
Dual frame
frame expansions
Greville formulas
Laplacian pyramid
oversampled filter banks
para-pseudoinverse
PERFECT RECONSTRUCTION FILTERBANKS
DESIGN
EXPANSIONS
MATRIX
ADVENT
BASES
LIFE
Publication Status
Published