Hybrid Iteration Control on LDPC Decoders

Size: px
Start display at page:

Download "Hybrid Iteration Control on LDPC Decoders"

Transcription

1 Hybrid Iteration Control on LDPC Decoders Erick Amador and Raymond Knopp EURECOM 694 Sophia Antipolis, France Vincent Rezard Infineon Technologies France 656 Sophia Antipolis, France Renaud Pacalet TELECOM ParisTech 694 Sophia Antipolis, France Abstract Stopping criteria for the iterative decoding of lowdensity parity-check codes are considered. For a successful decoding task an inherent stopping criterion is used: the fulfillment of all parity-check constraints. For an unsuccessful task the decoder usually completes a preset maximum number of iterations. Proper iteration control is required to save energy and time on unnecessary decoder operation when processing undecodable blocks. In this paper we propose an iteration control policy that is driven by the combination of two decision metrics. One is the number of satisfied parity-check constraints and the second one is provided by a specific message computation kernel: the Self- Corrected Min-Sum decoding algorithm. Our results show that this hybrid control policy offers superior performance in terms of energy efficiency compared to previously proposed techniques. In addition we show empirically how stopping criteria should be tuned as a function of false alarm and missed detection rates. Keywords LDPC codes; iterative decoding; stopping criterion; early termination I. INTRODUCTION Low-density parity-check (LDPC) codes [1] have gained a lot of interest because of their outstanding error-correction performance. These codes are currently considered for a variety of applications, ranging from next generation wireless communications to magnetic storage. The decoding process for these codes is typically an iterative one. For a successful decoding task the fulfillment of all parity-check constraints is verified, but usually for an unsuccessful task a preset maximum number of iterations is executed. Early detection of an undecodable block not only saves energy on unnecessary decoder operation but may improve the overall latency when an automatic repeat-request (ARQ) strategy is also in use. Previously proposed iteration control policies ([2][3][4]) differ on the decision metrics used. These decision metrics are characterized by their dependence or not upon extraneous variables that must be estimated. The parameters used within the decision rule must be tuned to particular scenarios. In the previous works it has been shown how this tuning essentially trades off error-correcting performance and the average number of iterations. In this work, we identify a decision metric provided by a specific decoding algorithm, the recently proposed Self- Corrected Min-Sum algorithm [5]. This algorithm has been shown to provide quasi-optimal error-correction performance at very low complexity. We propose to combine two decision metrics in order to control the iterative decoding task. We perform comparisons among the previous art and the proposed H = Fig. 1. N variable nodes M check nodes LDPC code graph example hybrid control policy in terms of error-correcting performance, average number of iterations and false alarm rate. The main advantage our work shows is the energy efficiency of the proposed policy as it exhibits empirically very low missed detection rates. Furthermore, we argue that the tuning of parameters of a stopping rule should be done based upon the false alarm and missed detection rates performance. The paper is organized as follows: Section II summarizes LDPC codes and their iterative decoding. In Section III, we show prior stopping criteria and the proposed control policy. Section IV shows simulation results and Section V concludes the paper. II. LDPC CODES LDPC codes are linear block codes defined by a sparse parity-check matrix H M N. This matrix defines M paritycheck constraints among N code symbols. The code can be represented by a bipartite graph, where columns of H are mapped to variable nodes and rows are mapped to check nodes. The nonzero elements in H define the graph connectivity. Figure 1 shows an example matrix (non-sparse) and the code graph representation. LDPC codes can be decoded by an iterative messagepassing algorithm [6] where check nodes and variable nodes exchange extrinsic reliability values associated with each code symbol. The decoding task is stopped once all parity-check constraints are fulfilled: H c T = S = (1) where c is a codeword and S is called the syndrome. If S then the decoder completes a maximum number of iterations. The computational complexity of the decoding task resides in the operation performed at the check nodes of the code graph, indeed it is in here where the tradeoff between errorcorrecting performance and complexity takes place. Optimal message computation is performed by the Sum-Product algorithm [6] at the expense of high complexity. The Min-Sum

2 (MS) algorithm [7] performs a sub-optimal message computation at reduced complexity. Several correction methods have been proposed to recover the performance loss of the MS algorithm by downscaling the messages computed using a normalization or an offset value, [7]. It has been argued recently in [5] that the sub-optimality of MS decoding is not due to the overestimation of the check node messages, but instead to the loss of the symmetric Gaussian distribution of these messages. This symmetry can be recovered by eliminating unreliable variable node messages or cleaning the inputs of the check node operation. By doing so, [5] introduces the Self-Corrected MS (SCMS) decoding, which exhibits quasioptimal error-correcting performance. An input to the check node operation is identified as unreliable if it has changed its sign with respect to the previous iteration. Unreliable messages are erased and are no longer propagated along the code graph. Because of its outstanding error-correcting performance and low complexity we looked closely at the behavior of the SCMS decoding in order to assist the early detection of undecodable blocks. III. STOPPING CRITERIA Iterative decoding algorithms are inherently dynamic since the number of iterations depends upon several factors. Proper iteration control policies should identify decodable and undecodable blocks in order to improve on energy expenditure and overall task latency. Convergence of a codeword is detected by verifying equation (1) (syndrome check) while non-convergence is usually detected by completing a preset maximum number of iterations. A. Prior Art Several works have proposed stopping criteria for the iterative decoding of LDPC codes. The authors in [8] proposed a termination criterion that detects so-called soft-word cycles, where the decoder is trapped in a continuous repetition without concluding in a codeword. This is achieved by storing and comparing the soft-words generated after each decoding iteration. This is carried out by means of content-addressable memories. This criterion saves on average iterations but clearly introduces storage elements. In [2] a stopping criterion was proposed based upon the monitoring of the variable node reliability (VNR), defined as the sum of the magnitudes of the variable node messages. This decision rule stops the decoding process if the VNR does not change or decreases within two successive iterations. This comes from the observation that a monotonic increasing behavior is expected from the VNR of a block achieving convergence. The criterion is switched off once the VNR passes a threshold value that is channel dependent. The criterion proposed in [9] is similar to the one in [2], it monitors the convergence of the mean magnitude of the variable node reliabilities. The decision rule uses two parameters tuned by simulations that are claimed to be channel independent. The authors in [3] proposed a criterion that uses the number of satisfied parity-check constraints as the decision metric. Given the syndrome S = [s 1,s 2,...,s M ] T, the number of satisfied constraints at iteration l is: M Nspc l = M s m (2) m=1 The decision rule monitors the behavior of this metric, tracking the increments and their magnitudes as well as the persistence of such behavior. In this rule three threshold values are used, all claimed to be channel independent. A similar scheme was presented in [4] as it monitors the summation of the checksums of all parity-checks. This is indeed the complement of the decision metric used in [3]. The decision rule monitors this metric and uses two threshold values that are dependent upon signal-to-noise ratio (SNR) to make a decision. The above control policies have been derived based upon the observation of the characteristic behavior shown by a particular decision metric within the decoding task. The decision metrics used by these control policies are characterized by their dependence or not upon extraneous variables. Estimating these variables (e.g., SNR) raises the implementation effort. In Section IV we show empirically how the tuning of the parameters used for a decision rule essentially trades off the false alarm rate and missed detection rate of undecodable blocks. B. Proposed Control Policy SCMS decoding introduces the concept of erased messages, messages which are deemed useless and are discarded after each decoding iteration. A formal treatment behind the concept of erased messages can be found in [5], but intuitively the number of messages erased per iteration provides some measure on the reliability (convergence) of the decoding task. For example, the less messages erased the more reliable the decoding task. Through simulations we observed the total number of erased messages per iteration to indentify the possibility to detect earlier an unsuccesful decoding task and also convergence. In the case of an undecodable block the number of erased messages fluctuates around a mean value (dependent upon the SNR), whereas for a decodable block this metric approaches zero relatively fast. In Figure 2 we show how the percentage of erased messages evolves with each decoding iteration for an instance of a decodable and an undecodable block. This corresponds to the decoding of the code defined in [1] with codeword length 1944 and coding rate 1/2 over the AWGN channel with QPSK modulation, with a maximum of 6 decoding iterations at E b /N = 1dB. By detecting the characteristic monotonic decreasing behavior of the total number of erased messages when the decoder enters a convergence state, it is possible to save energy on potential undecodable blocks. The erased messages metric follows the cumulative quality of the arguments for the paritycheck constraints, allowing in fact to observe the dynamics and evolution of the decoding process with fine granularity.

