101. On the Achievable Diversity-Complexity Tradeoffs of Joint Network-Channel Coded Cooperative Communication
- Author
-
Nausheen Ashra, Marium Jalal Chaudhry, Azhar Ul-Haq, Sajjad Rabbani, Fabio Graziosi, and Sandeep Narayanan
- Subjects
Modulation order ,Channel network ,Computer Networks and Communications ,Wireless network ,Computer science ,business.industry ,Galois theory ,Computational Theory and Mathematics ,Artificial Intelligence ,Hardware and Architecture ,Signal Processing ,law.invention ,Cooperative diversity ,Diversity combining ,Computer engineering ,Relay ,law ,Modulation ,Computer Science::Networking and Internet Architecture ,Telecommunications ,business ,Decoding methods ,Computer Science::Information Theory ,Communication channel - Abstract
In this paper, a novel mathematical framework for the analysis and optimization of Joint-Network -- Channel Coded Diversity (JNCCD) protocol is presented. The analysis is applicable to relay -- aided protocols based on the error propagation model, which rely on appropriately designed diversity combining demodulators at the destination. Wireless networks with an arbitrary number of sources and relays are considered. Arbitrary multilevel modulation schemes and network codes constructed over Galois Field (GF) are analyzed and JNCCD protocols are investigated. Our results show that if the modulation order is smaller than the Galois field, we are still able to achieve the higher diversity order with lower decoding complexity.
- Published
- 2015
- Full Text
- View/download PDF