Scholars' Mine
Missouri S&T
Research Repository
Curtis Laws Wilson Library
400 W. 14th Street
Rolla, MO 65409-0060
scholarsmine@mst.edu
| Title: | A Gray-code type bit assignment algorithm for unitary space-time constellations | |
| Author (s): | Panagos, A. Kosbar, Kurt Louis | |
| Department/Lab Affiliations: | Electrical and Computer Engineering Telemetry Learning Center University Transportation Center | |
| Keywords: | Gray codes computational complexity hamming codes space-time codes | |
| Issue Date: | 2007 | |
| Publisher: | Institute of Electrical and Electronics Engineers IEEE | |
| Citation: | Panagos, A., Kosbar, K. "A Gray-Code Type Bit Assignment Algorithm for Unitary Space-Time Constellations." Global Telecommunications Conference, 2007. GLOBECOM '07. IEEE. | |
| Abstract: | Many techniques for constructing unitary space- time constellations have been proposed. To minimize bit-error rate (BER) in a wireless communication system, constellations constructed using these techniques should be given a Gray- code type bit assignment, where symbols which are close in signal space have bit assignments which have small Hamming distance. To the authors' knowledge, no efficient general strategy for making this bit assignment has been suggested. This work proposes a prioritized distance (PD) algorithm for making this assignment in an optimal manner by minimizing the probability of bit error union bound. The algorithm can be used on constellations constructed using any technique. Simulation results show this algorithm significantly outperforms random searches and achieves near globally optimum results with moderate complexity. | |
| Type: | Article text | |
| Copyright Notice: | This material is presented to ensure timely dissemination of scholarly and technical work. Copyright and all rights therein are retained by authors or by other copyright holders. All persons copying this information are expected to adhere to the terms and constraints invoked by each author's copyright. In most cases, these works may not be reposted without the explicit permission of the copyright holder. can upload final version FULL COPYRIGHT INFORMATION: | |
| Publisher URL: | ||
| Link to this page: | ||
| Full Text: |
|
| title | A Gray-code type bit assignment algorithm for unitary space-time constellations | |
| contributor.author | Panagos, A. | |
| contributor.author | Kosbar, Kurt Louis | |
| contributor.deptlab | Electrical and Computer Engineering | |
| contributor.deptlab | Telemetry Learning Center | |
| contributor.deptlab | University Transportation Center | |
| subject | Gray codes | |
| subject | computational complexity | |
| subject | hamming codes | |
| subject | space-time codes | |
| date.issued | 2007 | |
| publisher | Institute of Electrical and Electronics Engineers IEEE | |
| identifier.citation | Panagos, A., Kosbar, K. "A Gray-Code Type Bit Assignment Algorithm for Unitary Space-Time Constellations." Global Telecommunications Conference, 2007. GLOBECOM '07. IEEE. | |
| identifier.pub.URI | ||
| description.abstract | Many techniques for constructing unitary space- time constellations have been proposed. To minimize bit-error rate (BER) in a wireless communication system, constellations constructed using these techniques should be given a Gray- code type bit assignment, where symbols which are close in signal space have bit assignments which have small Hamming distance. To the authors' knowledge, no efficient general strategy for making this bit assignment has been suggested. This work proposes a prioritized distance (PD) algorithm for making this assignment in an optimal manner by minimizing the probability of bit error union bound. The algorithm can be used on constellations constructed using any technique. Simulation results show this algorithm significantly outperforms random searches and achieves near globally optimum results with moderate complexity. | |
| type | Article | |
| type.DCMIType | text | |
| type.status | Final version | |
| rights | This material is presented to ensure timely dissemination of scholarly and technical work. Copyright and all rights therein are retained by authors or by other copyright holders. All persons copying this information are expected to adhere to the terms and constraints invoked by each author's copyright. In most cases, these works may not be reposted without the explicit permission of the copyright holder. | |
| rights | can upload final version | |
| rights.URI | ||
| rights.URI | ||
| rights.URI | ||
| date.accessioned | 2008-07-11T17:12:04Z | |
| date.available | 2008-07-22T18:15:54Z | |
| identifier.persist.URI | ||
| Full Text |
|