Detection and decoding algorithms of multi-antenna diversity techniques for terrestrial DVB systems

This PhD dissertation analyzes the behavior of multi-antenna diversity techniques in broadcasting scenarios of TDT (terrestrial digital television) systems and proposes a low-complexity detection and decoding design for their practical implementation. For that purpose, the transmission-reception chains of the European DVB-T (Digital Video Broadcasting - Terrestrial) and DVB-T2 standards have been implemented over which diversity and MIMO (multiple-input multiple-output) techniques have been assessed through Monte Carlo simulations. On one hand, the most important multi-antenna diversity techniques such as CDD (cyclic delay diversity), Alamouti code-based SFBC (space-frequency block coding) and MRC (maximum ratio combining), have been evaluated in a DVB-T system over both fixed and mobile Rayleigh and Ricean channels. With the DVB-T2 standard release, multi-antenna processing has actually been introduced in digital television systems. The distributed SFBC configuration proposed in DVB-T2 is analyzed from a performance point of view considering different propagation conditions in an SFN (single frequency network). On the other hand, error-performance and detection complexity analyses of 2x2 FRFD (full-rate full-diversity) SFBCs are carried out for last-generation DTV (digital television) systems. The use of channel coding based on LDPC (low-density parity check) codes in new standards such as DVB-T2, involves a soft-output MAP (maximum a posteriori ) detection which results in an increase of the detection complexity. In order to study the FRFD codes behavior in such a BICM (bit-interleaved coded modulation) scheme, the Golden code, which achieves the maximum coding gain, and the Sezginer-Sari code, which has a lower inherent detection complexity as an expense of sacrificing performance gain, have been chosen. Using LSD (list sphere decoder) detection, BER (bit error rate) performance and computational cost results are provided for TDT scenarios. In order to overcome the variable complexity of the LSD, LFSD (list fixed-complexity sphere decoder) detection is proposed for practical implementations. A redesign of the previously proposed LFSD algorithm for spatial multiplexing MIMO systems has been performed for FRFD SFBCs with close-to-LSD performance. Furthermore, an analysis of the number of candidates is carried out in order to maximize the eficiency of the algorithm. Due to its fixed complexity, the novel algorithm can be fully pipelined making feasible a realistic implementation in chip.Esta tesis analiza el comportamiento de las técnicas de diversidad multiantena en escenarios de radiodifusión TDT (televisión digital terrestre) y propone un diseño de baja complejidad para la detección de códigos SFBC (space-frequency block coding ) que facilita una posible implementación práctica. Para ello, se ha implementado la cadena de transmisión-recepción de los estándares europeos DVB-T (Digital Video Broadcasting - Terrestrial ) y DVB-T2 como entorno de trabajo donde se han incluido y simulado diferentes técnicas de diversidad MIMO (multiple-input multiple-output ). Por un lado, se evalúan las técnicas de diversidad multiantena CDD ( cyclic delay diversity), SFBC con codi cación Alamouti y MRC (maximum ratio combining ) en escenarios fijos y móviles de canales tanto Rayleigh como Ricean para el sistema DVB-T. En DVB-T2, se analiza la tecnología multiantena propuesta por el estándar para diferentes escenarios de propagación dentro de redes SFN (single frequency network ). Por otro lado, se realiza un estudio sobre códigos FRFD (full-rate full-diversity ) SFBC para su posible inclusión en futuros estándares de televisión digital. El uso de codificaciones de canal más potentes, como los códigos LDPC (low-density parity check ), implica la utilización de una detección MAP (maximum a posteriori ) con salida soft, incrementando considerablemente la complejidad de la detección. Para realizar el correspondiente análisis de complejidad y rendimiento, se han escogidos dos códigos FRFD. Por un lado, el código Golden, que ofrece la máxima ganancia de código y, por otro, el código propuesto por Sezginer y Sari, que consigue reducir la complejidad de detección a costa de perder cierta ganancia de código. Se presentan resultados basados en curvas de BER (bit error rate) y número de operaciones sobre un sistema BICM (bit-interleaved coded modulation ) equivalente a DVB-T2 en escenarios TDT utilizando una detección LSD (list sphere decoder ). Para resolver el problema de la complejidad variable del algoritmo LSD, se realiza un rediseño del ya propuesto LFSD (list fixed-complexity sphere decoder ) para técnicas de multiplexación espacial considerando la estructura de los códigos FRFD SFBC. Asimismo, se evalúa el número de candidatos que ofrece un funcionamiento más eficiente con menor coste computacional. Los resultados de simulación basados en curvas de BER muestran rendimientos cercanos al detector LSD manteniendo el número de operaciones constante. Por lo tanto, este nuevo diseño permite su eficiente y práctica implementación en dispositivos reales.Doktoretza-tesi honen gai nagusia Lurreko Telebista Digitalerako antena anitzeko dibertsitate tekniken portaera ikertzea da, hartzailerako konplexutasun baxuko algoritmoen diseinua oinarri hartuta. Horretarako, Europako DVB-T eta DVB-T2 telebista digitaleko estandarren igorle-hartzaile kateen simulagailua inplementatzeaz gain, dibertsitate eta MIMO ( multipleinput multiple-output ) algoritmoak garatu eta aztertu dira. Lehenengo helburu gisa, CDD (cyclic delay diversity ), Alamouti kodean oinarritutako SFBC (space-frequency block coding ) eta MRC (maximum ratio combining ) teknikak ebaluatu dira Rayleigh eta Ricean ingurunetan, bai komunikazio nko zein mugikorretarako. Argitaratu berri den DVB-T2 estandarrak antena anitzeko prozesaketa telebista sistema digitalean sartu duenez, teknologia honen analisia egin da maiztasun bakarreko telebista sareetarako SFN (single frequency network ). Tesiaren helburu nagusia FRFD (full-rate full-diversity ) SFBC kodigoen ikerketa eta hauek telebista digitalaren estandar berrietan sartzea ahalbidetuko dituzten detekzio sistemen diseinua izan da. Kanalen kodi kazio indartsuagoak erabiltzeak, LDPC ( low-density parity check ) kodeak esaterako, MAP (maximum a posteriori ) algoritmoan oinarritutako soft irteeradun detektoreen erabilera dakar berekin, detekzioaren konplexutasuna areagotuz. Bi FRFD kode aukeratu dira errendimendu eta konplexutasun analisiak DVB-T2 bezalako BICM (bit-interleaved coded modulation ) sistemetan egiteko. Alde batetik, irabazi maximoa lortzen duen Golden kodea eta, bestetik, konplexutasun txikiagoa duen Sezginer eta Sarik proposatutako kodea erabili dira. Bit errore edo BER (bit error rate) tasan eta konputazio kostuan oinarrituta, emaitzak aurkeztu dira zerrenda dekodeatzaile esferikoa ( list sphere decoder, LSD) erabiliz. LSD-aren konplexutasun aldakorraren arazoa konpontzeko, ezpazio-multiplexazioko teknikarako LFSD (list xed-complexity sphere decoder ) algoritmoaren berdiseinua garatu da, FRFD SFBC kodeen egitura berezia kontuan hartuta. Algoritmoaren eraginkortasuna maximizatzeko kandidatuen zenbakia ebaluatzen da baita ere. LSD-en antzeko errendimendua duten BER gra ketan oinarritutako simulazio emaitzak aurkezten dira, eragiketa kopurua konstante eta LSD-arenaren baino murritzagoa mantenduz. Beraz, proposatutako diseinu eraginkorrak, FRFD SFBC antena anitzeko dibertsitatean oinarritutako eskemen inplementazioa ahalbidetu dezakete telebista digitalaren estandar berrietarako

