Sciweavers

160 search results - page 11 / 32
» On the diagonalization of the discrete Fourier transform
Sort
View
SSC
2007
Springer
126views Cryptology» more  SSC 2007»
14 years 1 months ago
Randomness and Representation of Span n Sequences
Any span n sequences can be regarded as filtering sequences. From this observation, new randomness criteria for span n sequences are proposed. It is proved that the feedback funct...
Guang Gong
ASIACRYPT
1998
Springer
13 years 11 months ago
Optimal Resistance Against the Davies and Murphy Attack
Abstract. In recent years, three main types of attacks have been developed against Feistel-based ciphers, such as DES[1]; these attacks are linear cryptanalysis[2], differential cr...
Thomas Pornin
ICIP
2003
IEEE
14 years 21 days ago
Texture analysis: an adaptive probabilistic approach
Two main issues arise when working in the area of texture segmentation: the need to describe the texture accurately by capturing its underlying structure, and the need to perform ...
Karen Brady, Ian Jermyn, Josiane Zerubia
SPEECH
1998
69views more  SPEECH 1998»
13 years 7 months ago
Noisy speech enhancement using discrete cosine transform
This paper illustrates the advantages of using the Discrete Cosine Transform (DCT) as compared to the standard Discrete Fourier Transform (DFT) for the purpose of removing noise e...
Ing Yann Soon, Soo Ngee Koh, Chai Kiat Yeo
IPPS
1999
IEEE
13 years 11 months ago
Shuffle Memory System
This paper proposes a new memory system called shuffle memory. The shuffle memory is a generalization of transposition memory that has been widely used in 2-D Discrete Cosine Tran...
Kichul Kim