11 |
Novel methods in the improvement of turbo codes and their decodingRogers, Andrew John January 2013 (has links)
The performance of turbo codes can often be improved by improving the weight spectra of such codes. Methods of producing the weight spectra of turbo codes have been investigated and many improvements were made to refine the techniques. A much faster method of weight spectrum evaluation has been developed that allows calculation of weight spectra within a few minutes on a typical desktop PC. Simulation results show that new high performance turbo codes are produced by the optimisation methods presented. The two further important areas of concern are the code itself and the decoding. Improvements of the code are accomplished through optimisation of the interleaver and choice of constituent coders. Optimisation of interleaves can also be accomplished automatically using the algorithms described in this work. The addition of a CRC as an outer code proved to offer a vast improvement on the overall code performance. This was achieved without any code rate loss as the turbo code is punctured to make way for the CRC remainder. The results show a gain of 0.4dB compared to the non-CRC (1014,676) turbo code. Another improvement to the decoding performance was achieved through a combination of MAP decoding and Ordered Reliability decoding. The simulations show a performance of just 0.2dB from the Shannon limit. The same code without ordered reliability decoding has a performance curve which is 0.6dB from the Shannon limit. In situations where the MAP decoder fails to converge ordered reliability decoding succeeds in producing a codeword much closer to the received vector, often the correct codeword. The ordered reliability decoding adds to the computational complexity but lends itself to FPGA implementation.
|
12 |
Turbo-discharging the internal combustion engineBaker, Alan T. January 2014 (has links)
This thesis reports original research on a novel internal combustion (IC) engine charge air system concept called Turbo-Discharging. Turbo-Discharging depressurises the IC engine exhaust system so that the engine gas exchange pumping work is reduced, thereby reducing fuel consumption and CO2 emissions. There is growing concern regarding the human impact on the climate, part of which is attributable to motor vehicles and transport. Recent legislation has led manufacturers to improve the fuel economy and thus reduce the quantity of CO2 generated by their vehicles. As this legislation becomes more stringent manufacturers are looking to new and developing technologies to help further improve the fuel conversion efficiency of their vehicles. Turbo-Discharging is such a technology which benefits from the fact it uses commonly available engine components in a novel system arrangement. Thermodynamic and one-dimensional gas dynamics models and experimental testing on a 1.4 litre four cylinder four-stroke spark ignition gasoline passenger car engine have shown Turbo-Discharging to be an engine fuel conversion efficiency and performance enhancing technology. This is due to the reduction in pumping work through decreased exhaust system pressure, and the improved gas exchange process resulting in reduced residual gas fraction. Due to these benefits, engine fuel conversion efficiency improvements of up to 4% have been measured and increased fuel conversion efficiency can be realised over the majority of the engine operating speed and load map. This investigation also identified a measured improvement in engine torque over the whole engine speed range with a peak increase of 12%. Modelling studies identified that both fuel conversion efficiency and torque can be improved further by optimisation of the Turbo-Discharging system hardware beyond the limitations of the experimental engine test. The model predicted brake specific fuel consumption improvements of up to 16% at peak engine load compared to the engine in naturally aspirated form, and this increased to up to 24% when constraints imposed on the experimental engine test were removed.
|
13 |
Insugstrycksreglering av turbomotoriserade dragracingmotorcyklarTorniainen, Kalle January 2019 (has links)
Vid acceleration från stillastående med en turbomotoriserad dragracingmotorcykel behöver motorcykelns insugstryck regleras. Om regleringen av insugstrycket inte lyckas uppstår en okontrollerad och hastig ökning av insugstrycket. En för hastig ökning av insugstrycket leder till att vridmomentet från motorn ökar snabbare än önskat. Konsekvenserna av en för hastig vridmomentsökning blir att motorcykelns framhjul lyfter eller att motorcykelns bakhjul tappar greppet mot banan och spinner loss. I rapporten testas, simuleras och jämförs både nya och gamla koncept för att reglera insugstrycket i startögonblicket. Konceptet som i beslutsmatrisen fick högst viktad summa visade i utförda test god förmåga att reglera insugstrycket. Konceptet med högst viktad summa var koncept A. Koncept A använder sig av mottrycket i wastegatehatten som återkoppling till styrenheten. Hårdvaran som används i koncept A är en pneumatisk wastegate-ventil med två solenoider.
|
14 |
Igualização turbo em sistemas de comunicações óticasPereira, Rúben Tiago de Oliveira January 2012 (has links)
Tese de Mestrado Integrado. Engenharia Electrotécnica e de Computadores. Área de Especialização de Telecomunicações. Faculdade de Engenharia. Universidade do Porto. 2012
|
15 |
Circuit Design of Maximum a Posteriori Algorithm for Turbo Code DecoderKao, Chih-wei 30 July 2010 (has links)
none
|
16 |
A Study on Hybrid Automatic Repeat Request AlgorithmWu, Da-Cheng 13 August 2004 (has links)
There are two important techniques, automatic repeat request (ARQ) and forward error control (FEC), in error control systems. ARQ uses redundancy for detecting errors. While an error is detected in a transmitted code word, the receiver requests the transmitter to re-transmit the corrupted code word and the transmitted code word with detected error is discarded. However, the transmitted code word with detected error still contains a lot of information. ARQ schemes require a feedback channel. FEC relies on the controlled use of redundancy in the transmitted code word to detect and correct errors. Whether the decoding of the received code word is successful, no further processing is performed at the receiver. Therefore, FEC requires only a one-way link between the transmitter and receiver. In error control systems, a powerful FEC, turbo coding, was first proposed in 1993. Its performance was investigated by simulation to be close to the Shannon limit.
Hybrid ARQ (HARQ) systems after properly combining the ARQ techniques and FEC techniques, can be classified into type-I, type-II and type-III, and its performance can be elevated far more than ARQ systems. HARQ adopts the FEC methods to detect and correct the error patterns caused in the process of transmission. While errors are detected in the demodulated signals at receiver and fail to be corrected, the receiver will activate ARQ mechanism to request the transmitter to retransmit related information to achieve an error-free transmission.
In this thesis, a feasible type-II hybrid ARQ algorithm is proposed. Performance of the proposed algorithm is evaluated and analyzed by computer simulations. Compared with the traditional HARQ algorithms, the proposed algorithm can offer better performance in delay time and number of retransmissions with approximate throughput.
|
17 |
The design of efficient radial turbines for low power applicationsAtkinson, M. J. January 1998 (has links)
No description available.
|
18 |
Projeto de entrelaçadores para códigos turboJar e Silva, Marcel January 2006 (has links)
Made available in DSpace on 2014-06-12T17:42:14Z (GMT). No. of bitstreams: 2
arquivo6945_1.pdf: 934856 bytes, checksum: 6dde6929102773555ee9224146f061b8 (MD5)
license.txt: 1748 bytes, checksum: 8a4605be74aa9ea9d79846c1fba20a33 (MD5)
Previous issue date: 2006 / Os entrelaçadores possuem um papel crucial para que os códigos turbo atinjam desempenho próximo
da capacidade do canal. Apesar de terem sido introduzidos primeiramente como simples permutações
aleatórias, atualmente existem várias classes de entrelaçadores, tais como, S-aleatórios,
DRP, polinomiais e quasi-cíclicos, que produzem melhor desempenho para códigos turbo em um
canal AWGN e/ou são mais simples de serem armazenados. Este trabalho tem dois objetivos principais.
O primeiro é fazer estudos comparativos entre classes de entrelaçadores que apresentam a
propriedade da economia de memória em relação aos entrelaçadores aleatórios. Este estudo visa
suprir uma lacuna na literatura, que normalmente compara novas classes de entrelaçadores com a
classe dos entrelaçadores S-aleatórios. O segundo objetivo é o desenvolvimento de uma nova classe
de entrelaçadores que também apresenta a característica da economia de memória, além de garantir
altos fatores de espalhamento. Os entrelaçadores pertencentes a esta classe são batizados como
entrelaçadores quasi-retangulares
|
19 |
Evaluation of Soft Output Decoding for Turbo CodesHuang, Fu-hua 16 September 1997 (has links)
Evaluation of soft output decoding for turbo codes is presented. Coding theory related to this research is studied, including convolutional encoding and Viterbi decoding. Recursive systematic convolutional (RSC) codes and nonuniform interleavers commonly used in turbo code encoder design are analyzed. Fundamentals such as reliability estimation, log-likelihood algebra, and soft channel outputs for soft output Viterbi algorithm (SOVA) turbo code decoding are examined. The modified Viterbi metric that incorporates a-priori information used for SOVA decoding is derived. A low memory implementation of the SOVA decoder is shown. The iterative SOVA turbo code decoding algorithm is described with illustrative examples. The performance of turbo codes are evaluated through computer simulation. It has been found that the SOVA turbo code decoding algorithm, as described in the literature, did not perform as well as the published results. Modifications to the decoding algorithm are suggested. The simulated turbo code performance results shown after these modifications more closely match with current published research work. / Master of Science
|
20 |
[en] PERFORMANCE ANALYSIS OF TURBO CODES / [pt] ANÁLISE DE DESEMPENHO DE CÓDIGOS TURBOAMANDA CUNHA SILVA 08 January 2007 (has links)
[pt] Có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. / [en] 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.
|
Page generated in 0.0248 seconds