Abstract
This paper is concerned with the bit error probability (BEP) of coded unitary space---time modulation systems based on finite-length low density parity check (LDPC) codes. The union bound on the BEP of the maximum likelihood (ML) decoding is derived for any code rate, unitary space---time constellation and mapping. The tightness of the bound is checked with simulation results of the ordered statistic decoding (OSD). Numerical and simulation results show that the union bound is also close to the error performance of the sum---product (SP) decoding at low BEP levels when Gray mapping is employed. The derived bound is useful to benchmark the error performance of finite-length coded unitary space---time modulation systems, especially for those that employ short-to-medium length LDPC codes.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
