Relevant bibliographies by topics / Block turbo codes

Academic literature on the topic 'Block turbo codes'

Author: Grafiati
Published: 4 June 2021
Last updated: 4 February 2022

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Contents

Consult the lists of relevant articles, books, theses, conference reports, and other scholarly sources on the topic 'Block 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.

Journal articles on the topic "Block turbo codes"

1

Ryumshin, K. Yu. "ON CYCLICITY OF BLOCK TURBO CODES." Telecommunications and Radio Engineering 71, no. 7 (2012): 623–29. http://dx.doi.org/10.1615/telecomradeng.v71.i7.40.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Son, Jaeyong, Jun Jin Kong, and Kyeongcheol Yang. "Efficient decoding of block turbo codes." Journal of Communications and Networks 20, no. 4 (August 2018): 345–53. http://dx.doi.org/10.1109/jcn.2018.000050.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Kerouédan, Sylvie, Patrick Adde, and Ramesh Pyndiah. "How we implemented block turbo codes?" Annales Des Télécommunications 56, no. 7-8 (July 2001): 447–54. http://dx.doi.org/10.1007/bf02995455.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Afghah, Fatemeh, Mehrdad Ardebilipo, and Abolfazl Razi. "Fast Turbo Codes Concatenated With Space-Time Block Codes." Journal of Applied Sciences 8, no. 16 (August 1, 2008): 2867–73. http://dx.doi.org/10.3923/jas.2008.2867.2873.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Pyndiah, R. M. "Near-optimum decoding of product codes: block turbo codes." IEEE Transactions on Communications 46, no. 8 (1998): 1003–10. http://dx.doi.org/10.1109/26.705396.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Babich, Fulvio, Guido Montorsi, and Francesca Vatta. "Turbo Codes Performance Optimization over Block Fading Channels." Journal of Communications Software and Systems 2, no. 3 (April 5, 2017): 228. http://dx.doi.org/10.24138/jcomss.v2i3.285.

Full text
Abstract:
In this paper, the best achievable performance of a turbo coded system on a block fading channel is obtained, assuming binary antipodal modulation. A rate 1/3 turbo code is considered, obtained by concatenating, through a random interleaver, an 8-states rate 1/2 and a rate 1 convolutional codes (CC). The block fading channel model is motivated by the fact that in many wireless systems the coherence time of the channel is much longer than one symbol interval, resulting in adjacent symbols being affected by the same fading value. The fading blocks will experience independent fades, assuming a sufficient separation in time, in frequency, or both in time and in frequency. This channel model is suitable for analyzing, forinstance, wireless communication systems employing techniques such as slow frequency-hopping, as is done in the Global System for Mobile communications (GSM).In such systems, coded information is transmitted over a small number of fading channels in order to achieve diversity. The best coded information allocations over a certain number of fading channels are evaluated, using the Eades-McKay algorithm to generate distinct permutations of a multiset. Bounds on the achievable performance due to coding are derived using information-theoretic techniques. In particular, in the paper an analytical method is proposed, based on the sphere-packing bounding technique, to assess the achievable performance. Moreover, simulation results are obtained and compared with the theoretical ones.
APA, Harvard, Vancouver, ISO, and other styles
7

Al-Dweik, A., S. Le Goff, and B. Sharif. "A Hybrid Decoder for Block Turbo Codes." IEEE Transactions on Communications 57, no. 5 (May 2009): 1229–32. http://dx.doi.org/10.1109/tcomm.2009.05.070107.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Mahran, A., and M. Benaissa. "Adaptive Chase algorithm for block turbo codes." Electronics Letters 39, no. 7 (2003): 617. http://dx.doi.org/10.1049/el:20030421.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Huebner, A., K. Sh Zigangirov, and Daniel J. Costello. "Laminated turbo codes: A new class of block-convolutional codes." IEEE Transactions on Information Theory 54, no. 7 (July 2008): 3024–34. http://dx.doi.org/10.1109/tit.2008.924702.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Bee Leong Yeap, Tong Hooi Liew, J. Hamorsky, and L. Hanzo. "Comparative study of turbo equalization schemes using convolutional, convolutional turbo, and block-turbo codes." IEEE Transactions on Wireless Communications 1, no. 2 (April 2002): 266–73. http://dx.doi.org/10.1109/7693.994820.

