Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Behjat Forouzandeh

dblp:76/29 · also Bahjat Forouzandeh · DBLP profile ↗
← Back
5ranked-venue papers
0as first author
2since 2021 · last 2024
0009-0005-8330-0782ORCID · corroborated

Domains — the database's venue-derived domains; a paper can count in several

Systems, architecture and hardware · 3 · 1 since 2021Artificial intelligence and machine learning · 1 · 1 since 2021Applied, interdisciplinary, general and emerging computing · 1

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Computer architecture, parallel and distributed computing, and storage systems
1 paper
Electronic design automation · 75% Processor architecture and microarchitecture · 25%

Topics — the 4 heaviest of 4, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Electronic design automation › high-level synthesis › arithmetic-level optimization
bit-width optimization
0.312017
Improved Range Analysis in Fixed-Point Polynomial Data-Path · IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 2017
Processor architecture and microarchitecture › computer arithmetic
fixed-point arithmetic
0.312017
Improved Range Analysis in Fixed-Point Polynomial Data-Path · IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 2017
Electronic design automation › hardware verification and test
hardware verification
0.312017
Improved Range Analysis in Fixed-Point Polynomial Data-Path · IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 2017
Electronic design automation
high-level synthesis
0.312017
Improved Range Analysis in Fixed-Point Polynomial Data-Path · IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 2017

Methods — techniques the papers use, named apart from their topics

satisfiability modulo theories · 0.3polynomial optimization · 0.3
YearPublicationVenuePosition
2024 High-performance power spectral/bispectral estimator for biomedical signal processing applications using novel memory-based FFT processor
Abdolvahab Khalili Sadaghiani, Behjat Forouzandeh
Integr.2
2022 Image interpolation based on 2D-DWT and HDP-HMM
Abdolvahab Khalili Sadaghiani, Behjat Forouzandeh
Pattern Anal. Appl.2
2017 Improved Range Analysis in Fixed-Point Polynomial Data-Path
abstract
In range analysis (RA), suitable integer bit-widths are assigned to the variables so that no overflow occurs. Although the accuracy in RA rather than error analysis has more impact on hardware cost and efficiency, there are few works that offer new approaches to improve RA. Arithmetic functions, mostly represented by polynomials, are normally suitable for both optimization and verification purposes. In this paper, a safe and more accurate RA of feed-forward fixed-point polynomial data-flow graphs is proposed. The method employs particular features of RA and maps it to a specific class of polynomial optimization problems. The proposed method provides tighter ranges while taking less runtime in comparison with satisfiability-modulo theory-based method. Furthermore, the improved ranges lead to enhance the area and delay efficiency more than 50% and 24%, respectively, when the circuits are implementing the functions in comparison with the state-of-the-art techniques.
Mahdieh Grailoo, Bijan Alizadeh, Behjat Forouzandeh
IEEE Trans. Comput. Aided Des. Integr. Circuits Syst.3
2012 High-performance low-leakage regions of nano-scaled CMOS digital gates under variations of threshold voltage and mobility
abstract
We propose a modeling methodology for both leakage power consumption and delay of basic CMOS digital gates in the presence of threshold voltage and mobility variations. The key parameters in determining the leakage and delay are OFF and ON currents, respectively, which are both affected by the variation of the threshold voltage. Additionally, the current is a strong function of mobility. The proposed methodology relies on a proper modeling of the threshold voltage and mobility variations, which may be induced by any source. Using this model, in the plane of threshold voltage and mobility, we determine regions for different combinations of performance (speed) and leakage. Based on these regions, we discuss the trade-off between leakage and delay where the leakage-delay-product is the optimization objective. To assess the accuracy of the proposed model, we compare its predictions with those of HSPICE simulations for both basic digital gates and ISCAS85 benchmark circuits in 45-, 65-, and 90-nm technologies.
Hossein Aghababa, Behjat Forouzandeh, Ali Afzali-Kusha
J. Zhejiang Univ. Sci. C2
2010 Statistical delay modeling of read operation of SRAMs due to channel length variation
abstract
In this paper, we present a statistical modeling for the transition time of the static random-access memories during the read operation in the presence of the channel length variation. To model the I-V characteristics of the transistors, the a-power law model which is a simple analytical MOS model is used. To increase the accuracy, the effects of the short channel lengths as well as the drain bias are included in the modeling. The statistical analytical modeling is achieved by taking the partial derivations of the transition time expression. To assess the accuracy of the technique, HSPICE Monte-Carlo simulations have been used for a 65nm CMOS technology. The comparison, which is performed for different correlation coefficients, shows a very good accuracy for the model which is evaluated at substantially lower runtime.
Hossein Aghababa, Mahmoud Zangeneh, Ali Afzali-Kusha, Behjat Forouzandeh
ISCAS4