Oversampling PCM techniques and optimum noise shapers for quantizing a class of nonbandlimited signals

We consider the efficient quantization of a class of nonbandlimited signals, namely, the class of discrete-time signals that can be recovered from their decimated version. The signals are modeled as the output of a single FIR interpolation filter (single band model) or, more generally, as the sum of the outputs of L FIR interpolation filters (multiband model). These nonbandlimited signals are oversampled, and it is therefore reasonable to expect that we can reap the same benefits of well-known efficient A/D techniques that apply only to bandlimited signals. We first show that we can obtain a great reduction in the quantization noise variance due to the oversampled nature of the signals. We can achieve a substantial decrease in bit rate by appropriately decimating the signals and then quantizing them. To further increase the effective quantizer resolution, noise shaping is introduced by optimizing prefilters and postfilters around the quantizer. We start with a scalar time-invariant quantizer and study two important cases of linear time invariant (LTI) filters, namely, the case where the postfilter is the inverse of the prefilter and the more general case where the postfilter is independent from the prefilter. Closed form expressions for the optimum filters and average minimum mean square error are derived in each case for both the single band and multiband models. The class of noise shaping filters and quantizers is then enlarged to include linear periodically time varying (LPTV)M filters and periodically time-varying quantizers of period M. We study two special cases in great detail

Globally optimal FIR filters with applications in source and channel coding

In this paper, we derive a novel formulation to solve an important FIR filter optimization problem. The problem has received considerable attention in the past because it appears in a wide variety of disciplines. The newly proposed method finds the globally optimal solution to the problem and provides several other advantages over previous optimization techniques

Optimum pre- and postfilters for quantization

We consider the optimization of pre- and post filters surrounding a uniform quantizer such that the mean square error due to quantization is minimized. Unlike some previous work, the postfilter is not restricted to be the inverse of the prefilter. With no order constraint on the filters, we present closed form solutions for the optimum pre- and post filters. Using these optimum solutions, we obtain a coding gain expression for the system under study. We then repeat the same analysis with first order pre- and post filters in the form 1+αz^-1 and 1/(1+γz^-1) providing some examples where we compare coding gain performance with the case of α=γ

Optimum low cost two channel IIR orthonormal filter bank

In this paper, we statistically optimize a well known class of IIR two channel orthonormal filter banks parameterized by a single coefficient when subband quantizers are present. The optimization procedure is extremely simple and very fast compared for example to the linear programming method used in the FIR case to achieve similar compaction (coding) gains. The special form of the filters assure the existence of a zero at π which can be important for some wavelet applications and eliminate some of the major concerns that arise in the FIR design case. Finally, the compaction gain obtained is high and numerically very close to two (ideal case) for low pass spectra, high pass spectra and certain cases of multiband spectra. For these cases, the use of higher order IIR filters does not increase the compaction (coding) gain

Statistically optimum pre- and postfiltering in quantization

We consider the optimization of pre- and postfilters surrounding a quantization system. The goal is to optimize the filters such that the mean square error is minimized under the key constraint that the quantization noise variance is directly proportional to the variance of the quantization system input. Unlike some previous work, the postfilter is not restricted to be the inverse of the prefilter. With no order constraint on the filters, we present closed-form solutions for the optimum pre- and postfilters when the quantization system is a uniform quantizer. Using these optimum solutions, we obtain a coding gain expression for the system under study. The coding gain expression clearly indicates that, at high bit rates, there is no loss in generality in restricting the postfilter to be the inverse of the prefilter. We then repeat the same analysis with first-order pre- and postfilters in the form 1+αz-1 and 1/(1+γz^-1 ). In specific, we study two cases: 1) FIR prefilter, IIR postfilter and 2) IIR prefilter, FIR postfilter. For each case, we obtain a mean square error expression, optimize the coefficients α and γ and provide some examples where we compare the coding gain performance with the case of α=γ. In the last section, we assume that the quantization system is an orthonormal perfect reconstruction filter bank. To apply the optimum preand postfilters derived earlier, the output of the filter bank must be wide-sense stationary WSS which, in general, is not true. We provide two theorems, each under a different set of assumptions, that guarantee the wide sense stationarity of the filter bank output. We then propose a suboptimum procedure to increase the coding gain of the orthonormal filter bank