Full text
APA, Harvard, Vancouver, ISO, and other styles
More sources

Dissertations / Theses on the topic "Block turbo codes"

1

Martin, 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 text
Abstract:
New adaptive, iterative approaches to the decoding of block Turbo codes and multilevel codes are developed. Block Turbo codes are considered as they can readily provide high data rates, low decoding complexity and good performance. Multilevel codes are considered as they provide a moderate complexity approach to a high complexity code and can provide codes with good bandwidth efficiency. The work develops two adaptive sub-optimal soft output decoding algorithms for block Turbo codes. One is based on approximation and the other on the distance properties of the component codes. They can be used with different codes, modulation schemes, channel conditions and in different applications without modification. Both approaches provide improved performance compared to previous approaches on the additive white Gaussian noise (AWGN) channel. The approximation based adaptive algorithm is also investigated on the uncorrelated Rayleigh fiat fading channel and is shown to improve performance over previous approaches. Multilevel codes are typically decoded using a multistage decoder (MSD) for complexity reasons. Each level passes hard decisions to subsequent levels. If the approximation based adaptive algorithm is used to decode component codes in a traditional MSD it improves performance significantly. Performance can be improved further by passing reliability (extrinsic) information to all previous and subsequent levels using an iterative MSD. A new iterative multistage decoding algorithm for multilevel codes is developed by treating the extrinsic information as a Gaussian random variable. If the adaptive algorithms are used in conjunction with iterative multistage decoding on the AWGN channel, then a significant improvement in performance is obtained compared to results using a traditional MSD.
APA, Harvard, Vancouver, ISO, and other styles
2

Sholiyi, Abiodun Olugbenga. "Irregular block turbo codes for communication systems." Thesis, Swansea University, 2011. https://cronfa.swan.ac.uk/Record/cronfa43150.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Hirst, Simon. "Iterative decoding techniques for block based error correction codes." Thesis, Lancaster University, 2002. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.289060.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Wang, Charles C., and Tien M. Nguyen. "USING SHORT-BLOCK TURBO CODES FOR TELEMETRY AND COMMAND." International Foundation for Telemetering, 1999. http://hdl.handle.net/10150/608708.

Full text
Abstract:
International Telemetering Conference Proceedings / October 25-28, 1999 / Riviera Hotel and Convention Center, Las Vegas, Nevada
The turbo code is a block code even though a convolutional encoder is used to construct codewords. Its performance depends on the code word length. Since the invention of the turbo code in 1993, most of the bit error rate (BER) evaluations have been performed using large block sizes, i.e., sizes greater than 1000, or even 10,000. However, for telemetry and command, a relatively short message (<500 bits) may be used. This paper investigates the turbo-coded BER performance for short packets. Fading channel is also considered. In addition, biased channel side information is adopted to improve the performance.
APA, Harvard, Vancouver, ISO, and other styles
5

Š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 text
Abstract:
The aim is to explain the Turbo convolutional and block turbo codes and decoding the secure message. The practical part focuses on the design of a demonstration program in Matlab. The work is divided into four parts. The first two deal with theoretical analysis of coding and decoding. The third section contains a description created a demonstration program that allows you to navigate the process of encoding and decoding. The fourth is devoted to simulation and performance of turbo codes.
APA, Harvard, Vancouver, ISO, and other styles
6

Ganti, Kamalakar. "Interleaver design for modified circular simplex turbo block coded modulator." Ohio : Ohio University, 2004. http://www.ohiolink.edu/etd/view.cgi?ohiou1107805760.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Pirestani, Shervin. "Source-controlled block turbo coding." Access to citation, abstract and download form provided by ProQuest Information and Learning Company; downloadable PDF file, 69 p, 2008. http://proquest.umi.com/pqdlink?did=994238721&sid=2&Fmt=2&clientId=8331&RQT=309&VName=PQD.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Chapalain-Le, Floc'h Nadine. "Application des Turbo Codes en blocs pour les réseaux locaux sans fil à haut débit." Brest, 2002. http://www.theses.fr/2002BRES2033.