3 Percentage of erased messages Decodable block Undecodable block Iterations Fig. 2. Percentage of erased messages Erased messages Genie the increments of this metric and halting the decoding task once the number of increments exceeds a given threshold T. This threshold is a static parameter that essentially trades errorcorrecting performance and the average number of iterations. Algorithm 1 outlines the proposed decision rule. Algorithm 1 Stopping Criterion - SCMS ǫ m : number of erased messages in row m M: set of check nodes f s : boolean function for syndrome check, equation (1) count ; Sǫ l for all iterations 1 < l iterations max do for all rows m M do Decode row m Sǫ l Sǫ l + ǫ m end for if (f s ) then Halt decoding (convergence) if (Sǫ l > Sǫ l 1 ) then count count + 1 if (count > T) then Halt decoding (non-convergence) end for E b /N in db Fig. 3. for stopping rules In Figure 3 we show the average number of decoding iterations as a function of SNR for the same simulation scenario of Figure 2 for several stopping rules: 1) verification. 2) Erased messages metric. Decoding is halted when either the number of erased messages equals zero or a nonconvergence condition is satisfied. For nonconvergence detection we allow only a fixed number of increments of this metric. 3) Genie. An ideal stopping rule with foreknowledge of the transmitted block, in this case decoding would not even start on an undecodable block. The syndrome check and the genie criteria correspond to the empirical bounds of any valid stopping rule. From Figure 3 it is clear that the number of erased messages may be used as a decision metric to detect earlier undecodable blocks, but indeed is not suitable to detect early convergence as the absence of erased messages within an iteration is not a necessary condition for convergence. From these observations we use the erased messages metric to detect an undecodable block and the syndrome check for decodable blocks. We propose a stopping rule that follows the evolution of the total number of erased messages by counting Due to space limitations we do not show the comparison between the rule in Algorithm 1 and the previous art, nevertheless we outline the rationale behind the idea of combining two decision metrics for a control policy. The objective of a stopping criterion can be formulated as the detection of an undecodable block. Thus the possible outcomes of such criterion may be a hit, a false alarm and a missed detection. A false alarm corresponds to the halting of the decoding task that would have been successful in the absence of such stopping rule. This indeed generates unnecessary retransmissions in ARQ protocols. On the other hand a missed detection represents useless energy expenditure and an unnecessary delay to request a retransmission. Even though any stopping criteria can be tuned to make arbitrarily small the average number of iterations this has an impact on the false alarm rate. In [3] the authors showed empirically how the average number of iterations and the false alarm rate are complementary. We investigated further by looking at the missed detection rate, as this indeed can provide hints into a criterion s efficiency. Our results showed that the stopping rule in Algorithm 1 exhibits a very low missed detection rate in relation to [3] and [2]. For this reason we propose to enhance the performance of the previous rules by adding the number of erased messages per iteration as another decision metric on a SCMS-based LDPC decoder. Figure 4 shows the proposed hybrid iteration control system. We selected the number of parity-check constraints metric ([3]) as it offers less computational complexity than the VNR metric ([2]), Table I compares the cited stopping rules along

4 Erased messages SCMS decoder Iteration Control 1 1 Fig. 4. Parity check constraints Hybrid iteration control system TABLE I COMPLEXITY OF DECISION RULES Criterion Operations Tuning Compare Add Parameters Data Type Shin [3] 3 M+3 3 Integer Kienle [2] 1 N 1 Real Algorithm 1 2 M+2 1 Integer with Algorithm 1. The number of operations is given as a function of the dimensions of the parity-check matrix. N is usually much larger than M (e.g., twice for a rate 1/2 code), this means that on the number of calculations alone the criterion by Kienle is the most complex one. Furthermore, the type of data used by this criterion requires full resolution real quantities, this indeed imposes a more complex datapath (within a VLSI implementation) when compared to the proposed criterion and the one by Shin. Therefore by observing the performance (error-correction, average iterations, false alarm and missed detection rates) of the mentioned stopping criteria we propose the hybrid iteration control policy for SCMS-based LDPC decoders such that two decision metrics are monitored in order to detect decodable and undecodable blocks. Even though it is possible to monitor all previously proposed decision metrics we found out that the erased messages metric provides the most effective detection for undecodable blocks (in the sense of exhibiting the lowest missed detection rate). In the next section, we provide results when utilizing the hybrid technique by using both Algorithm 1 and the criterion in [3] embodied as in Figure 4. IV. RESULTS AND CRITERIA COMPARISON All stopping criteria can reduce the average number of iterations depending upon the tuning of the decision parameters used within their control policy. This has consequences of different aspects that are worth investigating. In the following we tune the stopping criteria by [3] and [2] along with the proposed hybrid control to be used in the SCMS decoding within the simulation scenario described in the previous section. Figure 5 shows the simulated error-correcting performance (bit error rate, BER) for the tested criteria. The stopping criteria can be tuned to be close in performance, for the case of the criterion in [3] (Shin) the parameters used were θ d = 6,θ max = 4 and θ spc = 825; for the criterion in [2] (Kienle) MB = 16 was used. The hybrid criterion uses T = 22 and the same setup just mentioned for [3]. Figure 6 shows the average number of iterations for the stopping criteria. The syndrome check and the genie are once again provided to observe the achievable empirical bounds. BER Fig. 5. Error-correcting performance for stopping criteria Genie Fig. 6. for stopping criteria Here the tradeoff between average interations and performance loss is evident. From these figures the criterion by Kienle shows an advantage for less number of iterations for the low SNR region with the smallest performance loss, but this criterion shows the highest false alarm rate (FAR) on the same SNR region. In Figure 7 we show the FAR of the simulated stopping criteria. This is a relevant figure of merit since the stopping mechanism on its own can be responsible for unnecessary retransmissions. We can observe how the criterion by Kienle shows less false alarms on the high SNR region, this is due to the inherent threshold that is used within this criterion to disable the stopping rule, but on the other hand this criterion shows the highest false alarm rate for the low SNR region. The comparison between the proposed criterion and the one by Shin is much closer and indeed can be tuned to have a similar performance. So far we can observe that the criterion by Kienle in the low SNR region exhibits the lowest average number of iterations but leads to the highest number of retransmissions. In general the FAR of these criteria is relatively close, so we proceed to investigate their missed detection performance. Indeed the missed detection rate (MDR) can provide further insights into which criterion is actually saving energy without incurring into

5 Hybrid criterion 1 1 FAR: dashed lines, MDR: solid lines False Alarm Rate 1 3 FAR MDR Fig. 7. False alarm rate of stopping criteria Fig. 9. FAR and MDR for stopping rules with different tuning of parameters Missed Detection Rate Fig. 8. Miss rate of stopping criteria any penalty. Figure 8 shows the MDR for the investigated criteria. The criterion by Kienle performs better than Shin for the low SNR region, but this no longer holds as the SNR increases. The most relevant result is that the proposed hybrid criterion achieved a MDR at least one order of magnitude less than the best of the other ones. The performance for each stopping criterion depends upon the tuning of the decision-making parameters. In Figure 9 we show the FAR and MDR for different choices of tuning parameters that result in different average number of iterations. These results are from the same simulated scenario for E b /N = 1dB. From this we can observe the tradeoff involving FAR and the average number of iterations for all criteria. In general the criteria can reduce the average number of iterations but this would result in a higher FAR, this tradeoff must be selected based upon the particular target application (required throughput and allowable retransmissions). Furthermore we can observe the relationship between MDR and average number of iterations. In this respect the proposed criterion exhibits the best performance. From this figure we can see how a proper tuning of the parameters for a decision rule must consider the relationship between FAR and MDR. FAR refers to the penalty risk introduced by the stopping rule, whereas MDR refers to how effective the stopping rule is for detecting undecodable blocks. V. CONCLUSION We have presented a stopping criterion for the iterative decoding of LDPC codes based upon the combination of two decision metrics that follow the convergence behavior of the decoding task. Motivated by the quasi-optimal errorcorrecting performance of the SCMS decoding kernel, we enhanced the performance of the previous art by adding the number of erased messages per iteration as a second decision metric for proper iteration control. We achieved a notorious decrease in the average number of missed detections for the iteration control policy, making it the best choice in terms of energy efficiency. Furthermore, we showed empirically how the proper tuning of stopping criteria should consider both FAR and MDR in order to accurately assess their performance. REFERENCES [1] R. Gallager, Low-Density Parity-Check Codes, IRE Trans. Inf. Theory, vol. 7, pp , January [2] F. Kienle and N. Wehn, Low Complexity Stopping Criterion for LDPC Code Decoders, in Proc. of IEEE VTC 25-Spring, 25, pp [3] D. Shin, K. Heo, S. Oh, and J. Ha, A Stopping Criterion for Low- Density Parity-Check Codes, in Proc. of IEEE VTC 27-Spring, 27, pp [4] Z. Cui, L. Chen, and Z. Wang, An Efficient Early Stopping Scheme for LDPC Decoding, in 13th NASA Symposium on VLSI Design, 27. [5] V. Savin, Self-Corrected Min-Sum Decoding of LDPC Codes, in Proc. of IEEE International Symposium on Information Theory, 28, pp [6] F.R. Kschischang, B. Frey, and H.A. Loeliger, Factor graphs and the sum-product algorithm, IEEE Trans. Inf. Theory, vol. 47, pp , Febraury 21. [7] J. Chen and M. Fossorier, Near Optimum Universal Belief Propagation based Decoding of LDPC codes, in IEEE Trans. on Comm., 22, pp [8] G. Glikiotis and V. Paliouras, A Low-Power Termination Criterion for Iterative LDPC Code Decoders, IEEE Workshop on Signal Processing Systems Design and Implementation, pp , November 25. [9] Jin Li, Xiao hu You, and Jing Li, Early Stopping for LDPC Decoding: Convergence of Mean Magnitude (CMM), in IEEE Communications Letters, 26, number 9. [1] IEEE-82.11n, Wireless LAN Medium Access Control and Physical Layer Specifications: Enhancements for Higher Throughput, P82.11n- 29, October 29.

High Throughput and Low Power Enhancements for LDPC Decoders

High Throughput and Low Power Enhancements for LDPC Decoders High Throughput and Low Power Enhancements for LDPC Decoders Erick Amador and Raymond Knopp EURECOM 694 Sophia Antipolis, France name.surname@eurecom.fr Renaud Pacalet TELECOM ParisTech 694 Sophia Antipolis,

More information

lambda-min Decoding Algorithm of Regular and Irregular LDPC Codes

lambda-min Decoding Algorithm of Regular and Irregular LDPC Codes lambda-min Decoding Algorithm of Regular and Irregular LDPC Codes Emmanuel Boutillon, Frédéric Guillou, Jean-Luc Danger To cite this version: Emmanuel Boutillon, Frédéric Guillou, Jean-Luc Danger lambda-min

More information

COMPARISON OF SIMPLIFIED GRADIENT DESCENT ALGORITHMS FOR DECODING LDPC CODES

COMPARISON OF SIMPLIFIED GRADIENT DESCENT ALGORITHMS FOR DECODING LDPC CODES COMPARISON OF SIMPLIFIED GRADIENT DESCENT ALGORITHMS FOR DECODING LDPC CODES Boorle Ashok Kumar 1, G Y. Padma Sree 2 1 PG Scholar, Al-Ameer College Of Engineering & Information Technology, Anandapuram,

More information

LOW-DENSITY PARITY-CHECK (LDPC) codes [1] can

LOW-DENSITY PARITY-CHECK (LDPC) codes [1] can 208 IEEE TRANSACTIONS ON MAGNETICS, VOL 42, NO 2, FEBRUARY 2006 Structured LDPC Codes for High-Density Recording: Large Girth and Low Error Floor J Lu and J M F Moura Department of Electrical and Computer

More information

THE DESIGN OF STRUCTURED REGULAR LDPC CODES WITH LARGE GIRTH. Haotian Zhang and José M. F. Moura

