Sezer Goren

Dr. Sezer Goren

Electrical and Computer Engineering, University of Massachusetts Dartmouth, New Bedford, Massachusetts, USA
orcid

Research Focus & Metrics

Academic Career Length

24Years (2003-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
31 January 2007 in Computers and Electrical Engineering
Verified
Journal Article
Closed access
Sezer GorenSezer Goren
Sezer Goren
FFF. Joel Ferguson
F. Joel Ferguson

23 May 2017 in IEEE Transactions on Computers
Verified
Journal Article
Closed access
HUH. Fatih Ugurdag
H. Fatih Ugurdag
FDFlorent de Dinechin
Florent de Dinechin
YGY. Serhan Gener
Y. Serhan Gener
Sezer GorenSezer Goren
Sezer Goren
LDLaurent-Stephane Didier
Laurent-Stephane Didier
This article studies the design of custom circuits for division by a small positive constant. Such circuits can be useful for specific FPGA and ASIC applications. The first problem studied is the Euclidean division of an unsigned integer by a constant, computing a quotient and remainder. Several new solutions are proposed and compared against the state-of-the-art. As the proposed solutions use small look-up tables, they match well with the hardware resources of an FPGA. The article then studies whether the division by the product of two constants is better implemented as two successive dividers or as one atomic divider. It also considers the case when only a quotient or only a remainder is needed. Finally, it addresses the correct rounding of the division of a floating-point number by a small integer constant. All these solutions, and the previous state-of-the-art, are compared in terms of timing, area, and area-timing product. In general, the relevance domains of the various techniques are different on FPGA and on ASIC.

3 April 2014 in IEEE Transactions on Computers
Verified
Journal Article
Closed access
BYBilgiday Yuce
Bilgiday Yuce
HUH. Fatih Ugurdag
H. Fatih Ugurdag
Sezer GorenSezer Goren
Sezer Goren
GDGunhan Dundar
Gunhan Dundar
Finding the value and/or index of the maximum (or minimum) element of a set of n numbers (each with k-bits) is a fundamental arithmetic operation and is needed in many applications. This paper proposes several maximum-finder (or minimum-finder) circuit topologies, which are parallel. We wrote circuit generators at hardware description language level for our topologies and previous works. Then we synthesized these circuits for 20 different (n, k) cases (with values up to 64) and compared their efficiency in timing (latency), area, and energy. The timing complexity of our fastest topology is O(log n + log k), whereas the fastest in the literature is O(log n log k). The synthesis results showed that our fastest topology is 1.2-2.2 times (1.6 times on the average) faster than the state-of-the-art. In this paper, we argue that a more fair metric of area efficiency is area-timing product. In terms of ATP, our proposed topologies are better than the state-of-the-art in 19 out of the 20 cases. In terms of energy (i.e., power-timing product, abbreviated as PTP), we are better in 11 cases out of 20.

12 October 2014
Verified
Conference Paper
Open access
PDF file
AJAnju Johnson
Anju Johnson
SSSayandeep Saha
Sayandeep Saha
RCRajat Subhra Chakraborty
Rajat Subhra Chakraborty
DMDebdeep Mukhopadhyay
Debdeep Mukhopadhyay
Sezer GorenSezer Goren
Sezer Goren

1 February 2013 in Computers and Electrical Engineering
Verified
Journal Article
Closed access
Sezer GorenSezer Goren
Sezer Goren
OOOzgur Ozkurt
Ozgur Ozkurt
AYAbdullah Yildiz
Abdullah Yildiz
HUH. Fatih Ugurdag
H. Fatih Ugurdag
RCRajat S. Chakraborty
Rajat S. Chakraborty
DMDebdeep Mukhopadhyay
Debdeep Mukhopadhyay

1 March 2017 in Integration
Verified
Journal Article
Closed access
AKAhmet Kakacak
Ahmet Kakacak
AGAydin Emre Guzel
Aydin Emre Guzel
OCOzan Cihangir
Ozan Cihangir
Sezer GorenSezer Goren
Sezer Goren
HUH. Fatih Ugurdag
H. Fatih Ugurdag