Nothing Special   »   [go: up one dir, main page]

Barik et al., 2017 - Google Patents

Time efficient signed Vedic multiplier using redundant binary representation

Barik et al., 2017

View PDF @Full View
Document ID
13773895685407193932
Author
Barik R
Pradhan M
Panda R
Publication year
Publication venue
The Journal of Engineering

External Links

Snippet

This study presents a high‐speed signed Vedic multiplier (SVM) architecture using redundant binary (RB) representation in Urdhva Tiryagbhyam (UT) sutra. This is the first ever effort towards extension of Vedic algorithms to the signed numbers. The proposed multiplier …
Continue reading at ietresearch.onlinelibrary.wiley.com (PDF) (other versions)

Classifications

    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06F—ELECTRICAL DIGITAL DATA PROCESSING
    • G06F7/00—Methods or arrangements for processing data by operating upon the order or content of the data handled
    • G06F7/38—Methods or arrangements for performing computations using exclusively denominational number representation, e.g. using binary, ternary, decimal representation
    • G06F7/48—Methods or arrangements for performing computations using exclusively denominational number representation, e.g. using binary, ternary, decimal representation using non-contact-making devices, e.g. tube, solid state device; using unspecified devices
    • G06F7/52—Multiplying; Dividing
    • G06F7/523—Multiplying only
    • G06F7/53—Multiplying only in parallel-parallel fashion, i.e. both operands being entered in parallel
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06F—ELECTRICAL DIGITAL DATA PROCESSING
    • G06F7/00—Methods or arrangements for processing data by operating upon the order or content of the data handled
    • G06F7/38—Methods or arrangements for performing computations using exclusively denominational number representation, e.g. using binary, ternary, decimal representation
    • G06F7/48—Methods or arrangements for performing computations using exclusively denominational number representation, e.g. using binary, ternary, decimal representation using non-contact-making devices, e.g. tube, solid state device; using unspecified devices
    • G06F7/52—Multiplying; Dividing
    • G06F7/523—Multiplying only
    • G06F7/533—Reduction of the number of iteration steps or stages, e.g. using the Booth algorithm, log-sum, odd-even
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06F—ELECTRICAL DIGITAL DATA PROCESSING
    • G06F7/00—Methods or arrangements for processing data by operating upon the order or content of the data handled
    • G06F7/38—Methods or arrangements for performing computations using exclusively denominational number representation, e.g. using binary, ternary, decimal representation
    • G06F7/48—Methods or arrangements for performing computations using exclusively denominational number representation, e.g. using binary, ternary, decimal representation using non-contact-making devices, e.g. tube, solid state device; using unspecified devices
    • G06F7/544—Methods or arrangements for performing computations using exclusively denominational number representation, e.g. using binary, ternary, decimal representation using non-contact-making devices, e.g. tube, solid state device; using unspecified devices for evaluating functions by calculation
    • G06F7/5443—Sum of products
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06F—ELECTRICAL DIGITAL DATA PROCESSING
    • G06F7/00—Methods or arrangements for processing data by operating upon the order or content of the data handled
    • G06F7/38—Methods or arrangements for performing computations using exclusively denominational number representation, e.g. using binary, ternary, decimal representation
    • G06F7/48—Methods or arrangements for performing computations using exclusively denominational number representation, e.g. using binary, ternary, decimal representation using non-contact-making devices, e.g. tube, solid state device; using unspecified devices
    • G06F7/499—Denomination or exception handling, e.g. rounding, overflow
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06F—ELECTRICAL DIGITAL DATA PROCESSING
    • G06F17/00—Digital computing or data processing equipment or methods, specially adapted for specific functions
    • G06F17/50—Computer-aided design
    • G06F17/5009—Computer-aided design using simulation
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06F—ELECTRICAL DIGITAL DATA PROCESSING
    • G06F17/00—Digital computing or data processing equipment or methods, specially adapted for specific functions
    • G06F17/10—Complex mathematical operations
    • G06F17/11—Complex mathematical operations for solving equations, e.g. nonlinear equations, general mathematical optimization problems
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06F—ELECTRICAL DIGITAL DATA PROCESSING
    • G06F17/00—Digital computing or data processing equipment or methods, specially adapted for specific functions
    • G06F17/20—Handling natural language data
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06F—ELECTRICAL DIGITAL DATA PROCESSING
    • G06F17/00—Digital computing or data processing equipment or methods, specially adapted for specific functions
    • G06F17/30—Information retrieval; Database structures therefor; File system structures therefor
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06F—ELECTRICAL DIGITAL DATA PROCESSING
    • G06F1/00—Details of data-processing equipment not covered by groups G06F3/00 - G06F13/00, e.g. cooling, packaging or power supply specially adapted for computer application
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06F—ELECTRICAL DIGITAL DATA PROCESSING
    • G06F2207/00—Indexing scheme relating to methods or arrangements for processing data by operating upon the order or content of the data handled
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06G—ANALOGUE COMPUTERS
    • G06G7/00—Devices in which the computing operation is performed by varying electric or magnetic quantities
    • G06G7/12—Arrangements for performing computing operations, e.g. operational amplifiers
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06F—ELECTRICAL DIGITAL DATA PROCESSING
    • G06F2217/00—Indexing scheme relating to computer aided design [CAD]

Similar Documents

Publication Publication Date Title
Barik et al. Time efficient signed Vedic multiplier using redundant binary representation
Kanhe et al. Design and implementation of floating point multiplier based on vedic multiplication technique
Reddy Design and implementation of high performance and area efficient square architecture using Vedic Mathematics
Barik et al. Efficient ASIC and FPGA implementation of cube architecture
Kumar Implementation and analysis of power, area and delay of array, Urdhva, Nikhilam Vedic multipliers
Thamizharasan et al. High-speed hybrid multiplier design using a hybrid adder with FPGA implementation
Sahu et al. Fast signed multiplier using Vedic Nikhilam algorithm
Liacha et al. Design of high‐speed, low‐power, and area‐efficient FIR filters
Leon et al. Energy‐efficient VLSI implementation of multipliers with double LSB operands
Fatemi et al. Efficient implementation of digit‐serial Montgomery modular multiplier architecture
Chen High‐order Taylor series approximation for efficient computation of elementary functions
Patel et al. Area–delay and energy efficient multi‐operand binary tree adder
Hiasat Sign detector for the extended four‐moduli set
Kim A low‐cost compensated approximate multiplier for Bfloat16 data processing on convolutional neural network inference
Niras et al. Fast sign‐detection algorithm for residue number system moduli set {2n− 1, 2n, 2n+ 1− 1}
Banerjee et al. A New Squarer design with reduced area and delay
Kuppili et al. Design of Vedic Mathematics based 16 bit MAC unit for Power and Delay Optimization
Shirol et al. Design and implementation of adders and multiplier in FPGA using Chipscope: a performance improvement
Kaivani et al. Area efficient floating‐point FFT butterfly architectures based on multi‐operand adders
Tomar et al. Multi‐precision binary multiplier architecture for multi‐precision floating‐point multiplication
Kalaiselvi et al. A modular technique of Booth encoding and Vedic multiplier for low-area and high-speed applications
Lamini et al. Precision analysis with analytical bit‐width optimisation process for linear circuits with feedbacks
Reynoso‐Godinez et al. FPGA‐based parallel process for Walsh–Hadamard transform
Kaivani et al. Improved design of high‐frequency sequential decimal multipliers
Saha et al. Vedic division methodology for high‐speed very large scale integration applications