Gotowa bibliografia na temat „Turbo codes”
Utwórz poprawne odniesienie w stylach APA, MLA, Chicago, Harvard i wielu innych
Spis treści
Zobacz listy aktualnych artykułów, książek, rozpraw, streszczeń i innych źródeł naukowych na temat „Turbo codes”.
Przycisk „Dodaj do bibliografii” jest dostępny obok każdej pracy w bibliografii. Użyj go – a my automatycznie utworzymy odniesienie bibliograficzne do wybranej pracy w stylu cytowania, którego potrzebujesz: APA, MLA, Harvard, Chicago, Vancouver itp.
Możesz również pobrać pełny tekst publikacji naukowej w formacie „.pdf” i przeczytać adnotację do pracy online, jeśli odpowiednie parametry są dostępne w metadanych.
Artykuły w czasopismach na temat "Turbo codes"
Topalov, Vladislav, Iryna Tregubova, Mykola Severyn i Iryna Hurklis. "Modification of chaotic interleaver for turbo codes with a change to the duffing equation and accounting for the distance spectrum of the code". Eastern-European Journal of Enterprise Technologies 6, nr 9 (126) (21.12.2023): 32–38. http://dx.doi.org/10.15587/1729-4061.2023.292850.
Pełny tekst źródłaRothweller, J. "Turbo codes". IEEE Potentials 18, nr 1 (1999): 23–25. http://dx.doi.org/10.1109/45.747241.
Pełny tekst źródłaBerrou, Claude, Charlotte Langlais i Yi Yu. "Turbo codes and turbo algorithms". Journal of Communications Software and Systems 2, nr 3 (5.04.2017): 179. http://dx.doi.org/10.24138/jcomss.v2i3.282.
Pełny tekst źródłaRobertson, P., i T. Wörz. "Coded modulation scheme employing turbo codes". Electronics Letters 31, nr 18 (31.08.1995): 1546–47. http://dx.doi.org/10.1049/el:19951064.
Pełny tekst źródłaBanerjee, A., F. Vatta, B. Scanavino i D. J. Costello. "Nonsystematic Turbo Codes". IEEE Transactions on Communications 53, nr 11 (listopad 2005): 1841–49. http://dx.doi.org/10.1109/tcomm.2005.858672.
Pełny tekst źródłaLi Ping. "Turbo-SPC codes". IEEE Transactions on Communications 49, nr 5 (maj 2001): 754–59. http://dx.doi.org/10.1109/26.923796.
Pełny tekst źródłaGeng, Fu Quan, Zhi Gang Huang, Xuan Jie Ning i Mao Fan Yang. "A Joint Improved Irregular Accumulate Concatenated Tree Coding and Frequency Hopping OFDM Modulation Scheme for Wireless Networks". Advanced Materials Research 902 (luty 2014): 364–69. http://dx.doi.org/10.4028/www.scientific.net/amr.902.364.
Pełny tekst źródłaIsaka, Motohiko. "4. Convolutional Codes and Turbo Codes". Journal of The Institute of Image Information and Television Engineers 70, nr 7 (2016): 576–81. http://dx.doi.org/10.3169/itej.70.576.
Pełny tekst źródłaJose Raj, M., i Dr Sharmini Enoch. "Performance analysis of highly improved hybrid turbo codes for 4G wireless networks". International Journal of Engineering & Technology 8, nr 4 (19.10.2019): 398. http://dx.doi.org/10.14419/ijet.v8i4.20841.
Pełny tekst źródłaEt. al., Mrs Channaveeramma E. ,. "Performance Comparison of Turbo coder and low-density parity check codes". Turkish Journal of Computer and Mathematics Education (TURCOMAT) 12, nr 10 (28.04.2021): 5898–901. http://dx.doi.org/10.17762/turcomat.v12i10.5408.
Pełny tekst źródłaRozprawy doktorskie na temat "Turbo codes"
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.
Pełny tekst źródłaYan, Yun. "Turbo codes". Ohio : Ohio University, 1999. http://www.ohiolink.edu/etd/view.cgi?ohiou1175200238.
Pełny tekst źródłaAbbara, Mamdouh. "Turbo-codes quantiques". Phd thesis, Ecole Polytechnique X, 2013. http://pastel.archives-ouvertes.fr/pastel-00842327.
Pełny tekst źródłaXia, Bo. "Importance sampling for LDPC codes and turbo-coded CDMA". Diss., The University of Arizona, 2004. http://hdl.handle.net/10150/290093.
Pełny tekst źródłaSauvé, 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.
Pełny tekst źródłaSILVA, 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.
Pełny tekst źródłaCó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.
Pełny tekst źródłaKim, Han Jo. "Improving turbo codes through code design and hybrid ARQ". [Gainesville, Fla.] : University of Florida, 2005. http://purl.fcla.edu/fcla/etd/UFE0012169.
Pełny tekst źródłaMartin, 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.
Pełny tekst źródłaTixier, Audrey. "Reconnaissance de codes correcteurs". Electronic Thesis or Diss., Paris 6, 2015. http://www.theses.fr/2015PA066554.
Pełny tekst źródłaIn 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
Książki na temat "Turbo codes"
Giulietti, Alexandre, Bruno Bougard i Liesbet Van der Perre. Turbo Codes. Boston, MA: Springer US, 2004. http://dx.doi.org/10.1007/978-1-4615-0477-1.
Pełny tekst źródłaVucetic, Branka, i Jinhong Yuan. Turbo Codes. Boston, MA: Springer US, 2000. http://dx.doi.org/10.1007/978-1-4615-4469-2.
Pełny tekst źródłaBerrou, Claude, red. Codes and Turbo Codes. Paris: Springer Paris, 2010. http://dx.doi.org/10.1007/978-2-8178-0039-4.
Pełny tekst źródłaBerrou, Claude. Codes and Turbo Codes. Paris: Springer-Verlag Paris, 2010.
Znajdź pełny tekst źródłaAbbasfar, Aliazam. Turbo-like Codes. Dordrecht: Springer Netherlands, 2007. http://dx.doi.org/10.1007/978-1-4020-6391-6.
Pełny tekst źródłaGiulietti, Alexandre. Turbo codes: Desirable and designable. Boston, MA: Kluwer Academic Publishers, 2004.
Znajdź pełny tekst źródłaVucetic, Branka. Turbo codes: Principles and applications. Boston: Kluwer Academic Publishers, 2000.
Znajdź pełny tekst źródłaVucetic, Branka. Turbo Codes: Principles and Applications. Boston, MA: Springer US, 2000.
Znajdź pełny tekst źródłaSauve, Pierre-Paul. Multibit decoding of turbo codes. Ottawa: National Library of Canada, 1998.
Znajdź pełny tekst źródłaGiulietti, Alexandre. Turbo Codes: Desirable and Designable. Boston, MA: Springer US, 2004.
Znajdź pełny tekst źródłaCzęści książek na temat "Turbo codes"
Rao, K. Deergha. "Turbo Codes". W Channel Coding Techniques for Wireless Communications, 181–231. Singapore: Springer Singapore, 2019. http://dx.doi.org/10.1007/978-981-15-0561-4_6.
Pełny tekst źródłaKienle, Frank. "Turbo Codes". W Architectures for Baseband Signal Processing, 117–45. New York, NY: Springer New York, 2013. http://dx.doi.org/10.1007/978-1-4614-8030-3_6.
Pełny tekst źródłaGiulietti, Alexandre, Bruno Bougard i Liesbet Van der Perre. "Turbo Codes". W Turbo Codes, 1–28. Boston, MA: Springer US, 2004. http://dx.doi.org/10.1007/978-1-4615-0477-1_1.
Pełny tekst źródłaXu, Jun, Jin Xu i Yifei Yuan. "Turbo Codes". W Channel Coding in 5G New Radio, 225–54. Boca Raton: CRC Press, 2022. http://dx.doi.org/10.1201/9781003336174-5.
Pełny tekst źródłaCancellieri, Giovanni. "Turbo Codes". W Polynomial Theory of Error Correcting Codes, 473–502. Cham: Springer International Publishing, 2014. http://dx.doi.org/10.1007/978-3-319-01727-3_9.
Pełny tekst źródłaDeergha Rao, K. "Turbo Codes". W Channel Coding Techniques for Wireless Communications, 161–207. New Delhi: Springer India, 2015. http://dx.doi.org/10.1007/978-81-322-2292-7_6.
Pełny tekst źródłaHeegard, Chris, i Stephen B. Wicker. "Concatenated Codes". W Turbo Coding, 65–88. Boston, MA: Springer US, 1999. http://dx.doi.org/10.1007/978-1-4757-2999-3_4.
Pełny tekst źródłaVucetic, Branka, i Jinhong Yuan. "Block Codes". W Turbo Codes, 13–36. Boston, MA: Springer US, 2000. http://dx.doi.org/10.1007/978-1-4615-4469-2_2.
Pełny tekst źródłaVucetic, Branka, i Jinhong Yuan. "Convolutional Codes". W Turbo Codes, 37–72. Boston, MA: Springer US, 2000. http://dx.doi.org/10.1007/978-1-4615-4469-2_3.
Pełny tekst źródłaVucetic, Branka, i Jinhong Yuan. "Introduction". W Turbo Codes, 1–12. Boston, MA: Springer US, 2000. http://dx.doi.org/10.1007/978-1-4615-4469-2_1.
Pełny tekst źródłaStreszczenia konferencji na temat "Turbo codes"
Pyndiah, R. "Block turbo codes: ten years later". W 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.
Pełny tekst źródłaNg, S. X. "Integrated wireless multimedia turbo-transceiver design approaching the Rayleigh channel's capacity: interpreting Shannon's lessons in the turbo-era". W 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:20040507.
Pełny tekst źródłaHuebner, A., M. Lentmaier, K. Sh Zigangirov i D. J. Costello. "Laminated turbo codes". W 2005 IEEE International Symposium on Information Theory (ISIT). IEEE, 2005. http://dx.doi.org/10.1109/isit.2005.1523405.
Pełny tekst źródłaKoller, C., A. Graell i Amat, J. Kliewer, F. Vatta i Danniel J. Costello. "Tuned turbo codes". W 2008 International Symposium on Information Theory and its Applications (ISITA 2008). IEEE, 2008. http://dx.doi.org/10.1109/isita.2008.4895619.
Pełny tekst źródłaTrajkovic, Vladimir D., Minyue Fu i Peter J. Schreier. "Turbo Equalization With Irregular Turbo Codes". W 2007 4th International Symposium on Wireless Communication Systems. IEEE, 2007. http://dx.doi.org/10.1109/iswcs.2007.4392320.
Pełny tekst źródłaKovaci, Maria, Horia Balta, Alexandre de Baynast i Miranda M. Nafornita. "Performance Comparison of Punctured Turbo Codes and Multi Binary Turbo Codes". W 2007 International Symposium on Signals, Circuits and Systems. IEEE, 2007. http://dx.doi.org/10.1109/isscs.2007.4292768.
Pełny tekst źródłaVafi, Sina, Tadeusz Wysocki i Mehran Abolhasan. "Serially Concatenated Turbo Codes". W 2009 5th International Conference on Wireless Communications, Networking and Mobile Computing (WiCOM). IEEE, 2009. http://dx.doi.org/10.1109/wicom.2009.5303570.
Pełny tekst źródłaPoulin, David, Jean-Pierre Tillich i Harold Ollivier. "Quantum serial turbo-codes". W 2008 IEEE International Symposium on Information Theory - ISIT. IEEE, 2008. http://dx.doi.org/10.1109/isit.2008.4594998.
Pełny tekst źródłaMoloudi, Saeedeh, Michael Lentmaier i Alexandre Graell i Amat. "Spatially coupled turbo codes". W 2014 8th International Symposium on Turbo Codes and Iterative Information Processing (ISTC). IEEE, 2014. http://dx.doi.org/10.1109/istc.2014.6955090.
Pełny tekst źródłaQi, Yongzhi, Deyuan Chen i Can Zhang. "Punctured Turbo-Polar Codes". W 2019 IEEE 11th International Conference on Communication Software and Networks (ICCSN). IEEE, 2019. http://dx.doi.org/10.1109/iccsn.2019.8905352.
Pełny tekst źródłaRaporty organizacyjne na temat "Turbo codes"
Mitchell, Gregory. Investigation of Hamming, Reed-Solomon, and Turbo Forward Error Correcting Codes. Fort Belvoir, VA: Defense Technical Information Center, lipiec 2009. http://dx.doi.org/10.21236/ada505116.
Pełny tekst źródłaMcEliece, Robert, i Padhraic Smyth. Turbo Decoding of High Performance Error-Correcting Codes via Belief Propagation. Fort Belvoir, VA: Defense Technical Information Center, grudzień 1998. http://dx.doi.org/10.21236/ada386835.
Pełny tekst źródła