In this paper a study of the cumulant-based blind equalization algorithms PAJOD and PAFA is conducted. Both algorithms assume that the data have been pre-whitened and hence the problem reduces to the estimation of paraunitary channels. The first contribution of this paper is an efficient implementation of the PAJOD algorithm called PAJOD2. The second contribution of this paper is a performance ...

The design of perfect reconstruction FIR multi lters is discussed in this paper. Schur algorithm is applied to factorize the polyphase matrix of multi lters into lattice blocks. The multi lters are characterized by the chain parameters in each lattice block. The complete parameterization of paraunitary multi lters and a class of biorthogonal multilters are derived. The parameterizations are min...

In this work, we have introduced a systematic design of the integerto-integer invertible quaternionic multiplier based on a generalized block-lifting structure using two alternative techniques: CORDIC architectures and distributed arithmetic (DA) as a block of M -band linear phase paraunitary filter banks LP Q-PUFB for the lossless-tolossy (L2L) image coding. The low latency separable image pro...

In this paper we introduce a novel and general matrix formulation of classical signal extension methods for subband processing of finite length signals. Considering a paraunitary 2-channel filter bank as transformation cell, this new characterization makes it possible to show that perfect reconstruction of finite signals can be ensured without resorting to extra subband samples; thus, by using ...

A DCT-based simplified general structure for linear phase paraunitary filter bank (LPPUFB) is developed recently by the preand post-processing of the DCT in the time domain. The new structure can be viewed as the dual of the generalized LOT (GenLOT). In this paper, we generalize the result to odd-channel LPPUFB and LPPUFB with pair-wise mirror image property. Design examples and their applicati...

Sampling rate conversion in multirate filter banks leads to time-varying phenomena, which differ between deterministic and stationary random signals. More specifically, downsampling causes deterministic signals to become periodically shift variant, while upsampling turns stationary random signals into cyclostationary signals. We provide criteria for the quantification of these effects, and comp...

ABSTRACT This paper presents an algorithm for designing an FIR paraunitary filter bank when one or several filters are given. The algorithm is based on the properties of the balanced state-space representation of the polyphase matrix. We show that this representation may be computed via a single RQ decomposition, thus gaining significant efficience with respect to previous work. Application of ...

In this paper, we present novel algorithms for multichannel blind deconvolution under output whitening constraints. The algorithms are inspired by recently-developed procedures for gradient adaptive paraunitary filter banks. Several algorithms are developed, including one algorithm that successfully deconvolves mixtures of arbitrary non-zero kurtosis source signals. We provide detailed local st...

Subband coders have been used in the past to dex(n) Y b ) compose a signal into subbands. The signals in each subband 4 Hi M F$’(Z) are quantized before transmission. The problem of optimal bit allocation involves allocating bits to the individual quantizers from a fixed budget so as to minimize the overall reconstruction error variance. The problem has been addressed in the past for two cases,...

We design lter banks that are best matched to input signal statistics in M-channel sub-band coders, using a rate{distortion criterion. Recent research has shown that unconstrained{ length paraunitary lter banks optimized under various energy compaction criteria are principal-component lter banks and satisfy two fundamental properties: total decorrelation and spectral majorization. We present se...