Adaptive Transmission for OFDM

To respond to dynamic channel conditions caused by fading, shadowing, and other time-varying disturbances, orthogonal frequency division multiplexing (OFDM) packet radio systems should adapt transmission parameters on a packet-by-packet basis to maintain or improve performance over the channel. For this to be possible, there are three key ideas that must be addressed: first, how to determine the subchannel conditions; second, which transmission parameters should be adapted; and third, how to adapt those parameters intelligently. In this thesis, we propose a procedure for determining relative subchannel quality without using any traditional channel measurements. Instead, statistics derived solely from subcarrier error counts allow subchannels to be ranked by order of estimated quality; this order can be exploited for adapting transmission parameters. We investigate adaptive subcarrier power allocation, adaptive subcarrier modulation that allows different subcarriers in the same packet to use different modulation formats, and adaptive coding techniques for OFDM in fading channels. Analysis and systems simulation assess the accuracy of the subcarrier ordering as well as the throughput achieved by the proposed adaptive transmission protocol, showing good performance across a wide range of channel conditions

Bit Interleaved Non-Binary LDPC Codes in OFDM System

Given the increasing number of applications requires high data transmission without increasing the channel band-width, this is the reason for the use of high order constellations such as QAM (Qaqdrature Amplitude Modulation). In order to eliminate inter symbols interferences, introduced for high data rate over multi-paths channels, with less complexity, we use OFDM (Orthogonal Frequency Division Multiplexing) Modulations. However, OFDM modulation using QAM requires a high signal to noise ratio. To overcome this disadvantage, it is interesting to combine high error correction codes such as LDPC codes with QAM using OFDM. Binary LDPC (Low-Density Parity-Check) code shows performance weakness when higher order constellations is used. To avoid this weakness, non-binary LDPC code is investigated. In this work, we show, under Gaussian, Rayleigh and Rician channels, with high order constellations (16-QAM, 64-QAM and 256-QAM) using OFDM modulations, that binary LDPC code is a good errors correcting code. Also, we illustrate that its non-binary version, with high order constellations, increases the system performance. We show that the performance of LDPC codes can be improved with the increasing of the iterations numbe

