Zaloguj się

Gotowe bibliografie tematyczne / Parity checker / Rozprawy doktorskie

Kliknij ten link, aby zobaczyć inne rodzaje publikacji na ten temat: Parity checker.

Rozprawy doktorskie na temat „Parity checker”

Autor: Grafiati

Data publikacji: 3 czerwca 2025

Data aktualizacji: 31 lipca 2025

Utwórz poprawne odniesienie w stylach APA, MLA, Chicago, Harvard i wielu innych

Wybierz rodzaj źródła:

Sprawdź 50 najlepszych rozpraw doktorskich naukowych na temat „Parity checker”.

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.

1

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ła

Streszczenie:

The new developments in coding theory research have revolutionized the application of coding to practical systems. Low-Density Parity Check (LDPC) codes form a class of Shannon limit approaching codes opted for digital communication systems that require high reliability. This thesis investigates the underlying relationship between the spectral properties of the parity check matrix and LDPC decoding convergence. The bit error rate of an LDPC code is plotted for the parity check matrix that has different Second Smallest Eigenvalue Modulus (SSEM) of its corresponding Laplacian matrix. It is found

Style APA, Harvard, Vancouver, ISO itp.

2

Guo, Feng. "Low density parity check coding." Thesis, University of Southampton, 2005. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.419159.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

3

Pirou, 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ła

Streszczenie:

<p>Recently, 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.</

Style APA, Harvard, Vancouver, ISO itp.

4

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ła

Style APA, Harvard, Vancouver, ISO itp.

5

Sharifi, 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

Streszczenie:

Low-Density Parity-Check (LDPC) codes are one of the most powerful classes of error-control codes known to date. These codes have been considered for many recent digital communication applications. In this dissertation, we propose stochastic decoding of state-of-the-art LDPC codes and demonstrate it as a competitive approach to practical LDPC decoding algorithms.In stochastic decoding, probabilities are represented as streams of random bits using Bernoulli sequences in which the information is contained in the statistics of the bit stream. This representation results in low hardware-complexity

Style APA, Harvard, Vancouver, ISO itp.

6

Davey, 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ła

Streszczenie:

Gallager's low-density parity-check codes are defined by sparse parity-check matrices, usually with a random contruction. Such codes have near Shannon limit performance when decoded using an iterative probabilistic decoding algorithm. We report two advances that improve the error-correction performance of these codes. First, defining the codes over non-binary fields we can obtain a 0.6 dB improvement in signal to noise ratio for a given bit error rate. Second, using irregular parity-check matrices with non-uniform row and column weights we obtain gains of up to 0.5 dB. The empirical error-corr

Style APA, Harvard, Vancouver, ISO itp.

7

Rankin, 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ła

Streszczenie:

The aim of coding theory is to design codes which can achieve the fundamental limits of communication [52] and yet are simple to implement. On average randomly constructed codes can achieve this goal, but with a decoding complexity that is impractical. Consequently, highly structured codes with practical decoding algorithms have been extensively studied. Unfortunately the vast majority of these codes do not approach capacity. Recent advances involving simple 'random like' codes with practical iterative decoding algorithms have closely approached capacity as the blocklength increases. This the

Style APA, Harvard, Vancouver, ISO itp.

8

Hayes, 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ła

Streszczenie:

ITC/USA 2007 Conference Proceedings / The Forty-Third Annual International Telemetering Conference and Technical Exhibition / October 22-25, 2007 / Riviera Hotel & Convention Center, Las Vegas, Nevada<br>Next 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 bri

Style APA, Harvard, Vancouver, ISO itp.

9

Moon, Todd K., and 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ła

Streszczenie:

International Telemetering Conference Proceedings / October 20-23, 2003 / Riviera Hotel and Convention Center, Las Vegas, Nevada<br>Low-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.

Style APA, Harvard, Vancouver, ISO itp.

10

Anitei, 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ła

Style APA, Harvard, Vancouver, ISO itp.

11

Price, Aiden K. "Improved constructions of low-density parity-check codes." Thesis, Queensland University of Technology, 2019. https://eprints.qut.edu.au/128373/1/Aiden_Price_Thesis.pdf.

Pełny tekst źródła

Streszczenie:

There is an ongoing need to improve the efficiency and error-correcting performance of error correcting codes, which are widely used to enhance accuracy when retrieving or communicating information. This research investigates several potential improvements to a high-performing class of error correcting codes known as low-density parity-check (LDPC) codes. The results presented here further the known literature surrounding a specific class of functions (Alltop functions). Additionally, this work demonstrates ways of manipulating existing LDPC code constructions using relaxed difference sets to

Style APA, Harvard, Vancouver, ISO itp.

12

Blad, 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ła

Streszczenie:

<p>Low-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. </p><p>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 dyn

Style APA, Harvard, Vancouver, ISO itp.

13

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ła

Streszczenie:

In this thesis, we extend applications of Low-Density Parity-Check (LDPC) codes to a combination of constituent sub-channels, which is a mixture of Gaussian channels with erasures. This model, for example, represents a common channel in magnetic recordings where thermal asperities in the system are detected and represented at the decoder as erasures. Although this channel is practically useful, we cannot find any previous work that evaluates performance of LDPC codes over this channel. We are also interested in practical issues such as designing robust LDPC codes for the mixture channel and pr

Style APA, Harvard, Vancouver, ISO itp.

14

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ła

Style APA, Harvard, Vancouver, ISO itp.

15

Vijayakumar, 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ła

Style APA, Harvard, Vancouver, ISO itp.

16

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ła

Streszczenie:

Low-density parity-check (LDPC) codes are a subclass of linear block codes. These codes have parity-check matrices in which the ratio of the non-zero elements to all elements is low. This property is exploited in defining low complexity decoding algorithms. Low-density parity-check codes have good distance properties and error correction capability near Shannon limits. In this thesis, the sum-product and the bit-flip decoding algorithms for low-density parity-check codes are implemented on Intel Pentium M 1,86 GHz processor using the software called MATLAB. Simulations for the two d

Style APA, Harvard, Vancouver, ISO itp.

17

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ła

Streszczenie:

Thesis (Ph.D)--Electrical and Computer Engineering, Georgia Institute of Technology, 2007.<br>Committee Chair: McLaughlin, Steven; Committee Member: Barry, John; Committee Member: Boldyreva, Alexandra; Committee Member: Clements, Mark; Committee Member: Li, Ye.

Style APA, Harvard, Vancouver, ISO itp.

18

Ho, Ki-hiu, and 何其曉. "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ła

Style APA, Harvard, Vancouver, ISO itp.

19

Zhang, 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ła

Streszczenie:

The Low-Density Parity-Check (LDPC) codes, which were invented by Gallager back in 1960s, have attracted considerable attentions recently. Compared with other error correction codes, LDPC codes are well suited for wireless, optical, and magnetic recording systems due to their near- Shannon-limit error-correcting capacity, high intrinsic parallelism and high-throughput potentials. With these remarkable characteristics, LDPC codes have been adopted in several recent communication standards such as 802.11n (Wi-Fi), 802.16e (WiMax), 802.15.3c (WPAN), DVB-S2 and CMMB. This dissertation is devoted

Style APA, Harvard, Vancouver, ISO itp.

20

Richter, Gerd. "Puncturing, mapping, and design of low-density parity-check codes." Düsseldorf VDI-Verl, 2008. http://d-nb.info/99372230X/04.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

21

DE, AMICIS AMEDEO. "Serially concatenated low-density parity-check codes for error correction." Doctoral thesis, Università Politecnica delle Marche, 2011. http://hdl.handle.net/11566/241943.

Pełny tekst źródła

Streszczenie:

Questa tesi studia il progetto di codici Multiple Serially Concatenated Multiple Parity-Check (M-SC-MPC) che sono una classe di codici LDPC strutturati, caratterizzati da una codifica molto semplice. Si è anche studiato come il progetto dei codici M-SC-MPC può essere ottimizzato per l'uso in applicazioni wireless. E' stato dimostrato che i codici LDPC irregolari presentano migliori prestazioni rispetto a quelli regolari, specialmente per i codici a basso tasso di rate. Per questo motivo, particolare attenzione è dedicata alla semplice modifica della struttura interna dei codici M-SC-MPC che

Style APA, Harvard, Vancouver, ISO itp.

22

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ła

Style APA, Harvard, Vancouver, ISO itp.

23

Liu, Yue Electrical Engineering &amp 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ła

Streszczenie:

Since the rediscovery, LDPC codes attract a large amount of research efforts. In 1998, nonbinary LDPC codes were firstly investigated and the results shown that they are better than their binary counterparts in performance. Recently, there is always a requirement from the industry to design applied nonbinary LDPC codes. In this dissertation, we firstly propose a novel class of quasi-cyclic (QC) LDPC codes. This class of QC-LDPC codes embraces both linear encoding complexity and excellent compatibility in various degree distributions and nonbinary expansions. We show by simulation results that

Style APA, Harvard, Vancouver, ISO itp.

24

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ła

Streszczenie:

In recent years, the invention of Turbo codes has spurred much interest in the coding community. Turbo codes are capable of approaching channel capacity closely at a decoding complexity much lower than previously thought possible. Although decoding complexity is relatively low, Turbo codes are still too complex to implement for many practical systems. This work is focused on low complexity channel coding schemes with Turbo-like performance. The issue of complexity is tackled by using single parity check (SPC) codes, arguably the simplest codes known. The SPC codes are used as component codes

Style APA, Harvard, Vancouver, ISO itp.

25

Hussein, 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ła

Style APA, Harvard, Vancouver, ISO itp.

26

Planjery, 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ła

Streszczenie:

ITC/USA 2010 Conference Proceedings / The Forty-Sixth Annual International Telemetering Conference and Technical Exhibition / October 25-28, 2010 / Town and Country Resort & Convention Center, San Diego, California<br>We 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

Style APA, Harvard, Vancouver, ISO itp.

27

Cai, Fang. "Efficient VLSI Architectures for Non-binary Low Density Parity Check Decoding." Case Western Reserve University School of Graduate Studies / OhioLINK, 2011. http://rave.ohiolink.edu/etdc/view?acc_num=case1300821245.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

28

Planjery, 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ła

Streszczenie:

Les codes Low-Density Parity-Check (LDPC) sont au coeur de larecherche des codes correcteurs d'erreurs en raison de leur excellenteperformance de décodage en utilisant un algorithme de décodageitératif de type propagation de croyances (Belief Propagation - BP).Cet algorithme utilise la représentation graphique d'un code, ditgraphe de Tanner, et calcule les fonctions marginales sur le graphe.Même si l'inférence calculée n'est exacte que sur un graphe acyclique(arbre), l'algorithme BP estime de manière très proche les marginalessur les graphes cycliques, et les codes LDPC peuvent asymptotiquemen

Style APA, Harvard, Vancouver, ISO itp.

29

Ho, 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ła

Style APA, Harvard, Vancouver, ISO itp.

30

Sweatlock, Sarah L. McEliece Robert J. McEliece Robert J. "Asymptotic weight analysis of low-density parity check (LDPC) code ensembles /." Diss., Pasadena, Calif. : California Institute of Technology, 2008. http://resolver.caltech.edu/CaltechETD:etd-05202008-094714.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

31

Hou, 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ła

Style APA, Harvard, Vancouver, ISO itp.

32

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ła

Streszczenie:

Error control coding is an essential part of modern communications systems. LDPC codes have been demonstrated to offer performance near the fundamental limits of channels corrupted by random noise. Optimal maximum likelihood decoding of LDPC codes is too complex to be practically useful even at short block lengths and so a graph-based message passing decoder known as the belief propagation algorithm is used instead. In fact, on graphs without closed paths known as cycles the iterative message passing decoding is known to be optimal and may converge in a single iteration, although identifying t

