default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDISTC 2012: Gothenburg, Sweden
- 7th International Symposium on Turbo Codes and Iterative Information Processing, ISTC 2012, August 27-31, 2012, Gothenburg, Sweden. IEEE 2012
- Shachar Shayovitz, Dan Raphaeli:
Efficient iterative decoding of LDPC in the presence of strong phase noise. 1-5 - Florence Alberge:
Pairwise joint probability propagation in BICM-ID. 6-10 - Chongbin Xu, Peng Wang, Sammy Chan
, Li Ping:
Decentralized power control for random access with iterative multi-user detection. 11-15 - Laurent Schmalen, Marc Adrat, Thorsten Clevorn, Peter Vary:
Windowed iterative source-channel decoding with delay constraints. 16-20 - Thomas Ilnseher, Frank Kienle, Christian Weis, Norbert Wehn:
A 2.15GBit/s turbo code decoder for LTE advanced base station applications. 21-25 - Cédric Marchand, Mohamed Ben Hammouda, Yvan Eustache, Laura Conde-Canencia, Emmanuel Boutillon:
Design and implementation of a near maximum likelihood decoder for Cortex codes. 26-30 - Guohua Zhang, Rong Sun, Xinmei Wang:
New quasi-cyclic LDPC codes with girth at least eight based on Sidon sequences. 31-35 - Chris Winstead, Yangyang Tang, Emmanuel Boutillon, Christophe Jégo, Michel Jézéquel:
A space-time redundancy technique for embedded stochastic error correction. 36-40 - Gianluigi Liva, Balázs Matuz, Enrico Paolini, Marco Chiani:
Short low-rate non-binary turbo codes. 41-45 - Stefan Schwandter, Alexandre Graell i Amat, Gerald Matz:
Spatially coupled LDPC codes for two-user decode-and-forward relaying. 46-50 - Arvind Yedla, Yung-Yih Jian, Phong S. Nguyen, Henry D. Pfister:
A simple proof of threshold saturation for coupled scalar recursions. 51-55 - Mohd Azri Mohd Izhar, Norsheila Fisal, Xiaobo Zhou, Khoirul Anwar, Tad Matsumoto:
Utilization of 2-D Markov source correlation using block turbo codes. 56-60 - Stefano Chinnici, Paolo Spallaccini:
Fast simulation of turbo codes on GPUs. 61-65 - S. M. Sadegh Tabatabaei Yazdi, Lara Dolecek:
Synchronization from deletions through interactive communication. 66-70 - Stefan Scholl, Frank Kienle, Michael Helmling, Stefan Ruzika:
ML vs. BP decoding of binary and non-binary LDPC codes. 71-75 - Werner Haselmayr, Bernhard Etzlinger, Andreas Springer:
Equalization of MIMO-ISI channels based on Gaussian message passing in factor graphs. 76-80 - Ming Zhan, Liang Zhou:
A memory reduced decoding scheme for double binary convolutional turbo code based on forward recalculation. 81-85 - Seok-Ki Ahn, Kyeongcheol Yang:
Importance sampling for performance estimation of LDPC codes over Rayleigh fading channels. 86-90 - Zhongwei Si, Ragnar Thobaben, Mikael Skoglund, Tobias J. Oechtering:
Bidirectional broadcasting by using multi-edge type LDPC convolutional codes. 91-95 - Khoirul Anwar, Tad Matsumoto:
Three-way relaying systems using iterative spatial demapping. 96-100 - Angelo Poloni, Stefano Valle, Stefano Vincenti:
NB-LDPC: Absorbing set and importance sampling. 101-105 - Vida Ravanmehr, Ludovic Danjean, Bane Vasic, David Declercq:
Signal recovery performance of the interval-passing algorithm. 106-110 - Jean Dion, Marie-Hélène Hamon, Pierre Penard, Matthieu Arzel, Michel Jézéquel:
Adapted scheduling of QC-LDPC decoding for multistandard receivers. 111-115 - Mohamad Mostafa, Werner G. Teich, Jürgen Lindner:
Analysis of high order recurrent neural networks for analog decoding. 116-120 - Vincent Gripon, Vitaly Skachek, Warren J. Gross, Michael G. Rabbat:
Random clique codes. 121-125 - Sheng Tong, Li Ping, Baoming Bai:
Near Shannon limit precoded concatenated zigzag codes. 126-130 - Andreas Winkelbauer, Norbert Goertz, Gerald Matz:
Compress-and-forward in the multiple-access relay channel: With or without network coding? 131-135 - Krishna R. Narayanan, Henry D. Pfister:
Iterative collision resolution for slotted ALOHA: An optimal uncoordinated transmission policy. 136-139 - Mihai-Alin Badiu, Carles Navarro i Manchon, Vasile Bota, Bernard Henri Fleury:
Distributed iterative processing for interference channels with receiver cooperation. 140-144 - Dapeng Hao, Peter Adam Hoeher:
A low-complexity tree search detection algorithm for superposition modulation. 145-149 - Irina E. Bocharova, Florian Hug, Rolf Johannesson, Boris D. Kudryashov:
High-rate QC LDPC codes of short and moderate length with good girth profile. 150-154 - Walter Nitzold, Michael Lentmaier, Gerhard P. Fettweis:
Spatially coupled protograph-based LDPC codes for incremental redundancy. 155-159 - Onur Oguz:
A novel soft equalization for MIMO systems with recycled extrinsic information. 160-164 - Y. Min, Francis Chung-Ming Lau, Chi K. Tse:
Generalized LDPC code with single-parity-check product constraints at super check nodes. 165-169 - Yong Jin Daniel Kim, Jan Bajcsy:
An architecture for faster than Nyquist Turbo broadcasting. 170-174 - Kai Zhang, Haiqiang Chen, Xiao Ma:
Adaptive decoding algorithms for LDPC codes with redundant check nodes. 175-179 - Lorenzo Guerrieri, Paola Bisaglia, Maurizio Martina, Guido Masera:
Reducing the memory for iteration-exchanged information and border future metrics in the HomePlug AV turbo decoder implementation. 180-184 - Gottfried Lechner, Sarah J. Johnson:
Absorbing sets and cycles. 185-189 - Zhenyu Shi, Peter Adam Hoeher:
Low-density hybrid-check coded superposition mapping in BICM-OFDM. 190-194 - Ammar El Falou, Charlotte Langlais, Charbel Abdel Nour, Catherine Douillard:
Low ML-detection complexity, adaptive 2×2 STBC, with powerful FEC codes. 195-199 - Shancheng Zhao, Xiao Ma, Baoming Bai:
Iterative detection/decoding of majority-logic decodable nonbinary LDPC codes over partial response channels. 200-204 - Nissim Halabi, Guy Even:
Local-optimality guarantees for optimal decoding based on paths. 205-209 - Laurent Schmalen, Stephan ten Brink, Andreas Leven:
Analysis and optimization of iteration schedules for LDPC coded modulation and detection. 210-214 - Guangsong Wang, Ingmar Land, Alex J. Grant:
Irregular repeat accumulate codes with few iterations for the binary adder channel. 215-219 - Daniel N. Liu, Michael P. Fitz:
Iterative equalization in non-linear satellite channels. 220-224 - Najeeb ul Hassan, Michael Lentmaier, Gerhard P. Fettweis:
Comparison of LDPC block and LDPC convolutional codes based on their decoding latency. 225-229 - Puripong Suthisopapan, Anupap Meesomboon, Kenta Kasai, Virasit Imtawil:
Ultra low complexity soft output detector for non-binary LDPC coded large MIMO systems. 230-234 - Salim Haddad, Amer Baghdadi, Michel Jézéquel:
Adaptive complexity MIMO turbo receiver applying turbo demodulation. 235-239 - Stefan Nowak, Ruediger Kays:
Interleaver design for spectrally-efficient bit-interleaved LDPC-coded modulation. 240-244 - Jan Geldmacher, Jürgen Götze:
On fault tolerant decoding of Turbo codes. 245-249 - Alexandros Katsiotis, Nicholas Kalouptsidis, Panagiotis Rizomiliotis:
Recursive flexible convolutional encoders for parallel concatenation. 250-254 - Hua Zhou, David G. M. Mitchell, Norbert Goertz, Daniel J. Costello Jr.:
A puncturing algorithm for rate-compatible LDPC convolutional codes. 255-259 - Martin Ågren, Martin Hell, Thomas Johansson, Carl Löndahl:
Improved message passing techniques in fast correlation attacks on stream ciphers. 260-264
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.
last updated on 2024-09-21 01:32 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:
