Distributed Channel Coding for Underwater Acoustic Cooperative Networks

Multiuser cooperative schemes usually rely on relay selection or channel selection to avoid deep fading and achieve diversity while maintaining acceptable spectral efficiency. In some applications such as underwater acoustic communications, the low speed of the acoustic wave results in a very long d...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:IEEE transactions on communications Ročník 62; číslo 3; s. 848 - 856
Hlavní autoři: Jalil, Amir Minayi, Ghrayeb, Ali
Médium: Journal Article
Jazyk:angličtina
Vydáno: New York, NY IEEE 01.03.2014
Institute of Electrical and Electronics Engineers
The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Témata:
ISSN:0090-6778, 1558-0857
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:Multiuser cooperative schemes usually rely on relay selection or channel selection to avoid deep fading and achieve diversity while maintaining acceptable spectral efficiency. In some applications such as underwater acoustic communications, the low speed of the acoustic wave results in a very long delay between the channel state information (CSI) measurement time and the relay assignment time, which leads to a severely outdated CSI. To remedy this, we propose distributed coding schemes that aim at achieving good diversity-multiplexing trade-off (DMT) for multiuser scenarios where CSI is not available for resource allocation. We consider a network with multiple source nodes, multiple relay nodes, and a single destination. We first introduce a distributed linear block coding scheme, including Reed-Solomon codes, where each relay implements a column of the generator matrix of the code, and soft decision decoding is employed to retrieve the information at the destination side. We derive the end-to-end error performance of this scheme and show that the achievable diversity equals the minimum Hamming distance of the underlying code, while its DMT outperforms that of existing schemes. We extend the proposed scheme to distributed convolutional codes, and show that achieving higher diversity orders is also possible.
Bibliografie:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
content type line 23
ISSN:0090-6778
1558-0857
DOI:10.1109/TCOMM.2014.012314.130425