Made available in DSpace on 2014-12-17T14:56:18Z (GMT). No. of bitstreams: 1 LucasCPC_DISSERT.pdf: 1619300 bytes, checksum: 97bb04f66b84a1ed1935715460aa2c22 (MD5) Previous issue date: 2014-02-14 / Wavelet coding has emerged as an alternative coding technique to minimize the fading effects of wireless channels. This work evaluates the performance of wavelet coding, in terms of bit error probability, over time-varying, frequency-selective multipath Rayleigh fading channels. The adopted propagation model follows the COST207 norm, main international standards reference for GSM, UMTS, and EDGE applications. The results show the wavelet coding s efficiency against the inter symbolic interference which characterizes these communication scenarios. This robustness of the presented technique enables its usage in different environments, bringing it one step closer to be applied in practical wireless communication systems / A codifica??o wavelet surgiu como uma t?cnica de codifica??o de canal alternativa para minimizar os efeitos destrutivos dos canais de comunica??o sem fio caracterizados pelo desvanecimento. Esse trabalho avalia o desempenho de sistemas com codifica??o wavelet, em termos de probabilidade de erro de bit, sobre canais de comunica??o com desvanecimento Rayleigh variante no tempo e m?ltiplos percursos seletivos em frequ?ncia. O modelo de propaga??o adotado segue a norma COST207, principal refer?ncia dos padr?es internacionais para aplica??es GSM, UMTS e EDGE. Os resultados demonstram a efici?ncia da t?cnica no combate a interfer?ncia inter-simb?lica, caracter?stica desses cen?rios de comunica??o. Essa robustez habilita o uso da t?cnica em diferentes ambientes, trazendo-a um passo ainda mais pr?ximo de ser aplicada em sistemas pr?ticos de comunica??o sem fio

Orientador: Michel Daoud Yacoub / Dissertação (mestrado) - Universidade Estadual de Campinas, Faculdade de Engenharia Eletrica e de Computação / Made available in DSpace on 2018-08-06T06:51:34Z (GMT). No. of bitstreams: 1 Costa_DanielBenevidesda_M.pdf: 1293492 bytes, checksum: 3aa8e540fd57db56b2ee4469c60307be (MD5) Previous issue date: 2006 / Resumo: Esta dissertação provê uma análise das estatísticas de ordem superior para canais de desvanecimento WeibuII e Nakagami-m. Considerando canais de desvanecimento WeibulI, devido à ausência de um modelo físico para tais canais, estatísticas conjuntas de duas variáveis WeibuII correlacionadas foram obtidas em forma fechada e em função de parâmetros físicos bem conhecidos. Outra estatística encontrada foi a taxa de cruzamento de nível e a duração média de desvanecimento usando diversidade com dois ramos para canais WeibuII correlacionados, desbalanceados e não-idênticos. Além disso, uma caracterização do comportamento do processo de fase e de sua derivada temporal para sinais WeibuII foi realizada. Analisando canais de desvanecimento Nakagami-m, uma expressão simples e em forma fechada para a taxa de cruzamento de fase generalizada foi obtida. Resultados de simulação completamente validaram a formulação proposta. Além disso, novas estatísticas em forma fechada para a envoltória, para as componentes em fase e em quadratura, para a fase e para suas respectivas derivadas temporais foram obtidas / Abstract: This dissertation provides an analysis of the higher order statistics for WeibuII and Nakagami-m fading channels. Conceming WeibuII fading channels, due to the absence of a fading model related of such channels, joint statistics for two correlated WeibuII variates were obtained in cIosed-form and in terms of welI-known physical parameters. Other statistics found were the levei crossing rate and the average fade duration for unbalanced, non-identical, correlated WeibuII channels operating over two branches of diversity. Furthermore, a characterization of the behaviour of the phase process and its time derivative for WeibuII signals was accomplish. Conceming Nakagami-m fading channeIs, a simple and cIosed-form expression for the generalized phase crossing rate was obtained. Results of simulation thoroughly validated the formulation proposed. Moreover, new cIosed-form statistics for the envelope, for the in-phase and quadrature components, for the phase and its respective time derivative were derived. / Mestrado / Telecomunicações e Telemática / Mestre em Engenharia Elétrica

