4 Bit Full Adder
4 Bit Full Adder
Aim: To design and implement a 4-bit ripple carry adder using VHDL.
Theory: In the ripple carry adder, the output is known after the carry generated by the previous
stage is produced. Thus, the sum of the most significant bit is only available after the carry signal
has rippled through the adder from the least significant stage to the most significant stage. As a
result, the final sum and carry bits will be valid after a considerable delay.
Program
library IEEE;
use IEEE.STD_LOGIC_1164.ALL;
entity full_adder is
port (A : in STD_LOGIC;
B : in STD_LOGIC;
Cin : in STD_LOGIC;
S : out STD_LOGIC;
);
end full_adder;
begin
end Behavioral;
library IEEE;
use IEEE.STD_LOGIC_1164.ALL;
entity Ripple_Adder is
Cin : in STD_LOGIC;
end Ripple_Adder;
component full_adder
Port ( A : in STD_LOGIC;
B : in STD_LOGIC;
Cin : in STD_LOGIC;
S : out STD_LOGIC;
end component;
begin
-- Port Mapping Full Adder 4 times
end Behavioral;
Schematic Diagram:
Waveform:
Conclusion: