Description: Software for Low Density Parity Check Codes Radford M. Neal Version of 2006-02-08. This collection of programs and modules, written in C, is intended to support research and education concerning Low Density Parity Check (LDPC) codes. (Note, however, that the copyright notice no longer restricts use to these purposes). These codes were invented by Robert Gallager in the early 1960's, and re-invented and shown to have very good performance by David MacKay and myself in the mid-1990's. The decoding algorithm for LDPC codes is related to that used for Turbo codes, and to probabilistic inference methods used in other fields. Variations on LDPC and Turbo codes are currently the best practical codes known, in terms of their ability to transmit data at rates approaching channel capacity with very low error probability. Platform: |
Size: 405064 |
Author:netor4you@yahoo.com |
Hits:
Description: [LDPC码]是LDPC码相关论文
[WuYuFei]中是WuYuFei的论文
[WuYufei_matlab]是WuYufei做Turbo码的Matlab程序
程序实现在固定信噪比和卷积长度的条件下，计算不同正常的帧错误概率和比特错误概率
turbo_sys_demo.m是主程序
其中trellis.m是构造网格的子程序
logmapo.m是LOGMAP译码算法子程序
sova0.m是SOVA译码算法子程序
encoderm.m是编码子程序
[22]是以WuYufei程序的改动，实现在帧长、信噪比和迭代次数固定的情况下，获得两个译码器的先验信息的变化情况
http://www.pudn.com
-[LDPC Code] LDPC code is a relevant paper [WuYuFei] is WuYuFei paper [WuYufei_matlab] is to do WuYufei procedures Turbo Codes Matlab program signal to noise ratio at a fixed length and convolution conditions, different normal frame error probability and the bit error probability is turbo_sys_demo.m main structure of which is trellis.m grid is logmapo.m Subroutine Subroutine LOGMAP decoding algorithm is the SOVA decoding algorithm sova0.m Subroutine Subroutine encoderm.m coding [22 ] WuYufei procedure is based on changes in帧长realize, signal to noise ratio and a fixed number of iterations circumstances, the acquisition of two decoder a priori information changes http://www.pudn.com Platform: |
Size: 1771520 |
Author:李灵 |
Hits:
Description: 在3G通讯中，turbo码以其优异的性能几乎达到了香浓定理的极限。我们提供一种低功耗的turbo码译码算法-In the 3G communications, turbo codes for its excellent performance almost reached the limit of Shannon theorem. We provide a low-power turbo code decoding algorithm Platform: |
Size: 178176 |
Author:wulinbo |
Hits:
Description: 由于Turbo码在接近Shannon极限的低信噪比下仍然能够获得较低的误码率，所以在近几年已成为编码理论界研究的热门领域，在第三代移动通信系统的开发中，Turbo码被普遍认为是高速数据信道的纠错编码方式。现在人们对Turbo码的主要研究包括编码器、交织器的设计及软输入、软输出迭代译码的算法。-This kind of codes has given rise to a large interest in the coding theory because of the can still aehieve small bit error rate at low SNR close to the Shannon capacity limits.In the development of the third generation mobile communieation systems，it is well kllown that Turbo codes are the way of correct coding of high-speeding data channel. The researeh of Turbo codes includes the design of the encoder，the illterleaver and soft-out/soft-in iterative decoding algorithm. Platform: |
Size: 96256 |
Author:陈吉伟 |
Hits:
Description: 运用Log-Map迭代译码算法实现Turbo码的简化译码，改善了码率，提高译码速度，减小了运算量。-The use of Log-Map iterative decoding algorithm decoding Turbo codes to simplify and improve the bit rate, improve decoding speed and reduce the computational complexity. Platform: |
Size: 118784 |
Author:何天玲 |
Hits:
Description: 课程设计两个程序：一：数据帧（程序每帧设置为400bit)在有扰信道传输时，采用Turbo码进行编译码。并仿真Log-MAP译码算法在不同迭代次数下的性能。
二：实现有扰信道中，不同信噪比下，采用MAP译码算法的Turbo码的性能。
以上各主程序均有做比较详细的程序注释
可直接运行turbo_main.m或LogMAP.m，稍等片刻即可观察到仿真结果
-two programs of Curriculum design : a: Data frames (each frame is setted to 400bit per frame) ,under a interferent channel transmission uses Turbo codes and decodes. including simulation of Log-MAP decoding algorithm performance under different number of its iterations.
2: To achieve the simulate the performance of MAP decoding algorithm for Turbo code,with different SNR that is decided by interferent channel.
Above the main program have to do a more detailed program notes
Can be directly run turbo_main.m or LogMAP.m, wait a moment to the simulation results can be observed Platform: |
Size: 346112 |
Author:陈侯海 |
Hits:
Description: Turbo码编译码的matlab源代码，包括logMAP算法与SOVA算法。可设置信道SNR参数，帧长度，删余系数等。-Turbo Codes Encoding and Decoding of the matlab source code, including logMAP algorithm and SOVA algorithms. Parameters can be set to channel SNR, frame length, deleted I coefficient. Platform: |
Size: 9216 |
Author:nostalgia |
Hits:
Description: Abstract—In this letter, we propose an efficient decoding algorithm
for turbo product codes as introduced by Pyndiah. The proposed
decoder has no performance degradation and reduces the
complexity of the original decoder by an order of magnitude. We
concentrate on extended Bose–Chaudhuri–Hocquengem codes as
the constituent row and column codes because of their already low
implementation complexity. For these component codes, we observe
that the weight and reliability factors can be fixed, and that
there is no need for normalization. Furthermore, as opposed to
previous efficient decoders, the newly proposed decoder naturally
scales with a test-pattern parameter that can change as a function
of iteration number, i.e., the efficient Chase algorithm presented
here uses conventionally ordered test patterns, and the syndromes,
even parities, and extrinsic metrics are obtained with a minimum
number of operations. Platform: |
Size: 95232 |
Author:cordic |
Hits:
Description: 这是一套完整的支持wimax 16e协议CTC的编译码程序，
主程序在demo.c
译码器：tcdecoder.c
编码器：tcencoder.c-/* This program simulates the classical turbo encoding-decoding system on PC.*/
/* It uses parallel concatenated convolutional codes described in Figure 2.9 in Chapter 2.*/
/* Two component RSC (Recursive Systematic Convolutional) encoders are used. */
/* First encoder is terminated with tails bits. (Info+ tail) bits are scrambled and */
/* passed to the second encoder, while second encoder is left open without tail bits. */
/* Random information bits are modulated into+1/-1, and transmitted through an AWGN channel.*/
/* Interleavers are randomly generated for each frame.*/
/* Log-MAP algorithm without quantization or approximation is used.*/
/* By making use of ln(e^x+e^y) = max (x,y)+ ln(1+e^(-abs(x-y))), */
/* the Log-MAP is simplified with a look-up table for the correction term.*/
/* When the approximation ln(e^x+e^y) = max (x,y) is, we have MAX-Log-MAP.*/
/* To set the number of iterations, change the globle variable "DECITER". To set the fr Platform: |
Size: 26624 |
Author:bennytang |
Hits:
Description: Turbo码的MAX_LOGmap译码算法仿真程序。
基于吴宇飞博士的Turbo码MATLAB仿真程序写的，吴宇飞的程序请自行下载吧，此子程序可直接替换使用，也调用了吴的子程序。
欢迎高手指点~-Turbo code decoding algorithm MAX_LOGmap simulation program. Turbo codes based on Dr. Wu Yufei' s simulation program written in MATLAB, Wu Yufei program please download it, the routine use of direct replacement, also called Wu subroutine. Welcome expert guidance ~ Platform: |
Size: 1024 |
Author:ZhangN |
Hits:
Description: This script simulates the classical turbo encoding-decoding system.
It simulates parallel concatenated convolutional codes.
Two component rate 1/2 RSC (Recursive Systematic Convolutional) component encoders are assumed.
First encoder is terminated with tails bits. (Info + tail) bits are scrambled and passed to
the second encoder, while second encoder is left open without tail bits of itself.
Random information bits are modulated into +1/-1, and transmitted through a AWGN channel.
Interleavers are randomly generated for each frame.
Log-MAP algorithm without quantization or approximation is used.
By making use of ln(e^x+e^y) = max(x,y) + ln(1+e^(-abs(x-y))),
the Log-MAP can be simplified with a look-up table for the correction function.
If use approximation ln(e^x+e^y) = max(x,y), it becomes MAX-Log-MAP.- This script simulates the classical turbo encoding-decoding system.
It simulates parallel concatenated convolutional codes.
Two component rate 1/2 RSC (Recursive Systematic Convolutional) component encoders are assumed.
First encoder is terminated with tails bits. (Info + tail) bits are scrambled and passed to
the second encoder, while second encoder is left open without tail bits of itself.
Random information bits are modulated into +1/-1, and transmitted through a AWGN channel.
Interleavers are randomly generated for each frame.
Log-MAP algorithm without quantization or approximation is used.
By making use of ln(e^x+e^y) = max(x,y) + ln(1+e^(-abs(x-y))),
the Log-MAP can be simplified with a look-up table for the correction function.
If use approximation ln(e^x+e^y) = max(x,y), it becomes MAX-Log-MAP. Platform: |
Size: 2048 |
Author:yk |
Hits:
Description: 本书系统讲解了差错控制编码系统的基础理论和实际应用，主要内容包括：用于可靠数字传输和存储的编码、线性分组码、循环码、二进制BCH码、大数逻辑可译码与有限几何码、线性分组码的网格、卷积码、基于网格的软判决译码算法、Turbo编码、低密度单奇偶校验码、网格编码调制等。本书包含大量实例和习题，讲解深入浅出，分析细致透彻，是差错控制编码领域中的经典教材。-This book explains the system of error control coding system, the basic theory and practical application, the main contents include: digital transmission and storage for reliable coding, linear block codes, cyclic codes, binary BCH codes, decoding logic of large numbers with limited geometric codes, linear block code grid, convolutional codes, grid-based soft-decision decoding algorithm, Turbo coding, low-density single-parity-check codes, trellis coded modulation. This book contains a large number of examples and exercises, analysis. It s the classic textbook in the field of error control coding. Platform: |
Size: 20987904 |
Author:Winnie |
Hits:
Description: 通过MATLAB平台对通信仿真，研究讨论Turbo码的编译码结构，四种Turbo码译码算法，讨论Turbo码中几种常见的交织器，利用MATLAB软件平台进行并行级联Turbo卷积码的性能仿真，仿真评估了不同设计参数对Turbo码性能的影响。-Through MATLAB simulation platform for communications, research and discussion Turbo code decoding structure, four kinds of Turbo code decoding algorithm, discuss several common Turbo code interleaver, using MATLAB software platform for parallel concatenated convolutional codes Turbo Performance Simulation , simulation and evaluation of different design parameters on Turbo code performance. Platform: |
Size: 11264 |
Author:马东韦 |
Hits:
Description: The BCJR algorithm is an algorithm for maximum a posteriori decoding of error correcting codes defined on trellises (principally convolutional codes). The algorithm is named after its inventors: Bahl, Cocke, Jelinek and Raviv.[1] This algorithm is critical to modern iteratively-decoded error-correcting codes including turbo codes and low-density parity-check codes. Platform: |
Size: 1331200 |
Author:kiki |
Hits:
Description: The MAP algorithm also known as BCJR algorithm is an algorithm for maximum a posteriori decoding of error correcting codes defined on trellises (principally convolutional codes). The algorithm is named after its inventors: Bahl, Cocke, Jelinek and Raviv. This algorithm is critical to modern iteratively-decoded error-correcting codes including turbo codes and low-density parity-check codes Platform: |
Size: 2325504 |
Author:abdullahgold |
Hits:
Description: Low-Density Parity-Check (LDPC) codes have gained lots of popularity due to their
capacity achieving/approaching property. This work studies the iterative decoding
also known as message-passing algorithms applied to LDPC codes. Belief propagation
(BP) algorithm and its approximations, most notably min-sum (MS), are popular
iterative decoding algorithms used for LDPC and turbo codes. The thesis is divided
in two parts. In the rst part, a low-complexity binary message-passing algorithm
derived the dynamic of analog decoders is presented and thoroughly studied.
In the second part, a modi cation for improving the performance of BP and MS
algorithms is proposed. It uses adaptive normalization of variable node message-Low-Density Parity-Check (LDPC) codes have gained lots of popularity due to their
capacity achieving/approaching property. This work studies the iterative decoding
also known as message-passing algorithms applied to LDPC codes. Belief propagation
(BP) algorithm and its approximations, most notably min-sum (MS), are popular
iterative decoding algorithms used for LDPC and turbo codes. The thesis is divided
in two parts. In the rst part, a low-complexity binary message-passing algorithm
derived the dynamic of analog decoders is presented and thoroughly studied.
In the second part, a modi cation for improving the performance of BP and MS
algorithms is proposed. It uses adaptive normalization of variable node message Platform: |
Size: 400384 |
Author:rag |
Hits:
Description: C语言实现的LDPC（Low Density Parity Check Codes）通信仿真代码(Software for Low Density Parity Check Codes
Version of 2012-02-11.
This collection of programs and modules, written in C, is intended to support research and education concerning Low Density Parity Check (LDPC) codes. (Note, however, that the copyright notice no longer restricts use to these purposes). These error-correcting codes were invented by Robert Gallager in the early 1960's, and re-invented and shown to have very good performance by David MacKay and myself in the mid-1990's. The decoding algorithm for LDPC codes is related to that used for Turbo codes, and to probabilistic inference methods used in other fields. Variations on LDPC and Turbo codes are currently the best practical codes known, in terms of their ability to transmit data at rates approaching channel capacity with very low error probability.) Platform: |
Size: 357376 |
Author:kai05911
|
Hits:
Search - decoding algorithm of turbo codes