The multidisciplinary field of memristors calls for the necessity for theoreticallyinclined researchers and experimenters to join forces, merging complementary expertise and technical know-how, to develop and implement rigorous and systematic techniques to design variability-aware memristor-based circuits and systems. The availability of a predictive physics-based model for a memristor is a necessary requirement before commencing these investigations. An interesting dynamic phenomenon, occurring ubiquitously in non-volatile memristors, is fading memory. The latter may be defined as the appearance of a unique steady-state behavior, irrespective of the choice of the initial condition from an admissible range of values, for each stimulus from a certain family, for example, the DC or the purely-AC periodic input class. This paper first provides experimental evidence for the emergence of fading memory effects in the response of a TaOₓ redox-based random access memory cell to inputs from both of these classes. Leveraging the predictive capability of a physics-based device model, called JART VCM v1, a thorough system-theoretic analysis, revolving around the Dynamic Route Map graphic tool, is presented. This analysis allows to gain a better understanding of the mechanisms, underlying the emergence of history erase effects, and to identify the main factors, that modulate this nonlinear phenomenon, toward future potential applications.

No description available.

International Telemetering Conference Proceedings / October 20-23, 2003 / Riviera Hotel and Convention Center, Las Vegas, Nevada / An implementation of a Pseudo Error Detection (PSED) system is presented and its performance in conjunction with smart antenna and smart diversity systems tested and evaluated. Non redundancy, instant response and relative simplicity make the Pseudo Error Detectors excellent real time error monitoring systems in smart antenna and smart diversity systems. Because of the Non-redundant Error Detection mechanism in Pseudo Error Detectors, we can monitor the error quality without any coding or overhead. The output of the pseudo error detector in AWGN, selective fading Doppler shift and other interference environments is directly correlated to the BER and BLER. This direct correlation makes it a great tool for online error monitoring of a system and can have numerous applications In a PSED the Eye diagram from the demodulator is sampled once per symbol. By monitoring and comparison of the eye at sampled intervals at different thresholds, we would know if an error has occurred. By integrating this result over a period of time we can get the averaged error level. The results provided in this paper were obtained and verified by both MatLab simulations using dynamic simulation techniques and hardware measurements over dynamic channels.

International Telemetering Conference Proceedings / October 20-23, 2003 / Riviera Hotel and Convention Center, Las Vegas, Nevada / An improved performance smart diversity was invented to improve the signal performance in a combined selective fading, Additive White Gaussian Noise (AWGN), Co-channel interference (CCI) and Doppler shift environment such as the LEO satellite channel. This system is also applicable to aeronautical and telemetry channels. Smart diversity is defined here as a mechanism that selects at each moment the best branch in a n-branch diversity system based on the error quality with no default branch and no prioritization. The predominant novelty of this discovery is the introduction of multi level analog based Pseudo Error Detectors (PSED) in every branch. One of the advantages of PSED is that it is a non redundant error detection system, with no requirement for overhead and no need for additional valuable spectrum. This research was motivated by problems in LEO satellite systems due to low orbit and high relative speed with respect to the ground stations. The system is independent of the modulation techniques and is applicable to both coherent and non-coherent detections. The results from simulations using dynamic simulation techniques and hardware measurements over dynamic channels show significant improvement of both the Bit Error Rate (BER) and the Block Error Rate (BLER).

