By popular demand!
Verilog module that uses Euclid's algorithm to iteratively compute the greatest common divisor of two 16-bit unsigned integer values Ain and Bin where Ain ≥ Bin.
module gcd (clk,start,Ain,Bin,answer,done);
--
Create your RupeeMail Account & refer your friends to earn launch referral bonus on every new registration.
Try this... http://www.rupeemail.in/rupeemail/invite.do?in=MTUyNjUlIyVSajZ5dlBocDhrU3ozWVZ3bTBhZWQyQ2ZF
Verilog module that uses Euclid's algorithm to iteratively compute the greatest common divisor of two 16-bit unsigned integer values Ain and Bin where Ain ≥ Bin.
module gcd (clk,start,Ain,Bin,answer,done);
input clk,start;
input [15:0] Ain,Bin;
output reg [15:0] answer;
output reg done;
reg [15:0] a,b;
always @ (posedge clk)
input [15:0] Ain,Bin;
output reg [15:0] answer;
output reg done;
reg [15:0] a,b;
always @ (posedge clk)
begin
if (start)
begin
a <= Ain; b <= Bin; done <= 0;
end
else if (b == 0)
begin
answer <= a;
done <= 1;
done <= 1;
end
else if (a > b)
a <= a – b;
else
b <= b – a;
end
endmodule--
Create your RupeeMail Account & refer your friends to earn launch referral bonus on every new registration.
Try this... http://www.rupeemail.in/rupeemail/invite.do?in=MTUyNjUlIyVSajZ5dlBocDhrU3ozWVZ3bTBhZWQyQ2ZF
thanks for sharing this site. you can download lots of ebooks from here
ReplyDeletehttp://feboook.blogspot.com
This will go into infinite loop, e.g. if a=0 and b=5
ReplyDeletePost a Comment
Your comments will be moderated before it can appear here.