PIECEWISE LINERIZATION OF LOGIC FUNCTIONS * (2008)
Ilya Levin, Osnat Keren, George Kolotov, Mark Karpovsky
The paper deals with a problem of linearization of multi-output logic functions. Specifically, the case is discussed, when the functions have a large number of variables and cannot be efficiently...
UNICAST MESSAGE ROUTING IN СOMMUNICATION NETWORKS WITH IRREGULAR TOPOLOGY (2008)
Lev Zakrevski, Sharad Jaiswal, Mark Karpovsky
Abstract. In this paper we consider the problem of deadlock-free unicast wormhole routing in computer and communication networks with irregular topologies. An example of such networks are Network of...
Asynchronous Balanced Gates Tolerant to Interconnect Variability (2008)
Konrad J. Kulikowski, Vyas Venkataraman, Zhen Wang, Er Taubin, Mark Karpovsky
Abstract — Existing methods of gate level power attack countermeasures depend on exact capacitance matching of the dual-rail data outputs of each gate. Process variability and a lack of design...
New Architecture for Sequential Machines with Self-error Detection (2007)
Mark Karpovsky, Ilya Levin, Vladimir Sinelnikov, Roman Goot
The present paper investigates a new technique for on-line checking of FPGA-based sequential devices defined by their finite state machines (FSMs). This technique is based on architecture comprising...
Space-Time Turn Prohibitions for Low Density Parity-Check Codes (2007)
Ari Trachtenberg, Mark Karpovsky
In 1948 Shannon [1] proved that error-free communication is possible through a communication channel at rates up to its capacity. Unfortunately, Shannon's proof was non-constructive and...
Space-Time Turn Prohibitions for Low Density Parity-Check Codes (2007)
Ari Trachtenberg, Mark Karpovsky
Introduction Low Density Parity-Check (LDPC) codes, which are codes whose paritycheck matrix is very sparse, are decoded with an iterative decoding algorithm, known as the sum-product algorithm, that...
A new algorithm for finding minimal cycle-breaking sets of turns in a graph (2006)
Lev Levitin, Mark Karpovsky, Mehmet Mustafa, Lev Zakrevsky
We consider the problem of constructing a minimal cycle-breaking set of turns for a given undirected graph. This problem is important for deadlock-free wormhole routing in computer and communication...
An Automated Fine-Grain Pipelining Using Domino Style Asynchronous Library (2005)
Er Smirnov, Er Taubin, Ming Su, Mark Karpovsky
Register Transfer Level (RTL) synthesis model which simplified the design of clocked circuits allowed design automation boost and VLSI progress for more than a decade. Shrinking technology and...
An Automated Fine-Grain Pipelining Using Domino Style Asynchronous Library (2005)
Er Smirnov, Er Taubin, Ming Su, Mark Karpovsky
Register Transfer Level (RTL) synthesis model which simplified the design of clocked circuits allowed design automation boost and VLSI progress for more than a decade. Shrinking technology and...
Gate Transfer Level Synthesis as an Automated Approach to Fine-Grain Pipelining (2004)
Re Smirnov, Er Taubin, Mark Karpovsky, Leonid Rozenblyum
Register Transfer Level (RTL) synthesis method in clocked designs simplified circuit design and allowed design automation boosting VLSI progress for more than a decade. Shrinking technology and...
New Class of Nonlinear Systematic Error Detecting Codes (2004)
Mark Karpovsky, Alexander Taubin, Er Taubin, Senior Member
We will say that code C detects error e with probability 1 Q(e), if Q(e) is a fraction of codewords y such that y, y + e C. We present a class of optimal nonlinear q- ary systematic (n, k)-codes...
Gate Transfer Level Synthesis as an Automated Approach to Fine-Grain Pipelining (2004)
Alexandre Smirnov, Alexander Taubin, Re Smirnov, Er Taubin, Mark Karpovsky, Leonid Rozenblyum
this paper. The use of dynamic logic is attractive for synchronous designs but no dynamic gate standard cell libraries exist so far mostly due to the late input arrival, charge sharing and noise...
Mark Karpovsky, Konrad J. Kulikowski, Er Taubin, Senior Member
We present a method of protecting a hardware implementation of the Advanced Encryption Standard (AES) against a side-channel attack known as Differential Fault Analysis attack. The method uses...
Karpovsky M. “Automated Pipelining in ASIC Synthesis Methodology: Gate Transfer Level (2004)
Re Smirnov, Er Taubin, Mark Karpovsky
The paper presents Gate Transfer Level (GTL) as a general framework for synthesis of industrial complexity asynchronous quasi-delay-insensitive (QDI) circuits. The GTL flow automatically provides the...
Mark Karpovsky, Konrad J. Kulikowski, Er Taubin
Abstract: We present two architectures for protecting a hardware implementation of AES against side-channel attacks known as Differential Fault Analysis attacks. The first architecture, which is...
Mark Karpovsky, Konrad J. Kulikowski, Er Taubin
Abstract: We present two architectures for protecting a hardware implementation of AES against side-channel attacks known as Differential Fault Analysis attacks. The first architecture, which is...
Application of Network Calculus to General Topologies using Turn-Prohibition (2003)
David Starobinski, Mark Karpovsky, Lev Zakrevski
Abstract — Network calculus is known to apply in general only to feed-forward routing networks, i.e., networks where routes do not create cycles of interdependent packet flows. In this paper, we...
Application of Network Calculus to General Topologies using Turn-Prohibition (2003)
David Starobinski, Mark Karpovsky, Lev Zakrevski
Abstract — Network calculus is known to apply in general only to feedforward routing networks, i.e., networks where routes do not create cycles of interdependent packet flows. In this paper, we...
Application of Network Calculus to General Topologies using Turn-Prohibition (2003)
David Starobinski, Mark Karpovsky, Lev Zakrevski
Abstract — Network calculus is known to apply in general only to feedforward routing networks, i.e., networks where routes do not create cycles of interdependent packet flows. In this paper, we...
Application of Network Calculus to General Topologies using Turn-Prohibition (2003)
David Starobinski, Mark Karpovsky, Lev Zakrevski
Abstract--- Network calculus is known to apply in general only to feedforward routing networks, i.e., networks where routes do not create cycles of interdependent packet flows. In this paper, we...
Application of Network Calculus to General Topologies using Turn-Prohibition (2003)
David Starobinski, Mark Karpovsky, Lev Zakrevski
Abstract — Network calculus is known to apply in general only to feed-forward routing networks, i.e., networks where routes do not create cycles of interdependent packet flows. In this paper, we...
Fault-tolerant message routing for multiprocessors (1998)
Abstract. In this paper the problem of fault-tolerant message routing in two-dimensional meshes, with each inner node having 4 neighbors, is investigated. It is assumed that some nodes/links can be...