The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
Apart from the speed performance, a common IC-implementation problem for nearest neighbor search, one of the most basic algorithms in pattern recognition, is low flexibility to different task applications. We report a digital word-parallel as sociative memory architecture with reconfigurable storage-space of reference vectors and clock-counting-based nearest-Euclidean-distance search, enabling single-chip...
In this paper, a coprocessor fabricated in 180nm for word-parallel nearest Euclidean distance search is developed based on a distance-clock-mapping concept which results in an area-efficient architecture. Conventionally, the nearest distance search is a computational issue in pattern recognition, which can be completed in O(dn) time by the brute-force search in a d-dimensional space among n reference...
Field programmable gate arrays (FPGAs) is becoming one of the most widely used electronics devices. Because of its unique architecture, power estimation is a complicated task for FPGAs. This paper presents a novel power estimation framework for SRAM-based FPGAs. Considering both dynamic power and static power, a gate-level power model for configuration logic blocks (CLBs) and a transistor-level power...
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.