default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDTimo Lehnigk-Emden
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c12]Lukas Steiner, Timo Lehnigk-Emden, Markus Fehrenz, Norbert Wehn:
A Mapping of Triangular Block Interleavers to DRAM for Optical Satellite Communication. DATE 2024: 1-2- 2023
- [i1]Lukas Steiner, Timo Lehnigk-Emden, Markus Fehrenz, Norbert Wehn:
A Mapping of Triangular Block Interleavers to DRAM for Optical Satellite Communication. CoRR abs/2312.02241 (2023) - 2021
- [c11]Matthias Herrmann, Norbert Wehn, Max Thalmaier, Markus Fehrenz, Timo Lehnigk-Emden, Matthias Alles:
A 336 Gbit/s Full-Parallel Window Decoder for Spatially Coupled LDPC Codes. EuCNC/6G Summit 2021: 508-513 - 2020
- [c10]Claus Kestel
, Lucas Johannsen, Oliver Griebel, Jhon Jimenez, Timo Vogt, Timo Lehnigk-Emden, Norbert Wehn:
A 506Gbit/s Polar Successive Cancellation List Decoder with CRC. PIMRC 2020: 1-7
2010 – 2019
- 2019
- [c9]Timo Lehnigk-Emden, Matthias Alles, Claus Kestel, Norbert Wehn:
Polar Code Decoder Framework. DATE 2019: 1208-1209 - 2015
- [c8]Philipp Schläfer, Norbert Wehn, Matthias Alles, Timo Lehnigk-Emden, Emmanuel Boutillon:
Syndrome based check node processing of high order NB-LDPC decoders. ICT 2015: 156-162 - [c7]Philipp Schläfer, Vladimir Rybalkin, Norbert Wehn, Matthias Alles, Timo Lehnigk-Emden, Emmanuel Boutillon:
A new architecture for high throughput, low latency NB-LDPC check node processing. PIMRC 2015: 1392-1397 - 2013
- [c6]Philipp Schläfer, Norbert Wehn, Matthias Alles, Timo Lehnigk-Emden:
A new dimension of parallelism in ultra high throughput LDPC decoding. SiPS 2013: 153-158 - 2011
- [b1]Timo Lehnigk-Emden:
Implementation and simulation aspects of advanced non-binary iterative coding schemes. University of Kaiserslautern, 2011, ISBN 978-3-941438-78-1, pp. 1-190 - 2010
- [c5]Christina Gimmler, Timo Lehnigk-Emden, Norbert Wehn:
Low-complexity iteration control for MIMO-BICM systems. PIMRC 2010: 241-246
2000 – 2009
- 2007
- [c4]Torben Brack, Matthias Alles, Timo Lehnigk-Emden, Frank Kienle, Norbert Wehn, Nicola E. L'Insalata, Francesco Rossi, Massimo Rovini, Luca Fanucci:
Low complexity LDPC code decoders for next generation standards. DATE 2007: 331-336 - [c3]Matthias Alles, Timo Lehnigk-Emden, Uwe Wasenmüller, Norbert Wehn:
Implementation Issues of Turbo Synchronization with Duo-Binary Turbo Decoding. PIMRC 2007: 1-5 - [c2]Torben Brack, Matthias Alles, Timo Lehnigk-Emden, Frank Kienle, Norbert Wehn, Friedbert Berens, Andreas Ruegg:
A Survey on LDPC Codes and Decoders for OFDM-based UWB Systems. VTC Spring 2007: 1549-1553 - 2006
- [c1]Frank Kienle, Timo Lehnigk-Emden, Norbert Wehn:
Fast convergence algorithm for LDPC Codes. VTC Spring 2006: 2393-2397
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-01 21:38 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
