Network


Latest external collaboration on country level. Dive into details by clicking on the dots.

Hotspot


Dive into the research topics where Padmanabhan Balasubramanian is active.

Publication


Featured researches published by Padmanabhan Balasubramanian.


ieee computer society annual symposium on vlsi | 2009

Dual-Sum Single-Carry Self-Timed Adder Designs

Padmanabhan Balasubramanian; Doug A. Edwards

This paper presents designs of self-timed dual-sum single-carry or dual-bit adder function blocks, constructed using commercially available synchronous library resources (standard cells) and validated using synchronous tools. Specifically, the proposed adder modules qualify as either quasi-delay-insensitive or speed-independent and satisfy Seitz’s weak-indication timing constraints. The delay-insensitive version of the ripple carry adder topology has been used to analyze the designs. The indication (completion) is either made implicit in the topology (local indication) or considerably isolated from the actual data path (a new variant of global indication). The proposed adders are found to exhibit improved power and performance parameters, whilst being competitive in terms of area, in comparison with those pertaining to other self-timed logic realizations


canadian conference on electrical and computer engineering | 2007

Synthesis of Power and Delay Optimized NIG structures

Padmanabhan Balasubramanian; Doug A. Edwards

Structuring and mapping of a Boolean function is an important problem in the design of digital combinatorial circuits. Library aware constructive decomposition offers a solution to this problem. Compact multi-level representation of binary networks, based on simple circuit structures, such as AND-inverter graphs (AIG) [1] [5], NAND graphs, OR-inverter graphs (OIG), AND-XOR-inverter graphs, reduced Boolean circuits [8] does exist in literature. In this work, we discuss a novel efficient synthesis method for combinational logic circuits, represented using a NAND-inverter graph (NIG), which is composed of only two-input NAND (NAND2) and inverter (INV) cells. The networks are constructed on the basis of irredundant disjunctive normal forms, comprising terms with minimal cardinality. Construction of a NIG for a non-regenerative function in normal form would be straightforward, whereas for the opposite phase, it would be developed by considering a virtual instance of the function. However, the choice of best NIG for a given function would be based upon node count and cell count needed for actual implementation at the technology independent stage. We compare the power efficiency and delay improvement achieved by optimal NIGs over minimal AIGs and OIGs for some case studies. In comparison with functionally equivalent and redundant AIGs, NIGs report mean savings in power and delay of 33.76% and 18.57% respectively, after technology mapping with a 0.35 micron TSMC CMOS process. For a similar comparison with OIGs, NIGs demonstrate average savings in power and delay of 45.67% and 20.92% respectively.


WSEAS Transactions on Circuits and Systems archive | 2009

High speed gate level synchronous full adder designs

Padmanabhan Balasubramanian; Nikos E. Mastorakis


annual conference on computers | 2011

QDI decomposed DIMS method featuring homogeneous/heterogeneous data encoding

Padmanabhan Balasubramanian; Nikos E. Mastorakis


WSEAS Transactions on Circuits and Systems archive | 2011

A robust asynchronous early output full adder

Padmanabhan Balasubramanian


ACC'10 Proceedings of the 2010 international conference on Applied computing conference | 2010

A set theory based method to derive network reliability expressions of complex system topologies

Padmanabhan Balasubramanian; Nikos E. Mastorakis


ECC'09 Proceedings of the 3rd international conference on European computing conference | 2009

A delay improved gate level full adder design

Padmanabhan Balasubramanian; Nikos E. Mastorakis


international conference on circuits | 2010

Robust asynchronous implementation of Boolean functions on the basis of duality

Padmanabhan Balasubramanian; Krishnamachar Prasad; Nikos E. Mastorakis


international conference on applied mathematics | 2009

A low power gate level full adder module

Padmanabhan Balasubramanian; Nikos E. Mastorakis


arXiv: Hardware Architecture | 2016

A Fault Tolerance Improved Majority Voter for TMR System Architectures.

Padmanabhan Balasubramanian; Krishnamachar Prasad; Nikos E. Mastorakis

Collaboration


Dive into the Padmanabhan Balasubramanian's collaboration.

Top Co-Authors

Avatar
Top Co-Authors

Avatar

Krishnamachar Prasad

Auckland University of Technology

View shared research outputs
Top Co-Authors

Avatar
Top Co-Authors

Avatar

D.A. Edwards

University of Manchester

View shared research outputs
Researchain Logo
Decentralizing Knowledge