Dissertations / Theses on the topic 'Turbo 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 'Turbo 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.
Fournier, Stéphan. "Turbo codes." Thesis, National Library of Canada = Bibliothèque nationale du Canada, 1997. http://www.collectionscanada.ca/obj/s4/f2/dsk2/ftp04/mq22763.pdf.
Full textYan, Yun. "Turbo codes." Ohio : Ohio University, 1999. http://www.ohiolink.edu/etd/view.cgi?ohiou1175200238.
Full textAbbara, Mamdouh. "Turbo-codes quantiques." Phd thesis, Ecole Polytechnique X, 2013. http://pastel.archives-ouvertes.fr/pastel-00842327.
Full textXia, Bo. "Importance sampling for LDPC codes and turbo-coded CDMA." Diss., The University of Arizona, 2004. http://hdl.handle.net/10150/290093.
Full textSauvé, Pierre-Paul. "Multibit decoding of turbo codes." Thesis, National Library of Canada = Bibliothèque nationale du Canada, 1998. http://www.collectionscanada.ca/obj/s4/f2/dsk1/tape10/PQDD_0004/MQ40947.pdf.
Full textSILVA, AMANDA CUNHA. "PERFORMANCE ANALYSIS OF TURBO CODES." PONTIFÍCIA UNIVERSIDADE CATÓLICA DO RIO DE JANEIRO, 2006. http://www.maxwell.vrac.puc-rio.br/Busca_etds.php?strSecao=resultado&nrSeq=9445@1.
Full textCódigos turbo são uma técnica de correção de erro eficiente que vem sendo proposta em diversos padrões de comunicações atuais. Esta técnica apresenta um desempenho que se aproxima dos limites teóricos estabelecidos na Teoria de Codificação. A razão para o excelente desempenho deste tipo de código baseia-se em dois fatores: uma estrutura de codificação composta por codificadores concatenados e uma estrutura de decodificação iterativa. Neste trabalho é realizada uma revisão da literatura onde a decodificação turbo é discutida segundo duas abordagens: uma que baseia-se na estrutura dos codificadores empregados e outra baseada na moderna teoria de grafos- fatores. O desempenho destes códigos é avaliado através de simulações. São considerados fatores como a estrutura dos codificadores, o tipo de modulação empregada, o algoritmo de decodificação utilizado, entre outros.
Turbo codes are an efficient error correcting technique that has been proposed for many communications standards. This technique achieves a performance that is near the theoretical limits established by Information Theory. The reason for this excellent performance of turbo codes relies on two aspects: a coding structure that is composed by concatenated encoders and an iterative decoding procedure. In the literature, two approaches for turbo decoding are presented: one that is based on the encoder structure and another that is built around the factor graphs theory. Both approaches are discussed in this work. Performance evaluation for these codes are obtained through simulations. Some aspects such as encoder structure, modulation scheme and decoding algorithm are considered and evaluated. Also codes derived from turbo codes by puncturing and shortening have been studied in this work.
Podemski, Robert. "Analyse spectrale des turbo codes." Rennes 1, 1998. http://www.theses.fr/1998REN10150.
Full textKim, Han Jo. "Improving turbo codes through code design and hybrid ARQ." [Gainesville, Fla.] : University of Florida, 2005. http://purl.fcla.edu/fcla/etd/UFE0012169.
Full textMartin, Philippa Anne. "Adaptive iterative decoding : block turbo codes and multilevel codes." Thesis, University of Canterbury. Electrical and Electronic Engineering, 2001. http://hdl.handle.net/10092/7853.
Full textTixier, Audrey. "Reconnaissance de codes correcteurs." Electronic Thesis or Diss., Paris 6, 2015. http://www.theses.fr/2015PA066554.
Full textIn this PhD, we focus on the code reconstruction problem. This problem mainly arises in a non-cooperative context when a communication consisting of noisy codewords stemming from an unknown code is observed and its content has to be retrieved by recovering the code that is used for communicating and decoding with it the noisy codewords. We consider here three possible scenarios and suggest an original method for each case. In the first one, we assume that the code that is used is a turbo-code and we propose a method for reconstructing the associated interleaver (the other components of the turbo-code can be easily recovered by the existing methods). The interleaver is reconstructed step by step by searching for the most probable index at each time and by computing the relevant probabilities with the help of the BCJR decoding algorithm. In the second one, we tackle the problem of reconstructing LDPC codes by suggesting a new method for finding a list of parity-check equations of small weight that generalizes and improves upon all existing methods. Finally, in the last scenario we reconstruct an unknown interleaved convolutional code. In this method we used the previous one to find a list of parity-check equations for this code. Then, by introducing a graph representing how these parity-check equations intersect we recover at the same time the interleaver and the convolutional code
Šedý, Jakub. "Turbo konvoluční a turbo blokové kódy." Master's thesis, Vysoké učení technické v Brně. Fakulta elektrotechniky a komunikačních technologií, 2011. http://www.nusl.cz/ntk/nusl-219287.
Full textOsseiran, Afif Hani. "Sur le décodage des codes turbo." Thesis, National Library of Canada = Bibliothèque nationale du Canada, 1999. http://www.collectionscanada.ca/obj/s4/f2/dsk1/tape8/PQDD_0028/MQ49797.pdf.
Full textLajnef, Khaled. "Étude des performances des codes turbo." Thesis, National Library of Canada = Bibliothèque nationale du Canada, 2001. http://www.collectionscanada.ca/obj/s4/f2/dsk3/ftp05/MQ65584.pdf.
Full textTanriover, Cagri C. "Improved turbo codes for data transmission." Thesis, Lancaster University, 2002. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.288960.
Full textHebbes, Luke. "Turbo codes for real-time applications." Thesis, Kingston University, 2004. http://eprints.kingston.ac.uk/20726/.
Full textFaudeil, Stéphane. "Les turbo-codes à haut débit." Brest, 1994. http://www.theses.fr/1994BRES2019.
Full textRaouafi, Fathi. "Adéquation turbo codes/processeurs de signal." Brest, 2001. http://www.theses.fr/2001BRES2010.
Full textTixier, Audrey. "Reconnaissance de codes correcteurs." Thesis, Paris 6, 2015. http://www.theses.fr/2015PA066554/document.
Full textIn this PhD, we focus on the code reconstruction problem. This problem mainly arises in a non-cooperative context when a communication consisting of noisy codewords stemming from an unknown code is observed and its content has to be retrieved by recovering the code that is used for communicating and decoding with it the noisy codewords. We consider here three possible scenarios and suggest an original method for each case. In the first one, we assume that the code that is used is a turbo-code and we propose a method for reconstructing the associated interleaver (the other components of the turbo-code can be easily recovered by the existing methods). The interleaver is reconstructed step by step by searching for the most probable index at each time and by computing the relevant probabilities with the help of the BCJR decoding algorithm. In the second one, we tackle the problem of reconstructing LDPC codes by suggesting a new method for finding a list of parity-check equations of small weight that generalizes and improves upon all existing methods. Finally, in the last scenario we reconstruct an unknown interleaved convolutional code. In this method we used the previous one to find a list of parity-check equations for this code. Then, by introducing a graph representing how these parity-check equations intersect we recover at the same time the interleaver and the convolutional code
List, Nancy Brown. "Low-Complexity Interleaver Design for Turbo Codes." Diss., Georgia Institute of Technology, 2004. http://hdl.handle.net/1853/5096.
Full textUnal, Baris. "Robust Data Hiding Scheme With Turbo Codes." Master's thesis, METU, 2005. http://etd.lib.metu.edu.tr/upload/2/12606848/index.pdf.
Full textNAL, BariS M.S., Department of Electrical And Electronics Engineering Supervisor: Prof. Dr. Rü
yal ERGÜ
L December 2005, 127 pages This study describes the design and implementation of a robust data hiding algorithm which is provided by turbo codes. As the digital technology grows up, it is getting easy to copy and distribute multimedia products without getting legal permission. This has forced researchers to study in digital watermarking areas. Along with watermarking researches, data hiding studies have gained interest in the last decade. Different watermark and data hiding algorithms have been proposed considering different requirements and properties such as robustness, fidelity, invisibility and data hiding capacity. In this thesis, robustness of watermarking systems and fidelity requirement in watermark models are considered and use of turbo codes is proposed with data embedding systems to improve system performance in terms of robustness. Fundamental watermarking algorithms in DCT domain are analyzed and simulated. Their performances in terms of robustness are presented. Data hiding algorithm which is based on projection and perturbation in transform domain is implemented in visual C. Then turbo codes are applied to this algorithm to improve system robustness. Improvement provided by turbo codes is demonstrated and compared with other discussed watermarking systems.
Haj, Shir Mohammadi Atousa. "Application of Turbo-Codes in Digital Communications." Thesis, University of Waterloo, 2001. http://hdl.handle.net/10012/773.
Full textRiaz, Bilal. "EXIT chart analysis for compressive turbo codes." Thesis, McGill University, 2009. http://digitool.Library.McGill.CA:80/R/?func=dbin-jump-full&object_id=66782.
Full textLes turbo codes ont atteint des performances près de la limite de Shannon dans la communication de données sur des canaux bruités. Les diagrammes EXIT (EXtrinsic Information Transfer) [15] récemment proposés sont devenus une partie essentielle de la conception de turbo codes et ont été utilisés en tant que substituts aux simulations traditionnelles du taux d'erreur binaire. Il a été démontré que les turbo codes compressés atteignent des performances près de l'entropie dans différents problèmes de codage de source [1], [46], [74]. L'objectif principal de cette thèse est d'étendre les diagrammes EXIT des turbo codes pour canaux aux turbo codes pour sources et également étendre cette technique aux décodeurs itératifs de taille fixé.Après une revue initiale de littérature et recherche pertinent, la technique de EXIT charts est augmenté à l'analyse de performance de codes turbo compressés. Au contraire de la dernière tentative d'une telle augmentation [24] et [32], l'augmentation dérivée dans cette thèse donne des résultats fiables qui correspondents à la performance simulée de codes turbo compréhensives. De plus, une borne inferieure est obtenue pour illustrer la connexion et les différences entre la technique de EXIT charts de cette thèse et de celle proposé dans [32]. Finalement, la technique de EXIT charts est augmenté à l'analyse de performance de décodeurs analogues itératifs et l'implémentation numérique de décodage turbo basée sur l'arithmétique de précision finie.Plusieurs résultats numériques ont été obtenus pour illustrer l'application réussie des dérivés de la technique du graphe EXIT. Premièrement, l'analyse de la performance du graphe EXIT dérivées est utilisée pour plusieurs seules sources de compression basée sur des encodeurs concaténés en parallèle et en série. En conséquence, la technique des graphes EXIT développée dans ce
Mitran, Patrick. "Design and applications of turbo source codes." Thesis, McGill University, 2002. http://digitool.Library.McGill.CA:80/R/?func=dbin-jump-full&object_id=29541.
Full textA unified framework, based on the parallel concatenation of trellis structured codes (turbo codes) is applied and shown to perform well in all cases. This represents a break with traditional source coding techniques in that the code is fixed-length to fixed-length. As such, it is a probabilistic coding technique. An explicit joint design of the parallel concatenated codes, based on conditions rooted in information theory, is presented. The codes thus designed are intimately related to Latin squares and are therefore named Latin Square Based Codes. As opposed to the vast majority of the existing literature on turbo codes, these codes perform data compression and are designed jointly. Furthermore, they are non-binary, non-linear, non-systematic and non-symmetric.
In all the above cases, near Shannon limit performance is observed. For data compression as applied to binary memoryless sources, the scheme achieves reliable communication at a rate only 7.5% above the entropy of the source. A similar result is shown for the Slepian-Wolf problem. Noise robust compression is shown to be as close as 1.11 dB from capacity for AWGN channels while coding for the Wyner-Ziv problem is as close as 1.1 dB from the rate-distortion function.
Ould, Cheikh Mouhamedou Youssouf. "On distance measurement methods for turbo codes." Thesis, McGill University, 2005. http://digitool.Library.McGill.CA:80/R/?func=dbin-jump-full&object_id=100669.
Full textThe reliable determination of a code's error performance at very low error rates using simulations may take months or may not be practical at all. However, the knowledge of dmin and its multiplicities can be used to estimate the error rates at high SNR. This thesis is concerned with efficient and accurate distance measurement methods for turbo codes. Since high values of dmin can be caused by high input weight values, say up to 20 or higher, if a brute force algorithm is used the accurate determination of dmin requires that all possible input sequences of input weight up to 20 be tested. Testing all possible input sequences becomes impractical as the size of the interleaver and the value of input weight increase. Thus, the accurate determination of the distance spectrum, or at least dmin and its multiplicities, is a significant problem, especially for interleavers that yield high dmin. Based on Garello's true distance measurement method, this thesis presents an efficient and accurate distance measurement method for single- and double-binary turbo codes that uses proper trellis termination such as dual-termination or tail-biting. This method is applied to determine the distance spectra for the digital video broadcasting with return channel via satellite (DVB-RCS) standard double-binary turbo codes. It is also used to design new interleavers for DVB-RCS that yield a significant improvement in error performance compared to those in the standard.
This method fits particularly well with tail-biting turbo codes that use structured interleavers. This is because the distance properties repeat and this method can use this knowledge to reduce the search space. The reduction in search space results in significant reduction in complexity (i.e., execution time), which allows the determination of high dmin values in reasonable time. This efficiency is demonstrated for both single- and double-binary turbo codes, using structured interleavers that have high dmin values for various code rates. This method reduces the execution tunes by a factor of 40 to 400.
Haj, Taieb Mohamed. "Codage vidéo distribué utilisant les turbo codes." Thesis, Université Laval, 2013. http://www.theses.ulaval.ca/2013/30170/30170.pdf.
Full textMost of the video compression processing is usually performed at the transmitter in the conventional video coding standards (MPEG, H.263, H.264/AVC [1]). This choice is due to the fact that the transmitter has full knowledge of its source to ensure easy and efficient compression. In addition, the usual applications of video transmission ensure a flow from a centralized station, with a higher computational capacity, to a number of receivers. The compression task is thus performed only once by a computationally adapted station. However, with the emergence of wireless surveillance locally distributed cameras, the growth of cellular interactive video applications as well as many other applications involving several low cost video encoders at the expense of high complexity central decoder, the compression task can no longer be handled by the encoder and thus the compression complexity should be transferred to the decoder. Slepian and Wolf information theoretical result on lossless coding for correlated distributed sources [2] and its extension to the lossy source coding case with side information at the decoder, as introduced by Wyner and Ziv [3], constitute the theoretical basis of distributed source coding. These theoretical concepts have given birth to a wide field of applications as the recent distributed video coding paradigm, established a few years ago. In this doctoral thesis, we present a study of various distributed video coding schemes in the pixel and transform domains. The decoder exploits the correlation between the video sequence to be transmitted by the encoder and the side information. This correlation can be seen as a virtual channel whose input is the frame to be transmitted and the output is the side information. Turbo coding is used to generate the parity bits which are sent, gradually upon decoder requests, to correct the errors in the side information considered as a noisy version of the original frame. In this work, we implement various algorithms for distributed video coding based on turbo codes in order to approach the efficiency of conventional video encoders.
Gnaedig, David. "High-Speed decoding of convolutional Turbo Codes." Lorient, 2005. http://www.theses.fr/2005LORIS050.
Full textTurbo codes are built as a concatenation of several convolutional codes separated by interleavers. In 1993, they have revolutionized error correcting coding by approaching within a few tenths of a decibel the Shannon limit. This performance is even more astonishing because the iterative decoding principle enables the decoder to be implemented in hardware with a relative low complexity. Due to their success, they are now widely used in practical systems and open standards. The increasing demand for high throughput applications in broadband applications is strong)y calling for high-speed decoder implementations, thus leading to new challenges. The objective of this thesis is to study high-throughput decoding architectures offering the best throughput versus complexity trade-off. We first laid down a simple expression to evaluate the benefits of an architecture in terms of throughput and efficiency. The application of this model to turbo decoding highlighted three typical parameters influencing the throughput and efficiency of the decoder : the degree of parallelism, the ratio of utilization (activity) of the processing units and the clock frequency. We tackled each of these points by investigating a large spectrum of possibilities of the design space, ranging from the joint code and decoder design to the optimization of the decoder architecture for a given code or set of codes. We first proposed a new coding scheme called Multiple Slice Turbo Codes making possible to minimize the memory requirements of the decoder using the parallel decoding of a the received codeword by several soft-input soft-output processors. In order to solve the resulting concurrent accesses to the memory, we designed a novel hierarchical interleaver. Second, we explored several solutions for improving the activity of the processors including the usage of a hybrid parallel/serial architecture and the introduction of two new schedules for parallel decoding: one schedule internal to the processors, and another at a more global level in association with an adapted constrained interleaver. Finally, thanks to an original method to reduce the critical path in the recursive computation of state metrics, we obtained, at no cost on a FPGA circuit, a doubling of the maximal clock frequency of the decoder. Most of the w techniques developed in this thesis were validated by designing a turbo decoder for the wireless broadband access standard WiMAX (IEEE 802. 16) that achieves excellent error decoding performance reaching a throughput of 100Mbit/s on a single FPGA
Talasila, Mahendra. "Implementation of Turbo Codes on GNU Radio." Thesis, University of North Texas, 2010. https://digital.library.unt.edu/ark:/67531/metadc33206/.
Full textJin, Hui. "Analysis and design of turbo-like codes." Diss., Pasadena, Calif. : California Institute of Technology, 2001. http://resolver.caltech.edu/CaltechETD:etd-08222001-151244.
Full textChauvin, Todd Henry. "Interleavers and iterative decoders for turbo codes /." Thesis, Connect to this title online; UW restricted, 2000. http://hdl.handle.net/1773/5947.
Full textSholiyi, Abiodun Olugbenga. "Irregular block turbo codes for communication systems." Thesis, Swansea University, 2011. https://cronfa.swan.ac.uk/Record/cronfa43150.
Full textRowitch, Douglas Neal. "Convolutional and turbo coded multicarrier direct sequence CDMA, and applications of turbo codes to hybrid ARQ communication systems /." Diss., Connect to a 24 p. preview or request complete full text in PDF format. Access restricted to UC campuses, 1998. http://wwwlib.umi.com/cr/ucsd/fullcit?p9835385.
Full textM'Sir, Mohamed El Amine. "Conception d'architectures rapides pour codes convolutifs en télécommunications : application aux turbo-codes." Metz, 2003. http://docnum.univ-lorraine.fr/public/UPV-M/Theses/2003/Msir.Mohamed.El.Amine.SMZ0315.pdf.
Full textM'Sir, Mohamed El Amine Dandache Abbas. "Conception d'architectures rapides pour codes convolutifs en télécommunications Application aux turbo-codes /." Metz : Université Metz, 2008. ftp://ftp.scd.univ-metz.fr/pub/Theses/2003/M'sir.Mohamed.el.Amine.SMZ0315.pdf.
Full textCuevas, Ordaz Francisco Javier. "Turbo décodage de code produit haut débit." Lorient, 2004. http://www.theses.fr/2004LORIS033.
Full textThis thesis continues research undertaken on new error correcting code techniques, following work on block turbo codes, BTCs, introduced in 1994 by R. Pyndiah. It proposes an innovative architecture for the turbo decoding of product codes, using extended BCH codes as elementary codes. This innovative architecture stores several data at the same address and performs parallel decoding to increase the data rate. First, we propose a new high rate turbo decoding architecture using a BCH (32,26,4) code with a soft input-soft output (SISO), correcting 1 error (Hamming code). Then, we dedicate the second group of results to decoding BCH (128,106,8) code for high data rates with strong error correction power, correcting 3 errors (minimum distance of product code d=64) and high code rates (R close to 0,7). The first advantage of theses designs is that they use only one memory (n2 data grouped into blocks of m2) at the input. The elementary decoder designs presented are capable of treating m data simultaneously, with m=1, 2, 4 and 8. The second result is that by using m parallel decoders of the same type for the architecture of the turbo decoder, we obtain a decoding m2 higher speed and a m2/2 surface area, for these elementary decoders. To compare the performance and complexity of the decoders, we use C language for behavioural simulations, VHDL for functional simulations and Synopsys Design Compiler for the synthesis. The results obtained open up the possibility of future integration on silicon for turbo decoders with strong error correction power (minimum distance 64, code rate 0. 8) and very high data rate (6. 4 Gbits/s with a CMOS 0. 18μm target library)
González, García R. Horacío. "Nouvelles structures de codage : turbo codes série / parallèle." Brest, 2004. http://www.theses.fr/2004BRES2037.
Full textThis thesis work deal with the development of new coding structures for turbo codes. This new structures seek to raise turbo codes' minimal distance, improving the code's performance at low error rate. To raise the minimal distance of convolutive turbo codes, we have developed a new coding structure, called Serial/Parallel Turbo Codes, that seeks to improve turbo code's behavior by improving the behavior of the elementary codes. The S/P Turbo code's structure seeks to keep a regular interleaving and to improve elementary codes by modifying their spectrum of distance. This allows to imitate long RSC codes and to eliminate rectangular error patterns in regular interleaving. Keeping the same design philosophy that S/P Turbo Codes, another proposed solution is shown : 3D Turbo Codes. This structure introduces a third coding dimension, independent from the base turbo codes. This makes 3D Turbo Codes easier to use that S/P Turbo Codes. To evaluate their performances, we have compared their results with some state-of-art coding schemes : the turbo codes from DVB-RCS and UMTS standards
Sanchez, Gonzalez Oscar David. "La montée en débit dans les architectures de turbo décodage de codes convolutifs." Télécom Bretagne, 2013. http://www.telecom-bretagne.eu/publications/publication.php?idpublication=14158.
Full textThe remarkable performance of the turbo codes in terms of their error correcting capabilities, and their feasibility to be implemented, have led to the adoption of them in several wireless communication standards: CCSDS for spatial communications; UMTS, LTE and LTE-Advanced for mobile phones; WiMAX for wide area networks and DVB-RCS for digital video broadcasting. The requirements in terms of the throughput rate have evolved form a few Mbit/s in the first practical applications, to a few hundred Mbit/s in WiMAX and LTE, up to data rates around 1 Gbit/s in four generation cellular communication systems, such as LTE-Advanced. The proposition of efficient architectural solutions to achieve high throughput turbo decoding rates is then a major challenge to accomplish, so that the industrial requirements are fulfilled and future high performance digital communication systems can be conceived. At the beginning of our research activities, the fastest turbo decoder architecture introduced in the literature achieved a throughput peak value around 700 Mbit/s. There were also several works that proposed architectures capable of achieving throughput values around 100 Mbit/s. Research opportunities were then available in order to establish architectural solutions that enable the decoding at a few Gbit/s. The first part of this work is devoted to the study of the turbo decoding algorithm and the techniques of parallelism. Analysis of the convergence of parallel turbo decoders are carried out, and a novel SISO decoder schedule to be used in shuffled turbo decoder architectures is presented. A methodology to efficiently explore the design space of parallel turbo decoder architectures is also proposed. Architectural solutions to break the bottleneck of the turbo decoder algorithm are presented in the second part of the thesis. Thus, a high throughput low complexity radix-16 SISO decoder is proposed, and a turbo decoder architecture implementing a high parallelism degree is designed.
Raoul, Olivier. "Conception et performances d'un circuit intégré turbo décodeur de codes produits." Brest, 1997. http://www.theses.fr/1997BRES2030.
Full textLiu, Haisheng. "Contributions à la maîtrise de la consommation dans des turbo-décodeurs." Télécom Bretagne, 2009. http://www.theses.fr/2009TELB0106.
Full textAlkhayat, Rachid. "Vers une architecture optimisée d'ASIP pour turbo décodage multi-standard." Télécom Bretagne, 2012. http://www.telecom-bretagne.eu/publications/publication.php?idpublication=13327.
Full textSystems-on-chips in the field of digital communications are becoming extremely diversified and complex with the continuous emerging of new digital communication systems and standards. In this field, Turbo decoding is one of the most computation, communication, and memory intensive, and thus, power-consuming component. Besides the increasing performance requirements, emerging digital communication systems imply multi-standard interoperability which introduces the new implementation flexibility requirement. In this context, recent efforts have targeted the use of Application-Specific Instruction-set Processor models (ASIP). Such an architecture model enables the designer to freely tune the flexibility/performance trade-off as required by the considered application. However, the architecture efficiency of application-specific processors is directly related to the devised instruction set and pipeline stages usage. Most of recently proposed works do not present this key issue explicitly. Hence, the main objective of this thesis work is related to unifying flexibility-oriented and optimization-oriented approaches in the design of channel decoders. Towards this objective, several contributions have been proposed: (1) designing of a multi-standard ASIP-based Turbo decoder achieving high architecture efficiency in terms of bit/cycle/iteration/mm2, (2) optimizing of the dynamic reconfiguration speed of the proposed ASIP architecture supporting all parameters of 3GPP-LTE/WiMAX/DVB-RCS standards, (3) designing of low complexity ARP and QPP interleavers for butterfly scheme with Radix4 trellis compression technique, and (4) proposing and designing of a complete FPGA prototype for the proposed multi-standard Turbo decoder. Furthermore, towards the support of LDPC decoding, a first effort has been proposed for the design of a scalable and flexible high throughput multi-ASIP combined architecture for LDPC and Turbo decoding
Baligh, Mohammadhadi. "Analysis of the Asymptotic Performance of Turbo Codes." Thesis, University of Waterloo, 2006. http://hdl.handle.net/10012/883.
Full textGuerrero, Durhan. "Turbo codes performance and multimedia in mobile applications." Thesis, National Library of Canada = Bibliothèque nationale du Canada, 1999. http://www.collectionscanada.ca/obj/s4/f2/dsk1/tape8/PQDD_0007/MQ42150.pdf.
Full textWadekar, Raju. "Adaptive rate turbo pun codes for wireless networks." Thesis, Lancaster University, 2008. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.531711.
Full textReid, Andrew Carey. "Turbo codes: convergence phenomena & non-binary constructions." Thesis, University of Canterbury. Electrical and Electronic Engineering, 2002. http://hdl.handle.net/10092/5462.
Full textLee, David C. (David Chunyi) 1978. "Simulating Turbo codes using a modular simulation platform." Thesis, Massachusetts Institute of Technology, 2002. http://hdl.handle.net/1721.1/87259.
Full textDurham, Laura M. (Laura Marie) 1977. "A density evolution analysis of turbo product codes." Thesis, Massachusetts Institute of Technology, 2002. http://hdl.handle.net/1721.1/87208.
Full textIncludes bibliographical references (leaves 112-113).
by Laura M. Durham.
S.M.
Chatzigeorgiou, Ioannis Ap. "Performance analysis and design of punctured turbo codes." Thesis, University of Cambridge, 2006. https://www.repository.cam.ac.uk/handle/1810/272140.
Full textHuang, Fu-hua. "Evaluation of Soft Output Decoding for Turbo Codes." Thesis, Virginia Tech, 1997. http://hdl.handle.net/10919/36910.
Full textMaster of Science
Raorane, Pooja Prakash. "Sampling Based Turbo and Turbo Concatenated Coded Noncoherent Modulation Schemes." University of Toledo / OhioLINK, 2010. http://rave.ohiolink.edu/etdc/view?acc_num=toledo1279071861.
Full textLindblom, Johannes. "Turbo Decoding With Early State Decisions." Thesis, Linköping University, Department of Electrical Engineering, 2008. http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-11694.
Full textTurbo codes was first presented in 1993 by C. Berrou, A. Glavieux and P. Thitimajshima. Since then this class of error correcting codes has become one of the most popular, because of its good properties. The turbo codes are able to come very close to theoretical limit, the Shannon limit. Turbo codes are for example used in the third generation of mobile phone (3G) and in the standard IEEE 802.16 (WiMAX).
There are some drawbacks with the algorithm for decoding turbo codes. The deocoder uses a Maximum A Posteriori (MAP) algorithm, which is a complex algorith. Because of the use of many variables in the decoder the decoding circuit will consume a lot of power due to memory accesses and internal communication. One way in which this can be reduced is to make early decisions.
In this work I have focused on making early decision of the encoder states. One major part of the work was also to be sure that the expressions were written in a way that as few variables as possible are needed. A termination condition is also introduced. Simulations based on estimations of the number of memory accesses, shows that the number of memory accesses will significantly decrease.
Shaw, Christopher, and Michael Rice. "TURBO-CODED APSK FOR TELEMETRY." International Foundation for Telemetering, 2007. http://hdl.handle.net/10150/604473.
Full textThis paper considers the use of Amplitude-Phase Shift Keying (APSK) for a telemetry system. Variable rate turbo codes are used to improve the power efficiency of 16- and 32-APSK. We discuss compensation techniques for power amplifier nonlinearities. Simulation results show the improved spectral efficiency of this modulation scheme over those currently defined in telemetry standards.