Au cours des 15 dernières années, des progrès spectaculaires dans l'analyse et la conception des codes définis par des graphes bipartites et dé-codables par des algorithmes itératifs ont permis le développement de systèmes de correction d'erreurs, avec des performances de plus en plus proches la limite théorique de Shannon. Dans ce contexte, un rôle déterminant a été joué par la famille des codes à matrice de parité creuse, appelés codes LDPC (pour « Low-Density Parity-Check », en anglais), introduit par Gallager au début des années 60 et décrits plus tard en termes de graphes bipartites. Négligés pendant de longues années, ces codes ont été redécouverts à la fin des années 90, après que la puissance du décodage itératif a été mise en évidence grâce à l'invention des Turbo-codes. Ce n'est qu'au début des années 2000 que les techniques nécessaires à l'analyse et l'optimisation des codes LDPC ont été développées, techniques qui ont permis ensuite la construction des codes avec des performances asymptotiques proches de la limite de Shannon. Cette remarquable avancée a motivé l'intérêt croissant de la communauté scientifique et soutenu le transfert rapide de cette technologie vers le secteur industriel. Plus récemment, un intérêt tout particulier a été porté aux codes LDPC définis sur des alphabets non-binaires, grâce notamment à leur meilleure capacité de correction en « longueur finie ». Bien que Gallager ait déjà proposé l'utilisation des alphabets non-binaires, en utilisant l'arithmétique modulaire, les codes LDPC non-binaires définis sur les corps finis n'ont étés étudiés qu'à partir de la fin des années 90. Il a été montré que ces codes offrent de meilleures performances que leurs équivalents binaires lorsque le bloc codé est de longueur faible à modérée, ou lorsque les symboles transmis sur le canal sont eux-mêmes des symboles non-binaires, comme par exemple dans le cas des modulations d'ordre supérieur ou des canaux à antennes multiples.Cependant, ce gain en performance implique un coût non négligeable en termes de complexité de décodage, quipeut entraver l'utilisation des codes LDPC non binaires dans des systèmes réels, surtout lorsque le prix à payer encomplexité est plus important que le gain en performance.Cette thèse traite de l'analyse et de la conception des codes LDPC non binaires pour des canaux à évanouissements. L'objectif principal de la thèse est de démontrer que, outre le gain en performance en termes de capacité de correction, l'emploi des codes LDPC non binaires peut apporter des bénéfices supplémentaires,qui peuvent compenser l'augmentation de la complexité du décodeur. La « flexibilité » et la « diversité »représentent les deux bénéfices qui seront démontrées dans cette thèse. La « flexibilité » est la capacité d'unsystème de codage de pouvoir s'adapter à des débits (rendements) variables tout en utilisant le même encodeuret le même décodeur. La « diversité » se rapporte à sa capacité d'exploiter pleinement l'hétérogénéité du canal de communication.La première contribution de cette thèse consiste à développer une méthode d'approximation de l'évolution de densité des codes LDPC non-binaires, basée sur la simulation Monte-Carlo d'un code « infini ». Nous montrons que la méthode proposée fournit des estimations très fines des performances asymptotiques des codes LDPCnon-binaires et rend possible l'optimisation de ces codes pour une large gamme d'applications et de modèles de canaux.La deuxième contribution de la thèse porte sur l'analyse et la conception de système de codage flexible,utilisant des techniques de poinçonnage. Nous montrons que les codes LDPC non binaires sont plus robustes au poinçonnage que les codes binaires, grâce au fait que les symboles non-binaires peuvent être partialement poinçonnés. Pour les codes réguliers, nous montrons que le poinçonnage des codes non-binaires obéit à des règles différentes, selon que l'on poinçonne des symboles de / Over the last 15 years, spectacular advances in the analysis and design of graph-basedcodes and iterative decoding techniques paved the way for the development of error correctionsystems operating very close to the theoretical Shannon limit. A prominent rolehas been played by the class of Low Density Parity Check (LDPC) codes, introduced inthe early 60's by Gallager's and described latter in terms of sparse bipartite graphs. In theearly 2000's, LDPC codes were shown to be capacity approaching codes for a wide rangeof channel models, which motivated the increased interest of the scientific community andsupported the rapid transfer of this technology to the industrial sector. Over the past fewyears there has been an increased interest in non-binary LDPC codes due to their enhancedcorrection capacity. Although Gallager already proposed in his seminal work the use ofnon-binary alphabets (by using modular arithmetic), non-binary LDPC codes defined overfinite fields have only been investigated starting with the late 90's. They have been provento provide better performance than their binary counterparts when the block-length issmall to moderate, or when the symbols sent through channel are not binary, which is thecase for high-order modulations or for multiple-antennas channels. However, the performancegain comes at a non-negligible cost in the decoding complexity, which may prohibitthe use of non-binary LDPC codes in practical systems, especially when the price to payin decoding complexity is too high for the performance gain that one can get.This thesis addresses the analysis and design of non-binary LDPC codes for fadingchannels. The main goal is to demonstrate that besides the gain in the decoding performance,the use of non-binary LDPC codes can bring additional benefits that may offsetthe extra cost in decoding complexity. Flexibility and diversity are the two benefitsthat we demonstrate in this thesis. The exibility is the capacity of a coding system toaccommodate multiple coding rates through the use of a unique encoder/decoder pair. Thediversity of a coding system relates to its capacity to fully exploit the communicationchannel's heterogeneity.The first contribution of the thesis is the development of a Density Evolution approximationmethod, based on the Monte-Carlo simulation of an infinite code. We showthat the proposed method provides accurate and precise estimates of non-binary ensemblethresholds, and makes possible the optimization of non-binary codes for a wide range ofapplications and channel models.The second contribution of the thesis consists of the analysis and design of flexiblecoding schemes through the use of puncturing. We show that the non-binary LDPCcodes are more robust to puncturing than their binary counterparts, thanks to the factthat non-binary symbol-nodes can be only partially punctured. For regular codes, we showthat the design of puncturing patterns must respect different rules depending on whetherthe symbol-nodes are of degree 2 or higher. For irregular codes we propose an optimizationprocedure and we present optimized puncturing distributions for non-binary LDPC codes,iiiwhich exhibit a gap to capacity between 0.2 and 0.5dB , for punctured rates varying from0.5 to 0.9.The third contribution investigates the non-binary LDPC codes transmitted over aRayleigh (fast) fading channel, in which different modulated symbols are affected by differentfading factors. In case of one-to-one correspondence between modulated and codedsymbols, deep fading can make some coded symbols totally unrecoverable, leading to apoor system performance. In order to avoid this phenomenon, binary diversity can beexploited by using a bit-interleaver module placed between the encoder and the modulator.We propose an optimized interleaving algorithm, inspired from the Progressive Edge-Growth (PEG) method, which ensures maximum girth of th

