The quaternion linear canonical transform is an important tool in applied mathematics and it closely related to the Fourier transform. In this work, using a symmetric form of two-sided (QFT), we first derive variation on Heisenberg-type uncertainty principle transformation. We then consider general It may be considered as extension Based orthogonal plane split, develop convolution theorem that ...

In this paper, the concept of canonical representation is proposed to find fuzzy roots of fuzzy polynomial equations. We transform fuzzy polynomial equations to system of crisp polynomial equations, this transformation is perform by using canonical representation based on three parameters Value, Ambiguity and Fuzziness. 

AA-LP Anti-aliasing lowpass AC3 Adaptive transform coder 3 ACR Absolute-category rating ADC Analog-to-digital converter ADPCM Adaptive differential pulse-code modulation AEC Acoustic echo cancellation / caneller AIR Acoustic impulse response ALP Adaptive lattice predictor ANC Active noise control or adaptive noise canceller AP Affine projection APC Adaptive predictive coding AR Auto-regressive ...

In this paper, a matrix form analoguous to the companion matrix which is often encountered in the theory of one dimensional (1-D) linear control systems is suggested for a class of polynomials in two indeterminates and real coefficients, here referred to as two dimensional (2-D) polynomials. These polynomials arise in the context of the theory of 2-D linear discrete control systems. Necessary a...

The most recent generalization of octonion Fourier transform (OFT) is the linear canonical (OLCT) that has become popular in present era due to its applications color image and signal processing. On other hand Wigner distribution (WD) analysis cannot be excluded. In this paper, we introduce novel integral coined as domain (WDOL). We first propose definition one dimensional WDOL (1DWDOL), extend...

This Research paper includes designing a area efficient and low error Discrete Cosine Transform. This area efficient and low error DCT is obtained by using shifters and adders in place of multipliers. The main technique used here is CSD(Canonical Sign Digit) technique.CSD technique efficiently reduces redundant bits. Pipelining technique is also introduced here which reduces the processing time.

This Research paper includes designing a area efficient and low error Discrete Cosine Transform. This area efficient and low error DCT is obtained by using shifters and adders in place of multipliers. The main technique used here is CSD (Canonical Sign Digit) technique.CSD technique efficiently reduces redundant bits. Pipelining technique is also introduced here which reduces the processing time.