Special Issue on Advances in Channel Coding

dc.citation.epage327en_US
dc.citation.issueNumber4en_US
dc.citation.spage325en_US
dc.citation.volumeNumber17en_US
dc.contributor.authorArikan, E.en_US
dc.contributor.authorLentmaier, M.en_US
dc.contributor.authorMontorsi, G.en_US
dc.date.accessioned2018-04-12T13:42:06Z
dc.date.available2018-04-12T13:42:06Z
dc.date.issued2015en_US
dc.departmentDepartment of Electrical and Electronics Engineeringen_US
dc.description.abstractSince the invention of turbo codes in 1993 there has been an enormous interest and progress in the field of capacity approaching code constructions. Many classical constructions have been replaced by newer, better performing codes with feasible decoding complexity. Most of these modern code constructions, such as turbo codes, Gallager's low-density parity-check (LDPC) codes and their generalizations, can be modeled by sparse graphical models. Spatial coupling of sparse graphical models has in the last years attracted a lot of interest due to the threshold saturation phenomenon, which leads to capacity achieving performance with iterative message passing decoding. Polar codes are a recently discovered class of capacity achieving codes that are formed by an explicit construction based on a phenomenon called channel polarization. These codes, too, have various low-complexity decoding algorithms based on message passing on a sparse graph that has a recursive structure similar to that of fast transforms in signal processing.en_US
dc.description.provenanceMade available in DSpace on 2018-04-12T13:42:06Z (GMT). No. of bitstreams: 1 bilkent-research-paper.pdf: 179475 bytes, checksum: ea0bedeb05ac9ccfb983c327e155f0c2 (MD5) Previous issue date: 2015en
dc.identifier.doi10.1109/JCN.2015.000062en_US
dc.identifier.issn1229-2370
dc.identifier.urihttp://hdl.handle.net/11693/37980
dc.language.isoEnglishen_US
dc.publisherKorean Institute of Communication Sciencesen_US
dc.relation.isversionofhttp://dx.doi.org/10.1109/JCN.2015.000062en_US
dc.source.titleJournal of Communications and Networksen_US
dc.subjectChannel codingen_US
dc.subjectIterative decodingen_US
dc.subjectSignal processing algorithmsen_US
dc.subjectCommunication systemsen_US
dc.subjectAlgorithm design and analysisen_US
dc.titleSpecial Issue on Advances in Channel Codingen_US
dc.typeEditorialen_US

Files

Original bundle
Now showing 1 - 1 of 1
Loading...
Thumbnail Image
Name:
Special Issue on Advances in Channel Coding.pdf
Size:
973.47 KB
Format:
Adobe Portable Document Format
Description:
Full Printable Version