Polarization for arbitrary discrete memoryless channels

Simple item page
dc.citation.epage148en_US
dc.citation.spage144en_US
dc.contributor.authorŞaşoǧlu, E.en_US
dc.contributor.authorTelatar, E.en_US
dc.contributor.authorArıkan, Erdalen_US
dc.coverage.spatialTaormina, Italyen_US
dc.date.accessioned2016-02-08T12:25:14Z
dc.date.available2016-02-08T12:25:14Z
dc.date.issued2009en_US
dc.departmentDepartment of Electrical and Electronics Engineeringen_US
dc.descriptionDate of Conference: 11-16 October 2009en_US
dc.descriptionConference Name: 2009 IEEE Information Theory Workshop, ITW 2009en_US
dc.description.abstractChannel polarization, originally proposed for binary-input channels, is generalized to arbitrary discrete memoryless channels. Specifically, it is shown that when the input alphabet size is a prime number, a similar construction to that for the binary case leads to polarization. This method can be extended to channels of composite input alphabet sizes by decomposing such channels into a set of channels with prime input alphabet sizes. It is also shown that all discrete memoryless channels can be polarized by randomized constructions. The introduction of randomness does not change the order of complexity of polar code construction, encoding, and decoding. A previous result on the error probability behavior of polar codes is also extended to the case of arbitrary discrete memoryless channels. The generalization of polarization to channels with arbitrary finite input alphabet sizes leads to polar-coding methods for approaching the true (as opposed to symmetric) channel capacity of arbitrary channels with discrete or continuous input alphabets.en_US
dc.description.provenanceMade available in DSpace on 2016-02-08T12:25:14Z (GMT). No. of bitstreams: 1 bilkent-research-paper.pdf: 70227 bytes, checksum: 26e812c6f5156f83f0e77b261a471b5a (MD5) Previous issue date: 2009en
dc.identifier.doi10.1109/ITW.2009.5351487en_US
dc.identifier.urihttp://hdl.handle.net/11693/28616
dc.language.isoEnglishen_US
dc.publisherIEEEen_US
dc.relation.isversionofhttp://dx.doi.org/10.1109/ITW.2009.5351487en_US
dc.source.titleProceedings of the 2009 IEEE Information Theory Workshop, ITW 2009en_US
dc.subjectCapacity-achieving codesen_US
dc.subjectChannel polarizationen_US
dc.subjectPolar codesen_US
dc.subjectDiscrete memoryless channelsen_US
dc.subjectError probabilitiesen_US
dc.subjectPrime numberen_US
dc.subjectCommunication channels (information theory)en_US
dc.titlePolarization for arbitrary discrete memoryless channelsen_US
dc.typeConference Paperen_US

Files

Original bundle
Now showing 1 - 1 of 1
Thumbnail Image
Name:
Polarization for arbitrary discrete memoryless channels.pdf
Size:
288.82 KB
Format:
Adobe Portable Document Format
Description:
Full printable version
Download

Collections

Scholarly Publications - Electrical and Electronics Engineering