Gharavi, H.
(2012),
A Low-Complexity Tree-Search Algorithm to Decode Diversity-Oriented Block Codes with Inter-Symbol Interference, IEEE International Conference on Communications , Ottawa, -1
(Accessed December 4, 2024)
Official websites use .gov
A .gov website belongs to an official government organization in the United States.
Secure .gov websites use HTTPS
A lock (
) or https:// means you’ve safely connected to the .gov website. Share sensitive information only on official, secure websites.
A Low-Complexity Tree-Search Algorithm to Decode Diversity-Oriented Block Codes with Inter-Symbol Interference
Published
Author(s)
Abstract
In order to contain a differential propagation delay in a block based cooperative MIMO system, a guard interval can be inserted to mitigate the effect of inter-symbol interference. A larger block size could substantially increase the effective symbol rate, although at the expense of decoding complexity. In this paper, we propose a novel low-complexity breadthadjustable tree-search algorithm, which, as an example, has been applied to decode Asynchronous Cooperative Liner Dispersion Codes (ACLDC). With simulation we demonstrate that when the blocksize is equivalent to 20, the complexity of the proposed algorithm is only a fraction of 10*-8 of that of the ML algorithm. This would allow us to practically enhance the effective symbol rate without any performance degradation.Proceedings Title
IEEE International Conference on Communications
Conference Dates
June 10-15, 2012
Conference Location
Ottawa
Pub Type
Conferences
Keywords
Wireless Netwroks, Transmit Diversity, MIMO, Linear Dispersion Codes (ACLDC)
Citation
Issues
If you have any questions about this publication or are having problems accessing it, please contact reflib@nist.gov.
Created June 10, 2012, Updated February 19, 2017