Dissertations / Theses on the topic 'Linear block codes'
Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles
Consult the top 50 dissertations / theses for your research on the topic 'Linear block codes.'
Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.
You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.
Browse dissertations / theses on a wide variety of disciplines and organise your bibliography correctly.
Spyrou, Spyros. "Linear block codes for block fading channels based on Hadamard matrices." Texas A&M University, 2005. http://hdl.handle.net/1969.1/3136.
Full textYildiz, Senay. "Construction Of Substitution Boxes Depending On Linear Block Codes." Master's thesis, METU, 2004. http://etd.lib.metu.edu.tr/upload/12605540/index.pdf.
Full textA Construction of Resilient Functions with High Nonlinearity"
by T. Johansson and E. Pasalic in 2000, and two years later in "
Linear Codes in Generalized Construction of Resilient Functions with Very High Nonlinearity"
by E. Pasalic and S. Maitra are compared and the former one is observed to be more promising in terms of nonlinearity. The first construction method uses a set of nonintersecting [n-d,m,t+1] linear block codes in deriving t-resilient S-boxes of nonlinearity 2^(n-1)-2^(n-d-1),where d is a parameter to be maximized for high nonlinearity. For some cases, we have found better results than the results of Johansson and Pasalic, using their construction. As a distinguished reference for nxn S-box construction methods, we study the paper "
Differentially Uniform Mappings for Cryptography"
presented by K.Nyberg in Eurocrypt 1993. One of the two constructions of this paper, i.e., the inversion mapping described by Nyberg but first noticed in 1957 by L. Carlitz and S. Uchiyama, is used in the S-box of Rijndael, which is chosen as the Advanced Encryption Standard. We complete the details of some theorem and proposition proofs given by Nyberg.
El, Rifai Ahmed Mahmoud. "Applications of linear block codes to the McEliece cryptosystem." Diss., Georgia Institute of Technology, 1995. http://hdl.handle.net/1853/16604.
Full textKovacevic, Sanja. "SOVA based on a sectionalized trellis of linear block codes." Thesis, McGill University, 2004. http://digitool.Library.McGill.CA:80/R/?func=dbin-jump-full&object_id=80115.
Full textThis thesis examines a new decoding scheme based on the soft-output Viterbi algorithm (SOVA) applied to a sectionalized trellis for linear block codes. The computational complexities of the new SOVA decoder and of the conventional SOVA decoder based on the bit-level trellis are theoretically analyzed and derived. These results are used to obtain the optimum sectionalization of a trellis for SOVA. The optimum sectionalization of a trellis for Maximum A Posteriori (MAP), Maximum Logarithm MAP (Max-Log-MAP), and Viterbi algorithms, and their corresponding computational complexities are included for comparisons. The results confirm that SOVA based on a sectionalized trellis is the most computationally efficient SISO decoder examined in this thesis.
The simulation results of the bit error rate (BER) over additive white Gaussian noise (AWGN) channel demonstrate that the BER performance of the new SOVA decoder is not degraded. The BER performance of SOVA used in a serially concatenated block codes scheme reveals that the soft outputs of the proposed decoder are the same as those of the conventional SOVA decoder. Iterative decoding of serially concatenated block codes reveals that the quality of reliability estimates of the proposed SOVA decoder is the same as that of the conventional SOVA decoder.
Chaudhari, Pragat. "Analytical Methods for the Performance Evaluation of Binary Linear Block Codes." Thesis, University of Waterloo, 2000. http://hdl.handle.net/10012/904.
Full textAl-Lawati, Haider. "Performance analysis of linear block codes over the queue-based channel." Thesis, Kingston, Ont. : [s.n.], 2007. http://hdl.handle.net/1974/652.
Full textGriffiths, Wayne Bradley. "On a posteriori probability decoding of linear block codes over discrete channels." University of Western Australia. School of Electrical, Electronic and Computer Engineering, 2008. http://theses.library.uwa.edu.au/adt-WU2008.0156.
Full textFogarty, Neville Lyons. "On Skew-Constacyclic Codes." UKnowledge, 2016. http://uknowledge.uky.edu/math_etds/36.
Full textCollison, Sean Michael. "Extending the Dorsch decoder for efficient soft decision decoding of linear block codes." Pullman, Wash. : Washington State University, 2009. http://www.dissertations.wsu.edu/Thesis/Spring2009/s_collison_042309.pdf.
Full textTitle from PDF title page (viewed on May 21, 2009). "School of Electrical Engineering and Computer Science." Includes bibliographical references (p. 64-65).
Weaver, Elizabeth A. "MINIMALITY AND DUALITY OF TAIL-BITING TRELLISES FOR LINEAR CODES." UKnowledge, 2012. http://uknowledge.uky.edu/math_etds/1.
Full textAlabbadi, Mohssen. "Intergration of error correction, encryption, and signature based on linear error-correcting block codes." Diss., Georgia Institute of Technology, 1993. http://hdl.handle.net/1853/14959.
Full textWong, Brenden. "On the computation of the probability of undetected error for linear block codes on the Gilbert channel." Thesis, University of British Columbia, 1991. http://hdl.handle.net/2429/30119.
Full textApplied Science, Faculty of
Electrical and Computer Engineering, Department of
Graduate
DHAKAL, PAWAN. "Algorithms for 5G physical layer." Doctoral thesis, Politecnico di Torino, 2017. http://hdl.handle.net/11583/2670627.
Full textNajahi, Mohamed amine. "Synthesis of certified programs in fixed-point arithmetic, and its application to linear algebra basic blocks : and its application to linear algebra basic blocks." Thesis, Perpignan, 2014. http://www.theses.fr/2014PERP1212.
Full textTo be cost effective, embedded systems are shipped with low-end micro-processors. These processors are dedicated to one or few tasks that are highly demanding on computational resources. Examples of widely deployed tasks include the fast Fourier transform, convolutions, and digital filters. For these tasks to run efficiently, embedded systems programmers favor fixed-point arithmetic over the standardized and costly floating-point arithmetic. However, they are faced with two difficulties: First, writing fixed-point codes is tedious and requires that the programmer must be in charge of every arithmetical detail. Second, because of the low dynamic range of fixed-point numbers compared to floating-point numbers, there is a persistent belief that fixed-point computations are inherently inaccurate. The first part of this thesis addresses these two limitations as follows: It shows how to design and implement tools to automatically synthesize fixed-point programs. Next, to strengthen the user's confidence in the synthesized codes, analytic methods are suggested to generate certificates. These certificates can be checked using a formal verification tool, and assert that the rounding errors of the generated codes are indeed below a given threshold. The second part of the thesis is a study of the trade-offs involved when generating fixed-point code for linear algebra basic blocks. It gives experimental data on fixed-point synthesis for matrix multiplication and matrix inversion through Cholesky decomposition
Susar, Aylin. "Ofdm Papr Reduction With Linear Coding And Codeword Modification." Master's thesis, METU, 2005. http://etd.lib.metu.edu.tr/upload/12606428/index.pdf.
Full textYue, Chentao. "Decoding Techniques based on Ordered Statistics." Thesis, The University of Sydney, 2021. https://hdl.handle.net/2123/25059.
Full textSusanto, Misfa. "Network Coding for Multihop Wireless Networks: Joint Random Linear Network Coding and Forward Error Correction with Interleaving for Multihop Wireless Networks." Thesis, University of Bradford, 2015. http://hdl.handle.net/10454/14864.
Full textTempel, Dirk J. "Sequential decoding of linear block codes." 1993. http://hdl.handle.net/1993/9697.
Full textEsmaeili, Mostafa. "Application of linear block codes in cryptography." Thesis, 2019. http://hdl.handle.net/1828/10655.
Full textGraduate
Lin, Da-Zhong, and 林大中. "Modified Decoding Algorithm for Linear Block Codes." Thesis, 2010. http://ndltd.ncl.edu.tw/handle/86ga57.
Full text國立臺北科技大學
電機工程系研究所
98
In this thesis , we propose a modified decoding method for linesr block codes. For a linear block code, the maximum likelihood decoding can provide the best error performance, which can be obtained by applying the Viterbi algorithm in the decoding trellis. However, the decoding complexity of the trellis grows exponentially with the dimension of the code, which incurs a huge amount of computation. Therefore, a modified decoding algorithm is proposed to reduce the decoding complexity. Simulation results show that the error performance of the new method is close to that of the maximum likelihood decoding.
Cheng, Jay, and 鄭傑. "On Generalized Hamming Weights of Linear Block Codes." Thesis, 1995. http://ndltd.ncl.edu.tw/handle/58867308564051097365.
Full textShiu, Jiun, and 徐鈞. "eal-Number Linear Block Codes and Their Applications." Thesis, 1994. http://ndltd.ncl.edu.tw/handle/12846101570802598436.
Full text國立臺灣大學
資訊工程研究所
82
The research of error-control coding concerns the protecting of data against the errors that are introduced during the transmissions through channels. Conventionally, a digital channel is assumed. This assumption is reasonable since, in a digital communication system, we are processing digital data. However, in the case of protecting data through a computation, the above assumption is no longer valid. In this case, data to be protected are real or complex numbers and the computation are essentially additions and multiplications defined over a real or complex field. In this thesis, real-number error control codes for such a channel is studied. We define two classes of real-number codes which are based on discrete Hartley transform and discrete cosine transform, respectively. The general decoding algorithms for such kind of real-number codes are also studied. These algorithms have been viewed as new techniques for discrete-time signal processing. By utilizing the techniques of nonlinear filtering, real number codes can also be used to protect discrete-time signals from some nonlinear effects. Moreover, we have studied some majority decodable real-number codes which makes real-number codes more applicable, when extremely simple encoding and decoding schemes are required.
Amirhossein, Shokouh Aghaei. "Widely-linear MMSE Receivers for Linear Dispersion Space-time Block-codes." Thesis, 2008. http://hdl.handle.net/1807/17224.
Full textFossorier, Marc P. C. "Decoding of linear block codes based on ordered statistics." Thesis, 1994. http://hdl.handle.net/10125/9751.
Full textGenga, Yuval Odhiambo. "Techniques to improve iterative decoding of linear block codes." Thesis, 2019. https://hdl.handle.net/10539/29047.
Full textIn the field of forward error correction, the development of decoding algorithms with a high error correction performance and tolerable complexity has been of great interest for the reliable transmission of data through a noisy channel. The focus of the work done in this thesis is to exploit techniques used in forward error correction in the development of an iterative soft-decision decoding approach that yields a high performance in terms of error correction and a tolerable computational complexity cost when compared to existing decoding algorithms. The decoding technique developed in this research takes advantage of the systematic structure exhibited by linear block codes to implement an information set decoding approach to correct errors in the received vector outputted from the channel. The proposed decoding approach improves the iterative performance of the algorithm as the decoder is only required to detect and correct a subset of the symbols from the received vector. These symbols are referred to as the information set. The information set, which matches the length of the message, is then used decode the entire codeword. The decoding approach presented in the thesis is tested on both Reed Solomon and Low Density Parity Check codes. The implementation of the decoder varies for both the linear block codes due to the different structural properties of the codes. Reed Solomon codes have the advantage of having a row rank inverse property which enables the construction of a partial systematic structure using any set of columns in the parity check matrix. This property provides a more direct implementation for finding the information set required by the decoder based on the soft reliability information. However, the dense structure of the parity check matrix of Reed Solomon codes presents challenges in terms of error detection and correction for the proposed decoding approach. To counter this problem, a bit-level implementation of the decoding technique for Reed Solomon codes is presented in the thesis. The presentation of the parity check matrix extension technique is also proposed in the thesis. This technique involves the addition of low weight codewords from the dual code, that match the minimum distance of the code, to the parity check matrix during the decoding process. This helps add sparsity to the symbol-level implementation of the proposed decoder. This sparsity helps with the efficient exchange of the soft information during the message passing stage of the proposed decoder. Most high performance Low Density Parity Check codes proposed in literature lack a systematic structure. This presents a challenge for the proposed decoding approach in obtaining the information set. A systematic construction for a Quasi-Cyclic Low Density Parity Check code is also presented in this thesis so as to allow for the information set decoding. The proposed construction is able to match the error correction performance of a high performance Quasi-Cyclic Low Density Parity Check matrix design, while having the benefit of a low complexity construction for the encoder. In addition, this thesis also proposes a stopping condition for iterative decoding algorithms based on the information set decoding technique. This stopping condition is applied to other high performance iterative decoding algorithms for both Reed Solomon codes and Low Density Parity Check codes so as to improve the iterative performance. This improves on the overall efficiency of the decoding algorithms.
PH2020
Nori, Aditya Vithal. "Unifying Views Of Tail-Biting Trellises For Linear Block Codes." Thesis, 2005. https://etd.iisc.ac.in/handle/2005/1441.
Full textNori, Aditya Vithal. "Unifying Views Of Tail-Biting Trellises For Linear Block Codes." Thesis, 2005. http://etd.iisc.ernet.in/handle/2005/1441.
Full textTai, Chih-Han, and 戴志翰. "Applications of Linear Codes:Joint JPEG-Block Codes and Product-based Data Hiding Codes." Thesis, 2010. http://ndltd.ncl.edu.tw/handle/13873039712661821884.
Full text國立中興大學
電機工程學系所
98
This paper proposes a joint JPEG-block coding system (JJBC) based on BCJR decoding that maintains an acceptable image quality over AWGN and wireless channels. The joint design of JPEG compression and block codes in the transmitter has the advantage of avoiding error propagation and of low decoding complexity, compared to the conventional tandem system with separate optimization of source coding and channel coding. The PSNR performance of the JJBC system is much better than that of the tandem system when the low signal to noise ratio is low. Experimental results show that the proposed JJBC system achieves 6dB (3 dB) reduction at PSNR=20dB, compared to the conventional tandem system,under wireless IEEE 802.11b (AWGN) channels. The present paper use product code, proposed that a fast and effective data hiding method. Looking from the experimental result, the method we proposed have the good performance compared with other papers.
Buttner, Werner Heinrich. "Trellis decoding of Reed Solomon and related linear block codes." Diss., 1999. http://hdl.handle.net/2263/30447.
Full textDissertation (M Eng (Electronic Engineering))--University of Pretoria, 2006.
Electrical, Electronic and Computer Engineering
unrestricted
Chen, Wei, and 陳瑋. "A Further Study on Modified-t Algorithm for Linear Block Codes." Thesis, 2011. http://ndltd.ncl.edu.tw/handle/3th524.
Full text國立臺北科技大學
電機工程系研究所
99
For an (n, k) linear block code, maximum likelihood decoding attains the best error performance. However, the decoding complexity and the hardware requirements grow with the dimension of the code, causing a huge amount of calculating time. Therefore, we may reduce the complexity by deleting unnecessary paths using the t-algorithm. The error performance is close to that of the maximum likelihood decoding. Nevertheless, there is a limited range for selecting parameter t. When parameter t passes the threshold, the performance decreases. In this thesis, based on t-algorithm, a modified algorithm is proposed to broaden the range of t. The resulting parameter t can be adjusted according to the channel condition.
Swarts, Francis. "Undetected error behaviour of linear block codes on channels with memory." Thesis, 2014. http://hdl.handle.net/10210/9599.
Full textIn this thesis, the problem of undetected errors in digital communication systems employing error detection as the only means of error control, is investigated. In the past, the undetected error probability of linear block codes, was mainly investigated on the binary symmetric channel, which is memoryless. With this thesis, the main aim was to investigate the undetected error probability for linear block codes, on channels with memory. The channel models investigated are the Gilbert-Elliott and Fritchman channel models. Three techniques for calculating the undetected error probability on channels with memory are investigated. These techniques are: (i) Exhaustive codeword generation, (ii) Simulation and (iii) A trellis based technique. The trellis description of a block code based on the states of a syndrome calculating linear feedback shift register, formed the basis of the latter technique. The calculation of the weight spectrum of binary linear block codes, is still largely an unsolved problem. Using the trellis description of a binary linear block code, referred to earlier, we propose a description of binary linear block codes based on graphs, and from this we develop a technique for calculating the weight spectrum of binary linear block codes. The weight spectra of block codes determine the undetected error probability of these codes when used on the binary symmetric channel. Very favourable results were obtained through the application of the techniques developed for undetected error probability calculation as well as weight spectrum calculation.
SHAW, HUNG-HSI, and 蕭煥錫. "The Multi-level Squaring Construction for the Trellises of Linear Block Codes." Thesis, 2005. http://ndltd.ncl.edu.tw/handle/86976520780121033470.
Full textYan, Wei-Min, and 嚴偉珉. "Combination of Non-Disjoint Sub-Block Partition with Linear Block Codes for PAPR Reduction in OFDM System." Thesis, 2017. http://ndltd.ncl.edu.tw/handle/48407208352703449691.
Full text國立中興大學
通訊工程研究所
105
In this thesis, we propose combination of a modified PTS algorithm by partitioning an OFDM block into non-disjoint OFDM sub-block with linear block codes as phase factors. Through the concept of Gray code, the linear block codes are grown in parallel and serial, compare conventional PTS with our algorithms, our algorithms which are low computational complexity for searching phase factors, and simulation results show that the modified PTS with a non-disjoint partition achieves an obvious improvement of PAPR reduction. In addition, the side information provide extra error-correction property.
Wu, Ke-liang, and 吳克良. "The Study of Linear Block Codes of Maximum-Likelihood Decoding based on Improved." Thesis, 2014. http://ndltd.ncl.edu.tw/handle/94151116974603155757.
Full text國立中央大學
通訊工程學系在職專班
102
Channel coding has been applied to various communication systems extensively to overcome the channel noise and ensure transmission of information can be acceptedcorrectly. The information symbols are coded by adding redundancy for recovery from channel errors before transmission. The receiver uses specific decoding algorithm to proceed correction and error detection. A* decoding algorithm is a tree search algorithm, which is used to find the shortest path within a graph with branch and bound approach to determine the metric of each vertex in a tree. This algorithm estimates metrics between target and each vertex so that it can prune irrelevant vertexes in the early searching phase so as to find the most likely answer in a short period of time and achieve the goal of increasing efficiency.A* decoding algorithm hasbeen used to implement maximum-likelihood decoding of linear blockcodes. Moreover, it reduces the searching edges. In this thesis, we use the shortest path search in the most commonly used A * decoding algorithm as a reference and to be improved, retain the advantages of the original shortest path A decoding algorithm, and applied to the maximum likelihood decoding of binary linear block codes, through computer simulation method improved A * decoding algorithm performance comparison.
Huang, Yi-Chun, and 黃逸淳. "Application of the space time block codes on the uniform linear array antennas." Thesis, 2008. http://ndltd.ncl.edu.tw/handle/63929120294953047902.
Full text中原大學
電子工程研究所
96
The Alamouti code is an orthogonal code with transmission rate 1, but it can’t be used in more than two transmitted antennas. The uniform linear arrasults show that has by (ULA) can be applied in the transmitter by using Alamouti code and the simulation reenterperformance.
Li, Oei-Siang, and 李維祥. "Combined Linear Block Codes with SLM and PTS to reduce PAPR in OFDM." Thesis, 2006. http://ndltd.ncl.edu.tw/handle/30594370335678463795.
Full text國立中興大學
電機工程學系所
94
Multicarrier transmission, also known as orthogonal frequency division multiplexing(OFDM), is a technique with a long history that has recently seen rising popularity in wireless and wireline applications. One of the major drawbacks of multicarrier transmission is the high peak-to-average power ratio(PAPR) of the transmit signal. We propose a concept to reduce the PAPR in OFDM systems by using the stadard arrays of linear block codes. Our scheme may be regarded as modified versions of the selective mapping(SLM) and Partial Transmit Sequence(PTS), which are to reduce the PAPR by reducing code rate and selecting minimum PAPR from several coset leaders as the transmit signal. Because the coset leaders of a linear code are used for scrambling in our scheme, no side information is required to be transmitted and the received signal can be easily decoded by syndrome decoding. Final our simulation results show that our scheme has good performance in PAPR reduction.
Chandran, Aneesh. "Investigation of the use of infinite impulse response filters to construct linear block codes." Thesis, 2016. http://hdl.handle.net/10539/22669.
Full textThe work presented extends and contributes to research in error-control coding and information theory. The work focuses on the construction of block codes using an IIR lter structure. Although previous works in this area uses FIR lter structures for error-detection, it was inherently used in conjunction with other error-control codes, there has not been an investigation into using IIR lter structures to create codewords, let alone to justify its validity. In the research presented, linear block codes are created using IIR lters, and the error-correcting capabilities are investigated. The construction of short codes that achieve the Griesmer bound are shown. The potential to construct long codes are discussed and how the construction is constrained due to high computational complexity is shown. The G-matrices for these codes are also obtained from a computer search, which is shown to not have a Quasi-Cyclic structure, and these codewords have been tested to show that they are not cyclic. Further analysis has shown that IIR lter structures implements truncated cyclic codes, which are shown to be implementable using an FIR lter. The research also shows that the codewords created from IIR lter structures are valid by decoding using an existing iterative soft-decision decoder. This represents a unique and valuable contribution to the eld of error-control coding and information theory.
MT2017
Lin, Tien-Yu, and 林典育. "Study of Hybrid Automatic Request Schemes and Tree-Search Decoding of Linear Block Codes." Thesis, 2013. http://ndltd.ncl.edu.tw/handle/71231770591464490295.
Full text國立臺灣大學
電信工程學研究所
101
In this dissertation, we study two topics on communications: hybrid automatic repeat request (ARQ) and tree-search decoding of linear block codes. For the first topic, we propose an hybrid ARQ (HARQ) scheme with subpacket transmission and subpacket scheduling for systems with constant packet lengths. In this scheme, each transmission packet comprises two subpackets of equal lengths. As compared to the conventional type II HARQ scheme, the proposed HARQ scheme can more effectively control the error-correcting capability and thus attain better throughput efficiency in the moderate to high signal-to-noise ratios (SNR) regime. Based on the proposed HARQ scheme, we then presents two modified versions of the proposed scheme. The first version with higher complexity, can provide further throughput improvement in low SNR. The second version, with the highest complexity, can obtain additional throughput than the first version in moderate to high SNR. For the second topic, we investigate a tree-search decoding algorithm, named A*, and aim to effectively reduce the decoding latency (complexity). We propose two complexity-reduction techniques for the A* algorithm. The first technique is that the searching is embedded with depth constraints in which the numbers of bit difference from the most reliable positions at different depths are limited. In the second technique, apart from the tree searching, the algorithm employs generation of candidate codewords based on processing the newly updated candidate codeword. For both proposed algorithms, the searching complexity can be significantly reduced at the cost of slight performance loss. In addition, the two proposed techniques can be effectively combined to obtain a more efficient modified A* algorithm. We also investigate the A* decoding for block coded schemes with interblock memory. With interblock memory, both the error performance and average decoding latency of the A* algorithm can be significantly improved in the high SNR regime. Finally, we discuss a HARQ scheme which employs packet division together with the A* decoding. This scheme is easy to be implemented and can perform as well throughput as the conventional type II HARQ scheme.
Staphorst, Leonard. "Viterbi Decoded Linear Block Codes for Narrowband and Wideband Wireless Communication Over Mobile Fading Channels." Diss., 2005. http://hdl.handle.net/2263/27090.
Full textDissertation (MEng(Electronic))--University of Pretoria, 2006.
Electrical, Electronic and Computer Engineering
unrestricted
Li, Yeng-Ting, and 李彥霆. "Combination of Partial Transmit Sequence with Linear Block Codes for PAPR Reduction in OFDM System." Thesis, 2019. http://ndltd.ncl.edu.tw/cgi-bin/gs32/gsweb.cgi/login?o=dnclcdr&s=id=%22107NCHU5441109%22.&searchmode=basic.
Full text國立中興大學
電機工程學系所
107
Orthogonal Frequency Division Multiplexing (OFDM) is a multi-carrier system capable of high-rate data transmission, and has many advantages. One of the important shortcomings is the Peak To Average Power (PAPR). In order to solve this problem, we have many methods such as SLM, PTS, etc. This article is mainly based on PTS. Compared with the traditional partial transmission sequence (PTS), this paper uses tree and trellis structure of error correction (ECC), it can reduce the peak-to-average power ratio and search complexity either, and based on this, it is applied to data of larger length.
Krishnan, K. Murali. "Computational Problems In Codes On Graphs." Thesis, 2007. https://etd.iisc.ac.in/handle/2005/487.
Full textKrishnan, K. Murali. "Computational Problems In Codes On Graphs." Thesis, 2007. http://hdl.handle.net/2005/487.
Full textPaul, Prabal. "On The Peak-To-Average-Power-Ratio Of Affine Linear Codes." Thesis, 2006. https://etd.iisc.ac.in/handle/2005/350.
Full textPaul, Prabal. "On The Peak-To-Average-Power-Ratio Of Affine Linear Codes." Thesis, 2006. http://hdl.handle.net/2005/350.
Full textMeng, Jin. "Linear Interactive Encoding and Decoding Schemes for Lossless Source Coding with Decoder Only Side Information." Thesis, 2008. http://hdl.handle.net/10012/3928.
Full textMachireddy, Amrutha. "Learning Non-linear Mappings from Data with Applications to Priority-based Clustering, Prediction, and Detection." Thesis, 2021. https://etd.iisc.ac.in/handle/2005/5670.
Full textΜέρμιγκας, Παναγιώτης. "Αποκωδικοποιητής μέγιστης πιθανοφάνειας για κώδικες LDPC και υλοποίηση σε FPGA." Thesis, 2013. http://hdl.handle.net/10889/6012.
Full textIn the first part of this thesis, the basic principles of Coding Theory and Communication Systems are introduced. In order to correct errors in the case of transmission through a noisy channel, channel coding with Linear Block Codes is applied, and more specifically Low-Density Parity-Check (LDPC) codes. The mathematical description of such codes is defined and useful definitions and theorems are specified. In addition, the Maximum Likelihood (ML) criterion is specified, on which the development of the relevant decoder is based. The second part consists of the simulation of the ML decoder in software and its hardware implementation on FPGA, in the cases where either Soft or Hard information is used as the decoder's input. Furthermore, the decoder's Architecture and the Design Methodology used are presented. Improvements concerning the implementation of the decoder are introduced, which lead to a reduction in the required area on chip. The experimental results of the two implementations are compared to the case of the iterative decoder and the Bit Error Rate plots are produced, as well as the appropriate conclusions.
Shih, Ian, and 施奕安. "Improving the Robustness of AudioWatermarking via Linear Block Code." Thesis, 2006. http://ndltd.ncl.edu.tw/handle/bqp8us.
Full text國立中央大學
電機工程研究所
94
Digital audio watermark is a technique to embed copyright or other information into the audio data. The embedded data is perceptually inaudible to maintain the quality of the host signal. The proposed method in this paper is to embed the watermark into the audio signal by using spread-spectrum modulation. To avoid the watermark being destroyed by the transmission failure or signal processing, we add the error-correction coding technique based on linear block code, so that the pixel error rate of the extracted watermark can be reduced; thus, the robustness of the watermark is enhanced. In the experiment, we will observe the results that influenced by α and the error-correction coding. After the MP3 compression, the results will show how the error-correction coding can reduce the pixel error rate of the watermark pattern.
Liao, Wei-Chieh, and 廖偉傑. "Study on Decoding of The Linear Block Code Using Free Software." Thesis, 2009. http://ndltd.ncl.edu.tw/handle/40720520368737836146.
Full text中原大學
電機工程研究所
97
Error control coding is a commonly used technique in a commucation system to protect the transmitted data which may be corrupted due to noise or other reasons. Free software is software that can be used, copied, studied, modified, and redistributed without restriction. In this thesis, we use free software to develope a simulation system for decoding of linear block code. We work out and simplify several decoding methods for linear block code, and use a graphic interface to get and compare the error performances and coding complexities of differenct methods. The program can save the simulated data, and show the data graph simultaneously. We hope this research can be used as a basis of a more mature platform which can used as a tool for teaching and researching.
Kot, Alan D. "On the construction, dimensionality, and decoding of linear block code trellises." Thesis, 1992. http://hdl.handle.net/2429/1589.
Full text