Show simple item record

dc.contributor.authorSagar, Youvaraj T.
dc.contributor.authorYang, Jie
dc.contributor.authorKwon, Hyuck M.
dc.date.accessioned2012-06-19T20:37:45Z
dc.date.available2012-06-19T20:37:45Z
dc.date.issued2011-07-31
dc.identifier.citationSagar, Y.T.; Jie Yang; Kwon, H.M.; , "Channel capacities of parallel and serial modulo-sum relay networks," Information Theory Proceedings (ISIT), 2011 IEEE International Symposium on , vol., no., pp.269-273, July 31 2011-Aug. 5 2011 doi: 10.1109/ISIT.2011.6034062en_US
dc.identifier.isbn9781457705946
dc.identifier.issn2157-8095
dc.identifier.urihttp://hdl.handle.net/10057/5175
dc.identifier.urihttp://dx.doi.org/10.1109/ISIT.2011.6034062
dc.descriptionClick on the DOI link below to access the article (may not be free).en_US
dc.description.abstractThis paper presents channel capacities of parallel and serial modulo-sum relay networks. A parallel relay network consists of one source, multiple relays in parallel, and one destination node. A serial relay network consists of one source, multiple relays in serial, and one destination node. Each relay employs a quantize-and-forward (QAF) strategy. Each node including source, multiple relays, and destination, employs its own codebook for its own encoding and or decoding. Every node has information of the other nodes codebooks. And every addition in any channel is a modulo-sum. First, this paper presents the capacities for the binary modulo-sum symmetric parallel, and serial relay networks, assuming that the channels are discrete and memoryless. Second, this paper claims that the capacities obtained are strictly below the cut-set bounds except the trivial cases. Third, this paper extends the capacities obtained for the binary modulo-sum relay networks to the m-ary modulo-sum relay networks. Finally, this paper presents the closed form capacities for a worst direct channel which is a binary modulo-sum symmetric channel with a crossover probability of 1/2.en_US
dc.language.isoen_USen_US
dc.publisherIEEEen_US
dc.relation.ispartofseriesInformation Theory Proceedings (ISIT), 2011 IEEE International Symposium on;July 31 2011-Aug. 5 2011
dc.subjectChannel capacityen_US
dc.subjectDensity functional theoryen_US
dc.subjectEntropyen_US
dc.subjectNoiseen_US
dc.subjectProtocolsen_US
dc.subjectRelaysen_US
dc.titleChannel capacities of parallel and serial modulo-sum relay networksen_US
dc.typeConference paperen_US
dc.description.versionPeer reviewed
dc.rights.holderCopyright © 2011, IEEE


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record