Style APA, Harvard, Vancouver, ISO itp.

33

Planjery, 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ła

Streszczenie:

The recent renaissance of one particular class of error-correcting codes called low-density parity-check (LDPC) codes has revolutionized the area of communications leading to the so-called field of modern coding theory. At the heart of this theory lies the fact that LDPC codes can be efficiently decoded by an iterative inference algorithm known as belief propagation (BP) which operates on a graphical model of a code. With BP decoding, LDPC codes are able to achieve an exceptionally good error-rate performance as they can asymptotically approach Shannon's capacity. However, LDPC codes under BP

Style APA, Harvard, Vancouver, ISO itp.

34

Mei, 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ła

Streszczenie:

Communication channels can severely degrade a signal, not only due to fading effects but also interference in the form of impulsive noise. In conventional communication systems, the additive noise at the receiver is usually assumed to be Gaussian distributed. However, this assumption is not always valid and examples of non-Gaussian distributed noise include power line channels, underwater acoustic channels and manmade interference. When designing a communication system it is useful to know the theoretical performance in terms of bit-error probability (BEP) on these types of channels. However,

Style APA, Harvard, Vancouver, ISO itp.

35

Chen, 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ła

Style APA, Harvard, Vancouver, ISO itp.

36

Hur, 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ła

Streszczenie:

The objective of this dissertation is to investigate incremental redundancy low-density parity-check (IR-LDPC) codes for hybrid forward error correction / automatic repeat request (HybridARQ) schemes. Powerful capacity-approaching IR-LDPC codes are one of the key functional elements in high-throughput HybridARQ schemes and provide a flexible rate-compatible structure, which is necessary for low-complexity HybridARQ schemes. This dissertation first studies the design and performance evaluation of IR-LDPC codes, which have good error rate performance at short block lengths. The subset codes of t

Style APA, Harvard, Vancouver, ISO itp.

37

Kazanci, 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ła

Streszczenie:

Low Density Parity Check (LDPC) codes are the parity check codes of long block length, whose parity check matrices have relatively few non-zero entries. To improve the performance at relatively short block lengths, LDPC codes are constructed by either pseudo-random or quasi-cyclic methods instead of random construction methods. In this thesis, pseudo-random code construction methods, the effects of closed loops and the graph connectivity on the performance of pseudo-random LDPC codes are investigated. Moreover, quasi-cyclic LDPC codes, which have encoding and storage advantages over pseudo-ran

Style APA, Harvard, Vancouver, ISO itp.

38

Bardak, 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ła

Streszczenie:

In this thesis, design details of binary irregular Low-Density Parity-Check (LDPC) codes are investigated. We especially focus on the trade-off between the average variable node degree, wa, and the number of length-6 cycles of an irregular code. We observe that the performance of the irregular code improves with increasing wa up to a critical value, but deteriorates for larger wa because of the exponential increase in the number of length-6 cycles. We have designed an irregular code of length 16,000 bits with average variable node degree wa=3.8, that we call &lsquo<br>2/3/13&rsquo<br>since it

Style APA, Harvard, Vancouver, ISO itp.

39

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ła

Streszczenie:

A high throughput scalable decoder architecture, a tiling approach to reduce the complexity of the scalable architecture, and two low power decoding schemes have been proposed in this research. The proposed scalable design is generated from a serial architecture by scaling the combinational logic; memory partitioning and constructing a novel H matrix to make parallelization possible. The scalable architecture achieves a high throughput for higher values of the parallelization factor M. The switch logic used to route the bit nodes to the appropriate checks is an important constituent of the sca

Style APA, Harvard, Vancouver, ISO itp.

40

Hong, Jun-Chu, and 洪俊竹. "Parity Checks in Stream Cipher Correlation Attacks." Thesis, 2000. http://ndltd.ncl.edu.tw/handle/70335756369848727570.

Pełny tekst źródła

Streszczenie:

碩士<br>國立交通大學<br>資訊工程系<br>88<br>The commonest stream cipher system uses a keystream generator which consists of several LFSRs combined by a combining function. If there exists a measure of correlation between the output sequence of the keystream generator and an arbitrary LFSR, the initial state of the LFSR can be reconstructed by a correlation attack, that is, the partial key in the LFSR is determined. W. Meier and O. Staffelbach proposed a correlation attack method using parity check equations. In this thesis, we discuss the algorithm and its constraints, and then propose some impr

Style APA, Harvard, Vancouver, ISO itp.

41

Ma, Xudong. "On Constructing Low-Density Parity-Check Codes." Thesis, 2007. http://hdl.handle.net/10012/3440.

Pełny tekst źródła

Streszczenie:

This thesis focuses on designing Low-Density Parity-Check (LDPC) codes for forward-error-correction. The target application is real-time multimedia communications over packet networks. We investigate two code design issues, which are important in the target application scenarios, designing LDPC codes with low decoding latency, and constructing capacity-approaching LDPC codes with very low error probabilities. On designing LDPC codes with low decoding latency, we present a framework for optimizing the code parameters so that the decoding can be fulfilled after only a small number of iterati

Style APA, Harvard, Vancouver, ISO itp.

42

Kuo, Chien-Yo, and 郭建佑. "Finite Geometry Low Density Parity Check Code." Thesis, 2007. http://ndltd.ncl.edu.tw/handle/47566605491906246203.

Pełny tekst źródła

Streszczenie:

碩士<br>國立中正大學<br>通訊工程研究所<br>96<br>Low density parity check (LDPC) code is a class of linear block codes which provide near Shannon limit performance. The LDPC code was first invented by Gallager [1] in the early 1960s. But it was scarcely considered in the following years, until the last 1990s some researchers began to investigate codes on graphs and iterative decoding. This paper presents a geometric approach to the construction of low-density parity-check (LDPC) codes [5]. Two families of finite geometries LDPC codes are constructed based on the lines and points of Euclidean and projective ge

Style APA, Harvard, Vancouver, ISO itp.

43

Zhang, Lei. "Multi-edge Low-density Parity-check Coded Modulation." Thesis, 2011. http://hdl.handle.net/1807/31659.

Pełny tekst źródła

Streszczenie:

A method for designing low-density parity-check (LDPC) codes for bandwidth-efficient high-order coded modulation is proposed. Code structure utilizes the multi-edge-type LDPC code ensemble to achieve an improved match between codeword bit protection ca- pabilities and modulation bit-channel capacities over existing LDPC coded modulation techniques. The multi-dimensional EXIT vector field for the specific multi-edge parame- terization is developed for the analysis and design of code ensembles. A multi-dimensional EXIT decoding convergence condition is derived to enable efficient optimization. C

Style APA, Harvard, Vancouver, ISO itp.

44

Chiang, Chia-yang, and 江佳陽. "Low Density Parity Check Code and Density Evolution." Thesis, 2006. http://ndltd.ncl.edu.tw/handle/09098612508578815489.

Pełny tekst źródła

Streszczenie:

碩士<br>國立中正大學<br>通訊工程研究所<br>94<br>The LDPC code is a class of linear block codes which provide near capacity performance and implementable coding scheme. The LDPC code was first invented by Gallager in his thesis but was scarcely considered in the following 35 years. After Tanner, Mackay, Luby and Urbanke et al. with all their great works the LDPC code became renowned in recent years. The LDPC coding becomes the important technique for IEEE 802.11n, DVB-H or even in future 4G technologies. In some well designed degree distribution, the 1/2 rate LDPC code can approach Shannon limit within 0.0045

Style APA, Harvard, Vancouver, ISO itp.

45

Chen, Ming-Chan, and 陳銘展. "Interleaved Quasi-Cyclic Low Density Parity Check Code." Thesis, 2006. http://ndltd.ncl.edu.tw/handle/96246771926369783463.

Pełny tekst źródła

Streszczenie:

