Previously many tutorials are published on how to design the basic building blocks of a complex digital system. In this tutorial, we are going to implement a digital system to demonstrate the techniques involved in implementing a system. Fast Fourier Transform (FFT) is a very popular transform technique used in many fields of signal processing. […]
FPGA Implementation of 8-Point FFT Read More »
DIGITAL image processing is an ever expanding and dynamic area with applications reaching out into our everyday life such as medicine, space exploration, surveillance, authentication, automated industry inspection and many more areas. These applications involve different processes like image enhancement, image restoration and object detection. During image acquisition and processing images are often corrupted by
FPGA Implementation of Frequency Domain Denoising Filters Read More »
Sequential Multiplier is an old method to multiply two binary numbers. But it is also relevant in many architectures and it is the base of many newly developed multiplication techniques. The multiplication between a and b is shown below. The multiplication between two operands a and b can be considered as add the operand a
Sequential Multiplier Read More »
Array multiplier is very popular for multiplication of binary numbers. Array multiplier resembles the pen and paper method of multiplication process. Array multiplication process for two 4-bit unsigned numbers a and b is shown below. On the contrary to the sequential multiplier, array multiplier is parallel. A array of full adders are used for the
Unsigned Array Multiplier Read More »
Our objective is to divide A by B where both A and B can be positive or negative. The division operation can be expressed as by the following equation by considering 4 bit data width. where Q is the quotient and R is the remainder. The division operation is carried out by subsequent stages where
Signed Array Divider Read More »
Newton-Raphson’s iterative algorithm is a very popular method to approximate a given function. It can be used to compute reciprocal of a given number. The Newton-Raphson’s iterative equation is where is the first derivative of . The function which is used to compute the reciprocal of a number is , where D is the input
Newton-Raphson Reciprocal Read More »
The division operation is carried away by assuming fractional numbers. The Non-Restoring division algorithm is shown below. Initially R is set equal to N and n is the data width. The operands are in two’s compliment form where MSB bit is the signed bit. In Non-Restoring divider, quotient take the digit set {-1,1}. At the
Non-Restoring Division Read More »
The division operation is carried away by assuming fractional numbers and it is assumed that D and N are positive numbers. The Restoring division algorithm is shown below. Here n is the data width and R is set to N initially. An example of Restoring division is given below. Here N = 0.5 (0.100) and
Restoring Division Read More »
The Gold-Schmidt division is one of the popular fast division methods. It evaluates the division operation by iterative multiplications. The equations which govern Gold-Schmidt division are The major advantage of Gold-Schmidt division is its low latency. In VLSIimplementation where a designer wants to fasten the design performance then this divider can be used. The block
Gold-Schmidt Division Read More »
