Sciweavers

2297 search results - page 33 / 460
» A fast APRIORI implementation
Sort
View
93
Voted
ICASSP
2009
IEEE
15 years 2 months ago
Generating high performance pruned FFT implementations
We derive a recursive general-radix pruned Cooley-Tukey fast Fourier transform (FFT) algorithm in Kronecker product notation. The algorithm is compatible with vectorization and pa...
Franz Franchetti, Markus Püschel
VTC
2008
IEEE
105views Communications» more  VTC 2008»
15 years 4 months ago
Implementation of Single Carrier Packet Transmission with Frequency Domain Equalization
—Single-carrier (SC) transmission using frequency domain equalization (FDE) is one of the candidates for the next generation mobile communication systems expected to deliver high...
Valentin Gheorghiu, Suguru Kameda, Tadashi Takagi,...
ICMCS
2006
IEEE
117views Multimedia» more  ICMCS 2006»
15 years 4 months ago
Data Hiding for Speech Bandwidth Extension and its Hardware Implementation
Most of the current speech transmission systems are only able to deliver speech signals in a narrow frequency band. This narrowband speech is characterized by a thin and muffled ...
Fan Wu, Siyue Chen, Henry Leung
ISCAS
2003
IEEE
91views Hardware» more  ISCAS 2003»
15 years 3 months ago
Real-time implementation of H.263+ using TI TMS320c6201 digital signal processor
In this paper, we use a digital signal processor (DSP) to implement a real-time H.263+ codec. We use fast algorithms to reduce the codec computational complexity. Furthermore, the...
Timothy K. Shih, Chia-Yang Tsai, Hsueh-Ming Hang
ASIACRYPT
2003
Springer
15 years 3 months ago
Tate Pairing Implementation for Hyperelliptic Curves y2 = xp-x + d
The Weil and Tate pairings have been used recently to build new schemes in cryptography. It is known that the Weil pairing takes longer than twice the running time of the Tate pair...
Iwan M. Duursma, Hyang-Sook Lee