387 research outputs found
Generalized Triangular Decomposition in Transform Coding
A general family of optimal transform coders (TCs) is introduced here based on the generalized triangular decomposition (GTD) developed by Jiang This family includes the Karhunen-Loeve transform (KLT) and the generalized version of the prediction-based lower triangular transform (PLT) introduced by Phoong and Lin as special cases. The coding gain of the entire family, with optimal bit allocation, is equal to that of the KLT and the PLT. Even though the original PLT introduced by Phoong is not applicable for vectors that are not blocked versions of scalar wide sense stationary processes, the GTD-based family includes members that are natural extensions of the PLT, and therefore also enjoy the so-called MINLAB structure of the PLT, which has the unit noise-gain property. Other special cases of the GTD-TC are the geometric mean decomposition (GMD) and the bidiagonal decomposition (BID) transform coders. The GMD-TC in particular has the property that the optimum bit allocation is a uniform allocation; this is because all its transform domain coefficients have the same variance, implying thereby that the dynamic ranges of the coefficients to be quantized are identical
Symmetric extension methods for M-channel linear-phase perfect-reconstruction filter banks
The symmetric extension method has recently been shown to be an efficient way for subband processing of finite-length sequences. This paper presents an extension of this method to general linear-phase perfect-reconstruction filter banks. We derive constraints on the length and symmetry polarity of the permissible filter banks and propose a new design algorithm. In the algorithm, different symmetric sequences are formulated in a unified form based on the circular-symmetry framework. The length constraints in symmetrically extending the input sequence and windowing the subband sequences are investigated. The effect of shifting the input sequence is included. When the algorithm is applied to equal-length filter banks, we explicitly show that symmetric extension methods can always be constructed to replace the circular convolution approach.published_or_final_versio
Recommended from our members
On designing H∞ filters with circular pole and error variance constraints
Copyright [2003] IEEE. This material is posted here with permission of the IEEE. Such permission of the IEEE does not in any way imply IEEE endorsement of any of Brunel University's products or services. Internal or personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution must be obtained from the IEEE by writing to [email protected]. By choosing to view this document, you agree to all provisions of the copyright laws protecting it.In this paper, we deal with the problem of designing a H∞ filter for discrete-time systems subject to error variance and circular pole constraints. Specifically, we aim to design a filter such that the H∞ norm of the filtering error-transfer function is not less than a given upper bound, while the poles of the filtering matrix are assigned within a prespecified circular region, and the steady-state error variance for each state is not more than the individual prespecified value. The filter design problem is formulated as an auxiliary matrix assignment problem. Both the existence condition and the explicit expression of the desired filters are then derived by using an algebraic matrix inequality approach. The proposed design algorithm is illustrated by a numerical example
Generalized Fast-Convolution-based Filtered-OFDM: Techniques and Application to 5G New Radio
This paper proposes a generalized model and methods for fast-convolution
(FC)-based waveform generation and processing with specific applications to
fifth generation new radio (5G-NR). Following the progress of 5G-NR
standardization in 3rd generation partnership project (3GPP), the main focus is
on subband-filtered cyclic prefix (CP) orthogonal frequency-division
multiplexing (OFDM) processing with specific emphasis on spectrally well
localized transmitter processing. Subband filtering is able to suppress the
interference leakage between adjacent subbands, thus supporting different
numerologies for so-called bandwidth parts as well as asynchronous multiple
access. The proposed generalized FC scheme effectively combines overlapped
block processing with time- and frequency-domain windowing to provide highly
selective subband filtering with very low intrinsic interference level. Jointly
optimized multi-window designs with different allocation sizes and design
parameters are compared in terms of interference levels and implementation
complexity. The proposed methods are shown to clearly outperform the existing
state-of-the-art windowing and filtering-based methods.Comment: To appear in IEEE Transactions on Signal Processin
Subspace-Based Blind Channel Identification for Cyclic Prefix Systems Using Few Received Blocks
In this paper, a novel generalization of subspace-based blind channel identification methods in cyclic prefix (CP) systems is proposed. For the generalization, a new system parameter called repetition index is introduced whose value is unity for previously reported special cases. By choosing a repetition index larger than unity, the number of received blocks needed for blind identification is significantly reduced compared to all previously reported methods. This feature makes the method more realistic especially in wireless environments where the channel state is usually fast-varying. Given the number of received blocks available, the minimum value of repetition index is derived. Theoretical limit allows the proposed method to perform blind identification using only three received blocks in absence of noise. In practice, the number of received blocks needed to yield a satisfactory bit-error-rate (BER) performance is usually on the order of half the block size. Simulation results not only demonstrate the capability of the algorithm to perform blind identification using fewer received blocks, but also show that in some cases system performance can be improved by choosing a repetition index larger than needed. Simulation of the proposed method over time-varying channels clearly demonstrates the improvement over previously reported methods
A new synthesis procedure for linear-phase paraunitary digital filter banks
In this paper, a new design algorithm is presented for a family of linear phase paraunitary filter banks with generalized filter length and symmetric polarity. A number of new constraints on the distributions of filter length and symmetry polarity among the channels are derived. In the algorithm, the lengths of the filters are gradually reduced through a cascade of lattice structures. The derivations for filter banks with even and odd number of channels are formulated in a unified form.published_or_final_versio
Multirate digital filters, filter banks, polyphase networks, and applications: a tutorial
Multirate digital filters and filter banks find application in communications, speech processing, image compression, antenna systems, analog voice privacy systems, and in the digital audio industry. During the last several years there has been substantial progress in multirate system research. This includes design of decimation and interpolation filters, analysis/synthesis filter banks (also called quadrature mirror filters, or QMFJ, and the development of new sampling theorems. First, the basic concepts and building blocks in multirate digital signal processing (DSPJ, including the digital polyphase representation, are reviewed. Next, recent progress as reported by several authors in this area is discussed. Several applications are described, including the following: subband coding of waveforms, voice privacy systems, integral and fractional sampling rate conversion (such as in digital audio), digital crossover networks, and multirate coding of narrow-band filter coefficients. The M-band QMF bank is discussed in considerable detail, including an analysis of various errors and imperfections. Recent techniques for perfect signal reconstruction in such systems are reviewed. The connection between QMF banks and other related topics, such as block digital filtering and periodically time-varying systems, based on a pseudo-circulant matrix framework, is covered. Unconventional applications of the polyphase concept are discussed
- …