A thesis submitted to the Faculty of Engineering and the Built Environment, University of the Witwatersrand, Johannesburg, in fulfilment of the requirements for the degree of Doctor of Philosophy in the School of Electrical and Information Engineering, 2016 / Reliable and e cient data transmission have been the subject of current research, most especially in realistic channels such as the Rayleigh fading channels. The focus of every new technique is to improve the transmission reliability and to increase the transmission capacity of the communication links for more information to be transmitted. Modulation schemes such as M-ary Quadrature Amplitude Modulation (M-QAM) and Orthogonal Frequency Division Multiplexing (OFDM) were developed to increase the transmission capacity of communication links without additional bandwidth expansion, and to reduce the design complexity of communication systems. On the contrary, due to the varying nature of communication channels, the message transmission reliability is subjected to a couple of factors. These factors include the channel estimation techniques and Forward Error Correction schemes (FEC) used in improving the message reliability. Innumerable channel estimation techniques have been proposed independently, and in combination with di erent FEC schemes in order to improve the message reliability. The emphasis have been to improve the channel estimation performance, bandwidth and power consumption, and the implementation time complexity of the estimation techniques. Of particular interest, FEC schemes such as Reed-Solomon (RS) codes, Turbo codes, Low Density Parity Check (LDPC) codes, Hamming codes, and Permutation codes, are proposed to improve the message transmission reliability of communication links. Turbo and LDPC codes have been used extensively to combat the varying nature of communication channels, most especially in joint iterative channel estimation and decoding receiver structures. In this thesis, attention is focused on using RS codes to improve the message reliability of a communication link because RS codes have good capability of correcting random and burst errors, and are useful in di erent wireless applications. This study concentrates on symbol level soft decision decoding of RS codes. In this regards, a novel symbol level iterative soft decision decoder for RS codes based on parity-check equations is developed. This Parity-check matrix Transformation Algorithm (PTA) is based on the soft reliability information derived from the channel output in order to perform syndrome checks in an iterative process. Performance analysis verify that this developed PTA outperforms the conventional RS hard decision decoding algorithms and the symbol level Koetter and Vardy (KV ) RS soft decision decoding algorithm. In addition, this thesis develops an improved Distance Metric (DM) method of deriving reliability information over Rayleigh fading channels for combined demodulation with symbol level RS soft decision decoding algorithms. The newly proposed DM method incorporates the channel state information in deriving the soft reliability information over Rayleigh fading channels. Analysis verify that this developed metric enhances the performance of symbol level RS soft decision decoders in comparison with the conventional method. Although, in this thesis, the performance of the developed DM method of deriving soft reliability information over Rayleigh fading channels is only veri ed for symbol level RS soft decision decoders, it is applicable to any symbol level soft decision decoding FEC scheme. Besides, the performance of the all FEC decoding schemes plummet as a result of the Rayleigh fading channels. This engender the development of joint iterative channel estimation and decoding receiver structures in order to improve the message reliability, most especially with Turbo and LDPC codes as the FEC schemes. As such, this thesis develops the rst joint iterative channel estimation and Reed- Solomon decoding receiver structure. Essentially, the joint iterative channel estimation and RS decoding receiver is developed based on the existing symbol level soft decision KV algorithm. Consequently, the joint iterative channel estimation and RS decoding receiver is extended to the developed RS parity-check matrix transformation algorithm. The PTA provides design ease and exibility, and lesser computational time complexity in an iterative receiver structure in comparison with the KV algorithm. Generally, the ndings of this thesis are relevant in improving the message transmission reliability of a communication link with RS codes. For instance, it is pertinent to numerous data transmission technologies such as Digital Audio Broadcasting (DAB), Digital Video Broadcasting (DVB), Digital Subscriber Line (DSL), WiMAX, and long distance satellite communications. Equally, the developed, less computationally intensive, and performance e cient symbol level decoding algorithm for RS codes can be use in consumer technologies like compact disc and digital versatile disc. / GS2016