Full text
Abstract:
Cette thèse s'inscrit dans le cadre général des communications numériques et comporte deux parties. La première partie est consacrée à l'évaluation et l'analyse des performances des turbo codes en blocs (BTC) dans l'environnement radio-mobile HIPERLAN/2 (HIgh PERformance Local Area Network type 2). Dans cette partie, deux algorithmes à entrées e t sorties pondérées sont étudiés, l'algorithme sous-optimal de Chase-Pyndiah de complexité raisonnable qui minimise la probabilité d'erreur par mot du code élémentaire et l'algorithme optimal de Nazarov qui minimise la probabilité d'erreur symbole à symbole mais dont la complexité est nettement plus élevée. Cette étude montre que pour une transmission sur un canal aux atténuations fortement corrélées de type HIPERLAN/2, la répartition de la corrélation en entrée du turbo décodeur a une grande influence sur les performances et qu'un entrelaceur doit être défini de manière à répartir les échantillons corrélés uniformément dans la matrice du code. La deuxième partie présente l'étude et l'optimisation de la mise en ouvre de l'algorithme de turbo décodage de Chase-Pyndiah sur le DSP TMS320C6201 (1600 Mips à 200MHz) à virgule fixe de Texas Instrument. Cette dernière partie vise à démontrer la faisabilité de la mise en couvre des turbo codes en blocs sur DSP, et ceci pour des débits de plus en plus élevés. Cette mise en rouvre a été réalisée en langage C pour permettre une portabilité du code pour d'autres applications et sur d'autres DSP. La mise en couvre permet d'atteindre un débit utile de 394 Kb/s pour un turbo décodage du BTC(1024, 676) avec 4 itérations
This thesis deals with digital wireless communication and is divided in two parts. In the first part, the performance of block turbo codes (BTC) is evaluated and analysed in the HIPERLAN/2 (HIgh PERformance Local Area Network type 2) radio mobile environment. In this part, two soft-input soft-output decoding algorithms are studied, the sub-optimal Chase-Pyndiah algorithm of reasonable complexity that minimises the elementary code word error probability, and the optimal Nazarov algorithm that minimises the symbol error probability but is much more complex. This work shows that for channels with highly correlated atténuation (i. E. HIPERLAN/2 type channels), the distribution of the corrélation at the input of the turbo decoder has a big impact on the performance and that an interleaver should be defined in order to spread uniformly the correlated samples in the code matrix. The second part focuses on the study and optimisation of the implementation of the Chase-Pyndiah turbo decoding algorithm on the fixed point DSP TMS320C6201 (1600 Mips à 200MHz) provided by Texas Instrument. This work intends to demonstrate the feasibility of the implementation of block turbo codes on DSP while providing increasing data rates. The algorithm was implemented in C language in order to enable the code portability for other applications and on other DSP. With this implementation, a data rate of 394 Kb/s can be reached for the turbo decoding of the BTC(1024, 676) with 4 itérations
APA, Harvard, Vancouver, ISO, and other styles
9

Chinchilla, Rigoberto. "Interleaver design for the circular simplex turbo block coded modulator." Ohio : Ohio University, 2003. http://www.ohiolink.edu/etd/view.cgi?ohiou1178129287.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Shaheem, Asri. "Iterative detection for wireless communications." University of Western Australia. School of Electrical, Electronic and Computer Engineering, 2008. http://theses.library.uwa.edu.au/adt-WU2008.0223.

Full text
Abstract:
[Truncated abstract] The transmission of digital information over a wireless communication channel gives rise to a number of issues which can detract from the system performance. Propagation effects such as multipath fading and intersymbol interference (ISI) can result in significant performance degradation. Recent developments in the field of iterative detection have led to a number of powerful strategies that can be effective in mitigating the detrimental effects of wireless channels. In this thesis, iterative detection is considered for use in two distinct areas of wireless communications. The first considers the iterative decoding of concatenated block codes over slow flat fading wireless channels, while the second considers the problem of detection for a coded communications system transmitting over highly-dispersive frequency-selective wireless channels. The iterative decoding of concatenated codes over slow flat fading channels with coherent signalling requires knowledge of the fading amplitudes, known as the channel state information (CSI). The CSI is combined with statistical knowledge of the channel to form channel reliability metrics for use in the iterative decoding algorithm. When the CSI is unknown to the receiver, the existing literature suggests the use of simple approximations to the channel reliability metric. However, these works generally consider low rate concatenated codes with strong error correcting capabilities. In some situations, the error correcting capability of the channel code must be traded for other requirements, such as higher spectral efficiency, lower end-to-end latency and lower hardware cost. ... In particular, when the error correcting capabilities of the concatenated code is weak, the conventional metrics are observed to fail, whereas the proposed metrics are shown to perform well regardless of the error correcting capabilities of the code. The effects of ISI caused by a frequency-selective wireless channel environment can also be mitigated using iterative detection. When the channel can be viewed as a finite impulse response (FIR) filter, the state-of-the-art iterative receiver is the maximum a posteriori probability (MAP) based turbo equaliser. However, the complexity of this receiver's MAP equaliser increases exponentially with the length of the FIR channel. Consequently, this scheme is restricted for use in systems where the channel length is relatively short. In this thesis, the use of a channel shortening prefilter in conjunction with the MAP-based turbo equaliser is considered in order to allow its use with arbitrarily long channels. The prefilter shortens the effective channel, thereby reducing the number of equaliser states. A consequence of channel shortening is that residual ISI appears at the input to the turbo equaliser and the noise becomes coloured. In order to account for the ensuing performance loss, two simple enhancements to the scheme are proposed. The first is a feedback path which is used to cancel residual ISI, based on decisions from past iterations. The second is the use of a carefully selected value for the variance of the noise assumed by the MAP-based turbo equaliser. Simulations are performed over a number of highly dispersive channels and it is shown that the proposed enhancements result in considerable performance improvements. Moreover, these performance benefits are achieved with very little additional complexity with respect to the unmodified channel shortened turbo equaliser.
APA, Harvard, Vancouver, ISO, and other styles
More sources

Books on the topic "Block turbo codes"

1

Inc, Game Counselor. Game Counselor's Answer Book for Nintendo Players. Redmond, USA: Microsoft Pr, 1991.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
2

Inc, Game Counsellor, ed. The Game Counsellor's answer book for Nintendo Game players: Hundredsof questions -and answers - about more than 250 popular Nintendo Games. Redmond, Washington: Microsoft Press, 1991.

Find full text
APA, Harvard, Vancouver, ISO, and other styles

Book chapters on the topic "Block turbo codes"

1

Vucetic, Branka, and Jinhong Yuan. "Block Codes." In Turbo Codes, 13–36. Boston, MA: Springer US, 2000. http://dx.doi.org/10.1007/978-1-4615-4469-2_2.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Ivaniš, Predrag, and Dušan Drajić. "Trellis Decoding of Linear Block Codes, Turbo Codes." In Information Theory and Coding - Solved Problems, 385–446. Cham: Springer International Publishing, 2016. http://dx.doi.org/10.1007/978-3-319-49370-1_8.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Alzubi, Jafar A., Omar A. Alzubi, and Thomas M. Chen. "Algebraic-Geometric Non-binary Block Turbo Codes." In SpringerBriefs in Electrical and Computer Engineering, 41–55. Cham: Springer International Publishing, 2014. http://dx.doi.org/10.1007/978-3-319-08293-6_4.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Alzubi, Jafar A., Omar A. Alzubi, and Thomas M. Chen. "Irregular Decoding of Algebraic-Geometric Block Turbo Codes." In SpringerBriefs in Electrical and Computer Engineering, 57–68. Cham: Springer International Publishing, 2014. http://dx.doi.org/10.1007/978-3-319-08293-6_5.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Guinand, Paul, John Lodge, and Lutz Papke. "An alternative approach to the design of interleavers for block “turbo” codes." In Information Theory and Applications II, 95–103. Berlin, Heidelberg: Springer Berlin Heidelberg, 1996. http://dx.doi.org/10.1007/bfb0025138.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Adde, Patrick, Ramesh Pyndiah, and Sylvie Kerouedan. "Block Turbo Code with Binary Input for Improving Quality of Service." In Multiaccess, Mobility and Teletraffic for Wireless Communications, volume 6, 195–204. Boston, MA: Springer US, 2002. http://dx.doi.org/10.1007/978-1-4757-5918-1_14.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

McManus, S., and P. G. Farrell. "Evaluation of standard approximation to log-likelihood ratio addition in the MAP algorithm, and Its application in block code (‘Turbo’) Iterative decoding algorithms." In Crytography and Coding, 239–50. Berlin, Heidelberg: Springer Berlin Heidelberg, 1997. http://dx.doi.org/10.1007/bfb0024469.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

