2022-07-15 21:42:45 +00:00
|
|
|
///////////////////////////////////////////
|
|
|
|
// otfc.sv
|
|
|
|
//
|
|
|
|
// Written: me@KatherineParry.com, cturek@hmc.edu
|
|
|
|
// Modified:7/14/2022
|
|
|
|
//
|
|
|
|
// Purpose: On the fly conversion
|
|
|
|
//
|
|
|
|
// A component of the Wally configurable RISC-V project.
|
|
|
|
//
|
|
|
|
// Copyright (C) 2021 Harvey Mudd College & Oklahoma State University
|
|
|
|
//
|
|
|
|
// MIT LICENSE
|
|
|
|
// Permission is hereby granted, free of charge, to any person obtaining a copy of this
|
|
|
|
// software and associated documentation files (the "Software"), to deal in the Software
|
|
|
|
// without restriction, including without limitation the rights to use, copy, modify, merge,
|
|
|
|
// publish, distribute, sublicense, and/or sell copies of the Software, and to permit persons
|
|
|
|
// to whom the Software is furnished to do so, subject to the following conditions:
|
|
|
|
//
|
|
|
|
// The above copyright notice and this permission notice shall be included in all copies or
|
|
|
|
// substantial portions of the Software.
|
|
|
|
//
|
|
|
|
// THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR IMPLIED,
|
|
|
|
// INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, FITNESS FOR A PARTICULAR
|
|
|
|
// PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS
|
|
|
|
// BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT,
|
|
|
|
// TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE
|
|
|
|
// OR OTHER DEALINGS IN THE SOFTWARE.
|
|
|
|
////////////////////////////////////////////////////////////////////////////////////////////////
|
|
|
|
|
|
|
|
`include "wally-config.vh"
|
|
|
|
|
2022-07-21 19:38:06 +00:00
|
|
|
///////////////////////////////
|
|
|
|
// Square Root OTFC, Radix 2 //
|
|
|
|
///////////////////////////////
|
|
|
|
module sotfc2(
|
2022-07-23 00:41:18 +00:00
|
|
|
input logic sp, sz,
|
2022-09-19 05:42:35 +00:00
|
|
|
input logic [`DIVb+1:0] C,
|
2022-07-23 00:41:18 +00:00
|
|
|
input logic [`DIVb:0] S, SM,
|
|
|
|
output logic [`DIVb:0] SNext, SMNext
|
2022-07-21 19:38:06 +00:00
|
|
|
);
|
|
|
|
// The on-the-fly converter transfers the square root
|
|
|
|
// bits to the quotient as they come.
|
|
|
|
// Use this otfc for division and square root.
|
2022-09-19 07:51:56 +00:00
|
|
|
logic [`DIVb:0] K;
|
2022-07-21 19:38:06 +00:00
|
|
|
|
2022-09-19 07:51:56 +00:00
|
|
|
assign K = (C[`DIVb:0] & ~(C[`DIVb:0] << 1));
|
2022-07-21 19:38:06 +00:00
|
|
|
|
|
|
|
always_comb begin
|
|
|
|
if (sp) begin
|
2022-09-19 07:51:56 +00:00
|
|
|
SNext = S | K;
|
2022-07-21 19:38:06 +00:00
|
|
|
SMNext = S;
|
2022-07-23 00:41:18 +00:00
|
|
|
end else if (sz) begin
|
2022-07-21 19:38:06 +00:00
|
|
|
SNext = S;
|
2022-09-19 07:51:56 +00:00
|
|
|
SMNext = SM | K;
|
2022-07-23 00:41:18 +00:00
|
|
|
end else begin // If sp and sz are not true, then sn is
|
2022-09-19 07:51:56 +00:00
|
|
|
SNext = SM | K;
|
2022-07-23 00:41:18 +00:00
|
|
|
SMNext = SM;
|
2022-07-21 19:38:06 +00:00
|
|
|
end
|
|
|
|
end
|
2022-07-23 00:41:18 +00:00
|
|
|
|
2022-07-21 19:38:06 +00:00
|
|
|
endmodule
|
2022-07-15 21:42:45 +00:00
|
|
|
|
2022-07-21 19:38:06 +00:00
|
|
|
///////////////////////////////
|
|
|
|
// Square Root OTFC, Radix 4 //
|
|
|
|
///////////////////////////////
|
|
|
|
module sotfc4(
|
|
|
|
input logic [3:0] s,
|
|
|
|
input logic Sqrt,
|
2022-09-01 22:49:13 +00:00
|
|
|
input logic [`DIVb:0] S, SM,
|
|
|
|
input logic [`DIVb:0] C,
|
|
|
|
output logic [`DIVb:0] SNext, SMNext
|
2022-07-21 19:38:06 +00:00
|
|
|
);
|
|
|
|
// The on-the-fly converter transfers the square root
|
|
|
|
// bits to the quotient as they come.
|
|
|
|
// Use this otfc for division and square root.
|
|
|
|
|
|
|
|
always_comb begin
|
|
|
|
if (s[3]) begin
|
|
|
|
SNext = S | ((C << 1)&~(C << 2));
|
|
|
|
SMNext = S | (C&~(C << 1));
|
|
|
|
end else if (s[2]) begin
|
|
|
|
SNext = S | (C&~(C << 1));
|
|
|
|
SMNext = S;
|
|
|
|
end else if (s[1]) begin
|
|
|
|
SNext = SM | (C&~(C << 2));
|
|
|
|
SMNext = SM | ((C << 1)&~(C << 2));
|
|
|
|
end else if (s[0]) begin
|
|
|
|
SNext = SM | ((C << 1)&~(C << 2));
|
|
|
|
SMNext = SM | (C&~(C << 1));
|
|
|
|
end else begin // If sp and sn are not true, then sz is
|
|
|
|
SNext = S;
|
|
|
|
SMNext = SM | (C & ~(C << 2));
|
|
|
|
end
|
|
|
|
end
|
|
|
|
|
|
|
|
endmodule
|