# The Quasi-Serial Multiplier

@article{Swartzlander1973TheQM, title={The Quasi-Serial Multiplier}, author={E. Swartzlander}, journal={IEEE Transactions on Computers}, year={1973}, volume={C-22}, pages={317-321} }

A novel technique for digital multiplication is presented that represents a considerable departure from conventional (i.e., add and shift or fully parallel) multiplication algorithms. The quasi-serial multiplier generates the bits of the product sequentially from least significant to most significant. Each bit is computed by "counting" the number of ones in the corresponding column of the bit-product matrix and adding the previous carrys. This single operation yields both the product bit and… Expand

#### 89 Citations

Novel serial-parallel multipliers

- Mathematics
- 2001

New designs of serial-parallel multipliers based on the modified Booth and multi-bit recoding algorithms are introduced. Using recoding for the parallel operand, two proposed systolic multipliers… Expand

Fast multipliers for two's-complement numbers in serial form

- Mathematics, Computer Science
- 1985 IEEE 7th Symposium on Computer Arithmetic (ARITH)
- 1985

Two classes of multipliers are illustrated: the first generating the multiplier array by diagonals and rows, the second by columns. Expand

Carry-Save Multiplication Schemes without Final Addition

- Mathematics, Computer Science
- IEEE Trans. Computers
- 1996

This paper presents n/spl times/n multiplication schemes where the full 2n-bit result is produced, unlike similar multiplication schemes presented in the literature. Expand

n /spl times/ n carry-save multipliers without final addition

- Mathematics, Computer Science
- Proceedings of IEEE 11th Symposium on Computer Arithmetic
- 1993

The resulting implementation, when a radix-2 adder array is used, produces a result on 2n bits with a delay comparable to that of the multiplier proposed by M.D. Ercegovac and T. Lang (1990). Expand

VLSI-Oriented Architecture for Two's Complement Serial-Parallel Multiplication without Speed Penalty

- Computer Science
- 2007 International Conference on Computational Science and its Applications (ICCSA 2007)
- 2007

A VLSI-oriented, size-efficient two's complement serial-parallel multiplication architecture is proposed, suitable for VLSi implementation because it consists of modularized logic cells and locally interconnected signals. Expand

VLSI-Oriented Architecture for Two's Complement Serial-Parallel Multiplication without Speed Penalty

- Computer Science
- 2007

A VLSI-oriented, size-efficient two's complement serial-parallel multiplication architecture is proposed, suitable for VLSi implementation because it consists of modularized logic cells and locally interconnected signals. Expand

Carry-Save Multiplication Schemes Without

- Mathematics
- 1996

Carry-save multipliers require an adder at the last step to convert the carry-sum representation of the most significant half of the iesult into a non-redundant form This paper presents n x n… Expand

On a Bit-Serial Input and Bit-Serial Output Multiplier

- Mathematics, Computer Science
- IEEE Transactions on Computers
- 1983

It is shown that this bit-sequential input and output (LSBfirst) multiplier for positive numbers can be realized with only n adder modules, and the technique is extended to two's complement number system. Expand

Serial-parallel multipliers

- Computer Science
- Proceedings of 27th Asilomar Conference on Signals, Systems and Computers
- 1993

This paper examines the design of several serial-parallelmultipliers, compares and contrasts the different characteristics and improvements made on these multipliers, and gives a rough estimate of the size versus speed trade off for using serial-Parallel multipliers. Expand

Segmenetation based design of serial parallel multipliers

- Computer Science
- IEEE Workshop on Signal Processing Systems Design and Implementation, 2005.
- 2005

A novel architecture for the implementation of serial parallel multipliers (SPM) is proposed based on a segmentation technique of a simple SPM to blocks of equal bit length that achieves higher throughput and significant hardware reduction compared to the double precision SPM. Expand

#### References

SHOWING 1-10 OF 11 REFERENCES

Fast Multipliers

- Computer Science
- IEEE Transactions on Computers
- 1970

A parallel multiplier designed using the carry-save scheme and constructed from 74 series integrated circuits is described, which multiplies 10-bit by 12-bit binary numbers with a worst- case multiplication time of 520 ns. Expand

The Use of Analog Techniques in Binary Arithmetic Units

- Computer Science
- IEEE Trans. Electron. Comput.
- 1965

It is shown that when this element, which will be called a quantiser, is used, the design of arithmetic units for digital computers is considerably simplified and it is possible to build simple parallel adders and multipliers which do not require any external programming and which may be directly interconnected to form networks to carry out specific calculations. Expand

High-Speed Arithmetic in Binary Computers

- Computer Science
- Proceedings of the IRE
- 1961

Methods of obtaining high speed in addition, multiplication, and division in parallel binary computers are described and then compared with each other as to efficiency of operation and cost. The… Expand

A Suggestion for a Fast Multiplier

- Computer Science
- IEEE Trans. Electron. Comput.
- 1964

The author develops an adder tree to sum this set when t= 1 the maximum number of regions intersections of n t-flats and shows that a tree will be dependent on both t and n. Expand

Integrated-circuit digital logic families IIIߞECL and MOS devices

- Engineering
- IEEE Spectrum
- 1970

This final installment of a three-part article is devoted to emitter-coupled logic (ECL) devices as well as to metal oxide semiconductor (MOS) logic devices of the p-channel (P-MOS) and complementary… Expand

Counting Responders inan Associative Memory

- Mathematics
- 1971

Consider thefollowing problem. We wishtodesign a circuit thathasN input lines andm output lines. Eachinput line may present either a ZERO or a ONE tothecircuit. We wishtohavethepattern ofZERO'S… Expand

Counting Responders in an Associative Memory

- Computer Science
- IEEE Transactions on Computers
- 1971

It is shown that less than one full adder per memory cell is required and that the maximum delay in establishing the count is proportional to n, where n is the log to the base 3 of the number of memory cells. Expand