The Hartley Transform in a Finite Field
نویسندگان
چکیده
In this paper, the k-trigonometric functions over the Galois Field GF(q) are introduced and their main properties derived. This leads to the definition of the cask(.) function over GF(q), which in turn leads to a finite field Hartley Transform . The main properties of this new discrete transform are presented and areas for possible applications are mentioned.
منابع مشابه
Harmonic Modeling of Inrush Current in Core Type Power Transformers Using Hartley Transform
This paper presents a new method for evaluation and simulation of inrush current in various transformers using operational matrices and Hartley transform. Unlike most of the previous works, time and frequency domain calculations are conducted simultaneously. Mathematical equations are first represented to compute the inrush current based on reiteration and then Hartley transform is used to stud...
متن کاملGENERATION OF MULTIPLE SPECTRUM-COMPATIBLE ARTIFICIAL EARTHQUAKE ACCELEGRAMS WITH HARTLEY TRANSFORM AND RBF NEURAL NETWORK
The Hartley transform, a real-valued alternative to the complex Fourier transform, is presented as an efficient tool for the analysis and simulation of earthquake accelerograms. This paper is introduced a novel method based on discrete Hartley transform (DHT) and radial basis function (RBF) neural network for generation of artificial earthquake accelerograms from specific target spectrums. Acce...
متن کاملOn Galois-Division Multiple Access Systems: Figures of Merit and Performance Evaluation
A new approach to multiple access based on finite field transforms is investigated. These schemes, termed Galois-Division Multiple Access (GDMA), offer compact bandwidth requirements. A new digital transform, the Finite Field Hartley Transform (FFHT) requires to deal with fields of characteristic p, p 2. A binary-to-p-ary (p 2) mapping based on the opportunistic secondary channel is introdu...
متن کاملHartley transforms over finite fields
A general f ramework is presented for constructing transforms in the field of the input which have a convolutionlike property. The construction is carried out over finite fields, but is shown to be valid over the real and complex fields as well. It is shown that these basefield transforms can be v iewed as “projections” of the discrete Fourier transform @IT) and that they exist for all lengths ...
متن کاملFragile watermarking using finite field trigonometrical transforms
Fragile digital watermarking has been applied for authentication and alteration detection in images. Utilizing the cosine and Hartley transforms over finite fields, a new transform domain fragile watermarking scheme is introduced. A watermark is embedded into a host image via a blockwise application of two-dimensional finite field cosine or Hartley transforms. Additionally, the considered finit...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/1502.04670 شماره
صفحات -
تاریخ انتشار 2015