Added Montgomery factor calculation block

 * works in simulator
 * passes synthesis w/o warnings
 * code needs minor cleanup

2 files changed, 820 insertions, 0 deletions

diff --git a/src/rtl/modexpa7_factor.v b/src/rtl/modexpa7_factor.v
new file mode 100644
index 0000000..17d4785
--- /dev/null
+++ b/src/rtl/modexpa7_factor.v
@@ -0,0 +1,532 @@
+//======================================================================

+//

+// modexpa7_factor.v

+// -----------------------------------------------------------------------------

+// Montgomery factor calculation block.

+//

+// Authors: Pavel Shatov

+//

+// Copyright (c) 2017, NORDUnet A/S All rights reserved.

+//

+// Redistribution and use in source and binary forms, with or without

+// modification, are permitted provided that the following conditions

+// are met:

+// - Redistributions of source code must retain the above copyright

+//   notice, this list of conditions and the following disclaimer.

+//

+// - Redistributions in binary form must reproduce the above copyright

+//   notice, this list of conditions and the following disclaimer in the

+//   documentation and/or other materials provided with the distribution.

+//

+// - Neither the name of the NORDUnet nor the names of its contributors may

+//   be used to endorse or promote products derived from this software

+//   without specific prior written permission.

+//

+// THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS

+// IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED

+// TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A

+// PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT

+// HOLDER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,

+// SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED

+// TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR

+// PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF

+// LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING

+// NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS

+// SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.

+//

+//======================================================================

+

+module modexpa7_factor #

+	(

+			//

+			// This sets the address widths of memory buffers. Internal data

+			// width is 32 bits, so for e.g. 1024-bit operands buffers must store

+			// 1024 / 32 = 32 words, and these need 5-bit address bus, because

+			// 2 ** 5 = 32.

+			//

+		parameter	OPERAND_ADDR_WIDTH = 5

+	)

+	(

+		input											clk,

+		input											rst_n,

+

+		input											ena,

+		output										rdy,

+

+		output	[OPERAND_ADDR_WIDTH-1:0]	n_bram_addr,
+		output	[OPERAND_ADDR_WIDTH-1:0]	f_bram_addr,
+

+		input		[                32-1:0]	n_bram_out,
+

+		output	[                32-1:0]	f_bram_in,

+		output										f_bram_wr,

+

+		input		[OPERAND_ADDR_WIDTH-1:0]	n_num_words

+	);

+	

+		//

+		// FSM Declaration

+		//

+	localparam	[ 7: 0]	FSM_STATE_IDLE		= 8'h00;

+	

+	localparam	[ 7: 0]	FSM_STATE_INIT_1	= 8'hA1;

+	localparam	[ 7: 0]	FSM_STATE_INIT_2	= 8'hA2;

+		

+	localparam	[ 7: 0]	FSM_STATE_CALC_1	= 8'hB1;

+	localparam	[ 7: 0]	FSM_STATE_CALC_2	= 8'hB2;

+	localparam	[ 7: 0]	FSM_STATE_CALC_3	= 8'hB3;

+	localparam	[ 7: 0]	FSM_STATE_CALC_4	= 8'hB4;

+	localparam	[ 7: 0]	FSM_STATE_CALC_5	= 8'hB5;

+	localparam	[ 7: 0]	FSM_STATE_CALC_6	= 8'hB6;

+	localparam	[ 7: 0]	FSM_STATE_CALC_7	= 8'hB7;

+	localparam	[ 7: 0]	FSM_STATE_CALC_8	= 8'hB8;

+	

+	localparam	[ 7: 0]	FSM_STATE_SAVE_1	= 8'hC1;

+	localparam	[ 7: 0]	FSM_STATE_SAVE_2	= 8'hC2;

+	localparam	[ 7: 0]	FSM_STATE_SAVE_3	= 8'hC3;

+	localparam	[ 7: 0]	FSM_STATE_SAVE_4	= 8'hC4;

+	localparam	[ 7: 0]	FSM_STATE_SAVE_5	= 8'hC5;

+	

+	localparam	[ 7: 0]	FSM_STATE_STOP		= 8'hFF;

+	

+	reg	[ 7: 0]	fsm_state = FSM_STATE_IDLE;

+	reg	[ 7: 0]	fsm_next_state;

