James Stine

Prof. Dr. James Stine

Department of Electrical and Computer Engineering, Oklahoma State University, Stillwater, OK 74078, USA

Research Focus & Metrics

Academic Career Length

28Years (1999-Present)

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

Representative Publications

View All Publications
1 June 2007
Verified
Conference Paper
Closed access
JSJames Stine
James Stine
ICIvan Castellanos
Ivan Castellanos
MWMichael Wood
Michael Wood
JHJeff Henson
Jeff Henson
FLFred Love
Fred Love
RJRavi Jenkal
Ravi Jenkal
This paper discusses an open source, variation aware Process Design Kit (PDK), based on Scalable CMOS design rules, down to 45 nm,for use in VLSI research, education and small businesses. This kit includes all the necessary layout design rules and extraction command decks to capture layout dependent systematic variation and perform statistical circuit analysis. The kit also includes a standard cell and pad library with the necessary support files to enable full chip place and route and verification for System on Chip designs. Test chips designed with this PDK are designed in such a way so that they can be fabricated by fabrication facilities allowing validation of the design rules so that the rules may be used in future multi-project runs and design contests.

7 November 2016
Verified
Conference Paper
Open access
MGMatthew R. Guthaus
Matthew R. Guthaus
JSJames Stine
James Stine
SASamira Ataei
Samira Ataei
BCBrian Chen
Brian Chen
BWBin Wu
Bin Wu
MSMehedi Sarwar
Mehedi Sarwar
Computer systems research is often inhibited by the availability of memory designs. Existing Process Design Kits (PDKs) frequently lack memory compilers, while expensive commercial solutions only provide memory models with immutable cells, limited configurations, and restrictive licenses. Manually creating memories can be time consuming and tedious and the designs are usually inflexible. This paper introduces OpenRAM, an open-source memory compiler, that provides a platform for the generation, characterization, and verification of fabricable memory designs across various technologies, sizes, and configurations. It enables research in computer architecture, system-on-chip design, memory circuit and device research, and computer-aided design.

1 January 1999 in IEEE Transactions on Computers
Verified
Journal Article
Closed access
MSM.J. Schulte
M.J. Schulte
JSJames Stine
James Stine

1 June 1999 in Journal of Signal Processing Systems
Verified
Journal Article
Closed access
PDF file
JSJames Stine
James Stine
MSMichael J. Schulte
Michael J. Schulte

1 January 1999
Verified
Conference Paper
Closed access
MSM.J. Schulte
M.J. Schulte
JSJames Stine
James Stine
JJJ.G. Jansen
J.G. Jansen
Reducing the power dissipation of parallel multipliers is important in the design of digital signal processing systems. In many of these systems, the products of parallel multipliers are rounded to avoid growth in word size. The power dissipation and area of rounded parallel multipliers can be significantly reduced by a technique known as truncated multiplication. With this technique, the least significant columns of the multiplication matrix are not used. Instead, the carries generated by these columns are estimated. This estimate is added with the most significant columns to produce the rounded product. This paper presents the design and implementation of parallel truncated multipliers. Simulations indicate that truncated parallel multipliers dissipate between 29 and 40 percent less power than standard parallel multipliers for operand sizes of 16 and 32 bits.

22 November 2002
Verified
Conference Paper
Closed access
MSM.J. Schulte
M.J. Schulte
JSJames Stine
James Stine
The paper presents a methodology for designing bipartite tables for accurate function approximation. Bipartite tables use two parallel table lookups to obtain a carry-save (borrow-save) function approximation. A carry propagate adder can then convert this approximation to a two's complement number or the approximation can be directly Booth encoded. Our method for designing bipartite tables, called the Symmetric Bipartite Table Method, utilizes symmetry in the table entries to reduce the overall memory requirements. It has several advantages over previous bipartite table methods in that it: (1) provides a closed form solution for the table entries; (2) has right bounds on the maximum absolute error; (3) requires smaller table lookups to achieve a given accuracy; and (4) can be applied to a wide range of functions. Compared to conventional table lookups, the symmetric bipartite tables presented are 15.0 to 41.7 times smaller when the operand size is 16 bits and 99.1 to 273.9 times smaller when the operand size is 24 bits.