Solutions for New Terrestrial Broadcasting Systems Offering Simultaneously Stationary and Mobile Services

221 p.[EN]Since the first broadcasted TV signal was transmitted in the early decades of the past century, the television broadcasting industry has experienced a series of dramatic changes. Most recently, following the evolution from analogue to digital systems, the digital dividend has become one of the main concerns of the broadcasting industry. In fact, there are many international spectrum authorities reclaiming part of the broadcasting spectrum to satisfy the growing demand of other services, such as broadband wireless services, arguing that the TV services are not very spectrum-efficient. Apart from that, it must be taken into account that, even if up to now the mobile broadcasting has not been considered a major requirement, this will probably change in the near future. In fact, it is expected that the global mobile data traffic will increase 11-fold between 2014 and 2018, and what is more, over two thirds of the data traffic will be video stream by the end of that period. Therefore, the capability to receive HD services anywhere with a mobile device is going to be a mandatory requirement for any new generation broadcasting system. The main objective of this work is to present several technical solutions that answer to these challenges. In particular, the main questions to be solved are the spectrum efficiency issue and the increasing user expectations of receiving high quality mobile services. In other words, the main objective is to provide technical solutions for an efficient and flexible usage of the terrestrial broadcasting spectrum for both stationary and mobile services. The first contributions of this scientific work are closely related to the study of the mobile broadcast reception. Firstly, a comprehensive mathematical analysis of the OFDM signal behaviour over time-varying channels is presented. In order to maximize the channel capacity in mobile environments, channel estimation and equalization are studied in depth. First, the most implemented equalization solutions in time-varying scenarios are analyzed, and then, based on these existing techniques, a new equalization algorithm is proposed for enhancing the receivers’ performance. An alternative solution for improving the efficiency under mobile channel conditions is treating the Inter Carrier Interference as another noise source. Specifically, after analyzing the ICI impact and the existing solutions for reducing the ICI penalty, a new approach based on the robustness of FEC codes is presented. This new approach employs one dimensional algorithms at the receiver and entrusts the ICI removing task to the robust forward error correction codes. Finally, another major contribution of this work is the presentation of the Layer Division Multiplexing (LDM) as a spectrum-efficient and flexible solution for offering stationary and mobile services simultaneously. The comprehensive theoretical study developed here verifies the improved spectrum efficiency, whereas the included practical validation confirms the feasibility of the system and presents it as a very promising multiplexing technique, which will surely be a strong candidate for the next generation broadcasting services.[ES]Desde el comienzo de la transmisión de las primeras señales de televisión a principios del siglo pasado, la radiodifusión digital ha evolucionado gracias a una serie de cambios relevantes. Recientemente, como consecuencia directa de la digitalización del servicio, el dividendo digital se ha convertido en uno de los caballos de batalla de la industria de la radiodifusión. De hecho, no son pocos los consorcios internacionales que abogan por asignar parte del espectro de radiodifusión a otros servicios como, por ejemplo, la telefonía móvil, argumentado la poca eficiencia espectral de la tecnología de radiodifusión actual. Asimismo, se debe tener en cuenta que a pesar de que los servicios móviles no se han considerado fundamentales en el pasado, esta tendencia probablemente variará en el futuro cercano. De hecho, se espera que el tráfico derivado de servicios móviles se multiplique por once entre los años 2014 y 2018; y lo que es más importante, se pronostica que dos tercios del tráfico móvil sea video streaming para finales de ese periodo. Por lo tanto, la posibilidad de ofrecer servicios de alta definición en dispositivos móviles es un requisito fundamental para los sistemas de radiodifusión de nueva generación. El principal objetivo de este trabajo es presentar soluciones técnicas que den respuesta a los retos planteados anteriormente. En particular, las principales cuestiones a resolver son la ineficiencia espectral y el incremento de usuarios que demandan mayor calidad en los contenidos para dispositivos móviles. En pocas palabras, el principal objetivo de este trabajo se basa en ofrecer una solución más eficiente y flexible para la transmisión simultánea de servicios fijos y móviles. La primera contribución relevante de este trabajo está relacionada con la recepción de la señal de televisión en movimiento. En primer lugar, se presenta un completo análisis matemático del comportamiento de la señal OFDM en canales variantes con el tiempo. A continuación, con la intención de maximizar la capacidad del canal, se estudian en profundidad los algoritmos de estimación y ecualización. Posteriormente, se analizan los algoritmos de ecualización más implementados, y por último, basándose en estas técnicas, se propone un nuevo algoritmo de ecualización para aumentar el rendimiento de los receptores en tales condiciones. Del mismo modo, se plantea un nuevo enfoque para mejorar la eficiencia de los servicios móviles basado en tratar la interferencia entre portadoras como una fuente de ruido. Concretamente, tras analizar el impacto del ICI en los receptores actuales, se sugiere delegar el trabajo de corrección de dichas distorsiones en códigos FEC muy robustos. Finalmente, la última contribución importante de este trabajo es la presentación de la tecnología LDM como una manera más eficiente y flexible para la transmisión simultánea de servicios fijos y móviles. El análisis teórico presentado confirma el incremento en la eficiencia espectral, mientras que el estudio práctico valida la posible implementación del sistema y presenta la tecnología LDM c

Bandwidth-efficient communication systems based on finite-length low density parity check codes

Low density parity check (LDPC) codes are linear block codes constructed by pseudo-random parity check matrices. These codes are powerful in terms of error performance and, especially, have low decoding complexity. While infinite-length LDPC codes approach the capacity of communication channels, finite-length LDPC codes also perform well, and simultaneously meet the delay requirement of many communication applications such as voice and backbone transmissions. Therefore, finite-length LDPC codes are attractive to employ in low-latency communication systems. This thesis mainly focuses on the bandwidth-efficient communication systems using finite-length LDPC codes. Such bandwidth-efficient systems are realized by mapping a group of LDPC coded bits to a symbol of a high-order signal constellation. Depending on the systems' infrastructure and knowledge of the channel state information (CSI), the signal constellations in different coded modulation systems can be two-dimensional multilevel/multiphase constellations or multi-dimensional space-time constellations. In the first part of the thesis, two basic bandwidth-efficient coded modulation systems, namely LDPC coded modulation and multilevel LDPC coded modulation, are investigated for both additive white Gaussian noise (AWGN) and frequency-flat Rayleigh fading channels. The bounds on the bit error rate (BER) performance are derived for these systems based on the maximum likelihood (ML) criterion. The derivation of these bounds relies on the union bounding and combinatoric techniques. In particular, for the LDPC coded modulation, the ML bound is computed from the Hamming distance spectrum of the LDPC code and the Euclidian distance profile of the two-dimensional constellation. For the multilevel LDPC coded modulation, the bound of each decoding stage is obtained for a generalized multilevel coded modulation, where more than one coded bit is considered for level. For both systems, the bounds are confirmed by the simulation results of ML decoding and/or the performance of the ordered-statistic decoding (OSD) and the sum-product decoding. It is demonstrated that these bounds can be efficiently used to evaluate the error performance and select appropriate parameters (such as the code rate, constellation and mapping) for the two communication systems.The second part of the thesis studies bandwidth-efficient LDPC coded systems that employ multiple transmit and multiple receive antennas, i.e., multiple-input multiple-output (MIMO) systems. Two scenarios of CSI availability considered are: (i) the CSI is unknown at both the transmitter and the receiver; (ii) the CSI is known at both the transmitter and the receiver. For the first scenario, LDPC coded unitary space-time modulation systems are most suitable and the ML performance bound is derived for these non-coherent systems. To derive the bound, the summation of chordal distances is obtained and used instead of the Euclidean distances. For the second case of CSI, adaptive LDPC coded MIMO modulation systems are studied, where three adaptive schemes with antenna beamforming and/or antenna selection are investigated and compared in terms of the bandwidth efficiency. For uncoded discrete-rate adaptive modulation, the computation of the bandwidth efficiency shows that the scheme with antenna selection at the transmitter and antenna combining at the receiver performs the best when the number of antennas is small. For adaptive LDPC coded MIMO modulation systems, an achievable threshold of the bandwidth efficiency is also computed from the ML bound of LDPC coded modulation derived in the first part

