Design of overcomplete expansions for channel coding

The redundancy afforded by overcomplete expansions have been recently been considered for channel coding. In this paper, we utilise this approach in order to propose a channel coder design to for a correlated additive Gaussian noise channel, of which the noise covariance matrix is assumed to be known. We demonstrate that this approach can lead to a significant reduction of the noise interference by exploiting both the correlation of the channel and the redundancy of the filter banks. Simulation results providing some insight into these mechanisms are provided

Low-complexity high-performance GFSK receiver with carrier frequency offset correction

This paper presents an implementation of a GFSK receiver based on matched filtering of a sequence of K successive bits. This enables improved detection and superior BER performance but requires 2K matched filters of considerable complexity. Exploiting redundancy by performing phase propagation of successive single-bit stages, we propose an efficient receiver implementation. Results presented highlight the benefits of the proposed methd in terms of computational cost and performance compared to standard methods. We also address carrier frequency offset, and suggest a blind algorithm for its elimination. Performance results are exemplarily shown for a Bluetooth system

Detection of cochlear hearing loss applying wavelet packets and support vector machines

The aim of this paper is to evaluate the application of the wavelet packet transform (WP) and support vector machines (SVM) to transient evoked otoacoustic emissions (TEOAE) in order to achieve a detection of frequency-specific hearing loss. We introduce a system to determine detection rates between groups of persons with normal hearing, high frequency hearing loss, and pantonal hearing loss. The validity and use of our approach is verified on a different patient group

A new low-cost discrete bit loading using greedy power allocation

In this paper we consider a low cost bit loading based on the greedy power allocation (GPA). Compared to the standard GPA, which is optimal in terms of maximising the data throughput, three suboptimal schemes are suggested, which perform GPA on subsets of subchannels only. We demonstrate how these schemes can reduce complexity. Two of the proposed algorithms can achieve near optimal performance by including a transfer of residual power between subsets at the expense of a very small extra cost. By simulations, we show that the two near optimal schemes perform best in two separate and distinct SNR regions

A CM based equalizer for space-time spreading over channels with inter-Symbol interference

Space-time block coding (STBC) and a number of derivative techniques have been developed to maximize the diversity gain of a multi-input multi-output (MIMO) channel. This was later generalized for multi-user DS-CDMA systems through space-time spreading (STS), [3] and [4], which assumed flat fading as well as the availability of full channel state information (CSI) at the receiver. This paper focuses on the development of a blind chip-rate method for the equalization of STS over channels with inter-symbol interference (ISI). Simulation results are presented to demonstrate the convergence and noise resilience of the derived algorithm