Sciweavers

1222 search results - page 102 / 245
» Routing in the frequency domain
Sort
View
DATE
2006
IEEE
171views Hardware» more  DATE 2006»
14 years 3 months ago
Dynamic bit-width adaptation in DCT: image quality versus computation energy trade-off
We present a dynamic bit-width adaptation scheme in DCT applications for efficient trade-off between image quality and computation energy. Based on sensitivity differences of 64 ...
Jongsun Park, Jung Hwan Choi, Kaushik Roy
CCR
2002
86views more  CCR 2002»
13 years 9 months ago
Hop-by-hop routing algorithms for premium traffic
In Differentiated Service (DiffServ) networks, the routing algorithms used by the premium class traffic, due to the high priority afforded to that traffic, may have a significant ...
Jun Wang, Klara Nahrstedt
HICSS
2005
IEEE
170views Biometrics» more  HICSS 2005»
14 years 2 months ago
Low-Bandwidth Topology Maintenance for Robustness in Structured Overlay Networks
— Structured peer-to-peer systems have emerged as infrastructures for resource sharing in large-scale, distributed, and dynamic environments. One challenge in these systems is to...
Ali Ghodsi, Luc Onana Alima, Seif Haridi
FPGA
2012
ACM
300views FPGA» more  FPGA 2012»
12 years 4 months ago
Reducing the cost of floating-point mantissa alignment and normalization in FPGAs
In floating-point datapaths synthesized on FPGAs, the shifters that perform mantissa alignment and normalization consume a disproportionate number of LUTs. Shifters are implemente...
Yehdhih Ould Mohammed Moctar, Nithin George, Hadi ...
ACMSE
2006
ACM
14 years 29 days ago
Achieving efficient polynomial multiplication in fermat fields using the fast Fourier transform
We introduce an efficient way of performing polynomial multiplication in a class of finite fields GF(pm ) in the frequency domain. The Fast Fourier Transform (FFT) based frequency...
Selçuk Baktir, Berk Sunar