Evaluation of Channel Coding in OFDM Systems

Channel coding plays a very important role in OFDM systems performance. The structure of OFDM systems makes channel coding more effective in confronting fading channels. Sometimes Coded OFDM is known as COFDM. The role of channel coding in conjunction with frequency and time interleaving is to provide a link between bits transmitted on separated carriers of the signal spectrum, in such a way that the information conveyed by faded carriers can be reconstructed in the receiver. Frequency selectivity, currently known to be a disadvantage, is then turned into an advantage that can be called frequency diversity. Using Channel State Information (CSI), channel coding can yield some additional gain. Channel state information is frequency response of the channel or signal to noise ratio in each carrier. This thesis analyzes OFDM system and the effect of channel coding in reducing BER. Along with this soft decoding and decoding with CSI is also studied. Besides, performance of convolutional codes Turbo codes in OFDM systems is compared and compared. Besides, we compare the performance of convolution and turbo codes in OFDM systems. The results have been validated through simulations. This thesis also presents Space-Frequency Coded OFDM system consisting of two transmitters and a single receiver. Simple Alamouti space time code is used. An Mary PSK modulation is used to modulate the symbols across an OFDM channel. We also proposed a variation of the scheme which tries to spread additional symbols across timefrequency attempting to increase the rate of transmission without changing the type of modulation employed or increasing the bandwidth. A Rayleigh frequency selective slow fading channel is assumed through out the analysis. SER performance of the above systems is carried out with emphasis on the modulation scheme and number of carriers

High Speed Turbo Tcm Ofdm For Uwb And Powerline System

Turbo Trellis-Coded Modulation (TTCM) is an attractive scheme for higher data rate transmission, since it combines the impressive near Shannon limit error correcting ability of turbo codes with the high spectral efficiency property of TCM codes. We build a punctured parity-concatenated trellis codes in which a TCM code is used as the inner code and a simple parity-check code is used as the outer code. It can be constructed by simple repetition, interleavers, and TCM and functions as standard TTCM but with much lower complexity regarding real world implementation. An iterative bit MAP decoding algorithm is associated with the coding scheme. Orthogonal Frequency Division Multiplexing (OFDM) modulation has been a promising solution for efficiently capturing multipath energy in highly dispersive channels and delivering high data rate transmission. One of UWB proposals in IEEE P802.15 WPAN project is to use multi-band OFDM system and punctured convolutional codes for UWB channels supporting data rate up to 480Mb/s. The HomePlug Networking system using the medium of power line wiring also selects OFDM as the modulation scheme due to its inherent adaptability in the presence of frequency selective channels, its resilience to jammer signals, and its robustness to impulsive noise in power line channel. The main idea behind OFDM is to split the transmitted data sequence into N parallel sequences of symbols and transmit on different frequencies. This structure has the particularity to enable a simple equalization scheme and to resist to multipath propagation channel. However, some carriers can be strongly attenuated. It is then necessary to incorporate a powerful channel encoder, combined with frequency and time interleaving. We examine the possibility of improving the proposed OFDM system over UWB channel and HomePlug powerline channel by using our Turbo TCM with QAM constellation for higher data rate transmission. The study shows that the system can offer much higher spectral efficiency, for example, 1.2 Gbps for OFDM/UWB which is 2.5 times higher than the current standard, and 39 Mbps for OFDM/HomePlug1.0 which is 3 times higher than current standard. We show several essential requirements to achieve high rate such as frequency and time diversifications, multi-level error protection. Results have been confirmed by density evolution. The effect of impulsive noise on TTCM coded OFDM system is also evaluated. A modified iterative bit MAP decoder is provided for channels with impulsive noise with different impulsivity

