Look up Table Research Papers (original) (raw)

The scaled Chinese Remainder Theorem (CRT) is a very useful tool for the simplification of RNS to binary converters. The main drawback of this methodology is related to the use of large look-up tables that store the correspondence among... more

The scaled Chinese Remainder Theorem (CRT) is a very useful tool for the simplification of RNS to binary converters. The main drawback of this methodology is related to the use of large look-up tables that store the correspondence among the modular numbers and the corresponding scaled terms of the CRT. This fact limits the maximum speed allowed by this approach. In this paper a new method for the computation of the scaled factors is presented. It allows the computation of the scaled CRT output by using very small look-up tables implemented by conventional logic and simple and fast structures, that work in parallel. The only assumption made in order to develop the new algorithm is that the moduli must be odd

A lookup table is an array containing Pre-calculated values that can be retrieved from memory whenever needed. The project optimizes the memory space needed to store data in a look up table by combining the methods of Anti symmetric... more

A lookup table is an array containing Pre-calculated values that can be retrieved from memory whenever needed. The project optimizes the memory space needed to store data in a look up table by combining the methods of Anti symmetric Product Code (APC) and Odd
Multiple Storage (OMS). The existing methodology reduces the LUT size by half, but the combined effect of APC and OMS reduces the LUT size by one fourth. It saves the area delay to 30% -50%.LUT optimization is a memory based multiplication technique, where odd multiples
of fixed coefficients are required to be stored, which is known as Odd Multiple Storage (OMS).Suppose if there are 2L words, on conducting OMS optimization, instead of 2L words only, 2(L/2) words are stored. Then, even multiples are derived by left shift operation by means of a barrel shifter. Further product codes are recorded as anti symmetric pairs, (APC), which reduces the LUT size by the factor of two.

This article reviews the development of the CORE-OM and CORE System from 1995 to 2005 in the context of the need to measure, monitor, and manage the delivery of counselling and the psychological therapies in service of providing best... more

This article reviews the development of the CORE-OM and CORE System from 1995 to 2005 in the context of the need to measure, monitor, and manage the delivery of counselling and the psychological therapies in service of providing best quality care for clients. The origins and philosophy of these tools are summarised and practical aspects of how to use them

This paper describes the field programmable gate array (FPGA) implementation of Rijndael algorithm based on a novel design of S-box built using reduced residue of prime numbers. The objective is to present an efficient hardware... more

This paper describes the field programmable gate array (FPGA) implementation of Rijndael algorithm based on a novel design of S-box built using reduced residue of prime numbers. The objective is to present an efficient hardware implementation of Rijndael using very high speed integrated circuit hardware description language (VHDL). The novel S-box look up table (LUT) entries forms a set of reduced residue of prime number, which forms a mathematical field. The S-box with reduced residue of prime number adds more confusion to the entire process of Rijndael and makes it more complex and immune to algebraic attacks. The target hardware used in this paper is state-of-the-art Xilinx Virtex-5 XC5VLX50 FPGA. The proposed design achieves a throughput of 3.09 Gbps using only 1745 slices.

A shape-motion prototype-based approach is introduced for action recognition. The approach represents an action as a sequence of prototypes for efficient and flexible action matching in long video sequences. During training, an action... more

A shape-motion prototype-based approach is introduced for action recognition. The approach represents an action as a sequence of prototypes for efficient and flexible action matching in long video sequences. During training, an action prototype tree is learned in a joint shape and motion space via hierarchical K-means clustering and each training sequence is represented as a labeled prototype sequence; then a look-up table of prototype-to-prototype distances is generated. During testing, based on a joint probability model of the actor location and action prototype, the actor is tracked while a frame-to-prototype correspondence is established by maximizing the joint probability, which is efficiently performed by searching the learned prototype tree; then actions are recognized using dynamic prototype sequence matching. Distance measures used for sequence matching are rapidly obtained by look-up table indexing, which is an order of magnitude faster than brute-force computation of frame-to-frame distances. Our approach enables robust action matching in challenging situations (such as moving cameras, dynamic backgrounds) and allows automatic alignment of action sequences. Experimental results demonstrate that our approach achieves recognition rates of 92.86 percent on a large gesture data set (with dynamic backgrounds), 100 percent on the Weizmann action data set, 95.77 percent on the KTH action data set, 88 percent on the UCF sports data set, and 87.27 percent on the CMU action data set.

Just as control over perceived azimuth and elevation of a virtual sound source should be psychophysically calibrated in spatial au- ditory display, so should perceived range; however, in contrast to azimuth and elevation display, precise... more

Just as control over perceived azimuth and elevation of a virtual sound source should be psychophysically calibrated in spatial au- ditory display, so should perceived range; however, in contrast to azimuth and elevation display, precise control over auditory range has been difficult to achieve. This is partly due to the multidimen- sional complexity of the human response to spatial auditory

3 and I independently started working on 3D LUTS as an alternative to algebraic formulae to position spectral measurements in an isotropic color space. We both chose Newhall, Nickerson and Judd's data for Munsell chips as the data for... more

3 and I independently started working on 3D LUTS as an alternative to algebraic formulae to position spectral measurements in an isotropic color space. We both chose Newhall, Nickerson and Judd's data for Munsell chips as the data for our Look Up Tables(LUT). We used the colori- metric description of each Munsell Chip at the position speci- fied by Munsell

In recent years, there are massive numbers of users who share their contents over wide range of social networks. Thus, a huge volume of electronic data is available on the Internet containing the users' thoughts, attitudes, views and... more

In recent years, there are massive numbers of users who share their contents over wide range of social networks. Thus, a huge volume of electronic data is available on the Internet containing the users' thoughts, attitudes, views and opinions towards certain products, events, news or any interesting topics. Therefore, sentiment analysis becomes a desirable topic in order to automate the process of extracting the user's opinions. One of the widely content sharing languages over the social network is Arabic Language. However Arabic language has several obstacles that make the sentiment analysis a challenging problem. Most users share their contents in informal Arabic. Additionally, there are lots of different Arabic dialects. Hence, Arabic sentiment analysis researches is developed slowly compared to other languages such as English. This paper proposes a new hybrid lexicon approach for Arabic sentiment analysis that combines in the same framework both unsupervised and supervised technique. In the unsupervised phase, the polarity of data is extracted by means of Look-up table stemming technique. In the supervised phase, we use the data of the true classified polarity from the unsupervised phase to generate and train a classifier for the further classification of the unclassified data. We test and evaluate the proposed approach using MIKA corpus [1]. The results show that the proposed approach gives better results.

Testing an FPGA chip poses a challenging problem for test engineers. It requires implementing various configurations of the FPGA, but changing configurations incurs reprogramming costs. The fundamental question for FPGA testing is how to... more

Testing an FPGA chip poses a challenging problem for test engineers. It requires implementing various configurations of the FPGA, but changing configurations incurs reprogramming costs. The fundamental question for FPGA testing is how to determine the minimum number of test configurations and corresponding test vector sequences that will cover all the faults for a given FPGA's fault model. In this paper first two types of fault that can occur in the LUT of a FPGA i.e. data faults and addressing faults have been described. Based on this new fault model it has been shown that only 4 configurations are needed for testing of LUTs in a FPGA. A hierarchical approach is then proposed to solve the problem of controllability and observability while testing entire FPGA. This hierarchical approach is faster compared to the other approaches in literature for FPGA testing. The proposed hierarchical approach is also independent of the fault model and configuration used.