Low-Complexity Decoding Algorithms for Distributed Space-Time Coded Regenerative Relay Systems | Zendy

Chao Zhang | Zendy; Huarui Yin | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

Low-Complexity Decoding Algorithms for Distributed Space-Time Coded Regenerative Relay Systems

Author(s) -

Chao Zhang,

Huarui Yin

Publication year - 2012

Publication title -

international journal of distributed sensor networks

Language(s) - English

Resource type - Journals

SCImago Journal Rank - 0.324

H-Index - 53

eISSN - 1550-1477

pISSN - 1550-1329

DOI - 10.1155/2012/950296

Subject(s) - decoding methods , computer science , demodulation , soft decision decoder , relay , algorithm , computational complexity theory , telecommunications , quantum mechanics , channel (broadcasting) , power (physics) , physics

We examine decoding structure for distributed space-time coded regenerative relay networks. Given the possible demodulation error at the regenerative relays, we provide a general framework of error aware decoder, where the receiver exploits the demodulation error probability of relays to improve the system performance. Considering the high computational complexity of optimal Maximum Likelihood (ML) decoder, we also propose two low-complexity decoders, Max-Log decoder and Max-Log-Sphere decoder. Computational complexities of these three decoders are also analyzed. Simulation results show that error aware decoders can improve system performance greatly without high system overload and Max-Log decoder and Max-Log-Sphere decoder can drastically reduce the decoding complexity with negligible performance degradation. © 2012 Chao Zhang and Huarui Yin.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research