采用kogge-stone tree 的32位超前进位加法器
采用kogge-stone tree 的32位超前进位加法器经modlesim验证正确,并可以用dc综合!
module cla32 (a,b,cin,sum,co);
input a,b;
input cin;
output sum;
output co;
reg G1,P1,G2,P2,G3,P3,G4,P4,G5,P5;
reg cout;
wire sum,G0,P0;
assign P0=a^b;
assign G0=a&b;
assign sum=P0^{cout,cin};
assign co=cout;
always @(P0 or G0 or P1 or G1 or P2 or G2 or P3 or G3 or P4 or G4 or P5 or G5 )
begin
P1=P0&0;
G1=G0|P0&G0;
G1=G0;
P1=P0;
P2=P1&1;
G2=G1|P1&G1;
G2=G1;
P2=P1;
P3=P2&2;
G3=G2|P2&G2;
G3=G2;
P3=P2;
P4=P3&3;
G4=G3|P3&G3;
G4=G3;
P4=P3;
P5=P4&4;
G5=G4|P4&G4;
G5=G4;
P5=P4;
cout=G5|P5&cin;
end
endmodule 太感谢啦！！！ 66666666666666666666
页:
[1]
