DocumentCode
3619640
Title
Cooperative diversity with incremental redundancy turbo coding for quasi-static wireless networks
Author
R. Liu;P. Spasojevic;E. Soljanin
Author_Institution
ECE Dept., Rutgers Univ., NJ, USA
fYear
2005
fDate
6/27/1905 12:00:00 AM
Firstpage
791
Lastpage
795
Abstract
We propose an incremental redundancy (IR) cooperative coding scheme employing punctured turbo codes for quasi-static wireless networks. Our scheme enhances the network performance by embedding IR cooperative coding into an existing noncooperative route. More precisely, for each of the noncooperative hops, we consider the following cooperation strategy: we form collaborating cluster of M nodes consisting cf the (hop) sender and its M-1 neighbors. A decode-and-forward algorithm within the cluster enables the IR turbo coding scheme. The approach improves the reliability of multihop routing by employing a powerful coding scheme to enable cooperative diversity. We study its frame-error rate (FER) performance for quasi-static Rayleigh-fading channels based on the threshold behavior of turbo codes. A FER upper bound on the maximum-likelihood decoding and its asymptotic version are derived as a function of channel SNRs and the mother code noise threshold. Simulation results show that our bounds are very good predictors of the proposed scheme performance.
Keywords
"Turbo codes","Wireless networks","Redundancy","Maximum likelihood decoding","Collaboration","Clustering algorithms","Routing","Rayleigh channels","Upper bound","Predictive models"
Publisher
ieee
Conference_Titel
Signal Processing Advances in Wireless Communications, 2005 IEEE 6th Workshop on
Print_ISBN
0-7803-8867-4
Type
conf
DOI
10.1109/SPAWC.2005.1506248
Filename
1506248
Link To Document