Show simple item record

dc.contributor.authorModiri, Arghavanen
dc.date2015-06-02 16:06:39.16
dc.date.accessioned2015-06-03T17:14:12Z
dc.date.available2015-06-03T17:14:12Z
dc.date.issued2015-06-03
dc.identifier.urihttp://hdl.handle.net/1974/13114
dc.descriptionThesis (Master, Electrical & Computer Engineering) -- Queen's University, 2015-06-02 16:06:39.16en
dc.description.abstractIn this thesis, we consider the communication problem of a single source simultaneously transmitting to multiple receivers whose sets of requested messages overlap. For decades, one of the challenges in this broadcast setting has been decreasing the number of transmissions from the source to the terminals without increasing the system complexity. The multicast and broadcast problems with ‘common’ information have been mostly studied ‘existentially’: information-theoretical bounds on rates and capacities have been discussed in a number of previous works. In this work, we take the contrasted ‘constructive’ viewpoint and attempt to design practical transmission protocols with low encoding and decoding complexities. Our approach is based on rateless fountain coding equipped with efficient belief propagation (BP) decoders. While previous network coding solutions require high-complexity Gaussian elimination decoding for optimality, fountain codes allow for much better performance-complexity trade-offs with BP decoders due to their sparse decoding Tanner graphs. We provide insights and solutions for the 2-terminal setting as an example that show the extraordinary power and flexibility of fountain codes to address the conflicting challenges in the design of efficient transmission protocols. Our ideas can be extended to larger number of receivers and though we have focused on Luby-Transform (LT) codes, other fountain coding distributions can be equally useful. The proposed coding methods in this thesis can be applied to many practical systems such as wireless sensor networks (WSN) that have limited power, memory, and processing capabilities.en
dc.language.isoengen
dc.relation.ispartofseriesCanadian thesesen
dc.rightsQueen's University's Thesis/Dissertation Non-Exclusive License for Deposit to QSpace and Library and Archives Canadaen
dc.rightsProQuest PhD and Master's Theses International Dissemination Agreementen
dc.rightsIntellectual Property Guidelines at Queen's Universityen
dc.rightsCopying and Preserving Your Thesisen
dc.rightsThis publication is made available by the authority of the copyright owner solely for the purpose of private study and research and may not be copied or reproduced except as permitted by the copyright laws without written authority from the copyright owner.en
dc.subjectLT codesen
dc.subjectMixing Probabilitiesen
dc.subjectSampling Patternen
dc.subjectFountain codesen
dc.titleRateless Coding for Single-Source Networks with Common Informationen
dc.typethesisen
dc.description.degreeM.A.Sc.en
dc.contributor.supervisorYousefi, Shahramen
dc.contributor.departmentElectrical and Computer Engineeringen
dc.degree.grantorQueen's University at Kingstonen


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record