A GRASP for unitary space-time codes

Panagos, Adam; Kosbar, Kurt

doi:10.1109/glocom.2005.1578387

Cited by 5 publications

(6 citation statements)

References 7 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…As seen in Figure 3, this design metric requires less time to calculate but still retains the desirable properties of the originally proposed union bound design metric ∆. The authors are currently investigating using the reduced complexity union bound design metric in conjunction with recently proposed greedy search algorithms [9].…”

Section: Discussionmentioning

confidence: 95%

See 1 more Smart Citation

A new design metric for unitary space-time codes

Panagos

Kosbar

2006

Proceedings of the 2006 International Conference on Wireless Communications and Mobile Computing

View full text Add to dashboard Cite

Multiple-input multiple output (MIMO) communication systems can have dramatically higher throughput than singleinput, single-output systems. Unitary space-time codes for MIMO fading channels have been shown to be optimal under certain conditions when neither the transmitter or receiver has channel state information. Previous work on constructing unitary space-time codes has focused on the diversity product or diversity sum of the unitary space-time code constellation. This paper shows how these min-max design criteria may produce sub-optimal codes in terms of minimizing symbol-error rate (SER). A union bound design metric based on a union bound of pairwise error probabilities is presented, and a bound on its optimal value is derived. Examples suggest this new metric can more accurately distinguish good constellations than the diversity product and diversity sum. The complexity of the union bound design metric is reduced by using recently derived tight bounds, and a desirable -incremental property of the union bound design metric is demonstrated in an example.

show abstract

Section: Discussionmentioning

confidence: 95%

“…For example, with L = 32, β = 496 integrals must be evaluated numerically. If ∆ must be calculated numerous times during random or gradient based searches [9], the amount of time spent calculating ∆ can be prohibitive.…”

Section: Complexitymentioning

confidence: 99%

A new design metric for unitary space-time codes

Panagos

Kosbar

2006

Proceedings of the 2006 International Conference on Wireless Communications and Mobile Computing

View full text Add to dashboard Cite

show abstract

“…Because of these differences the speed at which searches can be performed has increased significantly. The search technique used is based on our original work in [11]. Parameters are randomly generated, the constellation is constructed, and the diversity product or sum is calculated.…”

Section: Construction Technique Comparisonmentioning

confidence: 99%

“…However, this previous construction technique required L 2 operations to calculate the diversity product. When used in conjunction with a greedy search algorithm [11], the polynomial complexity in L made it computationally expensive to search for large constellations.…”

Section: Introductionmentioning

confidence: 99%

WLC21-4: Weak-Group Unitary Space-Time Codes

2006

View full text Add to dashboard Cite

show abstract

“…Many works have been focused on how to utilize the scheme in [4][5][6][7][8][9][10][11][12][13][14][15][16]. Numerous methods have been proposed to construct the constellations in [4][5][6][7][8][9][10][11][12].…”

Section: Introductionmentioning

confidence: 99%

Noncoherent unitary space-time codes: Constellation design and decoding algorithm

2014

View full text Add to dashboard Cite

Two novel schemes of unitary space-time constellations generation based on zero vectors adding are proposed for the multiple-antenna communication system. In the first scheme, T 2 zero row vectors are added into conventional unitary matrices directly, and the number of new unitary matrices obtained by different positions of the added zero vectors in T symbol duration is 2 / T T     times larger than that of conventional unitary matrices. In the second scheme, one part of the required constellations is created by the first scheme and the other part is obtained by the conventional design. This means that more information bits can be transmitted by the new constellations. According to their special construction, two corresponding decoding algorithms are proposed with low complexity in flat fading channel, respectively. At the same time, the probability of miss detection is deduced for the decoding algorithms. Performance analysis and simulation results show that the proposed constellations outperform the conventional constellations and the proposed decoding algorithms are efficient and simple.

show abstract

A GRASP for unitary space-time codes

Cited by 5 publications

References 7 publications

A new design metric for unitary space-time codes

A new design metric for unitary space-time codes

WLC21-4: Weak-Group Unitary Space-Time Codes

Noncoherent unitary space-time codes: Constellation design and decoding algorithm

Contact Info

Product

Resources

About