595 research outputs found

    Hybrid solutions to instantaneous MIMO blind separation and decoding: narrowband, QAM and square cases

    Get PDF
    Future wireless communication systems are desired to support high data rates and high quality transmission when considering the growing multimedia applications. Increasing the channel throughput leads to the multiple input and multiple output and blind equalization techniques in recent years. Thereby blind MIMO equalization has attracted a great interest.Both system performance and computational complexities play important roles in real time communications. Reducing the computational load and providing accurate performances are the main challenges in present systems. In this thesis, a hybrid method which can provide an affordable complexity with good performance for Blind Equalization in large constellation MIMO systems is proposed first. Saving computational cost happens both in the signal sep- aration part and in signal detection part. First, based on Quadrature amplitude modulation signal characteristics, an efficient and simple nonlinear function for the Independent Compo- nent Analysis is introduced. Second, using the idea of the sphere decoding, we choose the soft information of channels in a sphere, and overcome the so- called curse of dimensionality of the Expectation Maximization (EM) algorithm and enhance the final results simultaneously. Mathematically, we demonstrate in the digital communication cases, the EM algorithm shows Newton -like convergence.Despite the widespread use of forward -error coding (FEC), most multiple input multiple output (MIMO) blind channel estimation techniques ignore its presence, and instead make the sim- plifying assumption that the transmitted symbols are uncoded. However, FEC induces code structure in the transmitted sequence that can be exploited to improve blind MIMO channel estimates. In final part of this work, we exploit the iterative channel estimation and decoding performance for blind MIMO equalization. Experiments show the improvements achievable by exploiting the existence of coding structures and that it can access the performance of a BCJR equalizer with perfect channel information in a reasonable SNR range. All results are confirmed experimentally for the example of blind equalization in block fading MIMO systems

    A Comprehensive Review on Various Estimation Techniques for Multi Input Multi Output Channel

    Get PDF
    لقد تطورت مشكلة تقدير القناة اللاسلكية بسبب بعض التأثيرات غير المرغوب فيها للخواص الفيزيائية للقناة على الإشارات المرسلة. في نهاية المستقبل، التشوه، والتأخير، والتوهين، والتداخلات، ونوبات الطور هي أكثر المشكلات التي تواجهها مع الإشارات المستقبلة. من أجل التغلب على تأثيرات القناة وتوفير جودة كاملة تقريبًا لنقل البيانات، يلزم تقدير معلومات القناة. في أنظمة المخرجات متعددة المدخلات والمخرجات (MIMO)، يعتبر تقدير القناة خطوة أكثر تعقيدًا مقارنة بأنظمة المخرجات ذات المدخلات المفردة، SISO، نظرًا لأن عدد القنوات الفرعية التي تحتاج إلى تقدير أكبر بكثير من انظمة SISO. الهدف الأساسي من هذه الورقة البحثية هو مراجعة شاملة لاغلب الخوارزميات الشهيرة والفعالة التي تم ابتكارها لحل مشكلة تقدير قناة MIMO في أنظمة الاتصالات اللاسلكية. في هذه الورقة، تم تصنيف هذه التقنيات إلى ثلاث مجموعات: غير المكفوفين، شبه الأعمى وتقدير أعمى. لكل مجموعة، يتم تقديم توضيح مختصر لخوارزميات التقدير المألوفة. وأخيرًا، نقارن بين هذه التقنيات استنادًا إلى التعقيد الحسابي والكمون ودقة التقدير.The problem of wireless channel estimation has been evolving due to some undesirable effects of channel physical properties on transmitted signals. At the receiver end, distortions, delays, attenuations, interferences, and phase shifts are the most issues encounter together with the received signals. In order to overcome channel effects and provide almost a perfect quality of data transmission, channel parameter estimation is needed. In Multiple Input-Multiple Output systems (MIMO), channel estimation is a more complicated step as compared with the Single Input-Single Output systems, SISO, because of the fact that the number of sub-channels that needs estimate is much greater than SISO systems. The fundamental objective of this research paper is to go over the famous and efficient algorithms that have been innovated to solve the problem of MIMO channel estimation in wireless communication systems. In this paper, these techniques have been classified into three groups: non-blind, semi-blind and blind estimation. For each group, a brief illustration is presented for familiar estimation algorithms. Finally, we compare between these techniques based on computational complexity, latency and estimation accuracy

    Complex Independent Component Analysis of Frequency-Domain Electroencephalographic Data

    Full text link
    Independent component analysis (ICA) has proven useful for modeling brain and electroencephalographic (EEG) data. Here, we present a new, generalized method to better capture the dynamics of brain signals than previous ICA algorithms. We regard EEG sources as eliciting spatio-temporal activity patterns, corresponding to, e.g., trajectories of activation propagating across cortex. This leads to a model of convolutive signal superposition, in contrast with the commonly used instantaneous mixing model. In the frequency-domain, convolutive mixing is equivalent to multiplicative mixing of complex signal sources within distinct spectral bands. We decompose the recorded spectral-domain signals into independent components by a complex infomax ICA algorithm. First results from a visual attention EEG experiment exhibit (1) sources of spatio-temporal dynamics in the data, (2) links to subject behavior, (3) sources with a limited spectral extent, and (4) a higher degree of independence compared to sources derived by standard ICA.Comment: 21 pages, 11 figures. Added final journal reference, fixed minor typo

    Efficient methodologies for real-time image restoration

    No full text
    In this thesis we investigate the problem of image restoration. The main focus of our research is to come up with novel algorithms and enhance existing techniques in order to deliver efficient and effective methodologies, applicable in real-time image restoration scenarios. Our research starts with a literature review, which identifies the gaps in existing techniques and helps us to come up with a novel classification on image restoration, which integrates and discusses more recent developments in the area of image restoration. With this novel classification, we identified three major areas which need our attention. The first developments relate to non-blind image restoration. The two mostly used techniques, namely deterministic linear algorithms and stochastic nonlinear algorithms are compared and contrasted. Under deterministic linear algorithms, we develop a class of more effective novel quadratic linear regularization models, which outperform the existing linear regularization models. In addition, by looking in a new perspective, we evaluate and compare the performance of deterministic and stochastic restoration algorithms and explore the validity of the performance claims made so far on those algorithms. Further, we critically challenge the ne- cessity of some complex mechanisms in Maximum A Posteriori (MAP) technique under stochastic image deconvolution algorithms. The next developments are focussed in blind image restoration, which is claimed to be more challenging. Constant Modulus Algorithm (CMA) is one of the most popular, computationally simple, tested and best performing blind equalization algorithms in the signal processing domain. In our research, we extend the use of CMA in image restoration and develop a broad class of blind image deconvolution algorithms, in particular algorithms for blurring kernels with a separable property. These algorithms show significantly faster convergence than conventional algorithms. Although CMA method has a proven record in signal processing applications related to data communications systems, no research has been carried out to the investigation of the applicability of CMA for image restoration in practice. In filling this gap and taking into account the differences of signal processing in im- age processing and data communications contexts, we extend our research on the applicability of CMA deconvolution under the assumptions on the ground truth image properties. Through analyzing the main assumptions of ground truth image properties being zero-mean, independent and uniformly distributed, which char- acterize the convergence of CMA deconvolution, we develop a novel technique to overcome the effects of image source correlation based on segmentation and higher order moments of the source. Multichannel image restoration techniques recently gained much attention over the single channel image restoration due to the benefits of diversity and redundancy of the information between the channels. Exploiting these benefits in real time applications is often restricted due to the unavailability of multiple copies of the same image. In order to overcome this limitation, as the last area of our research, we develop a novel multichannel blind restoration model with a single image, which eliminates the constraint of the necessity of multiple copies of the blurred image. We consider this as a major contribution which could be extended to wider areas of research integrated with multiple disciplines such as demosaicing

    Convolutive Blind Source Separation Methods

    Get PDF
    In this chapter, we provide an overview of existing algorithms for blind source separation of convolutive audio mixtures. We provide a taxonomy, wherein many of the existing algorithms can be organized, and we present published results from those algorithms that have been applied to real-world audio separation tasks

    Novel Complex Adaptive Signal Processing Techniques Employing Optimally Derived Time-varying Convergence Factors With Applicatio

    Get PDF
    In digital signal processing in general, and wireless communications in particular, the increased usage of complex signal representations, and spectrally efficient complex modulation schemes such as QPSK and QAM has necessitated the need for efficient and fast-converging complex digital signal processing techniques. In this research, novel complex adaptive digital signal processing techniques are presented, which derive optimal convergence factors or step sizes for adjusting the adaptive system coefficients at each iteration. In addition, the real and imaginary components of the complex signal and complex adaptive filter coefficients are treated as separate entities, and are independently updated. As a result, the developed methods efficiently utilize the degrees of freedom of the adaptive system, thereby exhibiting improved convergence characteristics, even in dynamic environments. In wireless communications, acceptable co-channel, adjacent channel, and image interference rejection is often one of the most critical requirements for a receiver. In this regard, the fixed-point complex Independent Component Analysis (ICA) algorithm, called Complex FastICA, has been previously applied to realize digital blind interference suppression in stationary or slow fading environments. However, under dynamic flat fading channel conditions frequently encountered in practice, the performance of the Complex FastICA is significantly degraded. In this dissertation, novel complex block adaptive ICA algorithms employing optimal convergence factors are presented, which exhibit superior convergence speed and accuracy in time-varying flat fading channels, as compared to the Complex FastICA algorithm. The proposed algorithms are called Complex IA-ICA, Complex OBA-ICA, and Complex CBC-ICA. For adaptive filtering applications, the Complex Least Mean Square algorithm (Complex LMS) has been widely used in both block and sequential form, due to its computational simplicity. However, the main drawback of the Complex LMS algorithm is its slow convergence and dependence on the choice of the convergence factor. In this research, novel block and sequential based algorithms for complex adaptive digital filtering are presented, which overcome the inherent limitations of the existing Complex LMS. The block adaptive algorithms are called Complex OBA-LMS and Complex OBAI-LMS, and their sequential versions are named Complex HA-LMS and Complex IA-LMS, respectively. The performance of the developed techniques is tested in various adaptive filtering applications, such as channel estimation, and adaptive beamforming. The combination of Orthogonal Frequency Division Multiplexing (OFDM) and the Multiple-Input-Multiple-Output (MIMO) technique is being increasingly employed for broadband wireless systems operating in frequency selective channels. However, MIMO-OFDM systems are extremely sensitive to Intercarrier Interference (ICI), caused by Carrier Frequency Offset (CFO) between local oscillators in the transmitter and the receiver. This results in crosstalk between the various OFDM subcarriers resulting in severe deterioration in performance. In order to mitigate this problem, the previously proposed Complex OBA-ICA algorithm is employed to recover user signals in the presence of ICI and channel induced mixing. The effectiveness of the Complex OBA-ICA method in performing ICI mitigation and signal separation is tested for various values of CFO, rate of channel variation, and Signal to Noise Ratio (SNR)

    A Survey of Blind Modulation Classification Techniques for OFDM Signals

    Get PDF
    Blind modulation classification (MC) is an integral part of designing an adaptive or intelligent transceiver for future wireless communications. Blind MC has several applications in the adaptive and automated systems of sixth generation (6G) communications to improve spectral efficiency and power efficiency, and reduce latency. It will become a integral part of intelligent software-defined radios (SDR) for future communication. In this paper, we provide various MC techniques for orthogonal frequency division multiplexing (OFDM) signals in a systematic way. We focus on the most widely used statistical and machine learning (ML) models and emphasize their advantages and limitations. The statistical-based blind MC includes likelihood-based (LB), maximum a posteriori (MAP) and feature-based methods (FB). The ML-based automated MC includes k-nearest neighbors (KNN), support vector machine (SVM), decision trees (DTs), convolutional neural networks (CNNs), recurrent neural networks (RNNs), and long short-term memory (LSTM) based MC methods. This survey will help the reader to understand the main characteristics of each technique, their advantages and disadvantages. We have also simulated some primary methods, i.e., statistical- and ML-based algorithms, under various constraints, which allows a fair comparison among different methodologies. The overall system performance in terms bit error rate (BER) in the presence of MC is also provided. We also provide a survey of some practical experiment works carried out through National Instrument hardware over an indoor propagation environment. In the end, open problems and possible directions for blind MC research are briefly discussed
    corecore