Bounds on Storage for Consecutive Retrieval

Gupta, Udaiprakash I.

doi:10.1145/322108.322111

Cited by 9 publications

(1 citation statement)

References 7 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The computation of roots has a wide variety of applications: for example in numerical calculations for solving algebraic equations, in data organisation schemes (Gupta, 1979;Liu, Li, & You, 1992;Rosenberg, 2002), in computer graphics for colour processing, volume shading or other applications that make use of non-linear models (Glassner, 1995). The utilisation of FPGAs in such applications is more common every day, because of the need of fast calculations on embedded platforms at the cost of some precision.…”

Section: Introductionmentioning

confidence: 99%

An efficient FPGA architecture for integerη^throot computation

Rangel-Valdez¹,

Barrón-Zambrano

Torres-Huitzil

et al. 2014

International Journal of Electronics

View full text Add to dashboard Cite

In embedded computing, it is common to find applications such as signal processing, image processing, computer graphics or data compression that might benefit from hardware implementation for the computation of integer roots of order N ! 2. However, the scientific literature lacks architectural designs that implement such operations for different values of N, using a low amount of resources. This article presents a parameterisable field programmable gate array (FPGA) architecture for an efficient Nth root calculator that uses only adders/subtractors and N 2 location memory elements. The architecture was tested for different values of N ¼ f2; 6; 10; 14; 17g, using 64-bit number representation. The results show a consumption up to 10% of the logical resources of a Xilinx XC6SLX45-CSG324C device, depending on the value of N. The hardware implementation improved the performance of its corresponding software implementations in one order of magnitude. The architecture performance varies from several thousands to seven millions of root operations per second.

show abstract

Section: Introductionmentioning

confidence: 99%

An efficient FPGA architecture for integerη^throot computation

Rangel-Valdez¹,

Barrón-Zambrano

Torres-Huitzil

et al. 2014

International Journal of Electronics

View full text Add to dashboard Cite

show abstract

Consecutive One’s Properties for Matrices and Graphs Including Variable Diagonal Entries

Cozzens¹,

Mahadev

1989

Applications of Combinatorics and Graph Theory to the Biological and Social Sciences

View full text Add to dashboard Cite

Page-query compaction of secondary memory auxiliary databases

Kamel

1994

Distrib Parallel Databases

View full text Add to dashboard Cite

Prestoring redundant data in secondary memory auxiliary databases is an idea that can often yield improved retrieval performance through better clustering of related data. The clusters can be based on either whole query results or, as this paper indicates, on more specialized units called page-queries. The deliberate redundancy introduced by the designer is typically accompanied by much unnecessary redundancy among the elements of the auxiliary database. This paper presents algorithms for efficiently removing unwanted redundancy in auxiliary databases organized into page-query units. The algorithms presented here extend prior work done for secondary memory compaction in two respects: First, since it is generally not possible to remove all unwanted redundancies, the paper shows how can the compaction be done to remove the most undesirable redundancy from a system performance point-of-view. For example, among the factors considered in determining the worst redundancies are the update behavior and the effects of a particular compaction scheme on memory utilization. Second, unlike traditional approaches for database compaction which aim merely at reducing the storage space, this paper considers the paging characteristics in deciding on an optimal compaction scheme. This is done through the use of page-queries. Simulation results are presented and indicate that page-query compaction results in less storage requirements and more time savings than could be obtained by standard non-page-query compaction.

show abstract

Bounds on Storage for Consecutive Retrieval

Cited by 9 publications

References 7 publications

An efficient FPGA architecture for integerη^throot computation

An efficient FPGA architecture for integerη^throot computation

Consecutive One’s Properties for Matrices and Graphs Including Variable Diagonal Entries

Page-query compaction of secondary memory auxiliary databases

Contact Info

Product

Resources

About

Bounds on Storage for Consecutive Retrieval

Cited by 9 publications

References 7 publications

An efficient FPGA architecture for integerηthroot computation

An efficient FPGA architecture for integerηthroot computation

Consecutive One’s Properties for Matrices and Graphs Including Variable Diagonal Entries

Page-query compaction of secondary memory auxiliary databases

Contact Info

Product

Resources

About

An efficient FPGA architecture for integerη^throot computation

An efficient FPGA architecture for integerη^throot computation