Conference paper Open Access

When Channel Coding Hits the Implementation Wall

Kestel, Claus; Herrmann, Matthias; Wehn, Norbert


DataCite XML Export

<?xml version='1.0' encoding='utf-8'?>
<resource xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns="http://datacite.org/schema/kernel-4" xsi:schemaLocation="http://datacite.org/schema/kernel-4 http://schema.datacite.org/meta/kernel-4.1/metadata.xsd">
  <identifier identifierType="URL">https://zenodo.org/record/2349386</identifier>
  <creators>
    <creator>
      <creatorName>Kestel, Claus</creatorName>
      <givenName>Claus</givenName>
      <familyName>Kestel</familyName>
      <affiliation>Microelectronic Systems Design Research Group, TU Kaiserslautern</affiliation>
    </creator>
    <creator>
      <creatorName>Herrmann, Matthias</creatorName>
      <givenName>Matthias</givenName>
      <familyName>Herrmann</familyName>
      <affiliation>Microelectronic Systems Design Research Group, TU Kaiserslautern</affiliation>
    </creator>
    <creator>
      <creatorName>Wehn, Norbert</creatorName>
      <givenName>Norbert</givenName>
      <familyName>Wehn</familyName>
      <affiliation>Microelectronic Systems Design Research Group, TU Kaiserslautern</affiliation>
    </creator>
  </creators>
  <titles>
    <title>When Channel Coding Hits the Implementation Wall</title>
  </titles>
  <publisher>Zenodo</publisher>
  <publicationYear>2018</publicationYear>
  <subjects>
    <subject>Channel coding, 5G,</subject>
  </subjects>
  <dates>
    <date dateType="Issued">2018-12-03</date>
  </dates>
  <resourceType resourceTypeGeneral="Text">Conference paper</resourceType>
  <alternateIdentifiers>
    <alternateIdentifier alternateIdentifierType="url">https://zenodo.org/record/2349386</alternateIdentifier>
  </alternateIdentifiers>
  <relatedIdentifiers>
    <relatedIdentifier relatedIdentifierType="DOI" relationType="IsIdenticalTo">10.1109/ISTC.2018.8625324</relatedIdentifier>
    <relatedIdentifier relatedIdentifierType="URL" relationType="IsPartOf">https://zenodo.org/communities/epic_h2020</relatedIdentifier>
  </relatedIdentifiers>
  <rightsList>
    <rights rightsURI="http://creativecommons.org/licenses/by/4.0/legalcode">Creative Commons Attribution 4.0 International</rights>
    <rights rightsURI="info:eu-repo/semantics/openAccess">Open Access</rights>
  </rightsList>
  <descriptions>
    <description descriptionType="Abstract">&lt;p&gt;The continuous demands for higher throughput, higher spectral efficiency, lower latencies, lower power and large scalability in communication systems impose large challenges on the baseband signal processing. In the future, throughput requirements far beyond 100Gbit/s are expected, which is much higher than the tens of Gbit/s targeted in the 5G standardization. At the same time, advances in silicon technology due to shrinking feature sizes and increased performance parameters alone will not provide the necessary gain, especially in energy Efficiency for wireless transceivers, which have tightly constrained power and energy budgets. The focus of this paper lies on channel coding, which is a major source of complexity in digital baseband processing. We will highlight implementation challenges for the most advanced channel coding techniques, i.e. Turbo codes, Low Density Parity Check (LDPC) codes and Polar codes and present decoder architectures for&amp;nbsp;all three code classes that are designed for highest throughput.&lt;/p&gt;</description>
  </descriptions>
  <fundingReferences>
    <fundingReference>
      <funderName>European Commission</funderName>
      <funderIdentifier funderIdentifierType="Crossref Funder ID">10.13039/501100000780</funderIdentifier>
      <awardNumber awardURI="info:eu-repo/grantAgreement/EC/H2020/760150/">760150</awardNumber>
      <awardTitle>Enabling Practical Wireless Tb/s Communications with Next Generation Channel Coding</awardTitle>
    </fundingReference>
  </fundingReferences>
</resource>
58
56
views
downloads
Views 58
Downloads 56
Data volume 26.7 MB
Unique views 56
Unique downloads 54

Share

Cite as