Fractional biorthogonal partners in channel equalization and signal interpolation

The concept of biorthogonal partners has been introduced recently by the authors. The work presented here is an extension of some of these results to the case where the upsampling and downsampling ratios are not integers but rational numbers, hence, the name fractional biorthogonal partners. The conditions for the existence of stable and of finite impulse response (FIR) fractional biorthogonal partners are derived. It is also shown that the FIR solutions (when they exist) are not unique. This property is further explored in one of the applications of fractional biorthogonal partners, namely, the fractionally spaced equalization in digital communications. The goal is to construct zero-forcing equalizers (ZFEs) that also combat the channel noise. The performance of these equalizers is assessed through computer simulations. Another application considered is the all-FIR interpolation technique with the minimum amount of oversampling required in the input signal. We also consider the extension of the least squares approximation problem to the setting of fractional biorthogonal partners

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

Equalization with oversampling in multiuser CDMA systems

Some of the major challenges in the design of new-generation wireless mobile systems are the suppression of multiuser interference (MUI) and inter-symbol interference (ISI) within a single user created by the multipath propagation. Both of these problems were addressed successfully in a recent design of A Mutually Orthogonal Usercode-Receiver (AMOUR) for asynchronous or quasisynchronous code division multiple access (CDMA) systems. AMOUR converts a multiuser CDMA system into parallel single-user systems regardless of the multipath and guarantees ISI mitigation, irrespective of the channel locations. However, the noise amplification at the receiver can be significant in some multipath channels. In this paper, we propose to oversample the received signal as a way of improving the performance of AMOUR systems. We design Fractionally Spaced AMOUR (FSAMOUR) receivers with integral and rational amounts of oversampling and compare their performance with the conventional method. An important point that is often overlooked in the design of zero-forcing channel equalizers is that sometimes, they are not unique. This becomes especially significant in multiuser applications where, as we will show, the nonuniqueness is practically guaranteed. We exploit this flexibility in the design of AMOUR and FSAMOUR receivers and achieve noticeable improvements in performance

Biorthogonal partners and applications

Two digital filters H(z) and F(z) are said to be biorthogonal partners of each other if their cascade H(z)F(z) satisfies the Nyquist or zero-crossing property. Biorthogonal partners arise in many different contexts such as filterbank theory, exact and least squares digital interpolation, and multiresolution theory. They also play a central role in the theory of equalization, especially, fractionally spaced equalizers in digital communications. We first develop several theoretical properties of biorthogonal partners. We also develop conditions for the existence of biorthogonal partners and FIR biorthogonal pairs and establish the connections to the Riesz basis property. We then explain how these results play a role in many of the above-mentioned applications

Oversampling in shift-invariant spaces with a rational sampling period

8 pages, no figures.It is well known that, under appropriate hypotheses, a sampling formula allows us to recover any function in a principal shift-invariant space from its samples taken with sampling period one. Whenever the generator of the shift-invariant space satisfies the Strang-Fix conditions of order r, this formula also provides an approximation scheme of order r valid for smooth functions. In this paper we obtain sampling formulas sharing the same features by using a rational sampling period less than one. With the use of this oversampling technique, there is not one but an infinite number of sampling formulas. Whenever the generator has compact support, among these formulas it is possible to find one whose associated reconstruction functions have also compact support.This work has been supported by the Grant MTM2009-08345 from the D.G.I. of the Spanish Ministerio de Ciencia y Tecnología

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

Generic Feasibility of Perfect Reconstruction with Short FIR Filters in Multi-channel Systems

We study the feasibility of short finite impulse response (FIR) synthesis for perfect reconstruction (PR) in generic FIR filter banks. Among all PR synthesis banks, we focus on the one with the minimum filter length. For filter banks with oversampling factors of at least two, we provide prescriptions for the shortest filter length of the synthesis bank that would guarantee PR almost surely. The prescribed length is as short or shorter than the analysis filters and has an approximate inverse relationship with the oversampling factor. Our results are in form of necessary and sufficient statements that hold generically, hence only fail for elaborately-designed nongeneric examples. We provide extensive numerical verification of the theoretical results and demonstrate that the gap between the derived filter length prescriptions and the true minimum is small. The results have potential applications in synthesis FB design problems, where the analysis bank is given, and for analysis of fundamental limitations in blind signals reconstruction from data collected by unknown subsampled multi-channel systems.Comment: Manuscript submitted to IEEE Transactions on Signal Processin

Characterization and computation of canonical tight windows for Gabor frames

Let $(g_{nm})_{n,m\in Z}$ be a Gabor frame for $L_2(R)$ for given window $g$. We show that the window $h^0=S^{-1/2} g$ that generates the canonically associated tight Gabor frame minimizes $\|g-h\|$ among all windows $h$ generating a normalized tight Gabor frame. We present and prove versions of this result in the time domain, the frequency domain, the time-frequency domain, and the Zak transform domain, where in each domain the canonical $h^0$ is expressed using functional calculus for Gabor frame operators. Furthermore, we derive a Wiener-Levy type theorem for rationally oversampled Gabor frames. Finally, a Newton-type method for a fast numerical calculation of \ho is presented. We analyze the convergence behavior of this method and demonstrate the efficiency of the proposed algorithm by some numerical examples

Optimum quantization of a class of non-bandlimited signals

We consider the quantization of a special class of non bandlimited signals, namely the class of discrete time signals that can be recovered from their decimated version. Similar to sigma-delta modulation ideas, we show that we can obtain a great reduction in the quantization noise variance due to the oversampled nature of these signals. We then consider noise shaping by optimizing a pre- and post filter around the quantizer and develop a closed form expression for the coding gain of the scheme under study. The use of an orthonormal filter bank as a sophisticated quantizer is investigated and several examples are provided

A matrix pencil approach to the existence of compactly supported reconstruction functions in average sampling

The aim of this work is to solve a question raised for average sampling in shift-invariant spaces by using the well-known matrix pencil theory. In many common situations in sampling theory, the available data are samples of some convolution operator acting on the function itself: this leads to the problem of average sampling, also known as generalized sampling. In this paper we deal with the existence of a sampling formula involving these samples and having reconstruction functions with compact support. Thus, low computational complexity is involved and truncation errors are avoided. In practice, it is accomplished by means of a FIR filter bank. An answer is given in the light of the generalized sampling theory by using the oversampling technique: more samples than strictly necessary are used. The original problem reduces to finding a polynomial left inverse of a polynomial matrix intimately related to the sampling problem which, for a suitable choice of the sampling period, becomes a matrix pencil. This matrix pencil approach allows us to obtain a practical method for computing the compactly supported reconstruction functions for the important case where the oversampling rate is minimum. Moreover, the optimality of the obtained solution is established