碩士<br>國立中正大學<br>通訊工程研究所<br>95<br>Low-density parity check (LDPC) codes are one class of linear block codes and provide near capacity performance with iterative decoding at the AWGN channel when the code length is large. Therefore, LDPC codes have become strong competitors to Turbo codes for error control in many communication and digital storage systems where high reliability is required. Until now, LDPC codes are widely used in many communication systems, for example, 4G, 802.11n, 802.16e, MIMO-OFDM and so on. However, for the practical applications, how to design short and powerful LDPC

Style APA, Harvard, Vancouver, ISO itp.

46

Lee, Huang-Chang, and 李晃昌. "Decoding Scheduling for Low-Density Parity-Check Codes." Thesis, 2014. http://ndltd.ncl.edu.tw/handle/9q2ctb.

Pełny tekst źródła

Streszczenie:

博士<br>國立清華大學<br>電機工程學系<br>103<br>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 ca

Style APA, Harvard, Vancouver, ISO itp.

47

willie and 賴偉誌. "The Implementation of Low－Density Parity－Check Decoding." Thesis, 2008. http://ndltd.ncl.edu.tw/handle/80079451129269333829.

Pełny tekst źródła

Streszczenie:

碩士<br>大葉大學<br>電信工程學系碩士班<br>96<br>The error control coding is different from the source coding in general. In the transmission, the data are degraded by unreliable transmit media or interfered with the external factor, the error control coding is employed to correct errors as much as possible. Low density parity check (LDPC) code is a kind of powerful error control coding. Data encoded with LDPC code are sent with lower power and then could be received correctly with LDPC decoder employed. In this thesis, the sum-product algorithm of LDPC code is implemented by VHDL, which employs some mathemat

Style APA, Harvard, Vancouver, ISO itp.

48

Wijaya, Felixzihwelly Hendra, and 許輝利. "Low-Density Parity Check DecodingOver Markov Gaussian Channel." Thesis, 2015. http://ndltd.ncl.edu.tw/handle/11598035432028609577.

Pełny tekst źródła

Streszczenie:

碩士<br>國立臺灣科技大學<br>電機工程系<br>103<br>Memory impulse noise becomes one of the problems in the wired and wireless communication systems. To address the challenge of the memory impulse noise, a Low-Density Parity Check (LDPC) decoding combined with the Maximum A Priori (MAP) Estimation was devised. By estimating the channel states, while ignoring the impulse statistics, the LDPC decoder could perform well. More detailed steps and complexity analysis of the proposed decoder were offered. There are three algorithms tested for the proposed decoder to investigate the robustness of the algorithm. The sim

Style APA, Harvard, Vancouver, ISO itp.

49

Jhih-Siang, Wang, and 王致翔. "Density Evolution for Low-Density Parity-Check Codes." Thesis, 2011. http://ndltd.ncl.edu.tw/handle/83172527534429207322.

Pełny tekst źródła

Streszczenie:

碩士<br>國立中正大學<br>通訊工程研究所<br>99<br>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 th

Style APA, Harvard, Vancouver, ISO itp.

50

Lin, Chia-Yu, and 林家瑜. "Design of Low-Density Parity-Check Coding Systems." Thesis, 2011. http://ndltd.ncl.edu.tw/handle/49322183242635005414.

Pełny tekst źródła

Streszczenie:

博士<br>國立臺灣大學<br>資訊工程學研究所<br>99<br>For error correction in communication systems, low-density parity-check (LDPC) codes have been shown to have near-Shannon-limit performance. However compared with other error correction codes, encoding and decoding LDPC codes always require considerable power and processing time which would limit their practical use. In this thesis, the following techniques are proposed for efficient LDPC coding systems: 1) low-latency encoding, 2) decoding with node operation reduction, intelligent scheduling, and early stopping criteria, and 3) code structure with implementa

Style APA, Harvard, Vancouver, ISO itp.

Oferujemy zniżki na wszystkie plany premium dla autorów, których prace zostały uwzględnione w tematycznych zestawieniach literatury. Skontaktuj się z nami, aby uzyskać unikalny kod promocyjny!