• Publications
  • Influence
VLSI Architectures for Computing Multiplications and Inverses in GF(2m)
TLDR
A pipeline structure is developed to realize the Massey-Omura multiplier in the finite field GF(2m). Expand
  • 346
  • 15
Systolic Multipliers for Finite Fields GF(2m)
TLDR
Two systolic architectures are developed for performing the product–sum computation AB + C in the finite field GF(2m) of 2melements, where A, B, and C are arbitrary elements. Expand
  • 211
  • 15
Audio classification and categorization based on wavelets and support vector Machine
TLDR
In this paper, an improved audio classification and categorization technique is presented. Expand
  • 129
  • 9
  • PDF
A VLSI Design of a Pipeline Reed-Solomon Decoder
TLDR
A pipeline structure of a transform decoder similar to a systolic array is developed to decode Reed-Solomon (RS) codes. Expand
  • 158
  • 7
Spectral representation of fractional Brownian motion in n dimensions and its properties
TLDR
A spectral representation of fractional Brownian motion is provided for the construction of fBm from a white-noise-like process by means of a stochastic integral in frequency of a stationary uncorrelated random process. Expand
  • 105
  • 7
A VLSI design of a pipeline Reed-Solomon decoder
TLDR
A pipeline structure of a transform decoder similar to a systolic array is developed to decode Reed-Solomon codes. Expand
  • 89
  • 7
Fast, prime factor, discrete Fourier transform
In this paper it is shown that Winograds algorithm for computing convolutions and a fast, prime factor, discrete Fourier transform (DFT) algorithm can be modified to compute Fourier-like transformsExpand
  • 25
  • 6
VLSI design of inverse-free Berlekamp-Massey algorithm
TLDR
Berlekamp-Massey iterative algorithm for decoding BCH codes is modified to eliminate the calculation of inverses. Expand
  • 121
  • 5
Fourier analysis and signal processing by use of the Mobius inversion formula
TLDR
A novel Fourier technique for digital signal processing is developed. Expand
  • 66
  • 5
Use of Grobner bases to decode binary cyclic codes up to the true minimum distance
TLDR
A general algebraic method for decoding all types of binary cyclic codes is presented that can correct t=[(d-1)/2] errors, where d is the true minimum distance of the given cyclic code. Expand
  • 87
  • 5
...
1
2
3
4
5
...