NDLI: Powering by a table look-up and a multiplication with operand modification

Content Provider	IEEE Xplore Digital Library
Author	Takagi, N.
Copyright Year	1968
Abstract	An efficient method for generating a power of an operand, i.e., X/sup p/ for an operand X and a given p, is proposed. It is applicable to ps in the form of /spl plusmn/2/sup k/, where k is any integer and of /spl plusmn/2(k/sub 1/) /spl plusmn/2(-k/sub 2/), where k/sub 1/ is any integer and k/sub 2/ is any nonnegative integer. The reciprocal, the square root, the reciprocal square root, the reciprocal square, the reciprocal cube, and so forth are included. The method is a modification of the piecewise linear approximation. A power of an operand is generated through a table look-up and a multiplication with operand modification. The same accuracy is achieved as the piecewise linear approximation. The multiplication and an addition required for the piecewise linear approximation are replaced by only one double-sized multiplication with a slight modification of the operand and, hence, one clock cycle may be reduced. The required table size is reduced because only one coefficient instead of two has to be stored.
Sponsorship	IEEE Computer Society Technical Committee on Distributed Process IEEE Computer Society Technical Committee on VLSI IEEE Technical Committee on Computer Architecture IEEE Computer Society
Starting Page	1216
Ending Page	1222
Page Count	7
File Size	123585
File Format	PDF
ISSN	00189340
Volume Number	47
Issue Number	11
Language	English
Publisher	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Publisher Date	1998-11-01
Publisher Place	U.S.A.
Access Restriction	One Nation One Subscription (ONOS)
Rights Holder	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subject Keyword	Piecewise linear approximation Power generation Table lookup Clocks Read only memory Arithmetic Circuits Delay Taylor series
Content Type	Text
Resource Type	Article
Subject	Theoretical Computer Science Computational Theory and Mathematics Software Hardware and Architecture

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in

Efficient initial approximation for multiplicative division and square root by a multiplication with operand modification

Implementing multiplication with split read-only memory

Digital Generation of a Nonlinear Time-Base

An approach to implementing multiplication with small tables

A 30-b integrated logarithmic number system processor

On hardware for computing exponential and trigonometric functions

Look-up table-based large finite field multiplication in memory constrained cryptosystems

Fast division using accurate quotient approximations to reduce the number of iterations

Algorithm and architecture for logarithm, exponential, and powering computation

Powering by a table look-up and a multiplication with operand modification

Similar Documents

Efficient initial approximation for multiplicative division and square root by a multiplication with operand modification

Implementing multiplication with split read-only memory

Digital Generation of a Nonlinear Time-Base

An approach to implementing multiplication with small tables

A 30-b integrated logarithmic number system processor

On hardware for computing exponential and trigonometric functions

Look-up table-based large finite field multiplication in memory constrained cryptosystems

Fast division using accurate quotient approximations to reduce the number of iterations

Algorithm and architecture for logarithm, exponential, and powering computation

Powering by a table look-up and a multiplication with operand modification