In the first part of this thesis, the information capacity of time-varying fading channels is analysed using finite-state Markov channel (FSMC) models. Both fading channel amplitude and fading channel phase are modelled as finite-state Markov processes. The effect of the number of fading channel gain partitions on the capacity is studied (from 2 to 128 partitions). It is observed that the FSMC capacity is saturated when the number of fading channel gain partitions is larger than 4 to 8 times the number of channel input levels. The rapid FSMC capacity saturation with a small number of fading channel gain partitions can be used for the design of computationally simple receivers, with a negligible loss in the capacity. Furthermore, the effect of fading channel memory order on the capacity is studied (from first- to fourth-order). It is observed that low-order FSMC models can provide higher capacity estimates for fading channels than high-order FSMC models, especially when channel states are poorly observable in the presence of channel noise. To explain the effect of memory order on the FSMC capacity, the capacities of high-order and low-order FSMC models are analytically compared. It is shown that the capacity difference is caused by two factors: 1) the channel entropy difference, and 2) the channel observability difference between the high-order and low-order FSMC models. Due to the existence of the second factor, the capacity of high-order FSMC models can be lower than the capacity of low-order FSMC models. Two sufficient conditions are proven to predict when the low-order FSMC capacity is higher or lower than the high-order FSMC capacity. In the second part of this thesis, a new implicit (blind) channel estimation method in time- varying fading channels is proposed. The information source emits bits ???0??? and ???1??? with unequal probabilities. The unbalanced source distribution is used as a priori known signal structure at the receiver for channel estimation. Compared to pilot-symbol-assisted channel estimation, the proposed channel estimation technique can achieve a superior receiver bit error rate performance, especially at low signal to noise ratio conditions.

<p>Today wireless transmission of data is becoming more and more popular and the need for faster transmission rates is increasing. Since the bandwidth is limited it is important to try to use it to the fullest. CDMA is a technology that allows multiple accesses on the same frequency and time thus making it very bandwidth efficient. The CDMA technology was first introduced in the second generation’s cellular systems but has since then been improved and is reused in today’s 3G systems as Wideband CDMA. ISY is interested in getting a behavioural model of a W-CDMA system since they had developed a DSP processor called BBP1 and were thinking about adding W-CDMA support for it. Even though our system is not implemented on the BBP1 it should provide a good base for future implementations. This thesis project will describe the construction of a behavioural model of a W-CDMA system following the standard specified by 3GPP. The system simulates W-CDMA transmission and reception and has an optional channel used to simulate real world interference. The receiver uses a rake combiner to improve the performance of the system.</p>