"Block codes." In Codes and Turbo Codes, 109–66. Paris: Springer Paris, 2010. http://dx.doi.org/10.1007/978-2-8178-0039-4_4.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

"Space-time Block Codes †." In Turbo Coding, Turbo Equalisation and Space-Time Coding, 147–94. Chichester, UK: John Wiley & Sons, Ltd, 2011. http://dx.doi.org/10.1002/9780470978481.ch6.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

"Space-Time Block Codes." In Turbo Coding, Turbo Equalisation and Space-Time Coding, 393–443. Chichester, UK: John Wiley & Sons, Ltd, 2004. http://dx.doi.org/10.1002/047085474x.ch10.

Full text
APA, Harvard, Vancouver, ISO, and other styles

Conference papers on the topic "Block turbo codes"

1

Pyndiah, R. "Block turbo codes: ten years later." In IEE Seminar on Sparse-Graph Codes (Turbo Codes, Low Density Parity-Check Codes and Fountain Codes). IEE, 2004. http://dx.doi.org/10.1049/ic:20040505.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Razi, Abolfazl, Mehrdad Ardebilipour, and Fatemeh Afghah. "Space-Time Block Codes Assisted by Fast Turbo Codes." In 2008 4th International Conference on Wireless Communications, Networking and Mobile Computing (WiCOM). IEEE, 2008. http://dx.doi.org/10.1109/wicom.2008.347.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Kraidy, Ghassan M., Joseph J. Boutros, and Albert Guillen i Fabregas. "Irregular turbo codes in block-fading channels." In 2010 IEEE International Symposium on Information Theory - ISIT. IEEE, 2010. http://dx.doi.org/10.1109/isit.2010.5513370.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Geller, B., I. Diatta, J. Barbot, C. Vanstraceele, and F. Rambeau. "Block Turbo Codes: From Architecture to Application." In 2006 IEEE International Symposium on Information Theory. IEEE, 2006. http://dx.doi.org/10.1109/isit.2006.261747.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Mahran, A., and M. Benaissa. "Adaptive reliability calculation for block turbo codes." In 2003 IEEE 58th Vehicular Technology Conference. VTC 2003-Fall (IEEE Cat. No.03CH37484). IEEE, 2003. http://dx.doi.org/10.1109/vetecf.2003.1285103.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Liu, Xingcheng, Wei Zhang, Zhongfeng Wang, and Paul Cull. "An Efficient Adaptive Decoding for Block Turbo Codes." In 2006 International Conference on Wireless Communications, Networking and Mobile Computing. IEEE, 2006. http://dx.doi.org/10.1109/wicom.2006.128.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Alcoforado, M. L. M. G., V. C. da Rocha, and G. Markarian. "Turbo block codes for the binary adder channel." In Proceedings. International Symposium on Information Theory, 2005. ISIT 2005. IEEE, 2005. http://dx.doi.org/10.1109/isit.2005.1523672.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Izhar, Mohd Azri Mohd, and Norsheila Fisal. "Distributed turbo block codes in wireless relay networks." In 2012 IEEE Asia-Pacific Conference on Applied Electromagnetics (APACE). IEEE, 2012. http://dx.doi.org/10.1109/apace.2012.6457656.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Tallapragada, V. V. Satyanarayana, Jaya Krishna Sunkara, K. L. Narasihimha Prasad, and D. Nagaraju. "Fast turbo codes using sub-block based interleaver." In 2017 International Conference on Circuits, Controls, and Communications (CCUBE). IEEE, 2017. http://dx.doi.org/10.1109/ccube.2017.8394145.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Yinggang Du and Kam Tai Chan. "Enhanced space time block coded systems by concatenating turbo product codes." In Proceedings of the IEEE 6th Circuits and Systems Symposium on Emerging Technologies: Frontiers of Mobile and Wireless Communication (IEEE Cat. No.04EX710). IEEE, 2004. http://dx.doi.org/10.1109/casset.2004.1321972.

Full text
APA, Harvard, Vancouver, ISO, and other styles
You might also be interested in the extended bibliographies on the topic 'Block turbo codes' for particular source types:
Journal articles Dissertations / Theses
We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!

To the bibliography