• Corpus ID: 14450686

High Speed Efficient N X N Bit Parallel Hierarchical Overlay Multiplier Architecture Based On Ancient Indian Vedic Mathematics

@inproceedings{Thapliyal2004HighSE,
  title={High Speed Efficient N X N Bit Parallel Hierarchical Overlay Multiplier Architecture Based On Ancient Indian Vedic Mathematics},
  author={Himanshu Thapliyal and M. B. Srinivas},
  year={2004}
}
A N X N bit parallel overlay multiplier architecture is designed for high speed DSP operations. The architecture is based on the vertical and crosswise algorithm of ancient Indian Vedic Mathematics. In the proposed architecture grouping of the bits 4 at a time is done for both the multiplicand and multiplier. Thus the whole multiplication operation is decomposed into 4x4 bit multiplication modules. The 4x4 multiplication modules can be implemented by using any multiplier such as array, booth… 

Figures and Tables from this paper

A hierarchical design of high performance 8x8 bit multiplier based on Vedic mathematics

TLDR
In this paper, general technique for NxN multiplication is proposed and implemented; this gives less delay for calculating the multiplication results for 8x8 Bit Vedic Multiplier.

High Speed 4 X 4 Bit Vedic Multiplier based on Vertical and Crosswise Methods

TLDR
A high speed 4x4 bit Vedic Multiplier (VM) based on Vertically & Crosswise method of Vedic mathematics, a general multiplication formulae equally applicable to all cases of multiplication is presented.

Design and FPGA implementation of optimized 32-bit Vedic multiplier and square architectures

TLDR
The design of high speed multiplier and squaring architectures based upon ancient Indian Vedic mathematics sutras based upon concatenation operation and one carry save adder only are presented, which offers significant improvement in speed.

Implementation of an Efficient Multiplier based on Vedic Mathematics Using EDA Tool

TLDR
This paper presents a high speed 8x8 bit Vedic multiplier architecture which is quite different from the Conventional method of multiplication like add and shift and is based on Vertical and Crosswise structure of Ancient Indian Vedic Mathematics.

A Time-Area-Power Efficient High Speed Vedic Mathematics Multiplier using Compressors

TLDR
A novel architecture to perform high speed multiplication using ancient Vedic maths techniques and a new high speed approach utilizing 4:2 compressors and novel 7:2 compressor for addition has been incorporated in the same and has been explored.

ALU Using Area Optimized Vedic Multiplier

TLDR
In the work it is further optimized the Vedic multiplier type Urdhva Triyakbhyam by replacing the traditional adder with Carry save Adder to have more Delay Optimization and shows improvement of speed as compare with the traditional designs.

Novel High Speed Vedic Multiplier Proposal Incorporating Adder Based on Quaternary Signed Digit Number System

TLDR
A high-speed Vedic multiplier based on the Urdhva Tiryagbhyam sutra of Vedic mathematics that incorporates a novel adder based on Quaternary Signed digit number system that shows a maximum of 88.75% speed improvement with respect to Multi Value logic based 128x128 Vedic multipliers.

A low power decomposed hierarchical multiplier architecture embedding multiplexer based full adders

This paper proposes a novel 4times4 multiplier architecture which is efficient in terms of power without a significant increase in delay and area, especially designed for partition multipliers having

A Reduced-Bit Multiplication Algorithm for Digital Arithmetic

TLDR
A reduced-bit multiplication algorithm based on the ancient Vedic multiplication formulae, Urdhva tiryakbhyam and Nikhilam, is proposed and is further optimized by use of some general arithmetic operations such as expansion and bit-shifting to take advantage of bit-reduction in multiplication.

Design of Multiply and Accumulate Unit using Vedic Multiplication Techniques

TLDR
The results show that design of MAC unit using Vedic multiplica- tion is efficient in terms of area/speed compared to conventional multiplication.
...

References

SHOWING 1-10 OF 18 REFERENCES

A Time-Area-Power Efficient Multiplier and Square Architecture Based on Ancient Indian Vedic Mathematics

TLDR
In FPGA implementation it has been found that the proposed Vedic multiplier and square are faster than array multiplier and Booth multiplier.

Reconfigurable parallel inner product processor architectures

  • R. Lin
  • Computer Science
    IEEE Trans. Very Large Scale Integr. Syst.
  • 2001
TLDR
A set of low-power high-performance parallel counters is proposed for the implementation of the design, which could lead to a significant reduction in worst case power dissipation compared with traditional binary-logic based architectures, while showing superiority in speed, VLSI area, and layout simplicity.

An 0(n) Parallel Multiplier with Bit-Sequential Input and Output

TLDR
A new parallel multiplier with a very simple configuration that operates in time 0(n), where n is the maximum of the lengths of the multiplier and multiplicand, both of which are fixed point, expressed in binary notation is suggested.

A reconfigurable low-power high-performance matrix multiplier design

  • R. Lin
  • Computer Science
    Proceedings IEEE 2000 First International Symposium on Quality Electronic Design (Cat. No. PR00525)
  • 2000
TLDR
The novel logic operates 4-bit state signals where no more than half of the signal bits are subject to value-change at any logic stage, which significantly reduces the large circuit power dissipation while keeping high performance in speed and small VLSI area.

Low cost serial multipliers for high-speed specialised processors

TLDR
Four new arrays for signed number multiplication and multiplication/ addition based on full 2's complement representation are presented and it is shown that these units achieve the same speed advantages as other similar units which use redundant representations for the results.

Novel design and verification of a 16 x 16-b self-repairable reconfigurable inner product processor

A novel self-repairable and reconfigurable inner-product processor with low-power, fast CMOS circuits and DFT techniques is presented. It takes the advantage of recently proposed decomposition based

A SIGNED BINARY MULTIPLICATION TECHNIQUE

Trading bitwidth for array size: a unified reconfigurable arithmetic processor design

  • R. Lin
  • Computer Science
    Proceedings of the IEEE 2001. 2nd International Symposium on Quality Electronic Design
  • 2001
This paper presents a novel unified run-time reconfigurable arithmetic processor design scheme. It provides novel computational trade-offs between array/matrix size and input data item bitwidth, and