Relevant bibliographies by topics / EXIT chart

Academic literature on the topic 'EXIT chart'

Author: Grafiati
Published: 4 June 2021
Last updated: 31 January 2023

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 'EXIT chart.'

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 "EXIT chart"

1

Kai Li and Xiaodong Wang. "EXIT chart analysis of turbo multiuser detection." IEEE Transactions on Wireless Communications 4, no. 1 (January 2005): 300–311. http://dx.doi.org/10.1109/twc.2004.840260.

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

Pham, Anh Quang, Lie Liang Yang, Noor Samsiah Othman, and Lajos Hanzo. "EXIT-Chart Optimized Block Codes for Wireless Video Telephony." IEEE Transactions on Circuits and Systems for Video Technology 18, no. 12 (December 2008): 1671–80. http://dx.doi.org/10.1109/tcsvt.2008.2004937.

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

Gong, Feng-kui, Jian-hua Ge, and Bing-bing Li. "New applications of EXIT chart for iterative decoding systems." Journal of Shanghai Jiaotong University (Science) 13, no. 1 (February 2008): 35–39. http://dx.doi.org/10.1007/s12204-008-0035-6.

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

Babar, Zunaira, Soon Xin Ng, and Lajos Hanzo. "EXIT-Chart-Aided Near-Capacity Quantum Turbo Code Design." IEEE Transactions on Vehicular Technology 64, no. 3 (March 2015): 866–75. http://dx.doi.org/10.1109/tvt.2014.2328638.

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

Babich, F., A. Crismani, and R. G. Maunder. "EXIT chart aided design of periodically punctured turbo codes." Electronics Letters 46, no. 14 (2010): 1001. http://dx.doi.org/10.1049/el.2010.1018.

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

Lokshina, Izabella. "Application of Extrinsic Information Transfer Charts to Anticipate Turbo Code Behavior." International Journal of Interdisciplinary Telecommunications and Networking 3, no. 2 (April 2011): 31–37. http://dx.doi.org/10.4018/jitn.2011040102.

Full text
Abstract:
This paper examines turbo codes that are currently introduced in many international standards, including the UMTS standard for third generation personal communications and the ETSI DVB-T standard for Terrestrial Digital Video Broadcasting. The convergence properties of the iterative decoding process associated with a given turbo-coding scheme are estimated using the analysis technique based on so-called extrinsic information transfer (EXIT) chart. This approach provides a possibility to anticipate the bit error rate (BER) of a turbo code system using only the EXIT chart. It is shown that EXIT charts are powerful tools to analyze and optimize the convergence behavior of iterative systems utilizing the turbo principle. The idea is to consider the associated SISO stages as information processors that map input a priori LLR’s onto output extrinsic LLR’s, the information content being obviously assumed to increase from input to output, and introduce them to the design of turbo systems without the reliance on extensive simulation. Compared with the other methods for generating EXIT functions, the suggested approach provides insight into the iterative behavior of linear turbo systems with substantial reduction in numerical complexity.
APA, Harvard, Vancouver, ISO, and other styles
7

Deka, Kuntal, A. Rajesh, and Prabin Kumar Bora. "EXIT Chart Analysis of Puncturing for Non-Binary LDPC Codes." IEEE Communications Letters 18, no. 12 (December 2014): 2089–92. http://dx.doi.org/10.1109/lcomm.2014.2366119.

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

Kong, Lingjun, Yong Liang Guan, Jianping Zheng, Guojun Han, Kui Cai, and Kheong-Sann Chan. "EXIT-Chart-Based LDPC Code Design for 2D ISI Channels." IEEE Transactions on Magnetics 49, no. 6 (June 2013): 2823–26. http://dx.doi.org/10.1109/tmag.2013.2248351.

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

Liberatori, M. C., D. M. Petruzzi, J. Castiñeira Moreira, and J. C. Bonadero. "EXIT chart analysis of nonlinear turbo coding over GF(4)." IET Communications 2, no. 5 (2008): 630. http://dx.doi.org/10.1049/iet-com:20070178.

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

Mehrnoush, Morteza, Benjamin J. Belzer, Krishnamoorthy Sivakumar, and Roger Wood. "EXIT Chart-Based IRA Code Design for TDMR Turbo-Equalization System." IEEE Transactions on Communications 65, no. 4 (April 2017): 1762–74. http://dx.doi.org/10.1109/tcomm.2017.2662003.

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

Dissertations / Theses on the topic "EXIT chart"

1

