Show simple item record

dc.contributor.supervisorAMBROZE, MARCEL ADRIAN
dc.contributor.authorELERUJA, SAEED ANIBABA
dc.contributor.otherFaculty of Science and Engineeringen_US
dc.date.accessioned2021-04-30T14:48:41Z
dc.date.issued2021
dc.identifier10511605en_US
dc.identifier.urihttp://hdl.handle.net/10026.1/17080
dc.description.abstract

Communication has shifted from simple point-to-point communication to network communication with many senders and/or receivers. These networks are distributed in nature and require the formation of low-delay and energy-limited communication schemes which make use of correlated sources in which common information from the sources is carefully managed to avoid duplication, thereby attaining the optimal usage of channel resources. Slepian and Wolf first proposed and developed a scheme where multiple information sources can be jointly compressed at a rate greater than the sum of their respective rates if compressed separately. The major challenges in existing schemes are three, namely, the modelling of a correlation channel; consideration for systems with stringent delay restrictions; and the tradeoff between error correction performance and associated complexity. The aim of this research is to develop efficient means of improving the performance of distributed source coding, particularly, the Slepian-Wolf coding schemes. An Additive White Gaussian Noise (AWGN) equivalent channel is proposed and implemented. Subsequently, to justify the correlation between information sources, a binary symmetric equivalent channel is developed. It is understood from Shannon’s theory that block codes of sufficiently large length are asymptotically optimal. This justifies the use of binary channel codes like Low-Density Parity-Check (LDPC) codes for practical Slepian-Wolf coding. Thus, LDPC codes of block lengths n=512, 100 and 1024 were applied on the equivalent channel models and simulation results show improvement over other schemes with similar code lengths. Furthermore, to address the problem of systems with stringent restrictions on delay, new schemes were modelled to utilize very short, low delay codes like the [7, 4, 3] Hamming code, the [15, 7] BCH code as well as the [47, 24, 11] Quadratic Residue (QR) code. Particularly, an improved source coding scheme is proposed to correct a single-bit error of the [47, 24, 11] QR code based on the modification of the Dorsch decoder without the implementation of maximum-likelihood decoding. Finally, a framework is established for attaining maximum likelihood decoding and the associated complexity is presented.

en_US
dc.language.isoen
dc.publisherUniversity of Plymouth
dc.rightsAttribution-ShareAlike 3.0 United States*
dc.rights.urihttp://creativecommons.org/licenses/by-sa/3.0/us/*
dc.subjectCoding, Communications, Distributed Source Coding, Slepian-Wolf Coding,en_US
dc.subjectLow Density Parity Check (LDPC) codes, Quadratic Residue (QR) codes, Modified Dorsch decoder, Maximum Distance Separable (MDS) codesen_US
dc.subjectBelief Propagation/Sum-Product Algorithm (BP/SPA), PhDen_US
dc.subject.classificationPhDen_US
dc.titleBINARY LDPC DESIGN FOR SLEPIAN-WOLF CODING OF CORRELATED INFORMATION SOURCESen_US
dc.typeThesis
plymouth.versionpublishableen_US
dc.rights.embargodate2022-04-30T14:48:41Z
dc.rights.embargoperiod12 monthsen_US
dc.type.qualificationDoctorateen_US
rioxxterms.versionNA
plymouth.orcid_idhttps://orcid.org/0000-0001-7208-3157en_US


Files in this item

Thumbnail
Thumbnail
Thumbnail

This item appears in the following Collection(s)

Show simple item record

Attribution-ShareAlike 3.0 United States
Except where otherwise noted, this item's license is described as Attribution-ShareAlike 3.0 United States

All items in PEARL are protected by copyright law.
Author manuscripts deposited to comply with open access mandates are made available in accordance with publisher policies. Please cite only the published version using the details provided on the item record or document. In the absence of an open licence (e.g. Creative Commons), permissions for further reuse of content should be sought from the publisher or author.
Theme by 
@mire NV