THE DESIGN OF STRUCTURED REGULAR LDPC CODES WITH LARGE GIRTH. Haotian Zhang and José M. F. Moura THE DESIGN OF STRUCTURED REGULAR LDPC CODES WITH LARGE GIRTH Haotian Zhang and José M. F. Moura Department of Electrical and Computer Engineering Carnegie Mellon University, Pittsburgh, PA 523 {haotian,

More information

Capacity-approaching Codes for Solid State Storages

Capacity-approaching Codes for Solid State Storages Capacity-approaching Codes for Solid State Storages Jeongseok Ha, Department of Electrical Engineering Korea Advanced Institute of Science and Technology (KAIST) Contents Capacity-Approach Codes Turbo

More information

BER Evaluation of LDPC Decoder with BPSK Scheme in AWGN Fading Channel

BER Evaluation of LDPC Decoder with BPSK Scheme in AWGN Fading Channel I J C T A, 9(40), 2016, pp. 397-404 International Science Press ISSN: 0974-5572 BER Evaluation of LDPC Decoder with BPSK Scheme in AWGN Fading Channel Neha Mahankal*, Sandeep Kakde* and Atish Khobragade**

More information

Interlaced Column-Row Message-Passing Schedule for Decoding LDPC Codes

Interlaced Column-Row Message-Passing Schedule for Decoding LDPC Codes Interlaced Column-Row Message-Passing Schedule for Decoding LDPC Codes Saleh Usman, Mohammad M. Mansour, Ali Chehab Department of Electrical and Computer Engineering American University of Beirut Beirut

More information

New Message-Passing Decoding Algorithm of LDPC Codes by Partitioning Check Nodes 1

New Message-Passing Decoding Algorithm of LDPC Codes by Partitioning Check Nodes 1 New Message-Passing Decoding Algorithm of LDPC Codes by Partitioning Check Nodes 1 Sunghwan Kim* O, Min-Ho Jang*, Jong-Seon No*, Song-Nam Hong, and Dong-Joon Shin *School of Electrical Engineering and

More information

Optimized Min-Sum Decoding Algorithm for Low Density PC Codes

Optimized Min-Sum Decoding Algorithm for Low Density PC Codes Optimized Min-Sum Decoding Algorithm for Low Density PC Codes Dewan Siam Shafiullah, Mohammad Rakibul Islam, Mohammad Mostafa Amir Faisal, Imran Rahman, Dept. of Electrical and Electronic Engineering,

More information

Lowering the Error Floors of Irregular High-Rate LDPC Codes by Graph Conditioning

Lowering the Error Floors of Irregular High-Rate LDPC Codes by Graph Conditioning Lowering the Error Floors of Irregular High- LDPC Codes by Graph Conditioning Wen-Yen Weng, Aditya Ramamoorthy and Richard D. Wesel Electrical Engineering Department, UCLA, Los Angeles, CA, 90095-594.

More information

Layered Decoding With A Early Stopping Criterion For LDPC Codes

Layered Decoding With A Early Stopping Criterion For LDPC Codes 2012 2 nd International Conference on Information Communication and Management (ICICM 2012) IPCSIT vol. 55 (2012) (2012) IACSIT Press, Singapore DOI: 10.7763/IPCSIT.2012.V55.14 ayered Decoding With A Early

More information

On combining chase-2 and sum-product algorithms for LDPC codes

On combining chase-2 and sum-product algorithms for LDPC codes University of Wollongong Research Online Faculty of Engineering and Information Sciences - Papers: Part A Faculty of Engineering and Information Sciences 2012 On combining chase-2 and sum-product algorithms

More information

Finding Small Stopping Sets in the Tanner Graphs of LDPC Codes

Finding Small Stopping Sets in the Tanner Graphs of LDPC Codes Finding Small Stopping Sets in the Tanner Graphs of LDPC Codes Gerd Richter University of Ulm, Department of TAIT Albert-Einstein-Allee 43, D-89081 Ulm, Germany gerd.richter@uni-ulm.de Abstract The performance

More information

Overlapped Scheduling for Folded LDPC Decoding Based on Matrix Permutation

Overlapped Scheduling for Folded LDPC Decoding Based on Matrix Permutation Overlapped Scheduling for Folded LDPC Decoding Based on Matrix Permutation In-Cheol Park and Se-Hyeon Kang Department of Electrical Engineering and Computer Science, KAIST {icpark, shkang}@ics.kaist.ac.kr

More information

A new two-stage decoding scheme with unreliable path search to lower the error-floor for low-density parity-check codes

A new two-stage decoding scheme with unreliable path search to lower the error-floor for low-density parity-check codes IET Communications Research Article A new two-stage decoding scheme with unreliable path search to lower the error-floor for low-density parity-check codes Pilwoong Yang 1, Bohwan Jun 1, Jong-Seon No 1,

More information

Complexity Efficient Stopping Criterion for LDPC Based Distributed Video Coding

Complexity Efficient Stopping Criterion for LDPC Based Distributed Video Coding Complexity Efficient Stopping Criterion for LDPC Based Distributed Video Coding João Ascenso Instituto Superior de Engenharia de Lisboa Instituto de Telecomunicações Rua Conselheiro Emídio Navarro, 1 195-62

More information

On the construction of Tanner graphs

On the construction of Tanner graphs On the construction of Tanner graphs Jesús Martínez Mateo Universidad Politécnica de Madrid Outline Introduction Low-density parity-check (LDPC) codes LDPC decoding Belief propagation based algorithms

More information

Reduced Complexity of Decoding Algorithm for Irregular LDPC Codes Using a Split Row Method

Reduced Complexity of Decoding Algorithm for Irregular LDPC Codes Using a Split Row Method Journal of Wireless Networking and Communications 2012, 2(4): 29-34 DOI: 10.5923/j.jwnc.20120204.01 Reduced Complexity of Decoding Algorithm for Irregular Rachid El Alami *, Mostafa Mrabti, Cheikh Bamba

More information

TURBO codes, [1], [2], have attracted much interest due

TURBO codes, [1], [2], have attracted much interest due 800 IEEE TRANSACTIONS ON INFORMATION THEORY, VOL. 47, NO. 2, FEBRUARY 2001 Zigzag Codes and Concatenated Zigzag Codes Li Ping, Member, IEEE, Xiaoling Huang, and Nam Phamdo, Senior Member, IEEE Abstract

More information

Diversity Coded 5G Fronthaul Wireless Networks

Diversity Coded 5G Fronthaul Wireless Networks IEEE Wireless Telecommunication Symposium (WTS) 2017 Diversity Coded 5G Fronthaul Wireless Networks Nabeel Sulieman, Kemal Davaslioglu, and Richard D. Gitlin Department of Electrical Engineering University

More information

Multiple Constraint Satisfaction by Belief Propagation: An Example Using Sudoku

Multiple Constraint Satisfaction by Belief Propagation: An Example Using Sudoku Multiple Constraint Satisfaction by Belief Propagation: An Example Using Sudoku Todd K. Moon and Jacob H. Gunther Utah State University Abstract The popular Sudoku puzzle bears structural resemblance to

More information

A Generic Architecture of CCSDS Low Density Parity Check Decoder for Near-Earth Applications

A Generic Architecture of CCSDS Low Density Parity Check Decoder for Near-Earth Applications A Generic Architecture of CCSDS Low Density Parity Check Decoder for Near-Earth Applications Fabien Demangel, Nicolas Fau, Nicolas Drabik, François Charot, Christophe Wolinski To cite this version: Fabien

More information

LOW-density parity-check (LDPC) codes have attracted

LOW-density parity-check (LDPC) codes have attracted 2966 IEEE TRANSACTIONS ON INFORMATION THEORY, VOL. 50, NO. 12, DECEMBER 2004 LDPC Block and Convolutional Codes Based on Circulant Matrices R. Michael Tanner, Fellow, IEEE, Deepak Sridhara, Arvind Sridharan,

More information

Low complexity FEC Systems for Satellite Communication

Low complexity FEC Systems for Satellite Communication Low complexity FEC Systems for Satellite Communication Ashwani Singh Navtel Systems 2 Rue Muette, 27000,Houville La Branche, France Tel: +33 237 25 71 86 E-mail: ashwani.singh@navtelsystems.com Henry Chandran

More information

Optimized ARM-Based Implementation of Low Density Parity Check Code (LDPC) Decoder in China Digital Radio (CDR)

Optimized ARM-Based Implementation of Low Density Parity Check Code (LDPC) Decoder in China Digital Radio (CDR) Optimized ARM-Based Implementation of Low Density Parity Check Code (LDPC) Decoder in China Digital Radio (CDR) P. Vincy Priscilla 1, R. Padmavathi 2, S. Tamilselvan 3, Dr.S. Kanthamani 4 1,4 Department

More information

Modern Communications Chapter 5. Low-Density Parity-Check Codes

Modern Communications Chapter 5. Low-Density Parity-Check Codes 1/14 Modern Communications Chapter 5. Low-Density Parity-Check Codes Husheng Li Min Kao Department of Electrical Engineering and Computer Science University of Tennessee, Knoxville Spring, 2017 2/14 History

More information

Low Complexity Quasi-Cyclic LDPC Decoder Architecture for IEEE n

Low Complexity Quasi-Cyclic LDPC Decoder Architecture for IEEE n Low Complexity Quasi-Cyclic LDPC Decoder Architecture for IEEE 802.11n Sherif Abou Zied 1, Ahmed Tarek Sayed 1, and Rafik Guindi 2 1 Varkon Semiconductors, Cairo, Egypt 2 Nile University, Giza, Egypt Abstract

More information

Performance of the Sum-Product Decoding Algorithm on Factor Graphs With Short Cycles

Performance of the Sum-Product Decoding Algorithm on Factor Graphs With Short Cycles Performance of the Sum-Product Decoding Algorithm on Factor Graphs With Short Cycles Kevin Jacobson Abstract Originally invented by R. G. Gallager in 962, lowdensity parity-check (LDPC) codes have reemerged

More information

HIGH-THROUGHPUT MULTI-RATE LDPC DECODER BASED ON ARCHITECTURE-ORIENTED PARITY CHECK MATRICES

HIGH-THROUGHPUT MULTI-RATE LDPC DECODER BASED ON ARCHITECTURE-ORIENTED PARITY CHECK MATRICES HIGH-THROUGHPUT MULTI-RATE LDPC DECODER BASED ON ARCHITECTURE-ORIENTED PARITY CHECK MATRICES Predrag Radosavljevic, Alexandre de Baynast, Marjan Karkooti, Joseph R. Cavallaro ECE Department, Rice University

More information

Randomized Progressive Edge-Growth (RandPEG)

Randomized Progressive Edge-Growth (RandPEG) Randomized Progressive Edge-Growth (Rand) Auguste Venkiah, David Declercq, Charly Poulliat ETIS, CNRS, ENSEA, Univ Cergy-Pontoise F-95000 Cergy-Pontoise email:{venkiah,declercq,poulliat}@ensea.fr Abstract

More information

Performance Analysis of Gray Code based Structured Regular Column-Weight Two LDPC Codes

Performance Analysis of Gray Code based Structured Regular Column-Weight Two LDPC Codes IOSR Journal of Electronics and Communication Engineering (IOSR-JECE) e-issn: 2278-2834,p- ISSN: 2278-8735.Volume 11, Issue 4, Ver. III (Jul.-Aug.2016), PP 06-10 www.iosrjournals.org Performance Analysis

More information

A Software LDPC Decoder Implemented on a Many-Core Array of Programmable Processors

A Software LDPC Decoder Implemented on a Many-Core Array of Programmable Processors A Software LDPC Decoder Implemented on a Many-Core Array of Programmable Processors Brent Bohnenstiehl and Bevan Baas Department of Electrical and Computer Engineering University of California, Davis {bvbohnen,

More information

Hybrid Coding Gain and Hybrid ARQ Based on Conception of Majority Voting

Hybrid Coding Gain and Hybrid ARQ Based on Conception of Majority Voting Hybrid Coding Gain and Hybrid ARQ Based on Conception of Majority Voting Hsin-Kun Lai and Erl-Huei Lu Chin Min Institute of Technology, Chang Gung University No. 110, Syuefu Rd., Toufen Township, Miaoli

More information

Quantized Iterative Message Passing Decoders with Low Error Floor for LDPC Codes

Quantized Iterative Message Passing Decoders with Low Error Floor for LDPC Codes Quantized Iterative Message Passing Decoders with Low Error Floor for LDPC Codes Xiaojie Zhang and Paul H. Siegel University of California, San Diego 1. Introduction Low-density parity-check (LDPC) codes

More information

ITERATIVE decoders have gained widespread attention

ITERATIVE decoders have gained widespread attention IEEE TRANSACTIONS ON INFORMATION THEORY, VOL. 53, NO. 11, NOVEMBER 2007 4013 Pseudocodewords of Tanner Graphs Christine A. Kelley, Member, IEEE, and Deepak Sridhara, Member, IEEE Abstract This paper presents

More information

MULTI-RATE HIGH-THROUGHPUT LDPC DECODER: TRADEOFF ANALYSIS BETWEEN DECODING THROUGHPUT AND AREA

MULTI-RATE HIGH-THROUGHPUT LDPC DECODER: TRADEOFF ANALYSIS BETWEEN DECODING THROUGHPUT AND AREA MULTI-RATE HIGH-THROUGHPUT LDPC DECODER: TRADEOFF ANALYSIS BETWEEN DECODING THROUGHPUT AND AREA Predrag Radosavljevic, Alexandre de Baynast, Marjan Karkooti, and Joseph R. Cavallaro Department of Electrical

More information

Complexity-Optimized Low-Density Parity-Check Codes

Complexity-Optimized Low-Density Parity-Check Codes Complexity-Optimized Low-Density Parity-Check Codes Masoud Ardakani Department of Electrical & Computer Engineering University of Alberta, ardakani@ece.ualberta.ca Benjamin Smith, Wei Yu, Frank R. Kschischang

More information

Error Control Coding for MLC Flash Memories

Error Control Coding for MLC Flash Memories Error Control Coding for MLC Flash Memories Ying Y. Tai, Ph.D. Cadence Design Systems, Inc. ytai@cadence.com August 19, 2010 Santa Clara, CA 1 Outline The Challenges on Error Control Coding (ECC) for MLC

More information

Non-recursive complexity reduction encoding scheme for performance enhancement of polar codes

Non-recursive complexity reduction encoding scheme for performance enhancement of polar codes Non-recursive complexity reduction encoding scheme for performance enhancement of polar codes 1 Prakash K M, 2 Dr. G S Sunitha 1 Assistant Professor, Dept. of E&C, Bapuji Institute of Engineering and Technology,

More information

FPGA Implementation of Binary Quasi Cyclic LDPC Code with Rate 2/5

FPGA Implementation of Binary Quasi Cyclic LDPC Code with Rate 2/5 FPGA Implementation of Binary Quasi Cyclic LDPC Code with Rate 2/5 Arulmozhi M. 1, Nandini G. Iyer 2, Anitha M. 3 Assistant Professor, Department of EEE, Rajalakshmi Engineering College, Chennai, India

More information

A Parallel Decoding Algorithm of LDPC Codes using CUDA

A Parallel Decoding Algorithm of LDPC Codes using CUDA A Parallel Decoding Algorithm of LDPC Codes using CUDA Shuang Wang and Samuel Cheng School of Electrical and Computer Engineering University of Oklahoma-Tulsa Tulsa, OK 735 {shuangwang, samuel.cheng}@ou.edu

More information

Hard Decision Based Low SNR Early Termination for LTE Turbo Decoding

Hard Decision Based Low SNR Early Termination for LTE Turbo Decoding Hard Decision Based Low SNR Early Termination for LTE Turbo Decoding Jan Geldmacher, Klaus Hueske, and Jürgen Götze Information Processing Lab, TU Dortmund University Otto-Hahn-Strasse 4, 447 Dortmund,

More information

Payload Length and Rate Adaptation for Throughput Optimization in Wireless LANs

Payload Length and Rate Adaptation for Throughput Optimization in Wireless LANs Payload Length and Rate Adaptation for Throughput Optimization in Wireless LANs Sayantan Choudhury and Jerry D. Gibson Department of Electrical and Computer Engineering University of Califonia, Santa Barbara

More information

Design of Cages with a Randomized Progressive Edge-Growth Algorithm

Design of Cages with a Randomized Progressive Edge-Growth Algorithm 1 Design of Cages with a Randomized Progressive Edge-Growth Algorithm Auguste Venkiah, David Declercq and Charly Poulliat ETIS - CNRS UMR 8051 - ENSEA - University of Cergy-Pontoise Abstract The progressive

More information

Design of Cages with a Randomized Progressive Edge-Growth Algorithm

Design of Cages with a Randomized Progressive Edge-Growth Algorithm 1 Design of Cages with a Randomized Progressive Edge-Growth Algorithm Auguste Venkiah, David Declercq and Charly Poulliat ETIS - CNRS UMR 8051 - ENSEA - University of Cergy-Pontoise Abstract The Progressive

More information

Adaptive Linear Programming Decoding of Polar Codes

Adaptive Linear Programming Decoding of Polar Codes Adaptive Linear Programming Decoding of Polar Codes Veeresh Taranalli and Paul H. Siegel University of California, San Diego, La Jolla, CA 92093, USA Email: {vtaranalli, psiegel}@ucsd.edu Abstract Polar

More information

REVIEW ON CONSTRUCTION OF PARITY CHECK MATRIX FOR LDPC CODE

REVIEW ON CONSTRUCTION OF PARITY CHECK MATRIX FOR LDPC CODE REVIEW ON CONSTRUCTION OF PARITY CHECK MATRIX FOR LDPC CODE Seema S. Gumbade 1, Anirudhha S. Wagh 2, Dr.D.P.Rathod 3 1,2 M. Tech Scholar, Veermata Jijabai Technological Institute (VJTI), Electrical Engineering

More information

Partly Parallel Overlapped Sum-Product Decoder Architectures for Quasi-Cyclic LDPC Codes

Partly Parallel Overlapped Sum-Product Decoder Architectures for Quasi-Cyclic LDPC Codes Partly Parallel Overlapped Sum-Product Decoder Architectures for Quasi-Cyclic LDPC Codes Ning Chen, Yongmei Dai, and Zhiyuan Yan Department of Electrical and Computer Engineering, Lehigh University, PA

More information

Distributed Decoding in Cooperative Communications

Distributed Decoding in Cooperative Communications Distributed Decoding in Cooperative Communications Marjan Karkooti and Joseph R. Cavallaro Rice University, Department of Electrical and Computer Engineering, Houston, TX, 77005 {marjan,cavallar} @rice.edu

More information

ITERATIVE COLLISION RESOLUTION IN WIRELESS NETWORKS

ITERATIVE COLLISION RESOLUTION IN WIRELESS NETWORKS ITERATIVE COLLISION RESOLUTION IN WIRELESS NETWORKS An Undergraduate Research Scholars Thesis by KATHERINE CHRISTINE STUCKMAN Submitted to Honors and Undergraduate Research Texas A&M University in partial

More information

Cost efficient FPGA implementations of Min- Sum and Self-Corrected-Min-Sum decoders

Cost efficient FPGA implementations of Min- Sum and Self-Corrected-Min-Sum decoders Cost efficient FPGA implementations of Min- Sum and Self-Corrected-Min-Sum decoders Oana Boncalo (1), Alexandru Amaricai (1), Valentin Savin (2) (1) University Politehnica Timisoara, Romania (2) CEA-LETI,

More information

Reducing the Complexity of LDPC Decoding Algorithms: An Optimization-Oriented Approach

Reducing the Complexity of LDPC Decoding Algorithms: An Optimization-Oriented Approach Reducing the Complexity of LDPC Decoding Algorithms: An Optimization-Oriented Approach Sarajlic, Muris; Liu, Liang; Edfors, Ove Accepted/In press: 201-01-01 Link to publication Citation for published version

More information

IEEE TRANSACTIONS ON INFORMATION THEORY, VOL. 53, NO. 2, FEBRUARY /$ IEEE

IEEE TRANSACTIONS ON INFORMATION THEORY, VOL. 53, NO. 2, FEBRUARY /$ IEEE IEEE TRANSACTIONS ON INFORMATION THEORY, VOL. 53, NO. 2, FEBRUARY 2007 599 Results on Punctured Low-Density Parity-Check Codes and Improved Iterative Decoding Techniques Hossein Pishro-Nik, Member, IEEE,

More information

A new way to optimize LDPC code in gaussian multiple access channel

A new way to optimize LDPC code in gaussian multiple access channel Acta Technica 62 (2017), No. 4A, 495504 c 2017 Institute of Thermomechanics CAS, v.v.i. A new way to optimize LDPC code in gaussian multiple access channel Jingxi Zhang 2 Abstract. The code design for

More information

MULTI-RATE HIGH-THROUGHPUT LDPC DECODER: TRADEOFF ANALYSIS BETWEEN DECODING THROUGHPUT AND AREA

MULTI-RATE HIGH-THROUGHPUT LDPC DECODER: TRADEOFF ANALYSIS BETWEEN DECODING THROUGHPUT AND AREA MULTIRATE HIGHTHROUGHPUT LDPC DECODER: TRADEOFF ANALYSIS BETWEEN DECODING THROUGHPUT AND AREA Predrag Radosavljevic, Alexandre de Baynast, Marjan Karkooti, and Joseph R. Cavallaro Department of Electrical

More information

Nearly-optimal associative memories based on distributed constant weight codes

Nearly-optimal associative memories based on distributed constant weight codes Nearly-optimal associative memories based on distributed constant weight codes Vincent Gripon Electronics and Computer Enginering McGill University Montréal, Canada Email: vincent.gripon@ens-cachan.org

More information

Informed Dynamic Scheduling for Belief-Propagation Decoding of LDPC Codes

Informed Dynamic Scheduling for Belief-Propagation Decoding of LDPC Codes Informed Dynamic Scheduling for Belief-Propagation Decoding of LDPC Codes Andres I. Vila Casado, Miguel Griot and Richard D. Wesel Department of Electrical Engineering, University of California, Los Angeles,

More information

Check-hybrid GLDPC Codes Without Small Trapping Sets

Check-hybrid GLDPC Codes Without Small Trapping Sets Check-hybrid GLDPC Codes Without Small Trapping Sets Vida Ravanmehr Department of Electrical and Computer Engineering University of Arizona Tucson, AZ, 8572 Email: vravanmehr@ece.arizona.edu David Declercq

More information

Piecewise Linear Approximation Based on Taylor Series of LDPC Codes Decoding Algorithm and Implemented in FPGA

Piecewise Linear Approximation Based on Taylor Series of LDPC Codes Decoding Algorithm and Implemented in FPGA Journal of Information Hiding and Multimedia Signal Processing c 2018 ISSN 2073-4212 Ubiquitous International Volume 9, Number 3, May 2018 Piecewise Linear Approximation Based on Taylor Series of LDPC

More information

Performance of UMTS Radio Link Control

Performance of UMTS Radio Link Control Performance of UMTS Radio Link Control Qinqing Zhang, Hsuan-Jung Su Bell Laboratories, Lucent Technologies Holmdel, NJ 77 Abstract- The Radio Link Control (RLC) protocol in Universal Mobile Telecommunication

More information

LDPC Codes a brief Tutorial

LDPC Codes a brief Tutorial LDPC Codes a brief Tutorial Bernhard M.J. Leiner, Stud.ID.: 53418L bleiner@gmail.com April 8, 2005 1 Introduction Low-density parity-check (LDPC) codes are a class of linear block LDPC codes. The name

More information

Optimal Overlapped Message Passing Decoding of Quasi-Cyclic LDPC Codes

Optimal Overlapped Message Passing Decoding of Quasi-Cyclic LDPC Codes Optimal Overlapped Message Passing Decoding of Quasi-Cyclic LDPC Codes Yongmei Dai and Zhiyuan Yan Department of Electrical and Computer Engineering Lehigh University, PA 18015, USA E-mails: {yod304, yan}@lehigh.edu

More information

ISSN (Print) Research Article. *Corresponding author Akilambigai P

ISSN (Print) Research Article. *Corresponding author Akilambigai P Scholars Journal of Engineering and Technology (SJET) Sch. J. Eng. Tech., 2016; 4(5):223-227 Scholars Academic and Scientific Publisher (An International Publisher for Academic and Scientific Resources)

More information

Power-Aware Rateless Codes in Mobile Wireless Communication

Power-Aware Rateless Codes in Mobile Wireless Communication Power-Aware Rateless Codes in Mobile Wireless Communication Calum Harrison University College London c.harrison@cs.ucl.ac.uk Kyle Jamieson University College London k.jamieson@cs.ucl.ac.uk ABSTRACT Rateless

More information

Error Floors of LDPC Codes

Error Floors of LDPC Codes Error Floors of LDPC Codes Tom Richardson Flarion Technologies Bedminster, NJ 07921 tjr@flarion.com Abstract We introduce a computational technique that accurately predicts performance for a given LDPC

More information

Error-Correcting Codes

Error-Correcting Codes Error-Correcting Codes Michael Mo 10770518 6 February 2016 Abstract An introduction to error-correcting codes will be given by discussing a class of error-correcting codes, called linear block codes. The

More information

Design and Implementation of Low Density Parity Check Codes

Design and Implementation of Low Density Parity Check Codes IOSR Journal of Engineering (IOSRJEN) ISSN (e): 2250-3021, ISSN (p): 2278-8719 Vol. 04, Issue 09 (September. 2014), V2 PP 21-25 www.iosrjen.org Design and Implementation of Low Density Parity Check Codes

More information

New LDPC code design scheme combining differential evolution and simplex algorithm Min Kyu Song

New LDPC code design scheme combining differential evolution and simplex algorithm Min Kyu Song New LDPC code design scheme combining differential evolution and simplex algorithm Min Kyu Song The Graduate School Yonsei University Department of Electrical and Electronic Engineering New LDPC code design

More information

A nodal based evolutionary structural optimisation algorithm

A nodal based evolutionary structural optimisation algorithm Computer Aided Optimum Design in Engineering IX 55 A dal based evolutionary structural optimisation algorithm Y.-M. Chen 1, A. J. Keane 2 & C. Hsiao 1 1 ational Space Program Office (SPO), Taiwan 2 Computational

More information

ISSCC 2003 / SESSION 8 / COMMUNICATIONS SIGNAL PROCESSING / PAPER 8.7

ISSCC 2003 / SESSION 8 / COMMUNICATIONS SIGNAL PROCESSING / PAPER 8.7 ISSCC 2003 / SESSION 8 / COMMUNICATIONS SIGNAL PROCESSING / PAPER 8.7 8.7 A Programmable Turbo Decoder for Multiple 3G Wireless Standards Myoung-Cheol Shin, In-Cheol Park KAIST, Daejeon, Republic of Korea

More information

Convex combination of adaptive filters for a variable tap-length LMS algorithm

Convex combination of adaptive filters for a variable tap-length LMS algorithm Loughborough University Institutional Repository Convex combination of adaptive filters for a variable tap-length LMS algorithm This item was submitted to Loughborough University's Institutional Repository

More information

The Cross-Entropy Method

The Cross-Entropy Method The Cross-Entropy Method Guy Weichenberg 7 September 2003 Introduction This report is a summary of the theory underlying the Cross-Entropy (CE) method, as discussed in the tutorial by de Boer, Kroese,

More information

Reduced Latency Majority Logic Decoding for Error Detection and Correction

Reduced Latency Majority Logic Decoding for Error Detection and Correction Reduced Latency Majority Logic Decoding for Error Detection and Correction D.K.Monisa 1, N.Sathiya 2 1 Department of Electronics and Communication Engineering, Mahendra Engineering College, Namakkal, Tamilnadu,

More information

CSEP 561 Error detection & correction. David Wetherall

CSEP 561 Error detection & correction. David Wetherall CSEP 561 Error detection & correction David Wetherall djw@cs.washington.edu Codes for Error Detection/Correction ti ti Error detection and correction How do we detect and correct messages that are garbled

More information

Fault Tolerance & Reliability CDA Chapter 2 Additional Interesting Codes

Fault Tolerance & Reliability CDA Chapter 2 Additional Interesting Codes Fault Tolerance & Reliability CDA 5140 Chapter 2 Additional Interesting Codes m-out-of-n codes - each binary code word has m ones in a length n non-systematic codeword - used for unidirectional errors

More information

Viterbi Algorithm for error detection and correction

Viterbi Algorithm for error detection and correction IOSR Journal of Electronicsl and Communication Engineering (IOSR-JECE) ISSN: 2278-2834-, ISBN: 2278-8735, PP: 60-65 www.iosrjournals.org Viterbi Algorithm for error detection and correction Varsha P. Patil

More information

Research Article Cooperative Signaling with Soft Information Combining

Research Article Cooperative Signaling with Soft Information Combining Electrical and Computer Engineering Volume 2010, Article ID 530190, 5 pages doi:10.1155/2010/530190 Research Article Cooperative Signaling with Soft Information Combining Rui Lin, Philippa A. Martin, and

More information

Performance comparison of Decoding Algorithm for LDPC codes in DVBS2

Performance comparison of Decoding Algorithm for LDPC codes in DVBS2 Performance comparison of Decoding Algorithm for LDPC codes in DVBS2 Ronakben P Patel 1, Prof. Pooja Thakar 2 1M.TEC student, Dept. of EC, SALTIER, Ahmedabad-380060, Gujarat, India 2 Assistant Professor,

More information

DESIGN AND ANALYSIS OF ALGORITHMS. Unit 1 Chapter 4 ITERATIVE ALGORITHM DESIGN ISSUES

DESIGN AND ANALYSIS OF ALGORITHMS. Unit 1 Chapter 4 ITERATIVE ALGORITHM DESIGN ISSUES DESIGN AND ANALYSIS OF ALGORITHMS Unit 1 Chapter 4 ITERATIVE ALGORITHM DESIGN ISSUES http://milanvachhani.blogspot.in USE OF LOOPS As we break down algorithm into sub-algorithms, sooner or later we shall

More information

H-ARQ Rate-Compatible Structured LDPC Codes

H-ARQ Rate-Compatible Structured LDPC Codes H-ARQ Rate-Compatible Structured LDPC Codes Mostafa El-Khamy, Jilei Hou and Naga Bhushan Electrical Engineering Dept. Qualcomm California Institute of Technology 5775 Morehouse Drive Pasadena, CA 91125

More information

Gradient Descent Bit Flipping Algorithms for Decoding LDPC Codes

Gradient Descent Bit Flipping Algorithms for Decoding LDPC Codes 1 Gradient Descent Bit Flipping Algorithms for Decoding LDPC Codes Tadashi Wadayama, Keisue Naamura, Masayui Yagita, Yuui Funahashi, Shogo Usami, Ichi Taumi arxiv:0711.0261v2 [cs.it] 8 Apr 2008 Abstract

More information

Low Error Rate LDPC Decoders

Low Error Rate LDPC Decoders Low Error Rate LDPC Decoders Zhengya Zhang, Lara Dolecek, Pamela Lee, Venkat Anantharam, Martin J. Wainwright, Brian Richards and Borivoje Nikolić Department of Electrical Engineering and Computer Science,

More information

Leveraging Set Relations in Exact Set Similarity Join

Leveraging Set Relations in Exact Set Similarity Join Leveraging Set Relations in Exact Set Similarity Join Xubo Wang, Lu Qin, Xuemin Lin, Ying Zhang, and Lijun Chang University of New South Wales, Australia University of Technology Sydney, Australia {xwang,lxue,ljchang}@cse.unsw.edu.au,

More information

Channel Decoding in Wireless Communication Systems using Deep Learning

Channel Decoding in Wireless Communication Systems using Deep Learning Channel Decoding in Wireless Communication Systems using Deep Learning Gaurang Naik 12/11/2017 Deep Learning Course Project Acknowledgements: Navneet Agrawal, TU Berlin Error Control Coding Wireless Communication

More information

REPORT DOCUMENTATION PAGE

REPORT DOCUMENTATION PAGE REPORT DOCUMENTATION PAGE Form Approved OMB No. 0704-0188 Public reporting burden for this collection of information is estimated to average 1 hour per response, including the time for reviewing instructions,

More information

Complexity Comparison of Non-Binary LDPC Decoders

Complexity Comparison of Non-Binary LDPC Decoders Complexity Comparison of Non-Binary LDPC Decoders Laura Conde-Canencia, Ali Al-Ghouwayel, Emmanuel Boutillon To cite this version: Laura Conde-Canencia, Ali Al-Ghouwayel, Emmanuel Boutillon. Complexity

More information

TSG-RAN Working Group 2 (Radio layer 2 and Radio layer 3) TSGR2#2(99)085 Stockholm 8th to 11th March 1999

TSG-RAN Working Group 2 (Radio layer 2 and Radio layer 3) TSGR2#2(99)085 Stockholm 8th to 11th March 1999 TSG-RAN Working Group 2 (Radio layer 2 and Radio layer 3) TSGR2#2(99)085 Stockholm 8th to 11th March 1999 Agenda Item: 8.3.2 Source: Title: Document for: Siemens AG ARQ error control techniques Decision

More information

STARTING in the 1990s, much work was done to enhance

STARTING in the 1990s, much work was done to enhance 1048 IEEE TRANSACTIONS ON CIRCUITS AND SYSTEMS I: REGULAR PAPERS, VOL. 57, NO. 5, MAY 2010 A Low-Complexity Message-Passing Algorithm for Reduced Routing Congestion in LDPC Decoders Tinoosh Mohsenin, Dean

More information

Watermarking Method using Concatenated Code for Scaling and Rotation Attacks

Watermarking Method using Concatenated Code for Scaling and Rotation Attacks Watermarking Method using Concatenated Code for Scaling and Rotation Attacks Nobuhiro Hirata and Masaki Kawamura Graduate School of Science and Engineering, Yamaguchi University 677- Yoshida, Yamaguchi-shi,

More information

An Implementation of a Soft-Input Stack Decoder For Tailbiting Convolutional Codes

An Implementation of a Soft-Input Stack Decoder For Tailbiting Convolutional Codes An Implementation of a Soft-Input Stack Decoder For Tailbiting Convolutional Codes Mukundan Madhavan School Of ECE SRM Institute Of Science And Technology Kancheepuram 603203 mukundanm@gmail.com Andrew

More information

3 No-Wait Job Shops with Variable Processing Times

3 No-Wait Job Shops with Variable Processing Times 3 No-Wait Job Shops with Variable Processing Times In this chapter we assume that, on top of the classical no-wait job shop setting, we are given a set of processing times for each operation. We may select

More information

A Memory Efficient FPGA Implementation of Quasi-Cyclic LDPC Decoder

A Memory Efficient FPGA Implementation of Quasi-Cyclic LDPC Decoder Proceedings of the 5th WSEAS Int. Conf. on Instrumentation, Measurement, Circuits and Systems, angzhou, China, April 6-8, 26 (pp28-223) A Memory Efficient FPGA Implementation of Quasi-Cyclic DPC Decoder

More information

Threshold-Based Markov Prefetchers

Threshold-Based Markov Prefetchers Threshold-Based Markov Prefetchers Carlos Marchani Tamer Mohamed Lerzan Celikkanat George AbiNader Rice University, Department of Electrical and Computer Engineering ELEC 525, Spring 26 Abstract In this

More information

A Class of Group-Structured LDPC Codes

A Class of Group-Structured LDPC Codes A Class of Group-Structured LDPC Codes R. Michael Tanner Deepak Sridhara and Tom Fuja 1 Computer Science Department Dept. of Electrical Engineering University of California, Santa Cruz, CA 95064 Univ.

More information

FORWARD error correction (FEC) is one of the key

FORWARD error correction (FEC) is one of the key 3052 IEEE COMMUNICATIONS SURVEYS & TUTORIALS, VOL. 18, NO. 4, FOURTH QUARTER 2016 Turbo Product Codes: Applications, Challenges, and Future Directions H. Mukhtar, Member, IEEE, A. Al-Dweik, Senior Member,

More information

Improving Min-sum LDPC Decoding Throughput by Exploiting Intra-cell Bit Error Characteristic in MLC NAND Flash Memory

Improving Min-sum LDPC Decoding Throughput by Exploiting Intra-cell Bit Error Characteristic in MLC NAND Flash Memory Improving Min-sum LDPC Decoding Throughput by Exploiting Intra-cell Bit Error Characteristic in MLC NAND Flash Memory Wenzhe Zhao, Hongbin Sun, Minjie Lv, Guiqiang Dong, Nanning Zheng, and Tong Zhang Institute

More information

Research Article Improved Design of Unequal Error Protection LDPC Codes

Research Article Improved Design of Unequal Error Protection LDPC Codes Hindawi Publishing Corporation EURASIP Journal on Wireless Communications and Networking Volume 2010, Article ID 423989, 8 pages doi:10.1155/2010/423989 Research Article Improved Design of Unequal Error

More information

1. Introduction. 2. Motivation and Problem Definition. Volume 8 Issue 2, February Susmita Mohapatra

1. Introduction. 2. Motivation and Problem Definition. Volume 8 Issue 2, February Susmita Mohapatra Pattern Recall Analysis of the Hopfield Neural Network with a Genetic Algorithm Susmita Mohapatra Department of Computer Science, Utkal University, India Abstract: This paper is focused on the implementation

More information

Performance Analysis of Min-Sum LDPC Decoding Algorithm S. V. Viraktamath 1, Girish Attimarad 2

Performance Analysis of Min-Sum LDPC Decoding Algorithm S. V. Viraktamath 1, Girish Attimarad 2 Performance Analysis of Min-Sum LDPC Decoding Algorithm S. V. Viraktamath 1, Girish Attimarad 2 1 Department of ECE, SDM College of Engineering and Technology, Dharwad, India 2 Department of ECE, Dayanand

More information