Riaz, 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 text
Abstract:
Turbo codes have achieved near Shannon limit performance in data communication over noisy channels. Recently introduced EXtrinsic Information Transfer (EXIT) Charts [15] have become an essential part of turbo code design and have also been used as a complementary design tool for the traditional bit error rate simulations. Additionally, compressive turbo codes have been shown to achieve near-entropy performance in different source coding problems [1], [46], [74]. The main objective of this thesis is an extension of EXIT charts from turbo channel codes to turbo source codes, as well as extension of this technique to analog and finite precision iterative decoders. After the initial review of relevant literature and research results, the EXIT charts technique is extended to performance analysis of compressive turbo codes. As opposed to previous attempts at such an extension in [24] and [32], the extension derived in this thesis gives reliable results that closely match actual simulated performance of compressive turbo codes. Furthermore, a lower bound is obtained in order to illustrate the connection and differences between the compressive EXIT chart technique in this thesis and the one previously proposed in [32]. Finally, the EXIT chart technique is extended to performance analysis of analog iterative decoders and digitally implemented turbo decoding algorithms based on finite precision arithmetics. Various numerical results have been obtained to illustrate the successful application of the derived EXIT chart technique. Firstly, the derived EXIT chart performance analysis is used for several single source compression schemes based on both parallel and serial concatenated encoders. Consequently, the EXIT chart technique developed in this thesis is further applied to distributed turbo source coding schemes for the Slepian-Wolf and Wyner-Ziv problems. Finally, the designed EXIT charts are used to analyze the
Les 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
APA, Harvard, Vancouver, ISO, and other styles
2

