1 |
New techniques for adaptive equalisationFarahati, Nader January 1988 (has links)
No description available.
|
2 |
Frequency hopping data transmission at high frequencyWong, S. W. January 1985 (has links)
No description available.
|
3 |
Multiprocessor architectures for local area networksLaouar, El Hadi January 1990 (has links)
No description available.
|
4 |
Optimization of decoding procedures for convolutional codesNg, W-H. January 1978 (has links)
No description available.
|
5 |
A time spread diversity technique with integrated coding and interference cancellationSwanepoel, Stefanus Arnoldus 11 November 2005 (has links)
Conventional signal diversity techniques increase system complexity and/or result in an increase in the required signal bandwidth. A novel Time Spread (TS) diversity technique has been proposed in [1] aimed at improving the performance of digital communication systems in flat-fading channels without increasing their complexity or bandwidth usage. With TS, time diversity is obtained by transmitting a modulated spreading sequence, spanning over a temporal period longer than the channel coherence time Tc, for each information symbol. Unfortunately, this TS technique exhibits a Bit Error Rate (BER) performance floor at higher SNR values that renders the original technique less attractive. This dissertation is primarily concerned with the nullification of this BER performance floor. Sec¬ondly, the ability of the TS technique to transform a flat-fading channel into an Additive White Gaus¬sian Noise (AWGN) channel is investigated and exploited to enhance the performance of coding techniques designed for AWGN channels, when used in flat-fading channels. A new method is described by which TS sequences can be temporally expanded, thereby increas¬ing their obtainable time diversity gains. This method also reduces the computational complexity of a TS system, while retaining the signal diversity properties of a longer non-expanded sequence. The BER floor in TS systems is caused by the distortion of the Aperiodic Auto-Correlation (AAC) properties of overlapping spreading sequences in fading channels, resulting in Inter Code(Sequence) Interference (ICI) between spreading sequences. A Pilot Symbol Aided Modulation (PSAM) tech¬nique is adapted for the TS system to provide accurate channel estimates required by the Inter Code(Sequence) Interference Cancellation (lCIC) module. A hybrid ICIC technique, which corrects the fading TS symbol amplitudes during periods of above average instantaneous SNR levels, is shown to be the most effective. This ICIC technique enables the TS technique to provide gains similar to that of conventional third order diversity techniques at average Eb/ No ratios above 10 dB. Finally, the transparency and ability of the TS technique to transform fading channels into Gaus¬sian channels are exploited to allow the integration of conventional convolutional codes with the TS system. The coded TS system achieves substantial gains when operating in a Rayleigh flat-fading channel when a soft decision Viterbi decoder is used in the TS receiver. A strategy by which Turbo Code (TC) techniques can be integrated with the TS technique is discussed as a concluding notion to illustrate the flexibility of the TS technique. Future research areas are identified based on the findings of this dissertation. These include the investigation of more effective adaptive ICIC schemes and the possibility of using Code Division Multiple Access (CDMA) communication techniques over a narrow band channel by employing TS- and Multi-User (MU)-detection methods, combined with existing ICIC techniques. The cryptographic value of the TS technique also provides ground for future research. / Dissertation (MEng (Electronic Engineering))--University of Pretoria, 2006. / Electrical, Electronic and Computer Engineering / unrestricted
|
6 |
Estimation of Wordlengths for Fixed-Point Implementations using Polynomial Chaos ExpansionsRahman, Mushfiqur January 2023 (has links)
Due to advances in digital computing much of the baseband signal processing of a communication system has moved into the digital domain from the analog domain. Within the domain of digital communication systems, Software Defined Radios (SDRs) allow for majority of the signal processing tasks to be implemented in reconfigurable digital hardware. However this comes at a cost of higher power and resource requirements. Therefore, highly efficient custom hardware implementations for SDRs are needed to make SDRs feasible for practical use.
Efficient custom hardware motivates the use of fixed point arithmetic in the implementation of Digital Signal Processing (DSP) algorithms. This conversion to finite precision arithmetic introduces quantization noise in the system, which significantly affects the performance metrics of the system. As a result, characterizing quantization noise and its effects within a DSP system is an important challenge that needs to be addressed. Current models to do so significantly over-estimate the quantization effects, resulting in an over-allocation of hardware resources to implement a system.
Polynomial Chaos Expansion (PCE) is a method that is currently gaining attention in modelling uncertainty in engineering systems. Although it has been used to analyze quantization effects in DSP systems, previous investigations have been limited to simple examples. The purpose of this thesis is to therefore introduce new techniques that allow the application of PCE to be scaled up to larger DSP blocks with many noise sources. Additionally, the thesis introduces design space exploration algorithms that leverage the accuracy of PCE simulations to estimate bitwidths for fixed point implementations of DSP systems. The advantages of using PCE over current modelling techniques will be presented though its application to case studies relevant to practice. These case studies include Sine Generators, Infinite Impulse Response (IIR) filters, Finite Impulse Response (FIR) filters, FM demodulators and Phase Locked Loops (PLLs). / Thesis / Master of Applied Science (MASc)
|
Page generated in 0.1265 seconds