Sciweavers

116 search results - page 1 / 24
» Complexity Reduction Using Expansive Coding
Sort
View
AISB
1994
Springer
13 years 8 months ago
Complexity Reduction Using Expansive Coding
David Beasley, David R. Bull, Ralph R. Martin
CASES
2004
ACM
13 years 10 months ago
Procedure placement using temporal-ordering information: dealing with code size expansion
Abstract— In a direct-mapped instruction cache, all instructions that have the same memory address modulo the cache size, share a common and unique cache slot. Instruction cache ...
Christophe Guillon, Fabrice Rastello, Thierry Bida...
ICPP
2002
IEEE
13 years 10 months ago
Optimal Code Size Reduction for Software-Pipelined Loops on DSP Applications
Code size expansion of software-pipelined loops is a critical problem for DSP systems with strict code size constraint. Some ad-hoc code size reduction techniques were used to try...
Qingfeng Zhuge, Zili Shao, Edwin Hsing-Mean Sha
DATE
2010
IEEE
174views Hardware» more  DATE 2010»
13 years 3 months ago
An HVS-based Adaptive Computational Complexity Reduction Scheme for H.264/AVC video encoder using Prognostic Early Mode Exclusio
The H.264/AVC video encoder standard significantly improves the compression efficiency by using variable block-sized Inter (P) and Intra (I) Macroblock (MB) coding modes. In this p...
Muhammad Shafique, Bastian Molkenthin, Jörg H...
ICC
2008
IEEE
113views Communications» more  ICC 2008»
13 years 11 months ago
Complexity Reduction of Maximum-Likelihood Multiuser Detection (ML-MUD) Receivers with Carrier Interferometry Codes in MC-CDMA
—We propose to use carrier interferometry (CI) codes to reduce the complexity of the maximumlikelihood multiuser-detection (ML-MUD) receiver in MC-CDMA systems with carrier frequ...
Layla Tadjpour, Shang-Ho Tsai, C. C. Jay Kuo