Hsu, Teh-Hsuan. "Robust concatenated codes for the slow Rayleigh fading channel." [College Station, Tex. : Texas A&M University, 2008. http://hdl.handle.net/1969.1/ETD-TAMU-2723.

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

Karjalainen, J. (Juha). "Broadband single carrier multi-antenna communications with frequency domain turbo equalization." Doctoral thesis, Oulun yliopisto, 2011. http://urn.fi/urn:isbn:9789514295027.

Full text
Abstract:
Abstract This thesis focuses on advanced multi-antenna receiver and transmission techniques to improve the utilization efficiencies of radio resources in broadband single carrier communications. Special focus is devoted to the development of computationally efficient frequency domain (FD) turbo equalization techniques for single and multiuser MIMO frequency selective channels. Another special emphasis is given to transmission power optimization for single user MIMO communications, which takes into account the convergence properties of the iterative equalizer. A new iterative FD soft cancellation (SC) and minimum mean square error (MMSE) filtering based joint-over-antenna (JA) multiuser MIMO signal detection technique for multiuser MIMO uplink transmission in frequency-selective channels is proposed. The proposed FD multiuser MIMO detection technique requires significantly lower computational complexity than its time-domain counterpart. Furthermore, significant performance gains can be achieved with the proposed JA turbo receiver compared to an antenna-by-antenna (AA) turbo receiver when the total number of transmitter antennas and users is larger than the number of receiver antennas, as well as in the presence of spatial correlation. The impact of existing linear precoding techniques, e.g, maximum information rate (MaxRate) and minimum sum mean square error (MinSumMSE), on the performance of frequency domain turbo equalization is investigated by utilizing extrinsic information transfer (EXIT) chart analysis. A novel transmission power minimization framework based on an EXIT analysis of single carrier MIMO transmission with iterative FD SC-MMSE equalization is then proposed. The proposed optimization framework explicitly takes into account the convergence properties of the iterative equalizer. The proposed convergence constrained power allocation (CCPA) technique decouples the spatial interference between streams using singular value decomposition (SVD), and minimizes the transmission power while achieving the mutual information target for each stream after iterations at the receiver side. The transmission power allocation can be formulated as a convex optimization problem. A special case having only two mutual information constraints is considered, for which the Lagrange dual function is derived and its dual problem is solved. Inspired by the Lagrange duality, two CCPA based heuristic schemes are developed. The numerical results demonstrate that the proposed CCPA schemes outperform the existing power allocation schemes
Tiivistelmä Tässä työssä tutkitaan edistyksellisten moniantennivastaanotto- ja lähetysmenetelmien käyttöä radioresurssien tehokkuuden parantamiseen laajakaistaisessa yhden kantoaallon kommunikaatiossa. Työssä keskitytään erityisesti laskennallisesti tehokkaiden taajuustasossa suoritettavien iteratiivisten kanavakorjaintekniikoiden kehittämiseen yhden ja usean käyttäjän multiple-input multiple-output (MIMO) -kommunikaatiossa taajuusselektiivisen radiokanavan yli. Toinen tutkimuksen painopiste on lähetystehon optimointi yhden käyttäjän MIMO-kommunikaatiossa, jossa iteratiivisen kanavakorjaimen konvergenssiominaisuudet otetaan huomioon. Työssä ehdotetaan uudenlaista iteratiivista taajuustasossa suoritettavaa soft-cancellation (SC) ja minimum mean square error (MMSE) -suodatukseen pohjautuvaa joint-over-antenna (JA) monen käyttäjän ilmaisumenetelmää nousevan siirtokanavan tiedonsiirtoon taajuusselektiivisessa radiokanavassa. Ehdotettu tajuustasossa suoritettava usean käyttäjän MIMO-lähetyksen ilmaisumenetelmä vaatii selvästi vähemmän laskentatehoa verrattuna aikatason menetelmään. Tämän lisäksi ehdotetulla menetelmällä voidaan saavuttaa merkittävää suorituskykyhyötyä verrattuna antenna-by-antenna (AA) -pohjaiseen iteratiiviseen vastaanottimeen kun lähetysantennien ja käyttäjien kokonaislukumäärä on suurempi kuin vastaanotinantennien. Suorituskykyhyöty pätee myös tilakorrelaation tapauksessa. Työssä tutkitaan lisäksi olemassa olevien lineaaristen esikoodaustekniikoiden, esim. maximum information rate (MaxRate) and minimum sum mean square error (MinSumMSE), vaikutusta taajuustasossa suoritettavaan iteratiivisen kanavakorjaimen konvergenssiominaisuuksiin xtrinsic information transfer (EXIT) -analyysin avulla. Työssä ehdotetaan uudenlaista EXIT-analyysi-pohjaista lähetystehon minimointimenetelmää yhden kantoaallon MIMO-lähetykseen käyttäen iteratiivista taajuustason SC-MMSE-kanavakorjainta. Menetelmä ottaa huomioon iteratiivisen kanavakorjaimen konvergenssiominaisuudet. Ehdotettu convergence constrained power allocation (CCPA) -menetelmä erottaa tilatason häiriön lähetteiden välillä hyödyntäen singular value decomposition (SVD) -tekniikkaa ja minimoi lähetystehon ja saavuttaa samalla keskinäisinformaatiotavoitteet jokaiselle lähetteelle iteraatioiden jälkeen vastaanottimessa. Lähetystehon minimointiongelma voidaan muotoilla konveksiksi optimointiongelmaksi. Kahden keskinäisinformaatiorajoitteen erityistapaukselle johdetaan Lagrangen duaalifunktio ja ratkaistaan sen duaalifunktio. Työssä kehitetään lisäksi kaksi CCPA-pohjaista heuristista menetelmää. Numeeriset tulokset osoittavat ehdotettujen CCPA-pohjaisten menetelmien suoriutuvan paremmin verrattuna olemassa oleviin menetelmiin
APA, Harvard, Vancouver, ISO, and other styles
4

Shepherd, David Peter, and RSISE [sic]. "Optimisation of Iterative Multi-user Receivers using Analytical Tools." The Australian National University. Research School of Information Sciences and Engineering, 2008. http://thesis.anu.edu.au./public/adt-ANU20081114.221408.

Full text
Abstract:
The objective of this thesis is to develop tools for the analysis and optimization of an iterative receiver. These tools can be applied to most soft-in soft-out (SISO) receiver components. For illustration purposes we consider a multi-user DS-CDMA system with forward error correction that employs iterative multi-user detection based on soft interference cancellation and single user decoding. Optimized power levels combined with adaptive scheduling allows for efficient utilization of receiver resources for heavily loaded systems.¶ Metric transfer analysis has been shown to be an accurate method of predicting the convergence behavior of iterative receivers. EXtrinsic Information (EXIT), fidelity (FT) and variance (VT) transfer analysis are well-known methods, however the relationship between the different approaches has not been explored in detail. We compare the metrics numerically and analytically and derive functions to closely approximate the relationship between them. The result allows for easy translation between EXIT, FT and VT methods. Furthermore, we extend the $J$ function, which describes mutual information as a function of variance, to fidelity and symbol error variance, the Rayleigh fading channel model and a channel estimate. These $J$ functions allow the \textit{a priori} inputs to the channel estimator, interference canceller and decoder to be accurately modeled. We also derive the effective EXIT charts which can be used for the convergence analysis and performance predictions of unequal power CDMA systems.¶ The optimization of the coded DS-CDMA system is done in two parts; firstly the received power levels are optimized to minimize the power used in the terminal transmitters, then the decoder activation schedule is optimized such that the multi-user receiver complexity is minimized. The uplink received power levels are optimized for the system load using a constrained nonlinear optimization approach. EXIT charts are used to optimize the power allocation in a multi-user turbo-coded DS-CDMA system. We show through simulation that the optimized power levels allow for successful decoding of heavily loaded systems with a large reduction in the convergence SNR.¶ We utilize EXIT chart analysis and a Viterbi search algorithm to derive the optimal decoding schedule for a multi component receiver/decoder. We show through simulations that decoding delay and complexity can be significantly reduced while maintaining BER performance through optimization of the decoding schedule.
APA, Harvard, Vancouver, ISO, and other styles
5

Benaddi, Tarik. "Sparse graph-based coding schemes for continuous phase modulations." Phd thesis, Toulouse, INPT, 2015. http://oatao.univ-toulouse.fr/16037/1/Benaddi_Tarik.pdf.

Full text
Abstract:
The use of the continuous phase modulation (CPM) is interesting when the channel represents a strong non-linearity and in the case of limited spectral support; particularly for the uplink, where the satellite holds an amplifier per carrier, and for downlinks where the terminal equipment works very close to the saturation region. Numerous studies have been conducted on this issue but the proposed solutions use iterative CPM demodulation/decoding concatenated with convolutional or block error correcting codes. The use of LDPC codes has not yet been introduced. Particularly, no works, to our knowledge, have been done on the optimization of sparse graph-based codes adapted for the context described here. In this study, we propose to perform the asymptotic analysis and the design of turbo-CPM systems based on the optimization of sparse graph-based codes. Moreover, an analysis on the corresponding receiver will be done.
APA, Harvard, Vancouver, ISO, and other styles
6

Ylioinas, J. (Jari). "Iterative detection, decoding, and channel estimation in MIMO-OFDM." Doctoral thesis, University of Oulu, 2010. http://urn.fi/urn:isbn:9789514262203.

Full text
Abstract:
Abstract Iterative receiver techniques, multiple-input – multiple-output (MIMO) processing, and orthogonal frequency division multiplexing (OFDM) are amongst the key physical layer technologies when aiming at higher spectral efficiency for a wireless communication system. Special focus is put on iterative detection, decoding, and channel estimation for a MIMO-OFDM system. After designing separately efficient algorithms for the detection, channel decoding, and channel estimation, the objective is to optimize them to work together through optimizing the activation schedules for soft-in soft-out (SfISfO) components. A list parallel interference cancellation (PIC) detector is derived to approximate an a posteriori probability (APP) algorithm with reduced complexity and minimal loss of performance. It is shown that the list PIC detector with good initialization outperforms the K-best list sphere detector (LSD) in the case of small list sizes, whereas the complexities of the algorithms are of the same order. The convergence of the iterative detection and decoding is improved by using a priori information to also recalculate the candidate list, aside from the log-likelihood ratios (LLRs) of the coded bits. Unlike in pilot based channel estimation, the least-squares (LS) channel estimator based on symbol decisions requires a matrix inversion in MIMO-OFDM. The frequency domain (FD) space-alternating generalized expectation-maximization (SAGE) channel estimator calculates the LS estimate iteratively, avoiding the matrix inversion with constant envelope modulation. The performance and computational complexity of the FD-SAGE channel estimator are compared to those of pilot based LS channel estimation with minimum mean square error (MMSE) post-processing exploiting the time correlation of the channel. A time domain (TD) SAGE channel estimator is derived to avoid the matrix inversion in channel estimation based on symbol decisions for MIMO-OFDM systems also with non-constant envelope modulation. An obvious problem, with more than two blocks in an iterative receiver, is to find the optimal activation schedule of the different blocks. It is proposed to use extrinsic information transfer (EXIT) charts to characterize the behavior of the receiver blocks and to find out the optimal activation schedule for them. A semi-analytical expression of the EXIT function is derived for the LS channel estimator. An algorithm is proposed to generate the EXIT function of the APP algorithm as a function of the channel estimate’s mutual information (MI). Surface fitting is used to get closed form expressions for the EXIT functions of the APP algorithm and the channel decoder. Trellis search algorithms are shown to find the convergence with the lowest possible complexity using the EXIT functions. With the proposed concept, the activation scheduling can be adapted to prevailing channel circumstances and unnecessary iterations will be avoided.
APA, Harvard, Vancouver, ISO, and other styles
7

Tervo, V. (Valtteri). "Joint multiuser power allocation and iterative multi-antenna receiver design." Doctoral thesis, Oulun yliopisto, 2015. http://urn.fi/urn:isbn:9789526207292.

Full text
Abstract:
Abstract This thesis concentrates on joint optimization of transmit power allocation and receive filtering in multiuser, multi-antenna communications. Due to the increasing number of wireless devices, the design of energy-efficient communication links is becoming increasingly important. In cellular mobile communications, reducing the average power consumption in uplink transmission is beneficial for users in order to extend battery life and, hence, energy efficiency in general. However, the power consumption of the high power amplifier (HPA) at the transmitter depends on the peak power of the transmission. This thesis focuses on power allocation problems for single-carrier (SC) frequency division multiple access (FDMA) and orthogonal FDMA (OFDMA) transmission assuming iterative reception. The goal in the first scheme presented in this thesis is to reduce the average power consumption by designing a power allocation method that takes into account the convergence properties of an iterative receiver in multiuser uplink communications. The proposed scheme can guarantee that the desired quality of service (QoS) is achieved after a sufficient number of iterations. Reducing the peak-to-average power ratio (PAPR) in any transmission system is beneficial because it allows the use of inexpensive, energy-efficient power amplifiers. The goal in the second scheme presented in this thesis is to control the PAPR of the transmitted signal. Hence, in addition to the QoS constraint, the instantaneous PAPR constraint is derived for SC-FDMA and OFDMA transmission. Moreover, a statistical approach is considered in which the power variance of the transmitted waveform is controlled. The QoS and PAPR constraints are considered jointly and, therefore, the proposed power allocation strategy jointly takes into account the channel quality and the PAPR characteristics of the power amplifier. However, the PAPR constraint can be adopted to any SC-FDMA or OFDMA framework and it is not restricted to the scheme presented in this thesis. The objective of the optimization problems considered throughout the thesis is to minimize the sum power. The majority of the derived constraints are non-convex and therefore, two alternative successive convex approximations (SCAs) are derived for all the non-convex constraints considered. The numerical results show that the proposed power allocation strategies can significantly reduce the average transmission power of users while allowing flexible PAPR control. Hence, the proposed methods can be used to extend battery life for users and especially improve the QoS at the cell edges
Tiivistelmä Väitöskirjassa tutkitaan lähettimessä tapahtuvan tehoallokoinnin sekä vastaanottimessa tapahtuvan signaalin suodatuksen yhteisoptimointia monikäyttöön suunnatussa langattomassa moniantennikommunikaatiossa. Langattomien laitteiden lukumäärän kasvaessa energiatehokkuuden merkitys tiedonsiirtolinkkien suunnittelussa korostuu. Soluihin perustuvassa langattomassa tietoliikenteessä keskimääräisen tehonkulutuksen pienentäminen ylälinkkilähetyksessä (käyttäjältä tukiasemaan) on tärkeää käyttäjän kannalta, sillä se pidentää laitteen akun kestoa. Lähettimen tehovahvistimen (high power amplifier (HPA)) tehonkulutus on kuitenkin verrannollinen lähetyksen huipputehoon. Väitöskirjassa luodaaan uusia menetelmiä sekä vertaillaan tehoallokointia yhden kantoaallon taajuustason monikäyttöön (single carrier frequency division multiple access (SC-FDMA)) ja ortogonaalisen taajuustason monikäyttöön (orthogonal FDMA (OFDMA)) perustuvissa lähetysteknologioissa. Työn ensimmäisessä osiossa tavoitteena on keskimääräisen tehonkulutuksen pienentäminen monen käyttäjän ylälinkkikommunikaatiossa suunnittelemalla tehoallokointimenetelmä, joka ottaa huomioon iteratiivisen vastaanottimen konvergenssiominaisuudet. Työssä ehdotettu menetelmä takaa vastaanotetun informaation halutun laadun (quality of service (QoS)) riittävän monen vastaanottimessa tehdyn iteraation jälkeen. Huipputehon ja keskitehon suhteen (peak to average power ratio (PAPR)) pienentäminen missä tahansa lähetyksessä on hyödyllistä, sillä sen ansiosta voidaan käyttää energiatehokkaampia ja halvempia tehovahvistimia. Työn jälkimmäisessä osiossa tavoitteena on kontrolloida lähetetyn signaalin huipputehon ja keskitehon suhdetta. Työn ensimmäisessä osiossa esitetyn QoS-rajoitteen lisäksi tehoallokointia rajoitetaan symbolisekvenssikohtaisella PAPR-rajoitteella SCFDMA- ja OFDMA-lähetyksessä. Lisäksi esitetään tilastollinen menetelmä, jossa rajoitetaan lähetetyn signaalin tehon varianssia. Kun käytetään yhtäaikaisesti QoS- ja PAPR-rajoitteita, voidaan tiedonsiirtokanavaan suunnitella optimaalinen tehoallokointi ottaen huomioon tehovahvistimen epälineaarisuudet. Työssä esitetty PAPR-rajoite on kuitenkin geneerinen, ja se voidaan sovittaa mihin tahansa SCFDMA- tai OFDMA- optimointikehykseen. Työssä esitettävien optimointiongelmien tavoitteena on käyttäjien summatehon minimointi. Suurin osa työssä esiintyvistä ongelmista on ei-konvekseja, joten siinä esitetään kaksi vaihtoehtoista peräkkäinen konveksi approksimaatio (successive convex approximation (SCA)) -menetelmää kaikille ei-konvekseille rajoitteille. Numeeriset tulokset osoittavat, että esitetyt tehoallokointimenetelmät pienentävät merkittävästi keskimääräistä tehonkulutusta mahdollistaen lisäksi adaptiivisen PAPR-kontrolloinnin. Väitöskirjassa esitettyjen menetelmien avulla voidaan pidentää mobiilikäyttäjien akun kestoa sekä erityisesti parantaa solun reunakäyttäjien palvelun laatua
APA, Harvard, Vancouver, ISO, and other styles
8

Gilra, Deepak. "A class of non-binary LDPC codes." Texas A&M University, 2003. http://hdl.handle.net/1969/67.

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

Huusko, J. (Jarkko). "Communication performance prediction and link adaptation based on a statistical radio channel model." Doctoral thesis, Oulun yliopisto, 2016. http://urn.fi/urn:isbn:9789526211473.

Full text
Abstract:
Abstract This thesis seeks to develop a robust semi-analytical performance prediction method for an advanced iterative receiver that processes spatially multiplexed signals that have propagated through frequency-selective receive correlated multiple-input multiple-output (MIMO) wireless communication channels. In a change of perspective, the proposed performance prediction methods are applied at the transmitter, which seeks to attain a target frame error rate (FER) either by adaptive power control or by adaptive modulation and coding (AMC). The performance prediction scheme utilises the statistical properties of the channel—namely noise variance, number of separable propagation paths and the eigenvalues of the receive correlation matrix—to predict the signal-to-interference-plus-noise ratio (SINR) at the output of a frequency domain soft interference cancellation minimum mean square error equaliser. The SINR distribution is used to derive the distribution of the variance of the log-likelihood ratios (LLRs) at the output of a soft symbol-to-bit demapper. Mutual information transfer charts establish a bijective relationship between the variance of the LLRs and mutual information. A 3rd Generation Partnership Project compliant turbo code is assumed. Since the decoder operates independently from the channel, its extrinsic information transfer (EXIT) charts can be simulated in advance. By utilising the approximate LLR variance distribution of the demapped equaliser output, it is possible to evaluate the probability of an intersection between an equaliser chart associated with a random channel realisation and a fixed decoder chart. This probability provides the FER. Since the proposed performance prediction method does not require any instantaneous channel state information, it can be applied at the transmitter side as a robust link adaptation scheme. In adaptive transmission power control, the modulation order and code rate are fixed. By iteratively adjusting transmission power, the transmitter attempts to find an equaliser output LLR variance distribution that reaches a specified target FER. In AMC, transmission power is fixed. The equaliser output's LLR variance distribution is determined by the modulation order, while the decoder chart's position is determined by the code rate. The transmitter iteratively adjusts the code rate and attempts to find a modulation order and code rate pairing that reaches the target FER. For vertically encoded spatially multiplexed systems, the adaptive transmission power control and AMC schemes are complemented by adaptive repeat redundancy and incremental redundancy hybrid automatic repeat request (HARQ) techniques, respectively
Tiivistelmä Työn tavoitteena on kehittää luotettava semianalyyttinen suorituskyvyn ennustusmenetelmä tehokkaalle iteratiiviselle vastaanottimelle, joka käsittelee taajuusselektiivisen, vastaanotinpäässä tilakorreloituneen moniantennikanavan kautta kulkeneita tilakanavoituja signaaleja. Toisessa vaiheessa esitettyjä ennustusmenetelmiä hyödynnetään mukauttamalla lähetystehoa tai modulaatioastetta ja koodisuhdetta (adaptive modulation and coding [AMC]), samalla säilyttäen tavoitteeksi asetetun kehysvirhesuhteen (frame error rate [FER]). Suorituskyvyn ennustusmenetelmä hyödyntää kanavan tilastollisia ominaisuuksia – kohinan varianssia, eroteltavien etenemispolkujen lukumäärää sekä vastaanottimen korrelaatiomatriisin ominaisarvoja – ennustaakseen signaali–kohina-plus-interferenssisuhteen (signal-to-interference-plus-noise ratio [SINR]) jakauman taajuustasossa toimivan, häiriötä poistavan pienimmän keskineliösumman kanavakorjaimen lähdössä. SINR-jakaumasta johdetaan pehmän symboleista biteiksi -muunnoksen jälkeisten logaritmisten bittitodennäköisyyksien suhdelukujen (log-likelihood ratio [LLR]) jakauma. Keskinäisinformaation siirroskartat perustuvat LLR:ien varianssin sekä keskinäisinformaation väliseen bijektiivisyyteen. Informaatio on kanavakoodattu 3rd Generation Partnership Project -standardin mukaisella turbokoodilla. Turbodekooderin toiminta on kanavasta riippumatonta, joten dekooderin lisäinformaation siirroskartat (extrinsic information transfer [EXIT] charts) voidaan simuloida itsenäisesti. Hyödyntämällä kanavakorjaimen lähdön pehmeiden bittipäätösten LLR:ien varianssin jakaumaa, on mahdollista arvioida millä todennäköisyydellä korjaimen satunnaisen kanavarealisaation siirroskartta leikkaa dekooderin siirroskartan. Tämä todennäköisyys voidaan tulkita kehysvirhesuhteeksi. Koska suorituskyvyn ennustusmenetelmä ei vaadi hetkellistä tietoa kanavan tilasta, sitä voidaan hyödyntää lähetyksen mukautuksessa. Mukautuvassa tehonsäädössä modulaatio ja koodisuhde eivät muutu. Lähetin pyrkii iteratiivisella tehonsäädöllä löytämään korjaimen lähdölle LLR-jakauman, joka tuottaa halutun kehysvirhesuhteen. Mukautuvassa modulaation ja koodisuhteen valinnassa lähetysteho säilyy vakiona. Modulaatioaste vaikuttaa korjaimen lähdön LLR-jakaumaan ja koodisuhde dekooderin siirroskartan muotoon. Iteratiivisesti koodisuhdetta säätämällä lähetin pyrkii löytämään modulaation ja koodisuhteen yhdistelmän, joka saavuttaa tavoitellun kehysvirhesuhteen. Vertikaalisesti tilakanavoiduissa järjestelmissä mukautuvaa tehonsäätöä täydennetään lähetystehoa mukauttavilla uudellenlähetyksillä, kun taas mukautuvaa modulaation ja koodisuhteen valintaa täydennetään puolestaan koodisuhdetta pienentävillä automattisilla uudelleenlähetyspyynnöillä (hybrid automatic repeat request [HARQ])
APA, Harvard, Vancouver, ISO, and other styles
10

Mothi, Venkatesan Sabaresan. "Exit charts based analysis and design of rateless codes for the erasure and Gaussian channels." [College Station, Tex. : Texas A&M University, 2007. http://hdl.handle.net/1969.1/ETD-TAMU-1924.

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

Books on the topic "EXIT chart"

1

1952-, Hanzo Lajos, ed. Near-capacity variable length coding: Regular and exit-chart aided irregular designs. Chichester, West Sussex, U.K: Wiley, 2010.

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

Turbo coding, turbo equalisation, and space-time coding: Exit-chart aided near-capacity designs for wireless channels. 2nd ed. Chichester, West Sussex, U.K: Wiley, 2011.

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

Wang, Jin, Lie-Liang Yang, Lajos Hanzo, and Robert G. Maunder. Near-Capacity Variable-Length Coding: Regular and EXIT-Chart-Aided Irregular Designs. Wiley & Sons, Incorporated, John, 2010.

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

Wang, Jin, Lie-Liang Yang, Lajos Hanzo, and Robert G. Maunder. Near-Capacity Variable-Length Coding: Regular and EXIT-Chart-Aided Irregular Designs. Wiley & Sons, Incorporated, John, 2011.

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

Wang, Jin, Lie-Liang Yang, Lajos Hanzo, and Robert G. Maunder. Near-Capacity Variable-Length Coding: Regular and EXIT-Chart-Aided Irregular Designs. Wiley & Sons, Incorporated, John, 2011.

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

Wang, Jin, Lie-Liang Yang, Robert G. Maunder, and Lajos L. Hanzo. Near-Capacity Variable-Length Coding: Regular and Exit-Chart-Aided Irregular Designs. Wiley & Sons, Limited, John, 2010.

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

Ng, Soon Xin, T. H. Liew, B. L. Yeap, Lajos Hanzo, and R. Y. S. Tee. Turbo Coding, Turbo Equalisation and Space-Time Coding: EXIT-Chart-Aided near-Capacity Designs for Wireless Channels. Wiley & Sons, Incorporated, John, 2011.

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

Ng, Soon Xin, T. H. Liew, B. L. Yeap, R. Y. S. Tee, and Lajos L. Hanzo. Turbo Coding, Turbo Equalisation and Space-Time Coding: Exit-Chart-Aided Near-Capacity Designs for Wireless Channels. Wiley & Sons, Limited, John, 2011.

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

Ng, Soon Xin, T. H. Liew, B. L. Yeap, Lajos Hanzo, and R. Y. S. Tee. Turbo Coding, Turbo Equalisation and Space-Time Coding: EXIT-Chart-Aided near-Capacity Designs for Wireless Channels. Wiley & Sons, Incorporated, John, 2011.

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

Ng, Soon Xin, T. H. Liew, B. L. Yeap, Lajos Hanzo, and R. Y. S. Tee. Turbo Coding, Turbo Equalisation and Space-Time Coding: EXIT-Chart-Aided near-Capacity Designs for Wireless Channels. Wiley & Sons, Incorporated, John, 2011.

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

Book chapters on the topic "EXIT chart"

1

Bruner, Robert, and J. Greenlees. "Ext charts." In Connective Real 𝐾-Theory of Finite Groups, 285–302. Providence, Rhode Island: American Mathematical Society, 2010. http://dx.doi.org/10.1090/surv/169/13.

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

Perolo, Andrea. "Simple Charts, Clear and Uncluttered." In Entries & Exits, 49–66. Hoboken, NJ, USA: John Wiley & Sons, Inc., 2015. http://dx.doi.org/10.1002/9781119201168.ch3.

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

"Entry and Exit = Right or Wrong?" In Trading and Investing in the Forex Market Using Chart Techniques, 161–77. Hoboken, NJ, USA: John Wiley & Sons, Inc., 2015. http://dx.doi.org/10.1002/9781119206552.ch5.

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

"Irregular Variable-Length Codes for EXIT-Chart Matching." In Near-Capacity Variable-Length Coding, 259–89. Chichester, UK: John Wiley & Sons, Ltd, 2010. http://dx.doi.org/10.1002/9780470666425.ch7.

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

Lokshina, Izabella. "Application of Extrinsic Information Transfer Charts to Anticipate Turbo Code Behavior." In Advancements and Innovations in Wireless Communications and Network Technologies, 97–104. IGI Global, 2013. http://dx.doi.org/10.4018/978-1-4666-2154-1.ch007.

Full text
Abstract:
This paper examines turbo codes that are currently introduced in many international standards, including the UMTS standard for third generation personal communications and the ETSI DVB-T standard for Terrestrial Digital Video Broadcasting. The convergence properties of the iterative decoding process associated with a given turbo-coding scheme are estimated using the analysis technique based on so-called extrinsic information transfer (EXIT) chart. This approach provides a possibility to anticipate the bit error rate (BER) of a turbo code system using only the EXIT chart. It is shown that EXIT charts are powerful tools to analyze and optimize the convergence behavior of iterative systems utilizing the turbo principle. The idea is to consider the associated SISO stages as information processors that map input a priori LLR’s onto output extrinsic LLR’s, the information content being obviously assumed to increase from input to output, and introduce them to the design of turbo systems without the reliance on extensive simulation. Compared with the other methods for generating EXIT functions, the suggested approach provides insight into the iterative behavior of linear turbo systems with substantial reduction in numerical complexity.
APA, Harvard, Vancouver, ISO, and other styles
6

Zhong, Hua. "Digital Communications and a Smart World." In Strategic Innovations and Interdisciplinary Perspectives in Telecommunications and Networking, 136–63. IGI Global, 2019. http://dx.doi.org/10.4018/978-1-5225-8188-8.ch007.

Full text
Abstract:
This chapter is devoted to digital communications in a smart world. The author examines turbo codes that are currently introduced in many international standards and implemented in numerous advanced communication systems, applied in a smart world, and evaluate the process of extrinsic information transfer (EXIT). The convergence properties of the iterative decoding process, associated with a given turbo-coding scheme, are estimated using the analysis technique based on so-called EXIT charts. This approach provides a possibility to predict the bit-error rate (BER) of a turbo code system with only the extrinsic information transfer chart. The idea is to consider the associated soft-input soft-output (SISO) stages as information processors, which map input a priori log likelihood ratios (LLRs) onto output extrinsic LLRs. Compared with other methods, the suggested approach provides insight into the iterative behavior of linear turbo systems with substantial reduction in numerical complexity.
APA, Harvard, Vancouver, ISO, and other styles
7

"Joint EXIT-Chart Matching of Irregular Variable-Length Coding and Irregular Unity-Rate Coding." In Near-Capacity Variable-Length Coding, 339–72. Chichester, UK: John Wiley & Sons, Ltd, 2010. http://dx.doi.org/10.1002/9780470666425.ch9.

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

Land, Ingmar. "Code Design with EXIT Charts." In Academic Press Library in Mobile and Wireless Communications, 261–97. Elsevier, 2014. http://dx.doi.org/10.1016/b978-0-12-396499-1.00005-4.

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

Srivastava, Prashant. "Hydrographic Surveys in Antarctica." In Geoscientific Investigations From the Indian Antarctic Program, 160–93. IGI Global, 2022. http://dx.doi.org/10.4018/978-1-6684-4078-0.ch008.

Full text
Abstract:
Hydrographic and physical oceanographic studies could enhance the national data bank. They could also greatly assist the various national agencies in correlating their work with the Antarctic waters' bathymetric and physical properties, leading to an improved understanding of the characteristics of the Antarctica waters. The bathymetric data gathered near the permanent station 'Maitri' could be utilised to exchange data with other nations like Russia and IHO. As per the charting scheme promulgated by the International Hydrographic Organization (IHO), INT Chart Nos. 9050 and 9051 are required to be co-produced by Russia and India. In the INT Chart 9050, vast blank areas exist due to the non-availability of bathymetric data. Thus, concerted efforts are required to fill in these gaps by undertaking systematic hydrographic surveys. These ocean areas are close to the permanent station in Antarctica. It is in the best interest of India to have a well surveyed navigational chart near the permanent station.
APA, Harvard, Vancouver, ISO, and other styles
10

"‘Just part of my Continental charm.’ Anton Walbrooks Filmkarriere im britischen Exil." In German-speaking Exiles in the Performing Arts in Britain after 1933, 225–51. Brill | Rodopi, 2013. http://dx.doi.org/10.1163/9789401209199_013.

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

Conference papers on the topic "EXIT chart"

1

Xie, Kai, Li Wang, Gil Shamir, and Joseph Boutros. "EXIT Chart Analysis for Split-LDPC Codes." In 2006 IEEE International Symposium on Information Theory. IEEE, 2006. http://dx.doi.org/10.1109/isit.2006.261780.

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

Xiao, Pei, Rolando Carrasco, and Ian Wassell. "EXIT Chart Analysis of Space-Time Turbo Equalizer." In 2006 IEEE Information Theory Workshop. IEEE, 2006. http://dx.doi.org/10.1109/itw.2006.322895.

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

Xiao, Pei, Rolando Carrasco, and Ian Wassell. "EXIT Chart Analysis of Space-Time Turbo Equalizer." In 2006 IEEE Information Theory Workshop - ITW '06 Chengdu. IEEE, 2006. http://dx.doi.org/10.1109/itw2.2006.323711.

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

Riaz, Bilal, and Jan Bajcsy. "Exit Chart Analysis for Slepian-Wolf Turbo Compression." In 2007 10th Canadian Workshop on Information Theory. IEEE, 2007. http://dx.doi.org/10.1109/cwit.2007.375701.

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

Lechner, Gottfried, Troels Pedersen, and Gerhard Kramer. "EXIT Chart Analysis of Binary Message-Passing Decoders." In 2007 IEEE International Symposium on Information Theory. IEEE, 2007. http://dx.doi.org/10.1109/isit.2007.4557334.

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

Sayir, Jossy. "EXIT chart approximations using the role model approach." In 2010 IEEE International Symposium on Information Theory - ISIT. IEEE, 2010. http://dx.doi.org/10.1109/isit.2010.5513589.

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

Mehrnoush, Morteza, Benjamin J. Belzer, Krishnamoorthy Sivakumar, and Roger Wood. "EXIT chart based IRA code design for TDMR." In 2016 Annual Conference on Information Science and Systems (CISS). IEEE, 2016. http://dx.doi.org/10.1109/ciss.2016.7460573.

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

Razavi, Razieh, Muhammad Ali Imran, and Rahim Tafazolli. "EXIT chart analysis for turbo LDS-OFDM receivers." In 2011 7th International Wireless Communications and Mobile Computing Conference (IWCMC 2011). IEEE, 2011. http://dx.doi.org/10.1109/iwcmc.2011.5982559.

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

Damrath, Martin, and Peter A. Hoeher. "EXIT-Chart-Aided Code Matching in Molecular Communications." In 2018 IEEE 10th International Symposium on Turbo Codes & Iterative Information Processing (ISTC). IEEE, 2018. http://dx.doi.org/10.1109/istc.2018.8625266.

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

Zhang, Yuling, Wenwei He, and Fuzeng Zhang. "Joint Optimization of LDPC Codes with EXIT Chart." In 2008 4th International Conference on Wireless Communications, Networking and Mobile Computing (WiCOM). IEEE, 2008. http://dx.doi.org/10.1109/wicom.2008.361.

Full text
APA, Harvard, Vancouver, ISO, and other styles
You might also be interested in the extended bibliographies on the topic 'EXIT chart' for particular source types:
Journal articles Dissertations / Theses Books
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