11 research outputs found

    Mapper and Demapper for LDPC-Coded Systems

    Get PDF
    Low Density Parity Check (LDPC) codes are state-of-art error correcting codes, included in several standards for broadcast transmissions. Iterative softdecision decoding algorithms for LDPC codes reach excellent error correction capability; their performance, however, is strongly affected by finite-precision issues in the representation of inner variables. Great attention has been paid, in recent literature, to the topic of quantization for LDPC decoders, but mostly focusing on binary modulations and analyzing finite precision effects in a disaggregrated manner, i.e., considering separately each block of the receiver. Modern telecommunication standards, instead, often adopt high order modulation schemes, e.g. M-QAM, with the aim to achieve large spectral efficiency. This puts additional quantization problems, that have been poorly debated in previous literature. This paper discusses the choice of suitable quantization characteristics for both the decoder messages and the received samples in LDPC-coded systems using M-QAM schemes. The analysis involves also the demapper block, that provides initial likelihood values for the decoder, by relating its quantization strategy with that of the decoder. A signal label for a signal in a 2m-ary modulation scheme is simply the m-bit pattern assigned to the signal. A mapping strategy refers to the grouping of bits within a codeword, where each mbit group is used to select a 2m-ary signal in accordance with the signal labels. The most obvious mapping strategy is to use each group of m consecutive bits to select a signal. . We will call this the consecutive-bit (CB) mapping strategy. An alternative strategy is the bit-reliability (BR) mapping strategy which will be described below. A new demapper version, based on approximate expressions, is also presented, that introduces a slight deviation from the ideal case but yields a low complexity hardware implementation

    Parallel concatenated convolutional codes from linear systems theory viewpoint

    Get PDF
    The aim of this work is to characterize two models of concatenated convolutional codes based on the theory of linear systems. The problem we consider can be viewed as the study of composite linear system from the classical control theory or as the interconnection from the behavioral system viewpoint. In this paper we provide an inputโ€“stateโ€“output representation of both models and introduce some conditions for such representations to be both controllable and observable. We also introduce a lower bound on their free distances and the column distances

    Turbo codes and turbo algorithms

    Get PDF
    In the first part of this paper, several basic ideas that prompted the coming of turbo codes are commented on. We then present some personal points of view on the main advances obtained in past years on turbo coding and decoding such as the circular trellis termination of recursive systematic convolutional codes and double-binary turbo codes associated with Max-Log-MAP decoding. A novel evaluation method, called genieinitialised iterative processing (GIIP), is introduced to assess the error performance of iterative processing. We show that using GIIP produces a result that can be viewed as a lower bound of the maximum likelihood iterative decoding and detection performance. Finally, two wireless communication systems are presented to illustrate recent applications of the turbo principle, the first one being multiple-input/multiple-output channel iterative detection and the second one multi-carrier modulation with linear precoding

    ์ „์†กํšจ์œจ ํ–ฅ์ƒ์„ ์œ„ํ•œ MIMO-FTN ์ „์†ก๊ธฐ๋ฒ• ์—ฐ๊ตฌ

    Get PDF
    ์ฐจ์„ธ๋Œ€ ๋ฌด์„ ํ†ต์‹ ์—์„œ๋Š” ๋†’์€ ์ „์†ก๋ฅ ์„ ๊ฐ€์ง€๋Š” ํ†ต์‹  ๊น๋ฒ„์„ ์š”๊ตฌํ•œ๋‹ค. ํ•˜์ง€๋งŒ ๋Œ€์—ญํญ์ด ์ œํ•œ์ ์ด๊ธฐ ๋•Œ๋ฌธ์— ์ „์†ก๋ฅ ์„ ๋†’์ด๊ธฐ ์œ„ํ•œ ๋งŽ์€ ๋ฐฉ์•ˆ๋“ค์ด ์—ฐ๊ตฌ๋˜์–ด์ง€๊ณ  ์žˆ์ง€๋งŒ ์ „์†ก๋ฅ ๊ณผ ์„ฑ๋Šฅ์€ trade-off ๊ด€๊ณ„์ด๊ธฐ์— ์ „์†ก๋ฅ ์„ ํ–ฅ์ƒ์‹œํ‚ด์— ๋”ฐ๋ผ ์„ฑ๋Šฅ์€ ์ €ํ•˜์‹œํ‚ค๊ธฐ ๋•Œ๋ฌธ์— ์„ฑ๋Šฅ์„ ์ตœ๋Œ€ํ•œ ์œ ์ง€ํ•˜๋ฉด์„œ ๋†’์€ ์ „์†ก๋ฅ ์„ ๊ฐ–๋Š” ์ „์†ก๊ธฐ๋ฒ•๋“ค์ด ๋Œ€๋‘๋˜๊ณ  ์žˆ๋‹ค. DVB-S2 ๊ธฐ๋ฐ˜ ์œ„์„ฑ ํ†ต์‹ ์—์„œ๋Š” ์ „์†ก๋ฅ  ํ–ฅ์ƒ์„ ์œ„ํ•œ ๋งŽ์€ ๋ฐฉ์•ˆ๋“ค ์ค‘์— ๊ฐ€์žฅ ๋Œ€ํ‘œ์ ์ธ ๋ณตํ˜ธ ์†๋„๋ฅผ ๊ฐœ์„ ์‹œ์ผœ ์ „์†ก๋ฅ ์„ ํ–ฅ์ƒ์‹œํ‚ค๋Š” ๋ฐฉ์•ˆ์€ ์ด๋ฏธ ์—ฐ๊ตฌ๊ฐ€ ํฌํ™”์ƒํƒœ์— ์žˆ๋‹ค. ์ด์— ๋ณธ ๋…ผ๋ฌธ์—์„œ๋Š” ์ „์†ก๋ฅ ์„ ํ–ฅ์ƒ์‹œํ‚ค๋Š” ์—ฌ๋Ÿฌ ๊ฐ€์ง€ ๋ฐฉ๋ฒ• ์ค‘ Nyquist ์†๋„๋ณด๋‹ค ๋น ๋ฅด๊ฒŒ ์‹ ํ˜ธ๋ฅผ ์ „์†กํ•˜์—ฌ ์ „์†ก๋ฅ ์„ ํ–ฅ์ƒ์‹œํ‚ค๋Š” ๊ธฐ๋ฒ•์ธ FTN ๊ธฐ๋ฒ•๊ณผ ๋‘ ๊ฐœ ์ด์ƒ์˜ ์†ก์ˆ˜์‹  ์•ˆํ…Œ๋‚˜๋ฅผ ์‚ฌ์šฉํ•˜์—ฌ ์ „์†ก๋ฅ ์„ ๋†’์ด๋Š” MIMO ๊น๋ฒ„์„ ์‚ฌ์šฉํ•˜์—ฌ MIMO-FTN ์†ก์ˆ˜์‹ ๊ตฌ์กฐ๋ฅผ ์ œ์•ˆํ•œ๋‹ค.์ œ 1 ์žฅ : ์„œ๋ก  ์ œ 2 ์žฅ : ๋ฌด์„ ํ†ต์‹ ์—์„œ ์ „์†ก๋ฅ  ํ–ฅ์ƒ์„ ์œ„ํ•œ ๊ธฐ๋ฒ• 2.1 FTN ๊ธฐ๋ฒ• 2.2 High-Order Modulation ๊ธฐ๋ฒ• 2.3 MIMO ๊ธฐ๋ฒ• 2.4 MIMO-FTN ์—ฐ์ ‘ ๊ธฐ๋ฒ• ์ œ 3 ์žฅ : SISO์ฑ„๋„์—์„œ์˜ FTN ์ ์šฉ ๊ธฐ๋ฒ• 3.1 ์ฑ„๋„ ๋ถ€ํ˜ธํ™” ๊ธฐ๋ฒ• 3.1 ํ„ฐ๋ณด ๋ถ€ํ˜ธ ๊ธฐ๋ฐ˜์˜ FTN ๋ณตํ˜ธ๊ธฐ ๊ตฌ์กฐ ์ œ 4 ์žฅ : MIMO-FTN์˜ ์ตœ์  ์†ก์ˆ˜์‹ ๊ธฐ๋ฒ• ์ œ์•ˆ 4.1 FTN ๊ธฐ๋ฒ•์„ ์ ์šฉํ•œ ๊ณ„์ธต์  ์‹œ๊ณต๊ฐ„ ๋ณตํ˜ธ ๊ตฌ์กฐ ์ œ์•ˆ 4.2 FTN ๊ธฐ๋ฒ•์„ ์ ์šฉํ•œ ZF ๋ณตํ˜ธ ๊ตฌ์กฐ ์ œ์•ˆ ์ œ 5 ์žฅ : ์‹œ๋ฎฌ๋ ˆ์ด์…˜ ๋ฐ ์„ฑ๋Šฅ๋ถ„์„ ์ œ 6 ์žฅ : ๊ฒฐ๋ก Maste

    Turbo codes with rate-m/(M+1) constituent convolutional codes

    No full text
    International audienceThe original turbo codes (TCs), presented in 1993 by Berrou et al., consist of the parallel concatenation of two rate-1/2 binary recursive systematic convolutional (RSC) codes. This paper explains how replacing rate-1/2 binary component codes by rate-m/(m + 1) binary RSC codes can lead to better global performance. The encoding scheme can be designed so that decoding can be achieved closer to the theoretical limit, while showing better performance in the region of low error rates. These results are illustrated with some examples based on double-binary (m = 2) 8-state and 16-state TCs, easily adaptable to a large range of data block sizes and coding rates. The double-binary 8-state code has already been adopted in several telecommunication standards

    Double binary turbo codes analysis and decoder implementation

    Get PDF
    Ankara : The Department of Electrical and Electronics Engineering and the Institute of Engineering and Sciences of Bilkent University, 2008.Thesis (Master's) -- Bilkent University, 2008.Includes bibliographical references leaves 60-61.Classical Turbo Code presented in 1993 by Berrau et al. received great attention due to its near Shannon Limit decoding performance. Double Binary Circular Turbo Code is an improvement on Classical Turbo Code and widely used in todayโ€™s communication standards, such as IEEE 802.16 (WIMAX) and DVBRSC. Compared to Classical Turbo Codes, DB-CTC has better error-correcting capability but more computational complexity for the decoder scheme. In this work, various methods, offered to decrease the computational complexity and memory requirements of DB-CTC decoder in the literature, are analyzed to find the optimum solution for the FPGA implementation of the decoder. IEEE 802.16 standard is taken into account for all simulations presented in this work and different simulations are performed according to the specifications given in the standard. An efficient DB-CTC decoder is implemented on an FPGA board and compared with other implementations in the literature.Yฤฑlmaz, ร–zlemM.S

    An Iterative Coded Turbo Equalization Model in High Data Rate Wireless Application System

    Get PDF
    In next-generation wireless communication and 5G-based mobile communication, error-free communication with high transmission efficiency and reliability in a limited bandwidth is required along with diverse services. Highly reliable communication is difficult with wireless communication systems due to surrounding environment, movement of transmitters and receivers, and various noises. Channel coding technology should be applied to overcome these problems. In addition, an algorithm that can overcome the loss of transmission efficiency caused by the application of channel coding technology should be applied. However, since there is a trade-off relationship between improved transmission rates and performance, it is difficult to satisfy both. Thus, recently, methods to improve both transmission rates and performance simultaneously are being studied. Accordingly, this dissertation proposes a channel coded turbo equalization model that enables improved performance in a high transmission wireless communication system with improved transmission efficiency. The topic of this dissertation can be largely divided into two aspects: performance improvement and high transmission efficiency. First, a turbo equalization model combined with iterative codes for performance improvement in a wireless communication system was investigated, and a soft decision-based iterative coding schemes such as the convolutional code-based BCJR, turbo codes and LDPC codes were introduced. Subsequently, the performance of these coding schemes was comparatively analyzed. The BER performance analysis through the simulation showed that the LDPC code was approximately 1.2 [dB] at BER , which was the closest to the Shannon's channel capacity limit. In addition, the LDPC coding method was suggested as a channel coding scheme suitable for high-speed wireless communication by comparatively analyzing the characteristics of each coding scheme for complexity, decoding speed and performance. Second, the algorithm that achieved high transmission efficiency was investigated. Conventional high-transmission efficiency algorithms such as punctured, FTN and MIMO algorithms were introduced, and these three were comparatively analyzed from the perspective of the same transmission rate. In addition, MIMO-FTN and P-FTN algorithms, which combined each of the punctured and MIMO algorithms with the FTN algorithm to maximize the transmission efficiency, were proposed. The performances of the proposed algorithms were analyzed through the simulation from the perspective of the same transmission rate, and the W-ZF based MIMO-FTN algorithm was found to be the best. However, the performance degradation due to the application of FTN occurred, and subsequently, a turbo equalization model of FTN signals based UEP was proposed to overcome this problem. The UEP scheme was applied to the MIMO-FTN algorithm to maximize the improvement in transmission rates, and the UEP-FTN transmission scheme applying the OFDM scheme in multi-path channels was proposed. The performance of the proposed UEP-based FTN transmission scheme was analyzed through simulation, which showed that the application of the UEP scheme led to the improved performance. Based on this study, a turbo equalization model to achieve the performance improvement and high transmission efficiency was proposed. In addition, not limiting its usage only in the surface wireless communication but expanding its scope to underwater acoustic communication, the way to apply the model to underwater acoustic communication was investigated. Based on the decoded data and the turbo equalization-based UEP-FTN model that improved the transmission efficiency and performance in underwater acoustic communication, a method to calibrate the frequency and phase of the following packet was proposed. Its efficiency was verified through the actual underwater experiment at Gyeongcheon Lake in Mungyeong-si, Geyongsangbuk-do. The results of the experiment showed that the proposed method worked efficiently.์ œ 1 ์žฅ ์„œ๋ก  1 ์ œ 2 ์žฅ ์ง๋ ฌ ์—ฐ์ ‘๋œ ๋ฐ˜๋ณต ๋ถ€ํ˜ธํ™” ๊ฒฐํ•ฉ ๋œ ํ„ฐ๋ณด ๋“ฑํ™” ๋ชจ๋ธ 5 2.1 ํ„ฐ๋ณด ๋“ฑํ™” ๋ชจ๋ธ 5 2.2 ํ„ฐ๋ณด ๋“ฑํ™” ๋ชจ๋ธ๊ณผ ๊ฒฐํ•ฉ๋œ ๋ฐ˜๋ณต ๋ถ€ํ˜ธํ™” ๊ธฐ๋ฒ• 11 2.2.1 BCJR 13 2.2.2 ํ„ฐ๋ณด ๋ถ€ํ˜ธ 16 2.2.3 LDPC ๋ถ€ํ˜ธ 22 2.2.3.1 DVB-S2 ๊ธฐ๋ฐ˜ LDPC ๋ถ€ํ˜ธ(Long size) 23 2.2.3.2 IEEE 802.11n ๊ธฐ๋ฐ˜ LDPC ๋ถ€ํ˜ธ(Short size) 29 2.2.4 ๊ณ ์† ๋ฌด์„  ํ†ต์‹ ์„ ์œ„ํ•œ ์ตœ์  ๋ถ€ํ˜ธํ™” ๊ธฐ๋ฒ• 34 ์ œ 3 ์žฅ ๊ณ ์ „์†ก ํšจ์œจ ์•Œ๊ณ ๋ฆฌ์ฆ˜ 37 3.1 ๊ธฐ์กด ๊ณ ์ „์†ก ํšจ์œจ ์•Œ๊ณ ๋ฆฌ์ฆ˜ 38 3.1.1 Punctured ์•Œ๊ณ ๋ฆฌ์ฆ˜ 38 3.1.2 FTN ์•Œ๊ณ ๋ฆฌ์ฆ˜ 41 3.1.3 MIMO ์•Œ๊ณ ๋ฆฌ์ฆ˜ 48 3.1.3.1 ์‹œ๊ณต๊ฐ„ ๋ถ€ํ˜ธํ™” ๊ธฐ๋ฐ˜ MIMO ์•Œ๊ณ ๋ฆฌ์ฆ˜ 50 3.1.3.2 ZF ๊ธฐ๋ฐ˜ MIMO ์•Œ๊ณ ๋ฆฌ์ฆ˜ 54 3.1.4 ๊ธฐ์กด ๊ณ ์ „์†ก ํšจ์œจ ์•Œ๊ณ ๋ฆฌ์ฆ˜ ์ „์†ก๋ฅ  ๋ถ„์„ 56 3.2 FTN๊ณผ ๊ฒฐํ•ฉํ•œ ๊ณ ์ „์†ก ํšจ์œจ ์•Œ๊ณ ๋ฆฌ์ฆ˜ ๋ฐ ํ„ฐ๋ณด ๋“ฑํ™” ๋ชจ๋ธ ์ œ์•ˆ 58 3.2.1 FTN ์‹ ํ˜ธ์— ๋Œ€ํ•œ ํ„ฐ๋ณด ๋“ฑํ™” ๋ชจ๋ธ 58 3.2.2 P-FTN ํ„ฐ๋ณด ๋“ฑํ™” ๋ชจ๋ธ 59 3.2.3 MIMO-FTN ํ„ฐ๋ณด ๋“ฑํ™” ๋ชจ๋ธ 62 3.2.3.1 W-ZF๋ฅผ ์ด์šฉํ•œ ์ฑ„๋„ ๋ถ„๋ฆฌ ์•Œ๊ณ ๋ฆฌ์ฆ˜ 63 3.3 FTN๊ณผ ๊ฒฐํ•ฉํ•œ ๊ณ ์ „์†ก ํšจ์œจ ์•Œ๊ณ ๋ฆฌ์ฆ˜ ์„ฑ๋Šฅ ๋ถ„์„ 66 ์ œ 4 ์žฅ ๋น„๊ท ์ผ ์˜ค๋ฅ˜ ํ™•๋ฅ  ๊ธฐ๋ฐ˜ FTN ์‹ ํ˜ธ์˜ ํ„ฐ๋ณด ๋“ฑํ™” ๋ชจ๋ธ ์ œ์•ˆ 71 4.1 ๋น„๊ท ์ผ ์˜ค๋ฅ˜ ํ™•๋ฅ  ๊ธฐ๋ฐ˜ FTN ์‹ ํ˜ธ์˜ ํ„ฐ๋ณด ๋“ฑํ™” ๋ชจ๋ธ 71 4.1.1 ๋น„๊ท ์ผ ์˜ค๋ฅ˜ ํ™•๋ฅ  ๊ธฐ๋ฐ˜ ์šฐ์„  ์ˆœ์œ„ ์„ค์ • ๋ฐฉ๋ฒ• 74 4.1.2 ์šฐ์„  ์ˆœ์œ„์— ๋”ฐ๋ฅธ ๋ถ€ํ˜ธ์–ด ๋ฐฐ์น˜ ๋ฐฉ๋ฒ• 77 4.2 UEP ๊ธฐ๋ฒ•์ด ์ ์šฉ๋œ MIMO-FTN ํ„ฐ๋ณด ๋“ฑํ™” ๋ชจ๋ธ 79 4.3 OFDM ๊ธฐ๋ฒ•์ด ์ ์šฉ๋œ UEP-FTN ํ„ฐ๋ณด ๋“ฑํ™” ๋ชจ๋ธ 80 4.4 ๋น„๊ท ์ผ ์˜ค๋ฅ˜ ํ™•๋ฅ  ๊ธฐ๋ฐ˜ FTN ์‹ ํ˜ธ์˜ ์„ฑ๋Šฅ ๋ถ„์„ 85 4.4.1 UEP-FTN ์‹ ํ˜ธ์˜ ์„ฑ๋Šฅ ๋ถ„์„ 85 4.4.2 UEP ๊ธฐ๋ฒ•์ด ์ ์šฉ๋œ MIMO-FTN ์‹ ํ˜ธ์˜ ์„ฑ๋Šฅ ๋ถ„์„ 90 4.4.3 OFDM ๊ธฐ๋ฒ•์ด ์ ์šฉ๋œ UEP-FTN ์‹ ํ˜ธ์˜ ์„ฑ๋Šฅ ๋ถ„์„ 93 ์ œ 5 ์žฅ ์ˆ˜์ค‘ ๋ฌด์„  ํ†ต์‹ ์—์„œ์˜ ์‘์šฉ 96 5.1 UEP-FTN ๋ฐฉ์‹์˜ ์ˆ˜์ค‘ ํ†ต์‹  ์ ์šฉ 96 5.2 ๋ณตํ˜ธ๋œ ๋ฐ์ดํ„ฐ๋ฅผ ์ด์šฉํ•œ ์—ฐ์†์ ์ธ ์ฃผํŒŒ์ˆ˜ ๋ณด์ • ๋ฐฉ์‹ 98 5.3 ์‹คํ—˜ ํ™˜๊ฒฝ 100 5.4 ์‹คํ—˜ ๊ฒฐ๊ณผ 105 5.4.1 UEP-FTN ์‹ ํ˜ธ์˜ ์‹คํ—˜ ๊ฒฐ๊ณผ 105 5.4.2 ๋ณตํ˜ธ๋œ ๋ฐ์ดํ„ฐ๋ฅผ ์ด์šฉํ•œ ์ฃผํŒŒ์ˆ˜ ๋ณด์ • ๋ฐฉ์‹ ์‹คํ—˜ ๊ฒฐ๊ณผ 107 ์ œ 6 ์žฅ ๊ฒฐ ๋ก  110 ์ฐธ๊ณ ๋ฌธํ—Œ 113Docto
    corecore