Efficient compression of motion compensated residuals

EThOS - Electronic Theses Online ServiceGBUnited Kingdo

Enhanced Air-Interfaces for Fifth Generation Mobile Broadband Communication

In broadband wireless multicarrier communication systems, intersymbol interference (ISI) and intercarrier interference (ICI) should be reduced. In orthogonal frequency division multiplexing (OFDM), the cyclic prefix (CP) guarantees to reduce the ISI interference. However, the CP reduces spectral and power efficiency. In this thesis, iterative interference cancellation (IIC) with iterative decoding is used to reduce ISI and ICI from the received signal in multicarrier modulation (MCM) systems. Alternative schemes as well as OFDM with insufficient CP are considered; filter bank multicarrier (FBMC/Offset QAM) and discrete wavelet transform based multicarrier modulation (DWT-MCM). IIC is applied in these different schemes. The required components are calculated from either the hard decision of the demapper output or the estimated decoded signal. These components are used to improve the received signal. Channel estimation and data detection are very important parts of the receiver design of the wireless communication systems. Iterative channel estimation using Wiener filter channel estimation with known pilots and IIC is used to estimate and improve data detection. Scattered and interference approximation method (IAM) preamble pilot are using to calculate the estimated values of the channel coefficients. The estimated soft decoded symbols with pilot are used to reduce the ICI and ISI and improve the channel estimation. The combination of Multi-Input Multi-Output MIMO and OFDM enhances the air-interface for the wireless communication system. In a MIMO-MCM scheme, IIC and MIMO-IIC-based successive interference cancellation (SIC) are proposed to reduce the ICI/ISI and cross interference to a given antenna from the signal transmitted from the target and the other antenna respectively. The number of iterations required can be calculated by analysing the convergence of the IIC with the help of EXtrinsic Information Transfer (EXIT) charts. A new EXIT approach is proposed to provide a means to define performance for a given outage probability on quasi-static channels

A compressed sensing approach to block-iterative equalization: connections and applications to radar imaging reconstruction

The widespread of underdetermined systems has brought forth a variety of new algorithmic solutions, which capitalize on the Compressed Sensing (CS) of sparse data. While well known greedy or iterative threshold type of CS recursions take the form of an adaptive filter followed by a proximal operator, this is no different in spirit from the role of block iterative decision-feedback equalizers (BI-DFE), where structure is roughly exploited by the signal constellation slicer. By taking advantage of the intrinsic sparsity of signal modulations in a communications scenario, the concept of interblock interference (IBI) can be approached more cunningly in light of CS concepts, whereby the optimal feedback of detected symbols is devised adaptively. The new DFE takes the form of a more efficient re-estimation scheme, proposed under recursive-least-squares based adaptations. Whenever suitable, these recursions are derived under a reduced-complexity, widely-linear formulation, which further reduces the minimum-mean-square-error (MMSE) in comparison with traditional strictly-linear approaches. Besides maximizing system throughput, the new algorithms exhibit significantly higher performance when compared to existing methods. Our reasoning will also show that a properly formulated BI-DFE turns out to be a powerful CS algorithm itself. A new algorithm, referred to as CS-Block DFE (CS-BDFE) exhibits improved convergence and detection when compared to first order methods, thus outperforming the state-of-the-art Complex Approximate Message Passing (CAMP) recursions. The merits of the new recursions are illustrated under a novel 3D MIMO Radar formulation, where the CAMP algorithm is shown to fail with respect to important performance measures.A proliferação de sistemas sub-determinados trouxe a tona uma gama de novas soluções algorítmicas, baseadas no sensoriamento compressivo (CS) de dados esparsos. As recursões do tipo greedy e de limitação iterativa para CS se apresentam comumente como um filtro adaptativo seguido de um operador proximal, não muito diferente dos equalizadores de realimentação de decisão iterativos em blocos (BI-DFE), em que um decisor explora a estrutura do sinal de constelação. A partir da esparsidade intrínseca presente na modulação de sinais no contexto de comunicações, a interferência entre blocos (IBI) pode ser abordada utilizando-se o conceito de CS, onde a realimentação ótima de símbolos detectados é realizada de forma adaptativa. O novo DFE se apresenta como um esquema mais eficiente de reestimação, baseado na atualização por mínimos quadrados recursivos (RLS). Sempre que possível estas recursões são propostas via formulação linear no sentido amplo, o que reduz ainda mais o erro médio quadrático mínimo (MMSE) em comparação com abordagens tradicionais. Além de maximizar a taxa de transferência de informação, o novo algoritmo exibe um desempenho significativamente superior quando comparado aos métodos existentes. Também mostraremos que um equalizador BI-DFE formulado adequadamente se torna um poderoso algoritmo de CS. O novo algoritmo CS-BDFE apresenta convergência e detecção aprimoradas, quando comparado a métodos de primeira ordem, superando as recursões de Passagem de Mensagem Aproximada para Complexos (CAMP). Os méritos das novas recursões são ilustrados através de um modelo tridimensional para radares MIMO recentemente proposto, onde o algoritmo CAMP falha em aspectos importantes de medidas de desempenho

Characterization of neurological disorders using evolutionary algorithms

The life expectancy increasing, in the last few decades, leads to a large diffusion of neurodegenerative age-related diseases such as Parkinson’s disease. Neurodegenerative diseases are part of the huge category of neurological disorders, which comprises all the disorders affecting the central nervous system. These conditions have a terrible impact on life quality of both patients and their families, but also on the costs associated to the society for their diagnosis and management. In order to reduce their impact on individuals and society, new better strategies for the diagnosis and monitoring of neurological disorders need to be considered. The main aim of this study is investigating the use of artificial intelligence techniques as a tool to help the doctors in the diagnosis and the monitoring of two specific neurological disorders (Parkinson’s disease and dystonia), for which no objective clinical assessments exist. The evolutionary algorithms are chosen as the artificial intelligence technique to evolve the best classifiers. The classifiers evolved by the chosen technique are then compared with those evolved by two popular well-known techniques: artificial neural network and support vector machine. All the evolved classifiers are not only able to distinguish among patients and healthy subjects but also among different subgroups of patients. For Parkinson’s disease: two different cognitive impairment subgroups of patients are considered, with the aim of an early diagnosis and a better monitoring. For dystonia: two kinds of dystonia patients are considered (organic and functional) to have a better insight in the division of the two groups. The results obtained for Parkinson’s disease are encouraging and evidenced some differences among the cognitive impairment subgroups. Dystonia results are not satisfactory at this stage, but the study presents some limitations that could be overcome in future work

Journal of Telecommunications and Information Technology, 2001, nr 3

kwartalni