Physical-Layer Cooperation in Coded OFDM Relaying Systems

Mobile communication systems nowadays require ever-increasing data rate and coverage of wide areas. One promising approach to achieve this goal is the application of cooperative communications enabled by introducing intermediate nodes known as relays to support the transmission between terminals. By processing and forwarding the receive message at the relays, the path-loss effect between the source and the destination is mitigated. One major limit factor for relay assisted communications is that a relay cannot transmit and receive using the same physical resources. Therefore, a half-duplex constraint is commonly assumed resulting in halved spectral efficiency. To combat this drawback, two-way relaying is introduced, where two sources exchange information with each. On the other hand, due to the physical limitation of the relays, e.g., wireless sensor nodes, it's not possible to implement multiple antennas at one relay, which prohibits the application of multiple-input multiple-output (MIMO) techniques. However, when treating multiple relays as a cluster, a virtual antenna array is formed to perform MIMO techniques in a distributed manner. %This thesis aims at designing efficient one-way and two-way relaying schemes. Specifically, existing schemes from the literature are improved and new schemes are developed with the emphasis on coded orthogonal frequency division multiplexing (OFDM) transmissions. Of special interest is the application of physical-layer network coding (PLNC) for two-phase two-way relaying. In this case, a network coded message is estimated from the superimposed receive signal at the relay using PLNC schemes. The schemes are investigated based on a mutual information analysis and their performance are improved by a newly proposed phase control strategy. Furthermore, performance degradation due to system asynchrony is mitigated depending on different PLNC schemes. When multiple relays are available, novel cooperation schemes allowing information exchange within the relay cluster are proposed that facilitate distributed MIMO reception and transmission. Additionally, smart signaling approaches are presented to enable the cooperation at different levels with the cooperation overhead taken into account adequately in system performance evaluation

Advanced Coding And Modulation For Ultra-wideband And Impulsive Noises

The ever-growing demand for higher quality and faster multimedia content delivery over short distances in home environments drives the quest for higher data rates in wireless personal area networks (WPANs). One of the candidate IEEE 802.15.3a WPAN proposals support data rates up to 480 Mbps by using punctured convolutional codes with quadrature phase shift keying (QPSK) modulation for a multi-band orthogonal frequency-division multiplexing (MB-OFDM) system over ultra wideband (UWB) channels. In the first part of this dissertation, we combine more powerful near-Shannon-limit turbo codes with bandwidth efficient trellis coded modulation, i.e., turbo trellis coded modulation (TTCM), to further improve the data rates up to 1.2 Gbps. A modified iterative decoder for this TTCM coded MB-OFDM system is proposed and its bit error rate performance under various impulsive noises over both Gaussian and UWB channel is extensively investigated, especially in mismatched scenarios. A robust decoder which is immune to noise mismatch is provided based on comparison of impulsive noises in time domain and frequency domain. The accurate estimation of the dynamic noise model could be very difficult or impossible at the receiver, thus a significant performance degradation may occur due to noise mismatch. In the second part of this dissertation, we prove that the minimax decoder in \cite, which instead of minimizing the average bit error probability aims at minimizing the worst bit error probability, is optimal and robust to certain noise model with unknown prior probabilities in two and higher dimensions. Besides turbo codes, another kind of error correcting codes which approach the Shannon capacity is low-density parity-check (LDPC) codes. In the last part of this dissertation, we extend the density evolution method for sum-product decoding using mismatched noises. We will prove that as long as the true noise type and the estimated noise type used in the decoder are both binary-input memoryless output symmetric channels, the output from mismatched log-likelihood ratio (LLR) computation is also symmetric. We will show the Shannon capacity can be evaluated for mismatched LLR computation and it can be reduced if the mismatched LLR computation is not an one-to-one mapping function. We will derive the Shannon capacity, threshold and stable condition of LDPC codes for mismatched BIAWGN and BIL noise types. The results show that the noise variance estimation errors will not affect the Shannon capacity and stable condition, but the errors do reduce the threshold. The mismatch in noise type will only reduce Shannon capacity when LLR computation is based on BIL