Short Polar Codes. Peihong Yuan. Chair for Communications Engineering. Technische Universität München
|
|
- Jeremy Hunt
- 6 years ago
- Views:
Transcription
1 Short Polar Codes Peihong Yuan Chair for Communications Engineering July 26, 2016 LNT & DLR Summer Workshop on Coding 1 / 23
2 Outline 1 Motivation 2 Improve the Distance Property 3 Simulation Results 4 sum-min Approx. 5 Rate Matching/IR-HARQ 6 Conclusions 2 / 23
3 Polar codes Provable Capacity-Achieving 1 Encoding: Precoding (k n) Polar transform (n n) 1 2 n log n (parallelizable) Successive Cancellation (SC) decoding (sequential): 1 n log n + 2 n log n 1 2 x y: 2 tanh 1 [tanh x 2 tanh y ] sign(x) sign(y) min( x, y ) 2 1 E. Arıkan. Channel polarization: A method for constructing capacity-achieving codes for symmetric binary-input memoryless channels. IEEE Trans. on Information Theory, / 23
4 Construction of Polar codes (Gaussian Approx. 2 with J-function 3 ) I (W (2i 1) N ) + I (W (i) N/2 ) I (W (2i) N ) I (W (i) N/2 ) I (W (1) 1 ) = J(2/σ n) I (W (2i 1) N ) = 1 J ( 2 ) ( )] 2 [J 1 1 I (W (i) N/2 ) ) ( )] 2 I (W (2i) N ( 2 [J ) = J 1 I (W (i) N/2 ) 2 S. ten Brink et al. Design of low-density parity-check codes for modulation and detection. IEEE Trans. on Communications, F. Brännström. Convergence analysis and design of multiple concatenated codes. Ph.D. dissertation, Chalmers Univ. Technol., Göteborg, Sweden, Mar / 23
5 Polar codes vs. LTE-Turbo codes (1024, 512) 10 0 Polar Codes, SC Polar Codes, SC (GA Est.) LTE-Turbo codes log-map, NoIt= FER SNR in db 5 / 23
6 SC List Decoding 4 Time Complexity: O(Ln log n) Space Complexity: L(2n 1) float 2L(2n 1) boolean ML-achieving decoding (L 2 k ) 4 I. Tal and A. Vardy. List decoding of polar codes. IEEE Trans. on Information Theory, / 23
7 Polar codes vs. LTE-Turbo codes (1024, 512) 10 0 Polar Codes, SC Polar Codes, SCL, L=32 Polar ML (lower) bound 10 1 LTE-Turbo codes log-map, NoIt= FER SNR in db 7 / 23
8 ML (lower) bound 5 Algorithm 1 Estimate ML bound 1: ĉ = decode(y) 2: if ĉ c then 3: error = error + 1; 4: if ĉy T > cy T then 5: error ml = error ml + 1; 6: end if 7: end if 5 I. Tal and A. Vardy. List decoding of polar codes. IEEE Trans. on Information Theory, 2015, Sec. 5 8 / 23
9 Distance Property of Polar codes F n = ( ) m F n n n k row deletions G k n Minimum Hamming distance of (1024, 512) Polar codes: 16 (Design SNR < 5 db) 32 (Design SNR 5 db) 9 / 23
10 Outline 1 Motivation 2 Improve the Distance Property 3 Simulation Results 4 sum-min Approx. 5 Rate Matching/IR-HARQ 6 Conclusions 10 / 23
11 Outer codes + Polar codes CRC-aided (CA)-Polar codes 6 Flexible HARQ/Adaptive-decoding Minimum Distance? 6 K. Niu and K. Chen. CRC-aided decoding of polar codes. IEEE Communications Letters, / 23
12 RM-Polar codes 7 RM codes and Polar codes are obtrained from same polarization matrix F m 2. Polar rule: freeze the unreliable bits RM rule: freeze the bits with low weight of their corresponding rows RM-Polar codes: semi-rm semi-polar rule SCL decodable Minimum Distance not Flexible 7 B. Li et al. A RM-polar codes. arxiv preprint arxiv: , / 23
13 ebch-polar codes 8 Dynamic frozen bits (k, n, d) ebch codes (k > k) with H c = uf m 2, ch T = 0 uf m 2 H T = 0, let V n (n k ) = F m 2 H T (k, n, d) ebch-polar codes SCL decodable Minimum Distance Flexible 8 P. Trifonov and V. Miloslavskaya. Polar subcodes. IEEE Journal on Selected Areas in Communications, / 23
14 Outline 1 Motivation 2 Improve the Distance Property 3 Simulation Results 4 sum-min Approx. 5 Rate Matching/IR-HARQ 6 Conclusions 14 / 23
15 Simulation Results, R = 1/2, n = (1056,528) WiMax LDPC, BP, NoIt=100 LTE-Turbo, log-map, NoIt = 10 (1024,512) Polar SCL, L=32 (1024,512, 32) RM-Polar SCL, L = 32 (1024,512, 28) ebch-polar codes SCL, L=32 (1024,512) Polar CA-SCL, L=32, CRC-16 FER SNR in db 15 / 23
16 Outline 1 Motivation 2 Improve the Distance Property 3 Simulation Results 4 sum-min Approx. 5 Rate Matching/IR-HARQ 6 Conclusions 16 / 23
17 sum-min Approximation Polar codes (x + x ) 2 ln(1 + e x ) x 2 tanh 1 [tanh x 2 tanh y 2 ] = sign(x) sign(y) min( x, y )+ ln(1 + e x+y ) ln(1 + e x y ) 17 / 23
18 sum-min Approximation for Polar codes 10 0 Polar Codes, SC (tanh rule) Polar Codes, SC (sum-min aprrox) Polar Codes, SCL, L=32 (tanh rule) 10 1 Polar Codes, SCL, L=32 (sum-min aprrox) Polar Codes+CRC, SCL, L=32 (tanh rule) Polar Codes+CRC, SCL, L=32 (sum-min aprrox) 10 2 FER SNR in db 18 / 23
19 Outline 1 Motivation 2 Improve the Distance Property 3 Simulation Results 4 sum-min Approx. 5 Rate Matching/IR-HARQ 6 Conclusions 19 / 23
20 Rate Matching/IR-HARQ k is controlled via bit-freezing n is controlled via puncturing mother code length N = 2 log 2 n, the first N n bits will be punctured IR: equivalent puncture pattern I (1) 0 + I (0) 0 I (1) 0 = 1 J I (1) 1 = J I (1) 1 ( [ ( J 1 ( [ ( J 1 I (0) 0 1 I (0) 0 )] 2 + [J 1 ( I (0) 1 )] 2 + [J 1 ( I (0) 1 )] 2 ) 1 I (0) 1 )] 2 ) 20 / 23
21 Rate 0.2 Turbo & Polar Codes 10 0 (1600, 320) LTE-Turbo codes, log-map, NoIt=10 (1600, 320) Polar CA-SCL (L=32, CRC-16) FER SNR in db 21 / 23
22 Outline 1 Motivation 2 Improve the Distance Property 3 Simulation Results 4 sum-min Approx. 5 Rate Matching/IR-HARQ 6 Conclusions 22 / 23
23 Conclusions Pros: Cons: Good Performance Efficient Design Low Complexity Encoding/Decoding no High-Throughput VLSI Architecture no Adaptive Decoding 23 / 23
Polar Code Construction for List Decoding
1 Polar Code Construction for List Decoding Peihong Yuan, Tobias Prinz, Georg Böcherer arxiv:1707.09753v1 [cs.it] 31 Jul 2017 Abstract A heuristic construction of polar codes for successive cancellation
More informationLow-Complexity Puncturing and Shortening of Polar Codes
Low-Complexity Puncturing and Shortening of Polar Codes Valerio Bioglio, Frédéric Gabry, Ingmar Land Mathematical and Algorithmic Sciences Lab France Research Center, Huawei Technologies Co. Ltd. Email:
More informationRCA Analysis of the Polar Codes and the use of Feedback to aid Polarization at Short Blocklengths
RCA Analysis of the Polar Codes and the use of Feedback to aid Polarization at Short Blocklengths Kasra Vakilinia, Dariush Divsalar*, and Richard D. Wesel Department of Electrical Engineering, University
More informationPOLAR CODES FOR ERROR CORRECTION: ANALYSIS AND DECODING ALGORITHMS
ALMA MATER STUDIORUM UNIVERSITÀ DI BOLOGNA CAMPUS DI CESENA SCUOLA DI INGEGNERIA E ARCHITETTURA CORSO DI LAUREA MAGISTRALE IN INGEGNERIA ELETTRONICA E TELECOMUNICAZIONI PER L ENERGIA POLAR CODES FOR ERROR
More informationCluster Pairwise Error Probability and Construction of Parity-Check-Concatenated Polar Codes
Cluster Pairwise Error Probability and Construction of Parity-Check-Concatenated Polar Codes Tao Wang, Daiming Qu and Tao Jiang, Senior Member, IEEE arxiv:80.04458v [cs.it] Oct 08 Abstract A successive
More informationEfficient Bit-Channel Reliability Computation for Multi-Mode Polar Code Encoders and Decoders
Efficient Bit-Channel Reliability Computation for Multi-Mode Polar Code Encoders and Decoders Carlo Condo, Seyyed Ali Hashemi, Warren J. Gross arxiv:1705.05674v1 [cs.it] 16 May 2017 Abstract Polar codes
More informationSC-Fano Decoding of Polar Codes
SC-Fano Decoding of Polar Codes Min-Oh Jeong and Song-Nam Hong Ajou University, Suwon, Korea, email: {jmo0802, snhong}@ajou.ac.kr arxiv:1901.06791v1 [eess.sp] 21 Jan 2019 Abstract In this paper, we present
More informationMinimum-Distance Based Construction of Multi-Kernel Polar Codes
Minimum-Distance Based Construction of Multi-Kernel Polar Codes Valerio Bioglio, Frédéric Gabry, Ingmar Land, Jean-Claude Belfiore Mathematical and Algorithmic Sciences Lab France Research Center, Huawei
More informationOn Bit Error Rate Performance of Polar Codes in Finite Regime
On Bit Error Rate Performance of Polar Codes in Finite Regime A. Eslami and H. Pishro-Nik Abstract Polar codes have been recently proposed as the first low complexity class of codes that can provably achieve
More informationSuccessive Cancellation Decoding of Single Parity-Check Product Codes
Successive Cancellation Decoding of Single Parity-Check Product Codes Mustafa Cemil Coşkun, Gianluigi Liva, Alexandre Graell i Amat and Michael Lentmaier Institute of Communications and Navigation, German
More informationPractical Polar Code Construction Using Generalised Generator Matrices
Practical Polar Code Construction Using Generalised Generator Matrices Berksan Serbetci and Ali E. Pusane Department of Electrical and Electronics Engineering Bogazici University Istanbul, Turkey E-mail:
More informationAn Introduction to Low Density Parity Check (LDPC) Codes
An Introduction to Low Density Parity Check (LDPC) Codes Jian Sun jian@csee.wvu.edu Wireless Communication Research Laboratory Lane Dept. of Comp. Sci. and Elec. Engr. West Virginia University June 3,
More informationPolar Codes: Graph Representation and Duality
Polar Codes: Graph Representation and Duality arxiv:1312.0372v1 [cs.it] 2 Dec 2013 M. Fossorier ETIS ENSEA/UCP/CNRS UMR-8051 6, avenue du Ponceau, 95014, Cergy Pontoise, France Email: mfossorier@ieee.org
More informationTHE polar code of [1] achieves capacity of the symmetric
Low-Complexity Concatenated Polar Codes with Excellent Scaling Behavior Sung Whan Yoon, Student Member, IEEE and Jaekyun Moon, Fellow, IEEE School of Electrical Engineering Korea Advanced Institute of
More informationPermuted Successive Cancellation Decoder for Polar Codes
Permuted Successive Cancellation Decoder for Polar Codes Harish Vangala, Emanuele Viterbo, and Yi Hong, Dept. of ECSE, Monash University, Melbourne, VIC 3800, Australia. Email: {harish.vangala, emanuele.viterbo,
More informationThe PPM Poisson Channel: Finite-Length Bounds and Code Design
August 21, 2014 The PPM Poisson Channel: Finite-Length Bounds and Code Design Flavio Zabini DEI - University of Bologna and Institute for Communications and Navigation German Aerospace Center (DLR) Balazs
More informationwhere L(y) = P Y X (y 0) C PPM = log 2 (M) ( For n b 0 the expression reduces to D. Polar Coding (2)
Polar-Coded Pulse Position odulation for the Poisson Channel Delcho Donev Institute for Communications Engineering Technical University of unich Email: delchodonev@tumde Georg Böcherer athematical and
More informationPolar Coding for the Large Hadron Collider: Challenges in Code Concatenation
Polar Coding for the Large Hadron Collider: Challenges in Code Concatenation Alexios Balatsoukas-Stimming, Tomasz Podzorny, Jan Uythoven {alexios.balatsoukas, tomasz.podzorny, jan.uythoven}@cern.ch European
More informationConstruction and Decoding of Product Codes with Non-Systematic Polar Codes
Construction and Decoding of Product Codes with on-systematic Polar Codes Valerio Bioglio, Carlo Condo, Ingmar Land Mathematical and Algorithmic Sciences Lab Huawei Technologies France SASU Email: {valerio.bioglio,carlo.condo,ingmar.land}@huawei.com
More informationImproved Successive Cancellation Flip Decoding of Polar Codes Based on Error Distribution
Improved Successive Cancellation Flip Decoding of Polar Codes Based on Error Distribution Carlo Condo, Furkan Ercan, Warren J. Gross Department of Electrical and Computer Engineering, McGill University,
More informationBandwidth Efficient and Rate-Matched Low-Density Parity-Check Coded Modulation
Bandwidth Efficient and Rate-Matched Low-Density Parity-Check Coded Modulation Georg Böcherer, Patrick Schulte, Fabian Steiner Chair for Communications Engineering patrick.schulte@tum.de April 29, 2015
More informationSerially Concatenated Polar Codes
Received September 11, 2018, accepted October 13, 2018. Date of publication xxxx 00, 0000, date of current version xxxx 00, 0000. Digital Object Identifier 10.1109/ACCESS.2018.2877720 Serially Concatenated
More informationTHE seminal paper of Gallager [1, p. 48] suggested to evaluate
IEEE TRANSACTIONS ON INFORMATION THEORY, VOL. 50, NO. 11, NOVEMBER 2004 2657 Extrinsic Information Transfer Functions: Model and Erasure Channel Properties Alexei Ashikhmin, Member, IEEE, Gerhard Kramer,
More informationState-of-the-Art Channel Coding
Institut für State-of-the-Art Channel Coding Prof. Dr.-Ing. Volker Kühn Institute of Communications Engineering University of Rostock, Germany Email: volker.kuehn@uni-rostock.de http://www.int.uni-rostock.de/
More informationTightened Upper Bounds on the ML Decoding Error Probability of Binary Linear Block Codes and Applications
on the ML Decoding Error Probability of Binary Linear Block Codes and Moshe Twitto Department of Electrical Engineering Technion-Israel Institute of Technology Haifa 32000, Israel Joint work with Igal
More informationThe Turbo Principle in Wireless Communications
The Turbo Principle in Wireless Communications Joachim Hagenauer Institute for Communications Engineering () Munich University of Technology (TUM) D-80290 München, Germany Nordic Radio Symposium, Oulu,
More informationEnhanced belief propagation decoding of polar codes by adapting the parity-check matrix
Li et al. EURASIP Journal on Wireless Communications and etworking 2017) 2017:40 DOI 10.1186/s13638-017-0825-3 RESEARCH Enhanced belief propagation decoding of polar codes by adapting the parity-check
More informationInterleaved Concatenations of Polar Codes with BCH and Convolutional Codes
1 Interleaved Concatenations of Polar Codes with BCH and Convolutional Codes Ying Wang, Krishna R. arayanan and Yu-Chih Huang Department of Electrical and Computer Engineering, Texas A&M University Department
More informationLecture 9 Polar Coding
Lecture 9 Polar Coding I-Hsiang ang Department of Electrical Engineering National Taiwan University ihwang@ntu.edu.tw December 29, 2015 1 / 25 I-Hsiang ang IT Lecture 9 In Pursuit of Shannon s Limit Since
More informationECEN 655: Advanced Channel Coding
ECEN 655: Advanced Channel Coding Course Introduction Henry D. Pfister Department of Electrical and Computer Engineering Texas A&M University ECEN 655: Advanced Channel Coding 1 / 19 Outline 1 History
More informationPerformance Analysis and Code Optimization of Low Density Parity-Check Codes on Rayleigh Fading Channels
Performance Analysis and Code Optimization of Low Density Parity-Check Codes on Rayleigh Fading Channels Jilei Hou, Paul H. Siegel and Laurence B. Milstein Department of Electrical and Computer Engineering
More informationIEEE Working Group on Mobile Broadband Wireless Access. <http://grouper.ieee.org/groups/802/20/>
C802.20-07/35 Project IEEE 802.20 Working Group on Mobile Broadband Wireless Access Title Date Submitted Practice letter ballot 2 comment LDPC harmonized text from
More informationECC for NAND Flash. Osso Vahabzadeh. TexasLDPC Inc. Flash Memory Summit 2017 Santa Clara, CA 1
ECC for NAND Flash Osso Vahabzadeh TexasLDPC Inc. 1 Overview Why Is Error Correction Needed in Flash Memories? Error Correction Codes Fundamentals Low-Density Parity-Check (LDPC) Codes LDPC Encoding and
More informationJoint FEC Encoder and Linear Precoder Design for MIMO Systems with Antenna Correlation
Joint FEC Encoder and Linear Precoder Design for MIMO Systems with Antenna Correlation Chongbin Xu, Peng Wang, Zhonghao Zhang, and Li Ping City University of Hong Kong 1 Outline Background Mutual Information
More informationLecture 4 : Introduction to Low-density Parity-check Codes
Lecture 4 : Introduction to Low-density Parity-check Codes LDPC codes are a class of linear block codes with implementable decoders, which provide near-capacity performance. History: 1. LDPC codes were
More informationConstruction of low complexity Array based Quasi Cyclic Low density parity check (QC-LDPC) codes with low error floor
Construction of low complexity Array based Quasi Cyclic Low density parity check (QC-LDPC) codes with low error floor Pravin Salunkhe, Prof D.P Rathod Department of Electrical Engineering, Veermata Jijabai
More informationAdvanced Hardware Architecture for Soft Decoding Reed-Solomon Codes
Advanced Hardware Architecture for Soft Decoding Reed-Solomon Codes Stefan Scholl, Norbert Wehn Microelectronic Systems Design Research Group TU Kaiserslautern, Germany Overview Soft decoding decoding
More informationPOLAR codes have been proven to achieve the symmetric. Reduce the Complexity of List Decoding of Polar Codes by Tree-Pruning
Reduce the Complexity of List Decoding of Polar Cos by Tree-Pruning Kai Chen, Bin Li, Hui Shen, Jie Jin, and David Tse, Fellow, IEEE arxiv:58.228v [cs.it] 9 Aug 25 Abstract Polar cos unr cyclic redundancy
More informationConstruction of Polar Codes with Sublinear Complexity
1 Construction of Polar Codes with Sublinear Complexity Marco Mondelli, S. Hamed Hassani, and Rüdiger Urbanke arxiv:1612.05295v4 [cs.it] 13 Jul 2017 Abstract Consider the problem of constructing a polar
More informationLower Bounds on the Graphical Complexity of Finite-Length LDPC Codes
Lower Bounds on the Graphical Complexity of Finite-Length LDPC Codes Igal Sason Department of Electrical Engineering Technion - Israel Institute of Technology Haifa 32000, Israel 2009 IEEE International
More informationIntroduction to Low-Density Parity Check Codes. Brian Kurkoski
Introduction to Low-Density Parity Check Codes Brian Kurkoski kurkoski@ice.uec.ac.jp Outline: Low Density Parity Check Codes Review block codes History Low Density Parity Check Codes Gallager s LDPC code
More informationMessage-Passing Decoding for Low-Density Parity-Check Codes Harish Jethanandani and R. Aravind, IIT Madras
Message-Passing Decoding for Low-Density Parity-Check Codes Harish Jethanandani and R. Aravind, IIT Madras e-mail: hari_jethanandani@yahoo.com Abstract Low-density parity-check (LDPC) codes are discussed
More informationResearch Article A Parallel Decoding Algorithm for Short Polar Codes Based on Error Checking and Correcting
e Scientific World Journal Volume 214, Article ID 895782, 14 pages http://dx.doi.org/1.1155/214/895782 Research Article A Parallel Decoding Algorithm for Short Polar Codes Based on Error Checking and Correcting
More informationPolarization-Driven Puncturing for Polar Codes in 5G Systems
Robert Mota Oliveira Polarization-Driven Puncturing for Polar Codes in 5G Systems Dissertação de Mestrado Thesis presented to the Programa de Pós graduação em Engenharia Elétrica da PUC-Rio in partial
More informationThe Concept of Soft Channel Encoding and its Applications in Wireless Relay Networks
The Concept of Soft Channel Encoding and its Applications in Wireless Relay Networks Gerald Matz Institute of Telecommunications Vienna University of Technology institute of telecommunications Acknowledgements
More informationLDPC Codes. Intracom Telecom, Peania
LDPC Codes Alexios Balatsoukas-Stimming and Athanasios P. Liavas Technical University of Crete Dept. of Electronic and Computer Engineering Telecommunications Laboratory December 16, 2011 Intracom Telecom,
More informationRaptor Codes: From a Math Idea to LTE embms. BIRS, October 2015
Raptor Codes: From a Math Idea to LTE embms BIRS, October 2015 The plan is to... 1 introduce LT codes and Raptor codes 2 provide insights into their design 3 address some common misconceptions 2 / 31 The
More informationPolar codes for reliable transmission
Polar codes for reliable transmission Theoretical analysis and applications Jing Guo Department of Engineering University of Cambridge Supervisor: Prof. Albert Guillén i Fàbregas This dissertation is submitted
More informationPolar Codes are Optimal for Lossy Source Coding
Polar Codes are Optimal for Lossy Source Coding Satish Babu Korada and Rüdiger Urbanke EPFL, Switzerland, Email: satish.korada,ruediger.urbanke}@epfl.ch Abstract We consider lossy source compression of
More informationGeneralized Tree Architecture with High-Radix Processing for an SC Polar Decoder
Generalized Tree Architecture with Hih-Radix Processin or an SC Polar ecoder Tae-Hwan Kim Korea Aerospace University Santa Clara, CA 1 Outline Backround Polar codes SC decodin / decoder architecture Proposed
More informationSymbol Interleaved Parallel Concatenated Trellis Coded Modulation
Symbol Interleaved Parallel Concatenated Trellis Coded Modulation Christine Fragouli and Richard D. Wesel Electrical Engineering Department University of California, Los Angeles christin@ee.ucla. edu,
More informationCompound Polar Codes
Compound Polar Codes Hessam Mahdavifar, Mostafa El-Khamy, Jungwon Lee, Inyup Kang Mobile Solutions Lab, Samsung Information Systems America 4921 Directors Place, San Diego, CA 92121 {h.mahdavifar, mostafa.e,
More informationPOLAR codes, which are proposed in [1], provably achieve
IEEE TRANSACTIONS ON COMMUNICATIONS 1 A Correlation-Breaking Interleaving of Polar Codes Ya Meng, Student Member, IEEE, Liping Li, Member, IEEE, Chuan Zhang, Member, IEEE arxiv:1702.05202v1 [cs.it] 17
More informationTurbo Compression. Andrej Rikovsky, Advisor: Pavol Hanus
Turbo Compression Andrej Rikovsky, Advisor: Pavol Hanus Abstract Turbo codes which performs very close to channel capacity in channel coding can be also used to obtain very efficient source coding schemes.
More informationTurbo Code Design for Short Blocks
Turbo Code Design for Short Blocks Thomas Jerkovits, Balázs Matuz Abstract This work considers the design of short parallel turbo codes (PTCs) with block lengths in the order of (a few) hundred code bits.
More informationLDPC Codes. Slides originally from I. Land p.1
Slides originally from I. Land p.1 LDPC Codes Definition of LDPC Codes Factor Graphs to use in decoding Decoding for binary erasure channels EXIT charts Soft-Output Decoding Turbo principle applied to
More informationBifurcations and Chaos in Turbo Decoding Algorithms
Bifurcations and Chaos in Turbo Decoding Algorithms Z. Tasev 1, P. Popovski 2, G.M. Maggio 3, and L. Kocarev 1 1 Institute for Nonlinear Science, University of California, San Diego, 9500 Gilman Drive,
More informationSome Goodness Properties of LDA Lattices
Some Goodness Properties of LDA Lattices Shashank Vatedka and Navin Kashyap {shashank,nkashyap}@eceiiscernetin Department of ECE Indian Institute of Science Bangalore, India Information Theory Workshop
More informationCoding Techniques for Data Storage Systems
Coding Techniques for Data Storage Systems Thomas Mittelholzer IBM Zurich Research Laboratory /8 Göttingen Agenda. Channel Coding and Practical Coding Constraints. Linear Codes 3. Weight Enumerators and
More informationAdvances in Error Control Strategies for 5G
Advances in Error Control Strategies for 5G Jörg Kliewer The Elisha Yegal Bar-Ness Center For Wireless Communications And Signal Processing Research 5G Requirements [Nokia Networks: Looking ahead to 5G.
More informationA New Performance Evaluation Metric for Sub-Optimal Iterative Decoders
A New Performance Evaluation Metric for Sub-Optimal Iterative Decoders Ashwani Singh, Ali Al-Ghouwayel, G. Masera, Emmanuel Boutillon To cite this version: Ashwani Singh, Ali Al-Ghouwayel, G. Masera, Emmanuel
More informationEfficient Log Likelihood Ratio Estimation for Polar Codes
Efficient Log Likelihood Ratio Estimation for Polar Codes by Alaa Abdulameer Hasan, M. Sc. A dissertation submitted to the Faculty of Graduate Studies and Research in partial fulfillment of the requirements
More informationOne-Bit LDPC Message Passing Decoding Based on Maximization of Mutual Information
One-Bit LDPC Message Passing Decoding Based on Maximization of Mutual Information ZOU Sheng and Brian M. Kurkoski kurkoski@ice.uec.ac.jp University of Electro-Communications Tokyo, Japan University of
More informationNew Designs for Bit-Interleaved Coded Modulation with Hard-Decision Feedback Iterative Decoding
1 New Designs for Bit-Interleaved Coded Modulation with Hard-Decision Feedback Iterative Decoding Alireza Kenarsari-Anhari, Student Member, IEEE, and Lutz Lampe, Senior Member, IEEE Abstract Bit-interleaved
More informationAnalytical Bounds on Maximum-Likelihood Decoded Linear Codes: An Overview
Analytical Bounds on Maximum-Likelihood Decoded Linear Codes: An Overview Igal Sason Department of Electrical Engineering, Technion Haifa 32000, Israel Sason@ee.technion.ac.il December 21, 2004 Background
More informationDigital Communications III (ECE 154C) Introduction to Coding and Information Theory
Digital Communications III (ECE 154C) Introduction to Coding and Information Theory Tara Javidi These lecture notes were originally developed by late Prof. J. K. Wolf. UC San Diego Spring 2014 1 / 8 I
More informationQuasi-cyclic Low Density Parity Check codes with high girth
Quasi-cyclic Low Density Parity Check codes with high girth, a work with Marta Rossi, Richard Bresnan, Massimilliano Sala Summer Doctoral School 2009 Groebner bases, Geometric codes and Order Domains Dept
More informationFEEDBACK does not increase the capacity of a discrete
1 Sequential Differential Optimization of Incremental Redundancy Transmission Lengths: An Example with Tail-Biting Convolutional Codes Nathan Wong, Kasra Vailinia, Haobo Wang, Sudarsan V. S. Ranganathan,
More informationDynamic-SCFlip Decoding of Polar Codes
Dynamic-SCFlip Decoding of Polar Codes L. Chandesris, V. Savin, D. Declercq ludovic.chandesris@cea.fr, valentin.savin@cea.fr, declercq@ensea.fr CEA-LETI / Minatec, Grenoble, France arxiv:703.0444v [cs.it]
More informationIntroduction to Wireless & Mobile Systems. Chapter 4. Channel Coding and Error Control Cengage Learning Engineering. All Rights Reserved.
Introduction to Wireless & Mobile Systems Chapter 4 Channel Coding and Error Control 1 Outline Introduction Block Codes Cyclic Codes CRC (Cyclic Redundancy Check) Convolutional Codes Interleaving Information
More informationNon-Linear Turbo Codes for Interleaver-Division Multiple Access on the OR Channel.
UCLA Graduate School of Engineering - Electrical Engineering Program Non-Linear Turbo Codes for Interleaver-Division Multiple Access on the OR Channel. Miguel Griot, Andres I. Vila Casado, and Richard
More informationOptimum Soft Decision Decoding of Linear Block Codes
Optimum Soft Decision Decoding of Linear Block Codes {m i } Channel encoder C=(C n-1,,c 0 ) BPSK S(t) (n,k,d) linear modulator block code Optimal receiver AWGN Assume that [n,k,d] linear block code C is
More informationTHIS paper provides a general technique for constructing
Protograph-Based Raptor-Like LDPC Codes for the Binary Erasure Channel Kasra Vakilinia Department of Electrical Engineering University of California, Los Angeles Los Angeles, California 90024 Email: vakiliniak@ucla.edu
More information16.36 Communication Systems Engineering
MIT OpenCourseWare http://ocw.mit.edu 16.36 Communication Systems Engineering Spring 2009 For information about citing these materials or our Terms of Use, visit: http://ocw.mit.edu/terms. 16.36: Communication
More informationBelief propagation decoding of quantum channels by passing quantum messages
Belief propagation decoding of quantum channels by passing quantum messages arxiv:67.4833 QIP 27 Joseph M. Renes lempelziv@flickr To do research in quantum information theory, pick a favorite text on classical
More informationAdaptive Cut Generation for Improved Linear Programming Decoding of Binary Linear Codes
Adaptive Cut Generation for Improved Linear Programming Decoding of Binary Linear Codes Xiaojie Zhang and Paul H. Siegel University of California, San Diego, La Jolla, CA 9093, U Email:{ericzhang, psiegel}@ucsd.edu
More informationAn algorithm to improve the error rate performance of Accumulate-Repeat-Accumulate codes Tae-Ui Kim
An algorithm to improve the error rate performance of Accumulate-Repeat-Accumulate codes Tae-Ui Kim The Graduate School Yonsei University Department of Electrical and Electronic Engineering An algorithm
More informationarxiv: v1 [cs.it] 14 May 2018
Quantum Information and Computation, Vol. 0, No. 0 (2003) 000 000 c Rinton Press IMPROVED RECONCILIATION WITH POLAR CODES IN QUANTUM KEY DISTRIBUTION arxiv:1805.05046v1 [cs.it] 14 May 2018 SUNGHOON LEE
More informationInformation Theoretic Imaging
Information Theoretic Imaging WU Faculty: J. A. O Sullivan WU Doctoral Student: Naveen Singla Boeing Engineer: James Meany First Year Focus: Imaging for Data Storage Image Reconstruction Data Retrieval
More informationAPPLICATIONS. Quantum Communications
SOFT PROCESSING TECHNIQUES FOR QUANTUM KEY DISTRIBUTION APPLICATIONS Marina Mondin January 27, 2012 Quantum Communications In the past decades, the key to improving computer performance has been the reduction
More informationMaximum Likelihood Decoding of Codes on the Asymmetric Z-channel
Maximum Likelihood Decoding of Codes on the Asymmetric Z-channel Pål Ellingsen paale@ii.uib.no Susanna Spinsante s.spinsante@univpm.it Angela Barbero angbar@wmatem.eis.uva.es May 31, 2005 Øyvind Ytrehus
More informationGraph-based codes for flash memory
1/28 Graph-based codes for flash memory Discrete Mathematics Seminar September 3, 2013 Katie Haymaker Joint work with Professor Christine Kelley University of Nebraska-Lincoln 2/28 Outline 1 Background
More informationIntegrated Code Design for a Joint Source and Channel LDPC Coding Scheme
Integrated Code Design for a Joint Source and Channel LDPC Coding Scheme Hsien-Ping Lin Shu Lin and Khaled Abdel-Ghaffar Department of Electrical and Computer Engineering University of California Davis
More informationSingle-Gaussian Messages and Noise Thresholds for Low-Density Lattice Codes
Single-Gaussian Messages and Noise Thresholds for Low-Density Lattice Codes Brian M. Kurkoski, Kazuhiko Yamaguchi and Kingo Kobayashi kurkoski@ice.uec.ac.jp Dept. of Information and Communications Engineering
More informationIEEE Broadband Wireless Access Working Group <
Project Title IEEE 80.6 Broadband Wireless Access Working Group LDPC coding for OFDMA PHY Date Submitted Source(s) 004-08-7 Brian Classon Yufei Blankenship Motorola Jerry Kim Gyubum
More informationTightened Upper Bounds on the ML Decoding Error Probability of Binary Linear Block Codes and Applications
on the ML Decoding Error Probability of Binary Linear Block Codes and Department of Electrical Engineering Technion-Israel Institute of Technology An M.Sc. Thesis supervisor: Dr. Igal Sason March 30, 2006
More informationPerformance Comparison of LDPC Codes Generated With Various Code-Construction Methods
Performance Comparison of LDPC Codes Generated With Various Code-Construction Methods Zsolt Polgar, Florin rdelean, Mihaly Varga, Vasile Bota bstract Finding good LDPC codes for high speed mobile transmissions
More informationA Relation between Conditional and Unconditional Soft Bit Densities of Binary Input Memoryless Symmetric Channels
A Relation between Conditional and Unconditional Soft Bit Densities of Binary Input Memoryless Symmetric Channels Wolfgang Rave Vodafone Chair Mobile Communications Systems, Technische Universität Dresden
More informationDecomposition Methods for Large Scale LP Decoding
Decomposition Methods for Large Scale LP Decoding Siddharth Barman Joint work with Xishuo Liu, Stark Draper, and Ben Recht Outline Background and Problem Setup LP Decoding Formulation Optimization Framework
More informationEfficient Computation of EXIT Functions for Non-Binary Iterative Decoding
TO BE PUBLISHED IN IEEE TRANSACTIONS ON COMMUNCATIONS, DECEMBER 2006 Efficient Computation of EXIT Functions for Non-Binary Iterative Decoding Jörg Kliewer, Senior Member, IEEE, Soon Xin Ng, Member, IEEE,
More informationRate-Compatible Low Density Parity Check Codes for Capacity-Approaching ARQ Schemes in Packet Data Communications
Rate-Compatible Low Density Parity Check Codes for Capacity-Approaching ARQ Schemes in Packet Data Communications Jing Li (Tiffany) Electrical Engineering Dept, Texas A&M University College Station, TX
More informationPerformance of Polar Codes for Channel and Source Coding
Performance of Polar Codes for Channel and Source Coding Nadine Hussami AUB, Lebanon, Email: njh03@aub.edu.lb Satish Babu Korada and üdiger Urbanke EPFL, Switzerland, Email: {satish.korada,ruediger.urbanke}@epfl.ch
More informationNew Puncturing Pattern for Bad Interleavers in Turbo-Codes
SERBIAN JOURNAL OF ELECTRICAL ENGINEERING Vol. 6, No. 2, November 2009, 351-358 UDK: 621.391.7:004.052.4 New Puncturing Pattern for Bad Interleavers in Turbo-Codes Abdelmounaim Moulay Lakhdar 1, Malika
More informationDistributed Arithmetic Coding
Distributed Arithmetic Coding Marco Grangetto, Member, IEEE, Enrico Magli, Member, IEEE, Gabriella Olmo, Senior Member, IEEE Abstract We propose a distributed binary arithmetic coder for Slepian-Wolf coding
More informationConstellation Shaping for Communication Channels with Quantized Outputs
Constellation Shaping for Communication Channels with Quantized Outputs, Dr. Matthew C. Valenti and Xingyu Xiang Lane Department of Computer Science and Electrical Engineering West Virginia University
More informationOn the Joint Decoding of LDPC Codes and Finite-State Channels via Linear Programming
On the Joint Decoding of LDPC Codes and Finite-State Channels via Linear Programming Byung-Hak Kim (joint with Henry D. Pfister) Texas A&M University College Station International Symposium on Information
More informationPolar Codes: Construction and Performance Analysis
Master Project Polar Codes: Construction and Performance Analysis Ramtin Pedarsani ramtin.pedarsani@epfl.ch Supervisor: Prof. Emre Telatar Assistant: Hamed Hassani Information Theory Laboratory (LTHI)
More informationA Non-Asymptotic Approach to the Analysis of Communication Networks: From Error Correcting Codes to Network Properties
University of Massachusetts Amherst ScholarWorks@UMass Amherst Open Access Dissertations 5-2013 A Non-Asymptotic Approach to the Analysis of Communication Networks: From Error Correcting Codes to Network
More informationLDPC Code Ensembles that Universally Achieve Capacity under BP Decoding: A Simple Derivation
LDPC Code Ensembles that Universally Achieve Capacity under BP Decoding: A Simple Derivation Anatoly Khina EE Systems Dept., TAU Tel Aviv, Israel Email: anatolyk@eng.tau.ac.il Yair Yona Dept. of EE, UCLA
More informationDistance Properties of Short LDPC Codes and Their Impact on the BP, ML and Near-ML Decoding Performance
Distance Properties of Short LDPC Codes and Their Impact on the BP, ML and Near-ML Decoding Performance Irina E. Bocharova 1,2, Boris D. Kudryashov 1, Vitaly Skachek 2, Yauhen Yakimenka 2 1 St. Petersburg
More information