The discrete Laguerre transform: derivation and applications

نویسندگان

  • Giridhar D. Mandyam
  • Nasir Ahmed
چکیده

The discrete Laguerre transform (DLT) belongs to the family of unitary transforms known as Gauss-Jacobi transforms. Using classical methodology, the DLT is derived from the orthonormal set of Laguerre functions. By examining the basis vectors of the transform matrix, the types of signals that can be best represented by the DLT are determined. Simulation results are used to compare the DLT's e ectiveness in representing such signals to that of other available transforms in applications such as data compression and transform-domain adaptive lters.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Application of Laguerre functions to data compression

Abstrakt This article deals with the use of the Laguerre functions in the data compression. After the short introduction the definition of the Laguerre polynomials and functions is given. The application of the discrete Laguerre transform on the data compression is shown. It is pointed out that the discrete Laguerre transform can give better results than the discrete cosine transform in the tas...

متن کامل

Efficient implementation of discrete Pascal transform using difference operators

Introduction: Transformations are vital to any engineering subject, in particular, to electrical engineering. Fourier series, Laplace transform, Fourier transform and their counterparts in the discrete-time domain, are the fundamental tools for signal processing, communication and control engineering. Recently, the discrete Pascal transform (DPT) has been introduced to process discrete signals ...

متن کامل

Developing And Comparing Numerical Methods For Computing The Inverse Fourier Transform

Computing the Fourier transform and its inverse is important in many applications of mathematics, such as frequency analysis, signal modulation, and filtering. Two methods will be derived for numerically computing the inverse Fourier transforms, and they will be compared to the standard inverse discrete Fourier transform (IDFT) method. The first computes the inverse Fourier transform through di...

متن کامل

Extended Jacobi and Laguerre Functions and their Applications

The aim of this paper is to introduce two new extensions of the Jacobi and Laguerre polynomials as the eigenfunctions of two non-classical Sturm-Liouville problems. We prove some important properties of these operators such as: These sets of functions are orthogonal with respect to a positive de nite inner product de ned over the compact intervals [-1, 1] and [0,1), respectively and also th...

متن کامل

A general construction of Reed-Solomon codes based on generalized discrete Fourier transform

In this paper, we employ the concept of the Generalized Discrete Fourier Transform, which in turn relies on the Hasse derivative of polynomials, to give a general construction of Reed-Solomon codes over Galois fields of characteristic not necessarily co-prime with the length of the code. The constructed linear codes  enjoy nice algebraic properties just as the classic one.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • IEEE Trans. Signal Processing

دوره 44  شماره 

صفحات  -

تاریخ انتشار 1996