The role of the discrete-time Kalman-Yakubovitch-Popov lemma in designing statistically optimum FIR orthonormal filter banks

We introduce a new approach to design FIR energy compaction filters of arbitrary order N. The optimization of such filters is important due to their close connection to the design of an M-channel orthonormal filter bank adapted to the input signal statistics. The novel procedure finds the optimum product filter Fopt(Z)=H opt(Z)Hopt(Z^-1) corresponding to the compaction filter Hopt(z). The idea is to express F(z) as D(z)+D(z^-1) and reformulate the compaction problem in terms of the state space realization of the causal function D(z). For a fixed input power spectrum, the resulting filter Fopt(z) is guaranteed to be a global optimum due to the convexity of the new formulation. The new design method can be solved quite efficiently and with great accuracy using recently developed interior point methods and is extremely general in the sense that it works for any chosen M and any arbitrary filter length N. Finally, obtaining Hopt(z) from F opt(z) does not require an additional spectral factorization step. The minimum phase spectral factor can be obtained automatically by relating the state space realization of Dopt(z) to that of H opt(z)

The design of optimum filters for quantizing a class of non bandlimited signals

We consider the efficient quantization of a class of non bandlimited signals, namely the class of discrete time signals that can be recovered from their decimated version. By definition, these signals are oversampled and it is reasonable to expect that we can reap the same benefits of well known efficient A/D conversion techniques. Indeed, by using appropriate multirate reconstruction schemes, we first show that we can obtain a great reduction in the quantization noise variance due to the oversampled nature of the signals. To further increase the effective quantizer resolution, noise shaping is introduced by optimizing linear time invariant (LTI) and linear periodically time varying (LPTV)M pre- and post-filters around the quantizer. Closed form expressions for the optimum filters and the minimum mean squared error are derived for each case

Electrical writing, deleting, reading, and moving of magnetic skyrmioniums in a racetrack device

A magnetic skyrmionium (also called 2$\pi$-skyrmion) can be understood as a skyrmion - a topologically non-trivial magnetic whirl - which is situated in the center of a second skyrmion with reversed magnetization. Here, we propose a new optoelectrical writing and deleting mechanism for skyrmioniums in thin films, as well as a reading mechanism based on the topological Hall voltage. Furthermore, we point out advantages for utilizing skyrmioniums as carriers of information in comparison to skyrmions with respect to the current-driven motion. We simulate all four constituents of an operating skyrmionium-based racetrack storage device: creation, motion, detection and deletion of bits. The existence of a skyrmionium is thereby interpreted as a '1' and its absence as a '0' bit.Comment: This is a post-peer-review, pre-copyedit version of an article published in Scientific Reports. The final authenticated version is available online at [DOI

Analysis of hybrid relaying in cooperative WLAN

An ever-growing demand for higher data-rates has facilitated the growth of wireless networks in the past decades. Nevertheless, wireless technologies face performance limitations due to unstable wireless conditions and mobility of devices. In face of multi-path propagation and low data-rate stations, cooperative relaying promises gains in performance and reliability. However, cooperation procedures are unstable and introduce overhead that can endanger performance. In this paper we analyze the performance of a hybrid relaying protocol build based on the combination of opportunistic and broadcast-based relaying approaches. Hybrid relaying aims to increase the transmission capacity of wireless networks (proactive operation) when compared to proactive opportunistic and broadcast-based approaches due to rectifying the setbacks involved in those approaches, while adding a reactive approach to recover from failed transmissions. © 2013 IEEE