Coding and Detection for Multi-track Digital Data Storage
|
|
- Hannah Robinson
- 6 years ago
- Views:
Transcription
1 Coding and Detection for Multi-track Digital Data Storage Tom Conway ECE Dept, University of Limerick, Ireland 1
2 Outline Multi-track Digital Data Storage Detection Coding Performance Conclusions 2
3 Multi-track Digital Data Storage N R rows Multi row track Broad Spiral Read Heads Figure 1: (a) Optical (TwoDOS) (b) Magnetic 3
4 System Under Consideration Storage Medium Read Transducer Read Channel ECC Decode Servo Write Transducer Write Channel ECC Encode User Data User Data 4
5 Multitrack Read Channel r0(t) CTF ADC SRC r1(t) CTF ADC JOINT EQUALIZER SRC JOINT DETECTOR SRC r2(t) CTF ADC SRC r3(t) CTF ADC SRC r4(t) CTF ADC SRC F SAMPLE ADAPTION CONTROL/ Servo a0 k a1 k a2 k a3 k a4 k 5
6 TwoDOS PREAMBLE SYNC DATA Acquire Gain / Offset / Symbol Timing Acquire Bit Allignment Detect User Data Figure 2: TwoDOS Hexagonal 7 row data format 6
7 Parallel Read with multiple (split) beams Figure 3: 2D Intersymbol Interference 7
8 8 H(f_x,f_y) f_y f_x 1 Figure 4: Optical 2D freq response (Braat-Hopkins) Model fc = 2NA λ
9 Data Detection in Presence of 2D ISI Full Viterbi Detection Nstate = 2 2N R N branch/state = 2 N R i.e branches for NR = 7 STATE INPUT 9
10 One Option (2D Partial Response Detection) Equalize to 2D partial response target that is: Similar to channel response More practical for (suboptimal?) detector implementation Two Partial Responses proposed Hexagonal Duobinary Hexagonal Tribinary 10
11 Hexagonal Duobinary H(Dx, Du, Dv) = Du DxDu 1 2Dx D 2 x U or Dv Dv Dx X V 11
12 Hexagonal Duobinary Frequency Response H(f_x,f_y) f_y f_x 1 12
13 13 Fortunately 1+Du+Dv+2Dx+DxDu+DvDx+D 2 x = (1 + Du)(1 + Dv)(1 + Dx) Input Samples MAP -1 MAP π π 1+D v ε{ 0,1...8 } ε { 0,1...4 } 1 1+D u 2-1 Viterbi 1+D x ε ε { 0,1,2 } { 0,1 }
14 Iterative Detector (Soft Output) Input Samples π 1 MAP 1+D v - π -1 1 ε ε { 0,1...8 } π 2 MAP 1+D u - π -1 2 π 3 MAP 1+D x - π -1 3 { 0,1...8 } 14
15 SNR (db) 1E E-06 Ideal Detector Iterative detector Nr=7 Full Viterbi Nr=7 1E-05 BER 1E-04 1E-03 1E-02 1E-01 Coding and Detection for Multi-track Digital Data Storage AWGN Performance 15
16 16 Hexagonal Duobinary Summary Features: Nulls at Nyquist Freq in each direction. Soft Output Iterative detector. Complexity linear in NR. But 9 level output signal and sensitive to equalization and nonlinearities. Complex HW implementation. Detector 1dB loss. Suitable for highest densities.
17 Hexagonal Tribinary H(Dx, Du, Dv) = 1 D x Dv or
18 Hexagonal Tribinary Frequency Response H(f_x,f_y) f_y f_x 1 18
19 Hexagonal Tribinary Detection yr,c = ar,c + ar,c+1 + ar+1,c + nr,c a r,c a r,c+1 y r,c a r+1,c 19
20 20 Apply Sum Product Algorithm Define: F1(ar,c+1, ar+1,c, yr,c) = max( L k 0(ar,c+1) + L k 0(ar+1,c) (yr,c 1.0) 2, L k 0(ar,c+1) + L k 1(ar+1,c) (yr,c 2.0) 2, L k 1(ar,c+1) + L k 0(ar+1,c) (yr,c 2.0) 2, L k 1(ar,c+1) + L k 1(ar+1,c) (yr,c 3.0) 2 ) and F0(ar,c+1, ar+1,c, yr,c) = max( L k 0(ar,c+1) + L k 0(ar+1,c) (yr,c 0.0) 2, L k 0(ar,c+1) + L k 1(ar+1,c) (yr,c 1.0) 2, L k 1(ar,c+1) + L k 0(ar+1,c) (yr,c 1.0) 2, L k 1(ar,c+1) + L k 1(ar+1,c) (yr,c 2.0) 2 )
21 21 Iterate with: L k+1 1 (ar,c) = L k 1(ar,c) + F1(ar,c+1, ar+1,c, yr,c) +F1(ar 1,c, ar 1,c+1, yr 1,c) + F1(ar,c 1, ar+1,c 1, yr,c 1) and L k+1 0 (ar,c) = L k 0(ar,c) + F0(ar,c+1, ar+1,c, yr,c) +F0(ar 1,c, ar 1,c+1, yr 1,c) + F0(ar,c 1, ar+1,c 1, yr,c 1)
22 SNR (db) 1e e-07 Sliding Window Detector Nr=11 Ideal Detector Sum Prod detector Nr=11 Full Viterbi Nr=7 1e-06 BER 1e Coding and Detection for Multi-track Digital Data Storage AWGN Performance 22
23 Hexagonal Tribinary Summary Features: 4 level output signal. Robust to equalization and nonlinearities. Soft Output Iterative detector with good performance. Complexity linear in NR. But No Nulls in Freq Response. Suitable for moderate densities. 23
24 Bit Area (um^2) C/No (db) Hex MLSD Hex Duobinary Iterative Duobinary Hex Tribinary Iterative Tribinary 60 Coding and Detection for Multi-track Digital Data Storage Performance vs Areal Density 24
25 1D Time Varying Trellis 0 0 State N r rows time varying trellis α α 1 α 0 α (2N R +6) 2 states Input Output 2 branches/state 25
26 M-Algorithm Detection Canidate Path 0 Γ λ 0 λ... λ 1 8 λ 0 λ... λ 1 8 Σ Σ 2M metrics Top M Selected Canidate Path 1 Γ Σ Σ /Selector 2M Sorter λ 0 λ... λ 1 8 Γ Canidate Path M 1 Σ Σ 26
27 Experimental Results 27
28 28
29 Software Read Channel ADC Integer Allign Noise Filter Fine Allign VOL EQUALIZE SRC DETECT AGC PRE DET LMS GAIN OFFSET ERR CALC SYSTEM TIMING 29 SYNC
30 Tribinary Architecture with NTT 7 EQ Inputs 8 Eq Outputs Sample Rate Converter 8 Baud Samples Final Detected Bits 7 Input Rows Σ Σ Σ 2D Transform Domain Equalizer τ τ τ Tribinary Partial Resp Detector 7 Detected Bits Acquisition Control Tracking control Threshold Det Control Loops Early Preliminary Decisions Timing Sequencer 8 Errors 30
31 Coding and Detection for Multi-track Digital Data Storage 31 Experimental Perf. 35GB/disc BER Equalized Samples Time Index
32 1E M ber 1E 04 1E 03 Coding and Detection for Multi-track Digital Data Storage ber with Tribinary target and M detector 35GB/disc 32
33 Minimum Phase Equalization
34 1E M 1E 04 ber 1E 03 1E 02 SW FP M alg M alg Min Phase 1E 01 TwoDOS 50GB Performance w. Min Phase M-Detector Coding and Detection for Multi-track Digital Data Storage 34
35 35 Coding Work Require Sector ber of assuming 20Kbit Sector size and outer RS for major defect correction. Inner RS code LDPC Proposed Short Trellis Code + Inner RS code The allowable inner code rate is 0.9.
36 36 A High Rate Trellis Code for 2D Optical Storage Consider the Tribinary channel response: h = Let the channel input be xi,j {0, 1} The channel output yi,j is y = x h with denoting 2 dimensional convolution.
37 37 Let e denote an error event at the channel output e = y ŷ Let ai,j { 1, 0, 1} be the channel error input x ˆx e = a h (1) Minimum distance is d min = 3 with a = ±{1} with the corresponding channel output error event of e = ± 1 1 1
38 A computer search shows : a = ± 0 +1, +1 0, , e = ± {[ have channel output error events of ] [ ] [ , , all of which have a distance of d = 4 38, ] }
39 39 Principle: Design a short high rate soft decision code to detect most likely ( small distance ) events and combine with data detector. EG 1 The use of a single bit parity check code would increase the minimum distance from 3 to 4 or provide a coding gain of approximately 20 log = 1.24dB The rate of such a code is N 1 N
40 EG 2 40 If the 3 weigh 4 events could be detected and avoided, then a higher coding gain of 20 log = 2.22dB could be achieved. (Note that a larger number of weigh 5 error events exist). Proposed Code Consider a tiling of the hexagonal lattice with the tile 1 2 3,
41 Letting the tiling pattern be denoted Ti,j {1, 2, 3}. Note that with this tiling pattern, any three adjacent bits will have a different tiling value.
42 42 Now consider the code C such that a codeword c C if and only if ci,jti,j i j 4 = 0 (2) Given a received code word r which is corrupted with the error a, then ri,jti,j = (ci,j + ai,j)ti,j = ai,jti,j 4 4 i j i j i j 4
43 43 ai,jti,j { ± (1 2) 4, ± (1 3) 4, ± (2 3) 4} 4 sum will have the values Hence for each of the distance 4 input error patterns, the modulo i j i j or ai,jti,j 4 {1, 2, 3} Hence the use of the proposed code allows the detection of all weight 4 input error patterns as well as the single bit error patterns of weight 3.
44 44 Code Rate check bits Hence a code rate R = N 2 N is easily achieved. NB: Defining the code as i j i,jti,j c 4 = 1 with suitable N and NR can also guarantee a k run length constraint.
45 45 1 Decoding the Code Expanding the trellis of the channel state such that each original state has 4 states. Could use Sum Product algorithm. Here used M-algorithm with a time-varying trellis representing the two dimensional channel (M = 16*4 = 64 used here) ( Hard decision output). Alternatively, a post processor type implementations could be applied.
46 1E SNR (db) 1E 05 ber 1E 04 1E 03 Uncoded 22/24 46/48 62/64 78/80 94/96 1E 02 Coding and Detection for Multi-track Digital Data Storage Simulated Performance AWGN bit Error Rate 46
47 1E SNR (db) 1E 05 ver 1E 04 1E 03 Uncoded 22/24 46/48 62/64 78/80 94/96 1E 02 Coding and Detection for Multi-track Digital Data Storage Simulated Performance AWGN Event Error Rate 47
48 Code Rate 1E 05 1E 04 ber 1E 03 1E 02 Disc 5 Disc 3 Disc 4 Disc Dec centered Disc Dec off center Performance on Real data Coding and Detection for Multi-track Digital Data Storage 48
49 Tiled Trellis Code + Interleaved RS TriBinary + Tiled Code Constraint (M algorithm detector) Interleaved RS decoder (255,k) GF(256) N ~ (I =10) Overall Rate =
50 LDPC coding with Tribinary Sum Product Tribinary Detector with SOFT outputs LDPC Decoder N ~ Use Sum Product detector with soft output. 50
51 1E SNR (db) 1E 05 1E 04 ber 1E 03 1E 02 Uncoded RS 4K LDPC 62/64+RS 20K LDPC 20K LDPC itr 1E 01 Simulated Performance AWGN Coding and Detection for Multi-track Digital Data Storage 51
52 1E SNR (db) 1E 05 1E 04 ber 1E 03 1E 02 Uncoded RS 62/64+RS 20K LDPC 20K LDPC itr 1E 01 Simulated Performance + defects 1E-5 Coding and Detection for Multi-track Digital Data Storage 52
53 1E SNR (db) 1E 06 1E 05 ber 1E 04 1E 03 1E 02 Uncoded RS 62/64+RS 20K LDPC 20K LDPC itr 1E 01 Simulated Performance + defects 1E-3 Coding and Detection for Multi-track Digital Data Storage 53
54 Aspect Ratio Options 54
55 Perpendicular Recording line 1 h(x,y) x y Hexagonal Lattice Perpendicular Recording Similar to optical response! 1 55
56 Summary/Conclusions Multi-track Data Storage detection system demonstrated. Number of detection methods proposed. Implementation complexity should be feasible in near future. FPGA demonstrations of some key blocks. Would like to do full channel FPGA demonstrator. Some novel implementation concepts developed. 56
57 Summary/Conclusions (cntd.) Example high rate trellis coded system developed. Comparison with LDPC with AGWN plus defects. Potential for Optical Disc Multi-track Tape Magnetic Disk Holographic (Extend to 3D) 57
58 58 Project Teams (UL) Science Foundation Ireland (SFI) Grant 02/IN.1/I40. Principle Researcher: Tom Conway Academic Staff : Richard Conway Postgraduate Students Sebastien Tosi, Martin Power & Yann Mulero European IST-Project called TwoDOS (Project No. IST ). Principle Researcher: Tom Conway Academic Staff : Richard Conway Postgraduate Students Yann Mulero, Justin Hogan & Patrick Connolly
59 Acknowledgments 59 Some of this work is part of a European IST-Project called TwoDOS (Project No. IST ). All project members (Philips Research, University of Limerick, Eindhoven University of Technology, University of Lancaster, Philips ODTC and HW Communications) are acknowledged for their valuable contributions to this work. In particular: Wim Coene, Andre Immink, Andries Hekstra, Jan Bergmans, Jamal Riani, Steven van Beneden, Alexander van der Lee & Christopher Busch. Philips ODTC and Sony Corp for producing prototype discs. Some of this work is also supported by Science Foundation Ireland (SFI) under the grant 02/IN.1/I40.
Information 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 informationJoint Equalization and Decoding for Nonlinear Two-Dimensional Intersymbol Interference Channels with Application to Optical Storage
Joint Equalization and Decoding for Nonlinear Two-Dimensional Intersymbol Interference Channels with Application to Optical Storage 1 arxiv:cs/0509008v1 [cs.it] 4 Sep 2005 Naveen Singla and Joseph A. O
More informationThe E8 Lattice and Error Correction in Multi-Level Flash Memory
The E8 Lattice and Error Correction in Multi-Level Flash Memory Brian M. Kurkoski kurkoski@ice.uec.ac.jp University of Electro-Communications Tokyo, Japan ICC 2011 IEEE International Conference on Communications
More information2D Coding and Iterative Detection Schemes
2D Coding and Iterative Detection Schemes J. A. O Sullivan, N. Singla, Y. Wu, and R. S. Indeck Washington University Magnetics and Information Science Center Nanoimprinting and Switching of Patterned Media
More informationIterative Timing Recovery
Iterative Timing Recovery John R. Barry School of Electrical and Computer Engineering, Georgia Tech Atlanta, Georgia U.S.A. barry@ece.gatech.edu 0 Outline Timing Recovery Tutorial Problem statement TED:
More informationTurbo Codes for xdsl modems
Turbo Codes for xdsl modems Juan Alberto Torres, Ph. D. VOCAL Technologies, Ltd. (http://www.vocal.com) John James Audubon Parkway Buffalo, NY 14228, USA Phone: +1 716 688 4675 Fax: +1 716 639 0713 Email:
More informationTiming Recovery at Low SNR Cramer-Rao bound, and outperforming the PLL
T F T I G E O R G A I N S T I T U T E O H E O F E A L P R O G R ESS S A N D 1 8 8 5 S E R V L O G Y I C E E C H N O Timing Recovery at Low SNR Cramer-Rao bound, and outperforming the PLL Aravind R. Nayak
More information1 1 0, g Exercise 1. Generator polynomials of a convolutional code, given in binary form, are g
Exercise Generator polynomials of a convolutional code, given in binary form, are g 0, g 2 0 ja g 3. a) Sketch the encoding circuit. b) Sketch the state diagram. c) Find the transfer function TD. d) What
More informationBlind phase/frequency synchronization with low-precision ADC: a Bayesian approach
Blind phase/frequency synchronization with low-precision ADC: a Bayesian approach Aseem Wadhwa, Upamanyu Madhow Department of ECE, UCSB 1/26 Modern Communication Receiver Architecture Analog Digital TX
More informationThe E8 Lattice and Error Correction in Multi-Level Flash Memory
The E8 Lattice and Error Correction in Multi-Level Flash Memory Brian M Kurkoski University of Electro-Communications Tokyo, Japan kurkoski@iceuecacjp Abstract A construction using the E8 lattice and Reed-Solomon
More informationChapter 7: Channel coding:convolutional codes
Chapter 7: : Convolutional codes University of Limoges meghdadi@ensil.unilim.fr Reference : Digital communications by John Proakis; Wireless communication by Andreas Goldsmith Encoder representation Communication
More informationDigital Communications
Digital Communications Chapter 8: Trellis and Graph Based Codes Saeedeh Moloudi May 7, 2014 Outline 1 Introduction 2 Convolutional Codes 3 Decoding of Convolutional Codes 4 Turbo Codes May 7, 2014 Proakis-Salehi
More informationChannel Coding and Interleaving
Lecture 6 Channel Coding and Interleaving 1 LORA: Future by Lund www.futurebylund.se The network will be free for those who want to try their products, services and solutions in a precommercial stage.
More informationThese outputs can be written in a more convenient form: with y(i) = Hc m (i) n(i) y(i) = (y(i); ; y K (i)) T ; c m (i) = (c m (i); ; c m K(i)) T and n
Binary Codes for synchronous DS-CDMA Stefan Bruck, Ulrich Sorger Institute for Network- and Signal Theory Darmstadt University of Technology Merckstr. 25, 6428 Darmstadt, Germany Tel.: 49 65 629, Fax:
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 informationConstrained Coding Techniques for Advanced Data Storage Devices
Constrained Coding Techniques for Advanced Data Storage Devices Paul H. Siegel Director, CMRR Electrical and Computer Engineering University of California, San Diego 2/8/05 Outline Digital recording channel
More informationA REDUCED COMPLEXITY TWO-DIMENSIONAL BCJR DETECTOR FOR HOLOGRAPHIC DATA STORAGE SYSTEMS WITH PIXEL MISALIGNMENT
A REDUCED COMPLEXITY TWO-DIMENSIONAL BCJR DETECTOR FOR HOLOGRAPHIC DATA STORAGE SYSTEMS WITH PIXEL MISALIGNMENT 1 S. Iman Mossavat, 2 J.W.M.Bergmans 1 iman@nus.edu.sg 1 National University of Singapore,
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 information홀로그램저장재료. National Creative Research Center for Active Plasmonics Applications Systems
홀로그램저장재료 Holographic materials Material Reusable Processing Type of Exposure Spectral Resol. Max. diff. hologram (J/m2) sensitivity (lim./mm) efficiency Photographic emulsion Dichromated gelatin Photoresists
More informationSignal Processing for Digital Data Storage (11)
Outline Signal Processing for Digital Data Storage (11) Assist.Prof. Piya Kovintavewat, Ph.D. Data Storage Technology Research Unit Nahon Pathom Rajabhat University Partial-Response Maximum-Lielihood (PRML)
More informationStaircase Codes. for High-Speed Optical Communications
Staircase Codes for High-Speed Optical Communications Frank R. Kschischang Dept. of Electrical & Computer Engineering University of Toronto (Joint work with Lei Zhang, Benjamin Smith, Arash Farhood, Andrew
More informationDr. Cathy Liu Dr. Michael Steinberger. A Brief Tour of FEC for Serial Link Systems
Prof. Shu Lin Dr. Cathy Liu Dr. Michael Steinberger U.C.Davis Avago SiSoft A Brief Tour of FEC for Serial Link Systems Outline Introduction Finite Fields and Vector Spaces Linear Block Codes Cyclic Codes
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 informationCoding theory: Applications
INF 244 a) Textbook: Lin and Costello b) Lectures (Tu+Th 12.15-14) covering roughly Chapters 1,9-12, and 14-18 c) Weekly exercises: For your convenience d) Mandatory problem: Programming project (counts
More informationTurbo Codes. Manjunatha. P. Professor Dept. of ECE. June 29, J.N.N. College of Engineering, Shimoga.
Turbo Codes Manjunatha. P manjup.jnnce@gmail.com Professor Dept. of ECE J.N.N. College of Engineering, Shimoga June 29, 2013 [1, 2, 3, 4, 5, 6] Note: Slides are prepared to use in class room purpose, may
More informationStructured Low-Density Parity-Check Codes: Algebraic Constructions
Structured Low-Density Parity-Check Codes: Algebraic Constructions Shu Lin Department of Electrical and Computer Engineering University of California, Davis Davis, California 95616 Email:shulin@ece.ucdavis.edu
More informationUtilizing Correct Prior Probability Calculation to Improve Performance of Low-Density Parity- Check Codes in the Presence of Burst Noise
Utah State University DigitalCommons@USU All Graduate Theses and Dissertations Graduate Studies 5-2012 Utilizing Correct Prior Probability Calculation to Improve Performance of Low-Density Parity- Check
More informationLow-density parity-check (LDPC) codes
Low-density parity-check (LDPC) codes Performance similar to turbo codes Do not require long interleaver to achieve good performance Better block error performance Error floor occurs at lower BER Decoding
More informationSIPCom8-1: Information Theory and Coding Linear Binary Codes Ingmar Land
SIPCom8-1: Information Theory and Coding Linear Binary Codes Ingmar Land Ingmar Land, SIPCom8-1: Information Theory and Coding (2005 Spring) p.1 Overview Basic Concepts of Channel Coding Block Codes I:
More information2013/Fall-Winter Term Monday 12:50 Room# or 5F Meeting Room Instructor: Fire Tom Wada, Professor
SYSTEM ARCHITECTURE ADVANCED SYSTEM ARCHITECTURE Error Correction Code 1 01/Fall-Winter Term Monday 1:50 Room# 1- or 5F Meeting Room Instructor: Fire Tom Wada, Professor 014/1/0 System Arch 1 Introduction
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 informationDATA receivers for digital transmission and storage systems
IEEE TRANSACTIONS ON CIRCUITS AND SYSTEMS II: EXPRESS BRIEFS, VOL. 52, NO. 10, OCTOBER 2005 621 Effect of Loop Delay on Phase Margin of First-Order Second-Order Control Loops Jan W. M. Bergmans, Senior
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 informationLow-density parity-check codes
Low-density parity-check codes From principles to practice Dr. Steve Weller steven.weller@newcastle.edu.au School of Electrical Engineering and Computer Science The University of Newcastle, Callaghan,
More informationInterleave Division Multiple Access. Li Ping, Department of Electronic Engineering City University of Hong Kong
Interleave Division Multiple Access Li Ping, Department of Electronic Engineering City University of Hong Kong 1 Outline! Introduction! IDMA! Chip-by-chip multiuser detection! Analysis and optimization!
More informationCHAPTER 8 Viterbi Decoding of Convolutional Codes
MIT 6.02 DRAFT Lecture Notes Fall 2011 (Last update: October 9, 2011) Comments, questions or bug reports? Please contact hari at mit.edu CHAPTER 8 Viterbi Decoding of Convolutional Codes This chapter describes
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 informationLDPC Decoding Strategies for Two-Dimensional Magnetic Recording
SUBMITTED TO IEEE GLOBAL COMMUNICATIONS CONFERENCE, HONOLULU, HI, USA, NOV. 3-DEC. 4 29, 1 LDPC Decoding Strategies for Two-Dimensional Magnetic Recording Anantha Raman Krishnan, Rathnakumar Radhakrishnan,
More informationPreliminary Studies on DFE Error Propagation, Precoding, and their Impact on KP4 FEC Performance for PAM4 Signaling Systems
Preliminary Studies on DFE Error Propagation, Precoding, and their Impact on KP4 FEC Performance for PAM4 Signaling Systems Geoff Zhang September, 2018 Outline 1/(1+D) precoding for PAM4 link systems 1/(1+D)
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 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 informationCommunication by Regression: Sparse Superposition Codes
Communication by Regression: Sparse Superposition Codes Department of Statistics, Yale University Coauthors: Antony Joseph and Sanghee Cho February 21, 2013, University of Texas Channel Communication Set-up
More informationPerformance of Multi Binary Turbo-Codes on Nakagami Flat Fading Channels
Buletinul Ştiinţific al Universităţii "Politehnica" din Timişoara Seria ELECTRONICĂ şi TELECOMUNICAŢII TRANSACTIONS on ELECTRONICS and COMMUNICATIONS Tom 5(65), Fascicola -2, 26 Performance of Multi Binary
More informationPerformance evaluation for ML sequence detection in ISI channels with Gauss Markov Noise
arxiv:0065036v [csit] 25 Jun 200 Performance evaluation for ML sequence detection in ISI channels with Gauss Marov Noise Naveen Kumar, Aditya Ramamoorthy and Murti Salapaa Dept of Electrical and Computer
More informationPrinciples of Communications
Principles of Communications Chapter V: Representation and Transmission of Baseband Digital Signal Yongchao Wang Email: ychwang@mail.xidian.edu.cn Xidian University State Key Lab. on ISN November 18, 2012
More informationThe Viterbi Algorithm EECS 869: Error Control Coding Fall 2009
1 Bacground Material 1.1 Organization of the Trellis The Viterbi Algorithm EECS 869: Error Control Coding Fall 2009 The Viterbi algorithm (VA) processes the (noisy) output sequence from a state machine
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 informationNonlinear Turbo Codes for the broadcast Z Channel
UCLA Electrical Engineering Department Communication Systems Lab. Nonlinear Turbo Codes for the broadcast Z Channel Richard Wesel Miguel Griot Bike ie Andres Vila Casado Communication Systems Laboratory,
More informationStatus and Trends of Optical Data Storage Technology
Status and Trends of Optical Data Storage Technology Tom D. Milster University of Arizona Optical Sciences Center 1630 East University Blvd., Tucson, AZ, 85721-0094 Phone: 520-621-8280 FAX: 520-621-4358
More informationIntroduction to Convolutional Codes, Part 1
Introduction to Convolutional Codes, Part 1 Frans M.J. Willems, Eindhoven University of Technology September 29, 2009 Elias, Father of Coding Theory Textbook Encoder Encoder Properties Systematic Codes
More informationBASICS OF DETECTION AND ESTIMATION THEORY
BASICS OF DETECTION AND ESTIMATION THEORY 83050E/158 In this chapter we discuss how the transmitted symbols are detected optimally from a noisy received signal (observation). Based on these results, optimal
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 informationCommunication Theory II
Communication Theory II Lecture 24: Error Correction Techniques Ahmed Elnakib, PhD Assistant Professor, Mansoura University, Egypt May 14 th, 2015 1 Error Correction Techniques olinear Block Code Cyclic
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 informationData Detection for Controlled ISI. h(nt) = 1 for n=0,1 and zero otherwise.
Data Detection for Controlled ISI *Symbol by symbol suboptimum detection For the duobinary signal pulse h(nt) = 1 for n=0,1 and zero otherwise. The samples at the output of the receiving filter(demodulator)
More informationNew EPoC Burst Markers with Data Field
New EPoC Burst Markers with Data Field Leo Montreuil Rich Prodan Tom Kolze January 2015 www.broadcom.com Burst Markers Update Modifications in Burst Marker Motivation Updated BM Sequences and Modulated
More informationNew reduced state space BCJR algorithms for the ISI channel
New reduced state space BCJR algorithms for the ISI channel Anderson, John B; Prlja, Adnan; Rusek, Fredrik Published in: Proceedings, International Symp. on Information Theory 2009 Link to publication
More informationFactor Graphs and Message Passing Algorithms Part 1: Introduction
Factor Graphs and Message Passing Algorithms Part 1: Introduction Hans-Andrea Loeliger December 2007 1 The Two Basic Problems 1. Marginalization: Compute f k (x k ) f(x 1,..., x n ) x 1,..., x n except
More informationCode design: Computer search
Code design: Computer search Low rate codes Represent the code by its generator matrix Find one representative for each equivalence class of codes Permutation equivalences? Do NOT try several generator
More informationReed-Solomon codes. Chapter Linear codes over finite fields
Chapter 8 Reed-Solomon codes In the previous chapter we discussed the properties of finite fields, and showed that there exists an essentially unique finite field F q with q = p m elements for any prime
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 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 informationModulation codes for the deep-space optical channel
Modulation codes for the deep-space optical channel Bruce Moision, Jon Hamkins, Matt Klimesh, Robert McEliece Jet Propulsion Laboratory Pasadena, CA, USA DIMACS, March 25 26, 2004 March 25 26, 2004 DIMACS
More informationScalar and Vector Quantization. National Chiao Tung University Chun-Jen Tsai 11/06/2014
Scalar and Vector Quantization National Chiao Tung University Chun-Jen Tsai 11/06/014 Basic Concept of Quantization Quantization is the process of representing a large, possibly infinite, set of values
More informationModern Coding Theory. Daniel J. Costello, Jr School of Information Theory Northwestern University August 10, 2009
Modern Coding Theory Daniel J. Costello, Jr. Coding Research Group Department of Electrical Engineering University of Notre Dame Notre Dame, IN 46556 2009 School of Information Theory Northwestern University
More informationIterative Timing Recovery for Magnetic Recording Channels with Low Signal-to-Noise Ratio. Aravind R. Nayak
Iterative Timing Recovery for Magnetic Recording Channels with Low Signal-to-Noise Ratio A Thesis Presented to The Academic Faculty by Aravind R. Nayak In Partial Fulfillment of the Requirements for the
More informationMAXIMUM LIKELIHOOD SEQUENCE ESTIMATION FROM THE LATTICE VIEWPOINT. By Mow Wai Ho
MAXIMUM LIKELIHOOD SEQUENCE ESTIMATION FROM THE LATTICE VIEWPOINT By Mow Wai Ho A thesis submitted in partial fulfillment of the requirements for the Degree of Master of Philosophy Department of Information
More informationError Correction Code (1)
Error Correction Code 1 Fire Tom Wada Professor, Information Engineering, Univ. of the Ryukyus 01/1/7 1 Introduction Digital data storage Digital data transmission Data might change by some Noise, Fading,
More informationECE Information theory Final (Fall 2008)
ECE 776 - Information theory Final (Fall 2008) Q.1. (1 point) Consider the following bursty transmission scheme for a Gaussian channel with noise power N and average power constraint P (i.e., 1/n X n i=1
More informationDecoding the Tail-Biting Convolutional Codes with Pre-Decoding Circular Shift
Decoding the Tail-Biting Convolutional Codes with Pre-Decoding Circular Shift Ching-Yao Su Directed by: Prof. Po-Ning Chen Department of Communications Engineering, National Chiao-Tung University July
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 informationLecture 12. Block Diagram
Lecture 12 Goals Be able to encode using a linear block code Be able to decode a linear block code received over a binary symmetric channel or an additive white Gaussian channel XII-1 Block Diagram Data
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 informationDecision-Point Signal to Noise Ratio (SNR)
Decision-Point Signal to Noise Ratio (SNR) Receiver Decision ^ SNR E E e y z Matched Filter Bound error signal at input to decision device Performance upper-bound on ISI channels Achieved on memoryless
More informationEE4512 Analog and Digital Communications Chapter 4. Chapter 4 Receiver Design
Chapter 4 Receiver Design Chapter 4 Receiver Design Probability of Bit Error Pages 124-149 149 Probability of Bit Error The low pass filtered and sampled PAM signal results in an expression for the probability
More informationBinary Convolutional Codes
Binary Convolutional Codes A convolutional code has memory over a short block length. This memory results in encoded output symbols that depend not only on the present input, but also on past inputs. An
More informationANALYSIS OF A PARTIAL DECORRELATOR IN A MULTI-CELL DS/CDMA SYSTEM
ANAYSIS OF A PARTIA DECORREATOR IN A MUTI-CE DS/CDMA SYSTEM Mohammad Saquib ECE Department, SU Baton Rouge, A 70803-590 e-mail: saquib@winlab.rutgers.edu Roy Yates WINAB, Rutgers University Piscataway
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 informationIterative Encoding of Low-Density Parity-Check Codes
Iterative Encoding of Low-Density Parity-Check Codes David Haley, Alex Grant and John Buetefuer Institute for Telecommunications Research University of South Australia Mawson Lakes Blvd Mawson Lakes SA
More informationA SIMULATION AND GRAPH THEORETICAL ANALYSIS OF CERTAIN PROPERTIES OF SPECTRAL NULL CODEBOOKS
6 SOUTH AFRICAN INSTITUTE OF ELECTRICAL ENGINEERS Vol.() September A SIMULATION AND GRAPH THEORETICAL ANALYSIS OF CERTAIN PROPERTIES OF SPECTRAL NULL CODEBOOKS K. Ouahada and H. C. Ferreira Department
More informationError Correction and Trellis Coding
Advanced Signal Processing Winter Term 2001/2002 Digital Subscriber Lines (xdsl): Broadband Communication over Twisted Wire Pairs Error Correction and Trellis Coding Thomas Brandtner brandt@sbox.tugraz.at
More informationEVALUATION OF ERROR PROBABILITIES FOR GENERAL SIGNAL CONSTELLATIONS
EVALUATION OF ERROR PROBABILITIES FOR GENERAL SIGNAL CONSTELLATIONS Jack W. Stokes, Microsoft Corp., One Microsoft Way, Redmond, WA 98052 jstokes@microsoft.com James A. Ritcey, Dept. of Electrical Engineering,
More informationEE5713 : Advanced Digital Communications
EE5713 : Advanced Digital Communications Week 12, 13: Inter Symbol Interference (ISI) Nyquist Criteria for ISI Pulse Shaping and Raised-Cosine Filter Eye Pattern Equalization (On Board) 20-May-15 Muhammad
More informationOptimizing Flash based Storage Systems
Optimizing Flash based Storage Systems 1 Lifetime Reliability Latency Throughput 2 Projects Reliability/Latency/Throughput: Error Correction Code (ECC) Parallelization and Incremental Redundancy Lifetime:
More informationPipelined Viterbi Decoder Using FPGA
Research Journal of Applied Sciences, Engineering and Technology 5(4): 1362-1372, 2013 ISSN: 2040-7459; e-issn: 2040-7467 Maxwell Scientific Organization, 2013 Submitted: July 05, 2012 Accepted: August
More informationTHIS paper is aimed at designing efficient decoding algorithms
IEEE TRANSACTIONS ON INFORMATION THEORY, VOL. 45, NO. 7, NOVEMBER 1999 2333 Sort-and-Match Algorithm for Soft-Decision Decoding Ilya Dumer, Member, IEEE Abstract Let a q-ary linear (n; k)-code C be used
More informationStaircase Codes. Error-correction for High-Speed Fiber-Optic Channels
Staircase Codes Error-correction for High-Speed Fiber-Optic Channels Frank R. Kschischang Dept. of Electrical & Computer Engineering University of Toronto Talk at Delft University of Technology, Delft,
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 informationECE8771 Information Theory & Coding for Digital Communications Villanova University ECE Department Prof. Kevin M. Buckley Lecture Set 2 Block Codes
Kevin Buckley - 2010 109 ECE8771 Information Theory & Coding for Digital Communications Villanova University ECE Department Prof. Kevin M. Buckley Lecture Set 2 Block Codes m GF(2 ) adder m GF(2 ) multiplier
More informationEs e j4φ +4N n. 16 KE s /N 0. σ 2ˆφ4 1 γ s. p(φ e )= exp 1 ( 2πσ φ b cos N 2 φ e 0
Problem 6.15 : he received signal-plus-noise vector at the output of the matched filter may be represented as (see (5-2-63) for example) : r n = E s e j(θn φ) + N n where θ n =0,π/2,π,3π/2 for QPSK, and
More informationCompressed Sensing and Linear Codes over Real Numbers
Compressed Sensing and Linear Codes over Real Numbers Henry D. Pfister (joint with Fan Zhang) Texas A&M University College Station Information Theory and Applications Workshop UC San Diego January 31st,
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 informationLow-Density Parity-Check Codes
Department of Computer Sciences Applied Algorithms Lab. July 24, 2011 Outline 1 Introduction 2 Algorithms for LDPC 3 Properties 4 Iterative Learning in Crowds 5 Algorithm 6 Results 7 Conclusion PART I
More informationError Correction Methods
Technologies and Services on igital Broadcasting (7) Error Correction Methods "Technologies and Services of igital Broadcasting" (in Japanese, ISBN4-339-06-) is published by CORONA publishing co., Ltd.
More informationTrellis Coded Modulation
Trellis Coded Modulation Trellis coded modulation (TCM) is a marriage between codes that live on trellises and signal designs We have already seen that trellises are the preferred way to view convolutional
More informationThe Maximum-Likelihood Soft-Decision Sequential Decoding Algorithms for Convolutional Codes
The Maximum-Likelihood Soft-Decision Sequential Decoding Algorithms for Convolutional Codes Prepared by Hong-Bin Wu Directed by Prof. Po-Ning Chen In Partial Fulfillment of the Requirements For the Degree
More informationIterative Equalization using Improved Block DFE for Synchronous CDMA Systems
Iterative Equalization using Improved Bloc DFE for Synchronous CDMA Systems Sang-Yic Leong, Kah-ing Lee, and Yahong Rosa Zheng Abstract Iterative equalization using optimal multiuser detector and trellis-based
More informationIEEE TRANSACTIONS ON COMMUNICATIONS, VOL. 64, NO. 10, OCTOBER
IEEE TRANSACTIONS ON COMMUNICATIONS, VOL. 64, NO. 10, OCTOBER 2016 4029 Optimized Design of Finite-Length Separable Circulant-Based Spatially-Coupled Codes: An Absorbing Set-Based Analysis Behzad Amiri,
More informationCoherentDetectionof OFDM
Telematics Lab IITK p. 1/50 CoherentDetectionof OFDM Indo-UK Advanced Technology Centre Supported by DST-EPSRC K Vasudevan Associate Professor vasu@iitk.ac.in Telematics Lab Department of EE Indian Institute
More informationSIDDHARTH GROUP OF INSTITUTIONS :: PUTTUR Siddharth Nagar, Narayanavanam Road UNIT I
SIDDHARTH GROUP OF INSTITUTIONS :: PUTTUR Siddharth Nagar, Narayanavanam Road 517583 QUESTION BANK (DESCRIPTIVE) Subject with Code : CODING THEORY & TECHNIQUES(16EC3810) Course & Branch: M.Tech - DECS
More information