+

+

+		//
+		// Enable Delay (Trigger)
+		//
+   reg ena_dly = 1'b0;

+   wire ena_trig = ena && !ena_dly;
+   always @(posedge clk) ena_dly <= ena;

+	

+		

+		//

+		// Parameters Latch

+		//

+	reg	[OPERAND_ADDR_WIDTH-1:0]	n_num_words_latch;

+

+	always @(posedge clk)

+		//

+		if (fsm_next_state == FSM_STATE_INIT_1)

+			n_num_words_latch <= n_num_words;

+

+	

+		//

+		// Addresses

+		//

+	localparam	[OPERAND_ADDR_WIDTH-1:0]	bram_addr_zero = {OPERAND_ADDR_WIDTH{1'b0}};

+	wire			[OPERAND_ADDR_WIDTH-1:0]	bram_addr_last = n_num_words_latch;

+	

+	

+		//

+		// BRAM Addresses

+		//

+		/*

+	reg	[OPERAND_ADDR_WIDTH-1:0]	f_bram_addr_reg;

+		

+	wire	[OPERAND_ADDR_WIDTH-1:0]	f_bram_addr_next = f_bram_addr + 1'b1;

+	

+	wire										f_bram_addr_done =  (f_bram_addr == bram_addr_last) ? 1'b1 : 1'b0;

+	

+	assign f_bram_addr = f_bram_addr_reg;

+

+		

+	always @(posedge clk)

+		//

+		case (fsm_next_state)

+		

+			FSM_STATE_INIT_ZERO_ADDR:	f_bram_addr_reg <= bram_addr_zero;

+			FSM_STATE_INIT_NEXT_ADDR:	f_bram_addr_reg <= f_bram_addr_next;

+			

+		endcase

+

+	reg	f_bram_en;

+	

+	assign f_bram_wr = f_bram_en;

+	

+	always @(posedge clk)

+		//

+		case (fsm_next_state)

+			

+			FSM_STATE_INIT_ZERO_ADDR,

+			FSM_STATE_INIT_NEXT_ADDR,

+			FSM_STATE_INIT_LAST_ADDR:	f_bram_en <= 1'b1;

+			default:							f_bram_en <= 1'b0;

+			

+		endcase

+	

+	

+	reg	[31: 0]	f_bram_data;

+	

+	assign f_bram_in = f_bram_data;

+	

+	always @(posedge clk)

+		//

+		case (fsm_next_state)

+			FSM_STATE_INIT_ZERO_ADDR:	f_bram_data <= 32'd1;

+			FSM_STATE_INIT_NEXT_ADDR,

+			FSM_STATE_INIT_LAST_ADDR:	f_bram_data <= 32'd0;

+			default:							f_bram_data <= {32{1'bX}};

+			

+		endcase

+		*/

+		

+

+	

+	

+		//

+		// Cycle Counters

+		//

+	reg	[OPERAND_ADDR_WIDTH+5:0]	cyc_cnt;		// cycle counter

+		

+	wire	[OPERAND_ADDR_WIDTH+5:0]	cyc_cnt_zero = {1'b0, {OPERAND_ADDR_WIDTH{1'b0}}, {5{1'b0}}};

+	wire	[OPERAND_ADDR_WIDTH+5:0]	cyc_cnt_last = {n_num_words, 1'b1, {5{1'b1}}};

+	wire	[OPERAND_ADDR_WIDTH+5:0]	cyc_cnt_next = cyc_cnt + 1'b1;

+

+	wire	cyc_cnt_done = (cyc_cnt == cyc_cnt_last) ? 1'b1 : 1'b0;

+

+	

+	always @(posedge clk)

+		//

+		if (fsm_next_state == FSM_STATE_CALC_1)

+			//

+			case (fsm_state)

+				FSM_STATE_INIT_2:	cyc_cnt <= cyc_cnt_zero;

+				FSM_STATE_SAVE_5:	cyc_cnt <= cyc_cnt_done ? cyc_cnt : cyc_cnt_next;

+			endcase

+			

+

+	

+	

+		

+		//

+		// Ready Flag Logic

+		//

+	reg rdy_reg = 1'b1;

+	assign rdy = rdy_reg;
+
+   always @(posedge clk or negedge rst_n)

+		//

+		if (rst_n == 1'b0)						rdy_reg <= 1'b1;

+		else begin
+			if (fsm_state == FSM_STATE_IDLE)	rdy_reg <= ~ena_trig;
+			if (fsm_state == FSM_STATE_STOP)	rdy_reg <= 1'b1;

+		end

+		

+		

+		//

+		// Block Memories

+		//

+	reg	[OPERAND_ADDR_WIDTH-1:0]	f_addr;

+	reg	[OPERAND_ADDR_WIDTH-1:0]	f0_addr;	

+	reg	[OPERAND_ADDR_WIDTH-1:0]	f1_addr;

+	reg	[OPERAND_ADDR_WIDTH-1:0]	f2_addr;

+	

+	reg	[31: 0]	f_data_in;

+	reg	[31: 0]	f0_data_in;

+	reg	[31: 0]	f1_data_in;

+	reg	[31: 0]	f2_data_in;

+	

+	wire	[31: 0]	f0_data_out;

+	wire	[31: 0]	f1_data_out;

+	wire	[31: 0]	f2_data_out;

+	

+	reg				f_wren;

+	reg				f0_wren;

+	reg				f1_wren;

+	reg				f2_wren;

+	

+	assign n_bram_addr = f0_addr;	// TODO: Make separate register for N maybe?

+	

+	assign f_bram_addr	= f_addr;

+	assign f_bram_in		= f_data_in;

+	assign f_bram_wr		= f_wren;

+	

+	bram_1rw_readfirst #(.MEM_WIDTH(32), .MEM_ADDR_BITS(OPERAND_ADDR_WIDTH))
+	bram_f0 (.clk(clk), .a_addr(f0_addr), .a_wr(f0_wren), .a_in(f0_data_in), .a_out(f0_data_out));
+

+	bram_1rw_readfirst #(.MEM_WIDTH(32), .MEM_ADDR_BITS(OPERAND_ADDR_WIDTH))
+	bram_f1 (.clk(clk), .a_addr(f1_addr), .a_wr(f1_wren), .a_in(f1_data_in), .a_out(f1_data_out));

+

+	bram_1rw_readfirst #(.MEM_WIDTH(32), .MEM_ADDR_BITS(OPERAND_ADDR_WIDTH))
+	bram_f2 (.clk(clk), .a_addr(f2_addr), .a_wr(f2_wren), .a_in(f2_data_in), .a_out(f2_data_out));		

+		

+	

+	wire	[OPERAND_ADDR_WIDTH-1:0]	f_addr_next = f_addr + 1'b1;

+	wire	[OPERAND_ADDR_WIDTH-1:0]	f0_addr_next = f0_addr + 1'b1;

+	wire	[OPERAND_ADDR_WIDTH-1:0]	f1_addr_next = f1_addr + 1'b1;

+	wire	[OPERAND_ADDR_WIDTH-1:0]	f2_addr_next = f2_addr + 1'b1;

+	

+	wire										f_addr_done =  (f_addr == bram_addr_last) ? 1'b1 : 1'b0;

+	wire										f0_addr_done =  (f0_addr == bram_addr_last) ? 1'b1 : 1'b0;

+	wire										f1_addr_done =  (f1_addr == bram_addr_last) ? 1'b1 : 1'b0;

+	wire										f2_addr_done =  (f2_addr == bram_addr_last) ? 1'b1 : 1'b0;

+	

+	reg f12_addr_done_dly;

+	

+	always @(posedge clk)

+		//

+		f12_addr_done_dly <= f1_addr_done & f2_addr_done;

+	

+	reg	f0_data_out_carry;

+

+	wire	[31: 0]	f0_data_out_shifted = {f0_data_out[30:0], f0_data_out_carry};	

+	

+	

+	

+		//

+		// Subtractor

+		//

+	reg	[31: 0]	n_bram_out_dly;

+	

+	always @(posedge clk)

+		n_bram_out_dly <= n_bram_out;

+	

+	wire	[31: 0]	sub_d;

+	wire				sub_b_in;

+	reg				sub_b_in_mask;

+	wire				sub_b_out;

+	

+	assign sub_b_in = sub_b_out & ~sub_b_in_mask;

+

+	always @(posedge clk)

+		//

+		sub_b_in_mask <= (fsm_next_state == FSM_STATE_CALC_3) ? 1'b1 : 1'b0;

+		

+	

+	ip_sub32 sub_inst

+	(

+		.clk		(clk),

+		.a			(f1_data_in),

+		.b			(n_bram_out_dly),

+		.c_in		(sub_b_in),

+		.s			(sub_d),

+		.c_out	(sub_b_out)

+	);

+

+		

+	

+	always @(posedge clk)

+		//

+		case (fsm_next_state)

+			FSM_STATE_CALC_2:		f0_data_out_carry <= 1'b0;

+			FSM_STATE_CALC_3,

+			FSM_STATE_CALC_4,

+			FSM_STATE_CALC_5,

+			FSM_STATE_CALC_6:		f0_data_out_carry <= f0_data_out[31];

+			default:					f0_data_out_carry <= 1'bX;

+		endcase

+

+

+

+	reg	sub_b_out_dly1;

+	reg	f0_data_out_carry_dly1;

+	reg	f0_data_out_carry_dly2;

+	

+	always @(posedge clk) sub_b_out_dly1 <= sub_b_out;

+		

+	always @(posedge clk) f0_data_out_carry_dly1 <= f0_data_out_carry;

+	always @(posedge clk) f0_data_out_carry_dly2 <= f0_data_out_carry_dly1;

+	

+	reg	flag_keep_f;

+	

+	always @(posedge clk)

+		//

+		if (fsm_next_state == FSM_STATE_SAVE_1)

+			flag_keep_f <= sub_b_out_dly1 & ~f0_data_out_carry_dly2;

+

+	

+	always @(posedge clk) begin

+		//

+		case (fsm_next_state)

+		

+			FSM_STATE_INIT_1,

+			FSM_STATE_CALC_1,

+			FSM_STATE_SAVE_3:		f0_addr <= bram_addr_zero;

+			

+			FSM_STATE_INIT_2,

+			FSM_STATE_CALC_2,

+			FSM_STATE_CALC_3,

+			FSM_STATE_CALC_4,

+			FSM_STATE_CALC_5,

+			FSM_STATE_CALC_6,

+			FSM_STATE_SAVE_4,

+			FSM_STATE_SAVE_5:		f0_addr <= !f0_addr_done ? f0_addr_next : f0_addr;

+			

+		endcase

+		//

+		case (fsm_next_state)

+			

+			FSM_STATE_CALC_3,

+			FSM_STATE_SAVE_1:		f1_addr <= bram_addr_zero;

+			

+			FSM_STATE_CALC_4,

+			FSM_STATE_CALC_5,

+			FSM_STATE_CALC_6,

+			FSM_STATE_SAVE_2,

+			FSM_STATE_SAVE_3,

+			FSM_STATE_SAVE_4:		f1_addr <= !f1_addr_done ? f1_addr_next : f1_addr;

+			

+		endcase

+		//

+		case (fsm_next_state)

+		

+			FSM_STATE_CALC_5,

+			FSM_STATE_SAVE_1:		f2_addr <= bram_addr_zero;

+			

+			FSM_STATE_CALC_6,

+			FSM_STATE_CALC_7,

+			FSM_STATE_CALC_8,

+			FSM_STATE_SAVE_2,

+			FSM_STATE_SAVE_3,

+			FSM_STATE_SAVE_4:		f2_addr <= !f2_addr_done ? f2_addr_next : f2_addr;

+			

+		endcase

+		//

+			case (fsm_next_state)

+		

+			FSM_STATE_SAVE_3:		f_addr <= bram_addr_zero;

+			

+			FSM_STATE_SAVE_4,

+			FSM_STATE_SAVE_5:		f_addr <= !f_addr_done ? f_addr_next : f_addr;

+			

+		endcase

+		//

+	end

+	

+	always @(posedge clk) begin

+		//

+		case (fsm_next_state)			

+			FSM_STATE_INIT_1,

+			FSM_STATE_INIT_2,

+			FSM_STATE_SAVE_3,

+			FSM_STATE_SAVE_4,

+			FSM_STATE_SAVE_5:		f0_wren <= 1'b1;

+			default:					f0_wren <= 1'b0;

+		endcase

+		//

+		case (fsm_next_state)

+			FSM_STATE_CALC_3,

+			FSM_STATE_CALC_4,

+			FSM_STATE_CALC_5,

+			FSM_STATE_CALC_6:		f1_wren <= 1'b1;

+			default:					f1_wren <= 1'b0;

+		endcase

+		//

+		case (fsm_next_state)

+			FSM_STATE_CALC_5,

+			FSM_STATE_CALC_6,

+			FSM_STATE_CALC_7,

+			FSM_STATE_CALC_8:		f2_wren <= 1'b1;

+			default:					f2_wren <= 1'b0;

+		endcase

+		//

+		case (fsm_next_state)			

+			FSM_STATE_SAVE_3,

+			FSM_STATE_SAVE_4,

+			FSM_STATE_SAVE_5:		f_wren <= cyc_cnt_done;

+			default:					f_wren <= 1'b0;

+		endcase

+		//

+	end

+	

+	always @(posedge clk) begin

+		//

+		case (fsm_next_state)

+			FSM_STATE_INIT_1:		f0_data_in <= 32'd1;

+			FSM_STATE_INIT_2:		f0_data_in <= 32'd0;

+			FSM_STATE_SAVE_3,

+			FSM_STATE_SAVE_4,

+			FSM_STATE_SAVE_5:		f0_data_in <= flag_keep_f ? f1_data_out : f2_data_out;

+			default:					f0_data_in <= {32{1'bX}};

+		endcase

+		//

+		case (fsm_next_state)

+			FSM_STATE_CALC_3,

+			FSM_STATE_CALC_4,

+			FSM_STATE_CALC_5,

+			FSM_STATE_CALC_6:		f1_data_in <= f0_data_out_shifted;

+			default:					f1_data_in <= {32{1'bX}};

+		endcase

+		//

+		case (fsm_next_state)

+			FSM_STATE_CALC_5,

+			FSM_STATE_CALC_6,

+			FSM_STATE_CALC_7,

+			FSM_STATE_CALC_8:		f2_data_in <= sub_d;

+			default:					f2_data_in <= {32{1'bX}};

+		endcase

+		//

+		case (fsm_next_state)

+			FSM_STATE_SAVE_3,

+			FSM_STATE_SAVE_4,

+			FSM_STATE_SAVE_5:		f_data_in <= flag_keep_f ? f1_data_out : f2_data_out;

+			default:					f_data_in <= {32{1'bX}};

+		endcase

+		//

+	end

+

+	

+		//

+		// FSM Transition Logic

+		//

+	always @(posedge clk or negedge rst_n)

+		//

+		if (rst_n == 1'b0)	fsm_state <= FSM_STATE_IDLE;

+		else						fsm_state <= fsm_next_state;

+	

+	always @* begin

+		//

+		fsm_next_state = FSM_STATE_STOP;

+		//

+		case (fsm_state)

+

+			FSM_STATE_IDLE:		if (ena_trig)				fsm_next_state = FSM_STATE_INIT_1;

+										else							fsm_next_state = FSM_STATE_IDLE;

+												

+			FSM_STATE_INIT_1:										fsm_next_state = FSM_STATE_INIT_2;

+			

+			FSM_STATE_INIT_2:		if (f0_addr_done)			fsm_next_state = FSM_STATE_CALC_1;

+										else							fsm_next_state = FSM_STATE_INIT_2;

+												

+			FSM_STATE_CALC_1:										fsm_next_state = FSM_STATE_CALC_2;

+

+			FSM_STATE_CALC_2:										fsm_next_state = FSM_STATE_CALC_3;

+

+			FSM_STATE_CALC_3:										fsm_next_state = FSM_STATE_CALC_4;

+			

+			FSM_STATE_CALC_4:										fsm_next_state = FSM_STATE_CALC_5;

+			

+			FSM_STATE_CALC_5:										fsm_next_state = FSM_STATE_CALC_6;

+										

+			FSM_STATE_CALC_6:		if (f1_addr_done)			fsm_next_state = FSM_STATE_CALC_7;

+										else							fsm_next_state = FSM_STATE_CALC_6;

+										

+			FSM_STATE_CALC_7:										fsm_next_state = FSM_STATE_CALC_8;

+			

+			FSM_STATE_CALC_8:										fsm_next_state = FSM_STATE_SAVE_1;

+

+			FSM_STATE_SAVE_1:										fsm_next_state = FSM_STATE_SAVE_2;

+			

+			FSM_STATE_SAVE_2:										fsm_next_state = FSM_STATE_SAVE_3;

+			

+			FSM_STATE_SAVE_3:										fsm_next_state = FSM_STATE_SAVE_4;

+			

+			FSM_STATE_SAVE_4:		if (f12_addr_done_dly)	fsm_next_state = FSM_STATE_SAVE_5;

+										else							fsm_next_state = FSM_STATE_SAVE_4;

+

+			FSM_STATE_SAVE_5:		if (cyc_cnt_done)			fsm_next_state = FSM_STATE_STOP;

+										else							fsm_next_state = FSM_STATE_CALC_1;

+										

+			FSM_STATE_STOP:										fsm_next_state = FSM_STATE_IDLE;

+

+		endcase

+	end

+

+

+endmodule

+

+//======================================================================

+// End of file

+//======================================================================

diff --git a/src/tb/tb_factor.v b/src/tb/tb_factor.v
new file mode 100644
index 0000000..53e6769
--- /dev/null
+++ b/src/tb/tb_factor.v
@@ -0,0 +1,288 @@
+//======================================================================

+//

+// tb_factor.v

+// -----------------------------------------------------------------------------

+// Testbench for Montgomery factor calculation block.

+//

+// Authors: Pavel Shatov

+//

+// Copyright (c) 2017, NORDUnet A/S All rights reserved.

+//

+// Redistribution and use in source and binary forms, with or without

+// modification, are permitted provided that the following conditions

+// are met:

+// - Redistributions of source code must retain the above copyright

+//   notice, this list of conditions and the following disclaimer.

+//

+// - Redistributions in binary form must reproduce the above copyright

+//   notice, this list of conditions and the following disclaimer in the

+//   documentation and/or other materials provided with the distribution.

+//

+// - Neither the name of the NORDUnet nor the names of its contributors may

+//   be used to endorse or promote products derived from this software

+//   without specific prior written permission.

+//

+// THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS

+// IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED

+// TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A

+// PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT

+// HOLDER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,

+// SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED

+// TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR

+// PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF

+// LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING

+// NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS

+// SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.

+//

+//======================================================================

+

+`timescale 1ns / 1ps

+

+module tb_factor;

+

+		//

+		// Test Vectors

+		//

+	`include "../modexp_fpga_model_vectors.v";

+	

+		//

+		// Parameters

+		//

+	localparam NUM_WORDS_384 = 384 / 32;

+		

+		//

+		// Clock (100 MHz)

+		//

+	reg clk = 1'b0;

+	always #5 clk = ~clk;

+			

+		//

+		// Inputs

+		//

+	reg				rst_n;

+	reg				ena;

+	

+	reg	[ 3: 0]	n_num_words;

+

+		//

+		// Outputs

+		//

+	wire				rdy;

+

+		//

+		// Integers

+		//

+	integer w;

+	

+		//

+		// BRAM Interfaces

+		//

+	wire	[ 3: 0]	core_n_addr;

+	wire	[ 3: 0]	core_f_addr;

+	

+	wire	[31: 0]	core_n_data;

+	wire	[31: 0]	core_f_data_in;

+

+	wire				core_f_wren;

+

+	reg	[ 3: 0]	tb_n_addr;
+	reg	[ 3: 0]	tb_f_addr;
+

+	reg	[31:0]	tb_n_data;
+	wire	[31:0]	tb_f_data;
+	
+	reg				tb_n_wren;
+	

+		//

+		// BRAMs

+		//

+	bram_1rw_1ro_readfirst #(.MEM_WIDTH(32), .MEM_ADDR_BITS(4))
+	bram_n (.clk(clk),

+		.a_addr(tb_n_addr), .a_wr(tb_n_wren), .a_in(tb_n_data), .a_out(),
+		.b_addr(core_n_addr), .b_out(core_n_data));
+

+	bram_1rw_1ro_readfirst #(.MEM_WIDTH(32), .MEM_ADDR_BITS(4))
+	bram_f (.clk(clk),

+		.a_addr(core_f_addr), .a_wr(core_f_wren), .a_in(core_f_data_in), .a_out(),
+		.b_addr(tb_f_addr), .b_out(tb_f_data));
+

+		//

+		// UUT

+		//

+	modexpa7_factor #

+	(

+		.OPERAND_ADDR_WIDTH		(4)	// 32 * (2**4) = 512-bit operands

+	)

+	uut

+	(

+		.clk				(clk), 

+		.rst_n			(rst_n), 

+		

+		.ena				(ena), 

+		.rdy				(rdy), 

+		

+		.n_bram_addr	(core_n_addr), 

+		.f_bram_addr	(core_f_addr), 

+

+		.n_bram_out		(core_n_data), 

+		

+		.f_bram_in		(core_f_data_in), 

+		.f_bram_wr		(core_f_wren), 

+		

+		.n_num_words	(n_num_words)

+	);

+

+

+		//

+		// Script

+		//

+	initial begin

+

+		rst_n = 1'b0;

+		ena = 1'b0;

+		

+		#200;		

+		rst_n = 1'b1;

+		#100;

+		

+		test_factor_384(N_384);

+		

+	end

+      

+		

+		//

+		// Test Tasks

+		//

+		

+	task test_factor_384;
+		input	[383:0] n;

+		reg	[383:0] f;

+		reg	[383:0] factor;

+		integer i;
+		begin

+						

+			calc_factor_384(n, f);							// calculate factor on-the-fly

+			

+				// make sure, that the value matches the one saved in the include file

+			if (f !== FACTOR_384) begin

+				$display("ERROR: Calculated factor value differs from the one in the test vector!");

+				$finish;

+			end

+			

+			

+			n_num_words = 4'd11;								// set number of words
+			

+			write_memory_384(n);								// fill memory

+			
+			ena = 1;												// start operation
+			#10;													//

+			ena = 0;												// clear flag

+			
+			while (!rdy) #10;									// wait for operation to complete

+			read_memory_384(factor);						// get result from memory
+							

+			$display("    calculated: %x", factor);	//

+			$display("    expected:   %x", f);			//

+							

+				// check calculated value

+			if (f === factor) begin
+				$display("        OK");

+				$display("SUCCESS: Test passed.");
+			end else begin

+				$display("        ERROR");

+				$display("FAILURE: Test not passed.");

+			end

+		

+		end
+	

+	endtask
+

+

+	task write_memory_384;

+

+		input	[383:0] n;

+

+		reg	[383:0] n_shreg;

+		

+		begin
+			

+			tb_n_wren	= 1;														// start filling memories
+			
+			n_shreg       = n;													//

+			
+			for (w=0; w<NUM_WORDS_384; w=w+1) begin						// write all words
+				
+				tb_n_addr	= w[3:0];											// set addresses
+				
+				tb_n_data       = n_shreg[31:0];								//

+				
+				n_shreg       = {{32{1'bX}}, n_shreg[383:32]};			//

+				
+				#10;																	// wait for 1 clock tick
+				
+			end
+			
+			tb_n_addr	= {4{1'bX}};											// wipe addresses
+			
+			tb_n_data       = {32{1'bX}};										//

+			
+			tb_n_wren = 0;														// stop filling memories

+		

+		end

+		

+	endtask
+			
+

+	task read_memory_384;

+	

+		output	[383:0] f;

+		reg		[383:0] f_shreg;

+		

+		begin

+		

+				// read result word-by-word

+			for (w=0; w<NUM_WORDS_384; w=w+1) begin
+				tb_f_addr	= w[3:0];							// set address
+				#10;													// wait for 1 clock tick
+				f_shreg = {tb_f_data, f_shreg[383:32]};	// store data word
+			end

+			

+			tb_f_addr = {4{1'bX}};								// wipe address

+			f = f_shreg;											// return

+			

+		end

+		

+	endtask
+

+

+	task calc_factor_384;

+

+		input		[383:0] n;

+		output	[383:0] factor;

+		reg		[383:0] f;

+		reg		[384:0] f1;

+		reg		[384:0] f2;

+		integer i;

+

+		begin

+

+			f = 384'd1;

+

+			for (i=0; i<768; i=i+1) begin

+				f1 = {f, 1'b0};

+				f2 = f1 - {1'b0, n};

+				f = (f1 >= {1'b0, n}) ? f2 : f1;
+			end

+

+			factor = f;

+

+		end

+

+	endtask
+

+

+endmodule

+

+//======================================================================

+// End of file

+//======================================================================