Sell Your Projects | My Account | Careers | This email address is being protected from spambots. You need JavaScript enabled to view it. | Call: +91 9573777164

Multiuser Cooperative Diversity Through Network Coding Based on Classical Coding Theory

1 1 1 1 1 Rating 4.80 (49 Votes)


In this paper, we propose and analyze a generalized construction of distributed network codes for a network consisting of $M$ users sending independent information to a common base station through independent block fading channels. The aim is to increase the diversity order of the system without reducing its throughput. The proposed scheme, called generalized dynamic-network codes (GDNC), is a generalization of the dynamic-network codes (DNC) recently proposed by Xiao and Skoglund. The design of the network codes that maximize the diversity order is recognized as equivalent to the design of linear block codes over a nonbinary finite field under the Hamming metric. We prove that adopting a systematic generator matrix of a maximum distance separable block code over a sufficiently large finite field as the network transfer matrix is a sufficient condition for full diversity order under link failure model. The proposed generalization offers a much better tradeoff between rate and diversity order compared to the DNC. An outage probability analysis showing the improved performance is carried out, and computer simulations results are shown to agree with the analytical results.

Did you like this research project?

To get this research project Guidelines, Training and Code... Click Here

Multiuser Cooperative Diversity Through Network Coding Based on Classical Coding Theory - 4.8 out of 5 based on 49 votes

Project EnquiryLatest Ready Available Academic Live Projects in affordable prices

Included complete project review wise documentation with project explanation videos and Much More...