We present capacity results of the binary-symmetric parallel-relay network, where there is one source, one destination, and K relays in parallel. We show that forwarding relays, where the relays merely transmit their received signals, achieve the capacity in two ways: with coded transmission at the source and a finite number of relays, or uncoded transmission at the source and a sufficiently large number of relays. On the other hand, decoding relays, where the relays decode the source message, re-encode, and forward it to the destination, achieve the capacity when the number of relays is small.
History
Source title
Proceedings of the 2010 IEEE International Symposium on Information Theory (ISIT 2010)
Name of conference
2010 IEEE International Symposium on Information Theory (ISIT 2010)
Location
Austin, TX
Start date
2010-06-13
End date
2010-06-18
Pagination
654-658
Publisher
Institute of Electrical and Electronics Engineers (IEEE)
Place published
Piscataway, NJ
Language
en, English
College/Research Centre
Faculty of Engineering and Built Environment
School
School of Electrical Engineering and Computer Science