By Topic

An efficient VLSI implementation of four-step search algorithm

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Angus Wu ; Dept. of Electron. Eng., City Univ. of Hong Kong, Hong Kong ; So, M.F.

Four-step search (4SS) performs better than the well known three-step search (3SS) and the new three-step search (N3SS). Since 3SS, N3SS and 4SS are similar algorithms, existing architectures for 3SS and N3SS can be used for 4SS implementation. However, direct implementation of 4SS by existing architectures will cause redundant search. A power efficient VLSI implementation for 4SS is proposed. The implementation focuses on power reduction through a power down technique by dedicated data flow control and usage of calculation elements. The simulation result shows the proposed method increases the system throughput and reduces power consumption by 40%

Published in:

Electronics, Circuits and Systems, 1998 IEEE International Conference on  (Volume:3 )

Date of Conference: