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, -1
Pub Type: Conferences
Wireless Netwroks, Transmit Diversity, MIMO, Linear Dispersion Codes (ACLDC)