Rozprawy doktorskie na temat „Parity-check codes”
Utwórz poprawne odniesienie w stylach APA, MLA, Chicago, Harvard i wielu innych
Sprawdź 50 najlepszych rozpraw doktorskich naukowych na temat „Parity-check codes”.
Przycisk „Dodaj do bibliografii” jest dostępny obok każdej pracy w bibliografii. Użyj go – a my automatycznie utworzymy odniesienie bibliograficzne do wybranej pracy w stylu cytowania, którego potrzebujesz: APA, MLA, Harvard, Chicago, Vancouver itp.
Możesz również pobrać pełny tekst publikacji naukowej w formacie „.pdf” i przeczytać adnotację do pracy online, jeśli odpowiednie parametry są dostępne w metadanych.
Przeglądaj rozprawy doktorskie z różnych dziedzin i twórz odpowiednie bibliografie.
Adhikari, Dikshya. "The Role of Eigenvalues of Parity Check Matrix in Low-Density Parity Check Codes". Thesis, University of North Texas, 2020. https://digital.library.unt.edu/ark:/67531/metadc1707297/.
Pełny tekst źródłaHayes, Bob. "LOW DENSITY PARITY CHECK CODES FOR TELEMETRY APPLICATIONS". International Foundation for Telemetering, 2007. http://hdl.handle.net/10150/604497.
Pełny tekst źródłaNext generation satellite communication systems require efficient coding schemes that enable high data rates, require low overhead, and have excellent bit error rate performance. A newly rediscovered class of block codes called Low Density Parity Check (LDPC) codes has the potential to revolutionize forward error correction (FEC) because of the very high coding rates. This paper presents a brief overview of LDPC coding and decoding. An LDPC algorithm developed by Goddard Space Flight Center is discussed, and an overview of an accompanying VHDL development by L-3 Communications Cincinnati Electronics is presented.
Tee, James Seng Khien. "On concatenated single parity check codes and bit interleaved coded modulation". Thesis, University of Canterbury. Electrical and Electronic Engineering, 2001. http://hdl.handle.net/10092/5463.
Pełny tekst źródłaSharifi, Tehrani Saeed. "Stochastic decoding of low-density parity-check codes". Thesis, McGill University, 2011. http://digitool.Library.McGill.CA:80/R/?func=dbin-jump-full&object_id=97010.
Pełny tekst źródłaÀ ce jour, les codes Low-Density Parity-Check (LDPC) font partie des codes correcteurs d'erreurs les plus performants. Ces codes sont inclus dans différents standards de communications numériques. Dans ce manuscrit, nous proposons d'utiliser le décodage stochastique pour les codes LDPC. D'autre part, nous démontrons que pour les codes LDPC, le décodage stochastique représente une alternative réaliste aux algorithmes de décodage existants.Dans le processus de décodage stochastique, les probabilités sont représentées sous forme de séquences de Bernoulli. L'information est contenue dans la statistique de ces flux binaires aléatoires. Cette représentation particulière permet d'exécuter des calculs intensifs avec une faible complexité matérielle. Cependant le décodage stochastique est enclin au problème du verrouillage ("latching"). La corrélation entre les bits des différents flux au sein des cycles du graphe biparti dégrade les performances du décodage stochastique des codes LDPC. Pour résoudre le problème du verrouillage, nous proposons trois solutions: les mémoires de branche, les mémoires de suivi, et les mémoires de suivi à majorité. Ces différents composants permettent de suivre l'évolution de la statistique des flux binaires et de réintroduire des éléments aléatoires au sein des séquences observées, minimisant ainsi le phénomène de verrouillage. À notre connaissance, il s'agit là des premiers résultats probants permettant un décodage stochastique efficace des codes LDPC. Nous proposons de nouvelles architectures de décodeurs associées à leurs implantations matérielles respectives. La plus perfectionnée des architectures présentée ici est celle d'un décodeur stochastique pour le code LDPC (2048,1723) associé au standard IEEE 802.3an. À notre connaissance, en comparaison avec l'état de l'art actuel, ce décodeur dispose du meilleur rapport vitesse/complexité. Le débit maximum (au niveau du coeur), est de 61.3 Gb/s, il s'agit là du plus rapide des décodeurs de codes LDPC à décisions souples connu à ce jour. Nous présentons par ailleurs les performances de ce décodeur à très faible taux d'erreurs binaire. De plus, nous proposons d'appliquer le calcul stochastique au décodage conjoint des codes LDPC et des canaux à réponse partielle qui est utilisé dans les applications d'enregistrement magnétique. Enfin, nous étudions l'extension du décodage stochastique au décodage des codes en blocs ayant une matrice de parité à forte densité. Nous appliquons le décodage stochastique sur des graphes biparti aux codes Reed-Solomon, Bose-Chaudhuri-Hocquenghem, et aux turbocodes en blocs.
Meidan, Amir. "Linear-time encodable low-density parity-check codes". Thesis, National Library of Canada = Bibliothèque nationale du Canada, 1998. http://www.collectionscanada.ca/obj/s4/f2/dsk1/tape11/PQDD_0006/MQ40942.pdf.
Pełny tekst źródłaDavey, M. C. "Error-correction using low-density parity-check codes". Thesis, University of Cambridge, 2000. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.598305.
Pełny tekst źródłaRankin, David Michael. "Single parity check product codes and iterative decoding". Thesis, University of Canterbury. Electrical and Computer Engineering, 2001. http://hdl.handle.net/10092/1084.
Pełny tekst źródłaAnitei, Irina. "Circular Trellis based Low Density Parity Check Codes". Ohio University / OhioLINK, 2008. http://rave.ohiolink.edu/etdc/view?acc_num=ohiou1226513009.
Pełny tekst źródłaMoon, Todd K., i Jacob H. Gunther. "AN INTRODUCTION TO LOW-DENSITY PARITY-CHECK CODES". International Foundation for Telemetering, 2003. http://hdl.handle.net/10150/607470.
Pełny tekst źródłaLow-Density Parity-Check (LDPC) codes are powerful codes capable of nearly achieving the Shannon channel capacity. This paper presents a tutorial introduction to LDPC codes, with a detailed description of the decoding algorithm. The algorithm propagates information about bit and check probabilities through a tree obtained from the Tanner graph for the code. This paper may be useful as a supplement in a course on error-control coding or digital communication.
Ha, Jeongseok Ha. "Low-Density Parity-Check Codes with Erasures and Puncturing". Diss., Georgia Institute of Technology, 2003. http://hdl.handle.net/1853/5296.
Pełny tekst źródłaBlad, Anton. "Efficient Decoding Algorithms for Low-Density Parity-Check Codes". Thesis, Linköping University, Department of Electrical Engineering, 2005. http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-2794.
Pełny tekst źródłaLow-density parity-check codes have recently received much attention because of their excellent performance and the availability of a simple iterative decoder. The decoder, however, requires large amounts of memory, which causes problems with memory consumption.
We investigate a new decoding scheme for low density parity check codes to address this problem. The basic idea is to define a reliability measure and a threshold, and stop updating the messages for a bit whenever its reliability is higher than the threshold. We also consider some modifications to this scheme, including a dynamic threshold more suitable for codes with cycles, and a scheme with soft thresholds which allow the possibility of removing a decision which have proved wrong.
By exploiting the bits different rates of convergence we are able to achieve an efficiency of up to 50% at a bit error rate of less than 10^-5. The efficiency should roughly correspond to the power consumption of a hardware implementation of the algorithm.
Ismail, Mohamed Rafiq. "High throughput decoding of low density parity check codes". Thesis, University of Bristol, 2011. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.556712.
Pełny tekst źródłaVijayakumar, Suresh Mikler Armin. "FPGA implementation of low density parity check codes decoder". [Denton, Tex.] : University of North Texas, 2009. http://digital.library.unt.edu/permalink/meta-dc-11003.
Pełny tekst źródłaZhang, Kai. "High-Performance Decoder Architectures For Low-Density Parity-Check Codes". Digital WPI, 2012. https://digitalcommons.wpi.edu/etd-dissertations/17.
Pełny tekst źródłaChen, Jinghu. "Reduced complexity decoding algorithms for low-density parity check codes and turbo codes". Thesis, University of Hawaii at Manoa, 2003. http://hdl.handle.net/10125/6885.
Pełny tekst źródłaxiii, 117 leaves
Kim, Jaehong. "Design of rate-compatible structured low-density parity-check codes". Diss., Atlanta, Ga. : Georgia Institute of Technology, 2006. http://hdl.handle.net/1853/19723.
Pełny tekst źródłaCommittee Chair: McLaughlin, Steven; Committee Member: Barry, John; Committee Member: Boldyreva, Alexandra; Committee Member: Clements, Mark; Committee Member: Li, Ye.
Kolayli, Mert. "Comparison Of Decoding Algorithms For Low-density Parity-check Codes". Master's thesis, METU, 2006. http://etd.lib.metu.edu.tr/upload/12607731/index.pdf.
Pełny tekst źródłahowever, the performance of the sum-product decoder deteriorates for information rates below 0.5 instead of improving. By irregular construction of LDPC codes, a performance improvement is observed especially for low SNR values.
Richter, Gerd. "Puncturing, mapping, and design of low-density parity-check codes". Düsseldorf VDI-Verl, 2008. http://d-nb.info/99372230X/04.
Pełny tekst źródłaMantha, Ramesh. "Hybrid automatic repeat request schemes using turbo codes and low-density parity check codes". Thesis, National Library of Canada = Bibliothèque nationale du Canada, 1999. http://www.collectionscanada.ca/obj/s4/f2/dsk1/tape8/PQDD_0019/MQ58728.pdf.
Pełny tekst źródłaPirou, Florent. "Low-density Parity-Check decoding Algorithms". Thesis, Linköping University, Department of Electrical Engineering, 2004. http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-2160.
Pełny tekst źródłaRecently, low-density parity-check (LDPC) codes have attracted much attention because of their excellent error correcting performance and highly parallelizable decoding scheme. However, the effective VLSI implementation of and LDPC decoder remains a big challenge and is a crucial issue in determining how well we can exploit the benefits of the LDPC codes in the real applications. In this master thesis report, following a error coding background, we describe Low-Density Parity-Check codes and their decoding algorithm, and also requirements and architectures of LPDC decoder implementations.
Kopparthi, Sunitha. "Flexible encoder and decoder designs for low-density parity-check codes". Diss., Manhattan, Kan. : Kansas State University, 2010. http://hdl.handle.net/2097/4190.
Pełny tekst źródłaLiu, Yue Electrical Engineering & Telecommunications Faculty of Engineering UNSW. "Design of structured nonbinary quasi-cyclic low-density parity-check codes". Publisher:University of New South Wales. Electrical Engineering & Telecommunications, 2009. http://handle.unsw.edu.au/1959.4/43616.
Pełny tekst źródłaPlanjery, Shiva Kumar. "Iterative Decoding Beyond Belief Propagation of Low-Density Parity-Check Codes". Diss., The University of Arizona, 2013. http://hdl.handle.net/10150/305883.
Pełny tekst źródłaHussein, Ahmed Refaey Ahmed. "Universal Decoder for Low Density Parity Check, Turbo and Convolutional Codes". Thesis, Université Laval, 2011. http://www.theses.ulaval.ca/2011/28154/28154.pdf.
Pełny tekst źródłaHou, Jilei. "Capacity-approaching coding schemes based on low-density parity-check codes /". Diss., Connect to a 24 p. preview or request complete full text in PDF format. Access restricted to UC campuses, 2003. http://wwwlib.umi.com/cr/ucsd/fullcit?p3076341.
Pełny tekst źródłaHo, Ki-hiu. "Study of quantum low density parity check and quantum degenerate codes". Click to view the E-thesis via HKUTO, 2009. http://sunzi.lib.hku.hk/hkuto/record/B41897109.
Pełny tekst źródłaMei, Zhen. "Analysis of low-density parity-check codes on impulsive noise channels". Thesis, University of Newcastle upon Tyne, 2017. http://hdl.handle.net/10443/3758.
Pełny tekst źródłaPlanjery, Shiva Kumar. "Iterative decoding beyond belief propagation for low-density parity-check codes". Thesis, Cergy-Pontoise, 2012. http://www.theses.fr/2012CERG0618.
Pełny tekst źródłaAt the heart of modern coding theory lies the fact that low-density parity-check (LDPC) codes can be efficiently decoded by message-passing algorithms which are traditionally based on the belief propagation (BP) algorithm. The BP algorithm operates on a graphical model of a code known as the Tanner graph, and computes marginals of functions on the graph. While inference using BP is exact only on loop-free graphs (trees), the BP still provides surprisingly close approximations to exact marginals on loopy graphs, and LDPC codes can asymptotically approach Shannon's capacity under BP decoding.However, on finite-length codes whose corresponding graphs are loopy, BP is sub-optimal and therefore gives rise to the error floor phenomenon. The error floor is an abrupt degradation in the slope of the error-rate performance of the code in the high signal-to-noise regime, where certain harmful structures generically termed as trapping sets present in the Tanner graph of the code, cause the decoder to fail. Moreover, the effects of finite precision that are introduced during hardware realizations of BP can further contribute to the error floor problem.In this dissertation, we introduce a new paradigm for finite precision iterative decoding of LDPC codes over the Binary Symmetric channel (BSC). These novel decoders, referred to as finite alphabet iterative decoders (FAIDs) to signify that the message values belong to a finite alphabet, are capable of surpassing the BP in the error floor region. The messages propagated by FAIDs are not quantized probabilities or log-likelihoods, and the variable node update functions do not mimic the BP decoder, which is in contrast to traditional quantized BP decoders. Rather, the update functions are simple maps designed to ensure a higher guaranteed error correction capability by using the knowledge of potentially harmful topologies that could be present in a given code. We show that on several column-weight-three codes of practical interest, there exist 3-bit precision FAIDs that can surpass the BP (floating-point) in the error floor without any compromise in decoding latency. Hence, they are able to achieve a superior performance compared to BP with only a fraction of its complexity.Additionally in this dissertation, we propose decimation-enhanced FAIDs for LDPC codes, where the technique of decimation is incorporated into the variable node update function of FAIDs. Decimation, which involves fixing certain bits of the code to a particular value during the decoding process, can significantly reduce the number of iterations required to correct a fixed number of errors while maintaining the good performance of a FAID, thereby making such decoders more amenable to analysis. We illustrate this for 3-bit precision FAIDs on column-weight-three codes. We also show how decimation can be used adaptively to further enhance the guaranteed error correction capability of FAIDs that are already good on a given code. The new adaptive decimation scheme proposed has marginally added complexity but can significantly improve the slope of the error floor performance of a particular FAID. On certain high-rate column-weight-three codes of practical interest, we show that adaptive decimation-enhanced FAIDs can achieve a guaranteed error-correction capability that is close to the theoretical limit achieved by maximum-likelihood decoding
Healy, Cornelius Thomas. "Short-length low-density parity-check codes : construction and decoding algorithms". Thesis, University of York, 2014. http://etheses.whiterose.ac.uk/7875/.
Pełny tekst źródłaPlanjery, Shiva Kumar. "Low-Complexity Finite Precision Decoders for Low-Density Parity-Check Codes". International Foundation for Telemetering, 2010. http://hdl.handle.net/10150/605947.
Pełny tekst źródłaWe present a new class of finite-precision decoders for low-density parity-check (LDPC) codes. These decoders are much lower in complexity compared to conventional floating-point decoders such as the belief propagation (BP) decoder, but they have the potential to outperform BP. The messages utilized by the decoders assume values (or levels) from a finite discrete set. We discuss the implementation aspects as well as describe the underlying philosophy in designing these decoders. We also provide results to show that in some cases, only 3 bits are required in the proposed decoders to outperform floating-point BP.
Ho, Ki-hiu, i 何其曉. "Study of quantum low density parity check and quantum degeneratecodes". Thesis, The University of Hong Kong (Pokfulam, Hong Kong), 2009. http://hub.hku.hk/bib/B41897109.
Pełny tekst źródłaMiller, John. "High code rate, low-density parity-check codes with guaranteed minimum distance and stopping weight /". Diss., Connect to a 24 p. preview or request complete full text in PDF format. Access restricted to UC campuses, 2003. http://wwwlib.umi.com/cr/ucsd/fullcit?p3090443.
Pełny tekst źródłaHur, Woonhaing. "Incremental Redundancy Low-Density Parity-Check Codes for Hybrid FEC/ARQ Schemes". Diss., Georgia Institute of Technology, 2007. http://hdl.handle.net/1853/14491.
Pełny tekst źródłaKazanci, Onur Husnu. "Performance Of Pseudo-random And Quasi-cyclic Low Density Parity Check Codes". Master's thesis, METU, 2007. http://etd.lib.metu.edu.tr/upload/12609036/index.pdf.
Pełny tekst źródłaBardak, Erinc Deniz. "Design And Performance Of Capacity Approaching Irregular Low-density Parity-check Codes". Master's thesis, METU, 2009. http://etd.lib.metu.edu.tr/upload/12611084/index.pdf.
Pełny tekst źródła2/3/13&rsquo
since it has some variable nodes of degree 2 and 13 in addition to the majority of degree-3 nodes. The observed performance is found to be very close to that of the capacity approaching commercial codes. Time spent for decoding 50,000 codewords of length 1800 at Eb/No=1.6 dB for an irregular 2/3/13 code is measured to be 19% less than that of the regular (3, 6) code, mainly because of the smaller number of decoding failures.
Selvarathinam, Anand Manivannan. "High throughput low power decoder architectures for low density parity check codes". Texas A&M University, 2005. http://hdl.handle.net/1969.1/2529.
Pełny tekst źródłaChen, Lei. "Construction of structured low-density parity-check codes : combinatorial and algebraic approaches /". For electronic version search Digital dissertations database. Restricted to UC campuses. Access is free to UC campus dissertations, 2005. http://uclibs.org/PID/11984.
Pełny tekst źródłaYang, Sizhen Michael. "Construction of low-density parity-check codes for data storage and transmission". Diss., The University of Arizona, 2004. http://hdl.handle.net/10150/280665.
Pełny tekst źródłaLändner, Stefan [Verfasser]. "Improving the Error-Floor Behavior of Low-Density Parity-Check Codes / Stefan Ländner". Aachen : Shaker, 2011. http://d-nb.info/1070151254/34.
Pełny tekst źródłaPapaharalabos, Stylianos. "Efficient iterative decoding algorithms for turbo and low-density parity-check (LDPC) codes". Thesis, University of Surrey, 2005. http://epubs.surrey.ac.uk/804383/.
Pełny tekst źródłaWu, Xiaoxiao. "Efficient design and decoding of the rate-compatible low-density parity-check codes /". View abstract or full-text, 2009. http://library.ust.hk/cgi/db/thesis.pl?ECED%202009%20WUXX.
Pełny tekst źródłaSandberg, Sara. "Low-density parity-check codes : unequal error protection and reduction of clipping effects /". Luleå, 2009. http://pure.ltu.se/ws/fbspretrieve/2546109.
Pełny tekst źródłaHuang, Jen-Fa. "On finding generator polynomials and parity-check sums of binary projective geometry codes". Thesis, University of Ottawa (Canada), 1985. http://hdl.handle.net/10393/4800.
Pełny tekst źródłaKrishnan, Anantha Raman, i Shashi Kiran Chilappagari. "Low-Density Parity-Check Codes Which Can Correct Three Errors Under Iterative Decoding". International Foundation for Telemetering, 2009. http://hdl.handle.net/10150/606118.
Pełny tekst źródłaIn this paper, we give necessary and sufficient conditions for low-density parity-check (LDPC) codes with column-weight four to correct three errors when decoded using hard-decision message-passing decoding. We then give a construction technique which results in codes satisfying these conditions. We also provide numerical assessment of code performance via simulation results.
Ma, Xudong. "On Constructing Low-Density Parity-Check Codes". Thesis, 2007. http://hdl.handle.net/10012/3440.
Pełny tekst źródłaGhayoor, Farzad. "Non-binary compound codes based on single parity-check codes". Thesis, 2013. http://hdl.handle.net/10413/10422.
Pełny tekst źródłaThesis (Ph.D.)-University of KwaZulu-Natal, Durban, 2013.
Malema, Gabofetswe Alafang. "Low-density parity-check codes : construction and implementation". 2007. http://hdl.handle.net/2440/45525.
Pełny tekst źródłaThesis(Ph.D.) -- University of Adelaide, School of Electrical and Electronic Engineering, 2007
Jhih-Siang, Wang, i 王致翔. "Density Evolution for Low-Density Parity-Check Codes". Thesis, 2011. http://ndltd.ncl.edu.tw/handle/83172527534429207322.
Pełny tekst źródła國立中正大學
通訊工程研究所
99
In this paper, we demonstrate the Low-density parity-check (LDPC) codes and density evolution (DE). LDPC codes are a class of linear block codes which provide near-capacity performance on large data transmission by using belief propagation (BP) iterative decoding algorithm. In well design degree distribution, the rate 1/2 LDPC code can approach Shannon limit within 0.0045 dB for binary-input AWGN channels. Density evolution is a very useful and straightforward method to analyze the LDPC codes. In three assuming conditions, we can simulation and find the threshold for different rates binary-input memoryless channel. By using density evolution, we could know the LDPC code that we designed performs well or not, and then find the good degree distribution for LDPC code via density evolution to achieve the Shannon limit asymptotically as the block length tends to infinity become possible.
Lee, Huang-Chang, i 李晃昌. "Decoding Scheduling for Low-Density Parity-Check Codes". Thesis, 2014. http://ndltd.ncl.edu.tw/handle/9q2ctb.
Pełny tekst źródła國立清華大學
電機工程學系
103
When the iterative Belief Propagation (BP) decoding algorithm is applied to low-density parity-check (LDPC) codes, the convergence speed in the waterfall region and the error floor in the high SNR region are two of the most important metrics of performance measurement. Both can be significantly improved using the scheduling techniques proposed in this thesis. Fast convergence can be achieved using informed dynamic scheduling (IDS) since the important decoding messages have more opportunities of being updated. However, greedy groups and silent variable nodes can be observed in many IDS decoders, and these obstruct the decoders from providing a satisfactory convergence error-rate performance. In this thesis, Q-RBP (Quota-based residual BP) and SVNF-BP (Silent-Variable-Node-Free BP) are proposed in order to suppress greedy groups and silent variable nodes, respectively. Since the number of updates for each message is limited by the proposed Q-RBP schedule, the message updates that would potentially form a greedy group are forced to release the occupied computation resources. On the other hand, following the SVNF-RBP schedule, the messages associated with all variable nodes are arranged to have an equal chance of contributing their intrinsic messages, and hence the silent variable nodes are totally avoided. Both the Q-RBP and SVNF-RBP schedules can provide a significant improvement in decoding performance when compared to other IDS decoders presented in the previous literature. Additional pre-computations are required in most of IDS decoders, including Q-RBP and the SVNF-RBP schedules, so as to order customized decoding sequences for individually received codewords. However, rather than arranging the decoding schedule based on each received codeword, the proposed maximum mutual information increase (M^2I^2)-based algorithm determines the schedule based on maximizing the increase in mutual information. A pre-determined and fixed decoding schedule can be applied to all codewords, and the decoding convergence can be accelerated without increasing the decoding complexity. Moreover, when multiple distinct schedules are applied to a single codeword to create schedule diversity, the error floor can be significantly lowered without requiring any knowledge of trapping sets. When the proposed decoding schedules are applied to punctured LDPC codes, the benefit in increasing convergence speed can be more significant compared to dedicated codes. If rate-compatible (RC)-LDPC codes constructed based on puncturing are considered, the $\mathrm{M^2I^2}$-based algorithm can be used to arrange fixed schedules for incremental decoding, and further reduce the required number of iterations. With the assistance of the proposed decoding schedules, the puncture-based RC-LDPC codes can be a potential solution for delay-sensitive HARQ (Hybrid-Automatic Repeat reQuest) applications.
Smith, Benjamin. "Low-density parity-check codes with reduced decoding complexity". 2007. http://link.library.utoronto.ca/eir/EIRdetail.cfm?Resources__ID=452849&T=F.
Pełny tekst źródła