M. B. Srinivas
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
M. B. Srinivas has a total of 6 co-authors. Here are the top co-authors by number of shared publications:
- Himanshu Thapliyal
School of Computer Engineering, Nanyang Technological University, Singapore 639798
7 shared publications - R.V. Kamala
Center for VLSI and Embedded System Technologies, International Institute of Information Technology, Gachibowli, Hyderabad, India - 500032
2 shared publications - Garimella Rama Murthy
International Institute of Information Technology
1 shared publication - Hamid Reza Arabnia
School of Computing, University of Georgia, Athens, GA 30602, USA, USA
1 shared publication - Saurabh Kotiyal1 shared publication
- Vasanth Iyer
Troy Univ. (United States)
1 shared publication
Latest Publications
- Open Access
- 1 January 2008
- Published by Walter de Gruyter GmbH in International Journal on Smart Sensing and Intelligent Systems
- Vol. 1 (4) , 912-921
Training Data Compression Algorithms and Reliability in Large Wireless Sensor Networks
With the availability of low-cost sensor nodes there have been many standards developed to integrate and network these nodes to form a reliable network allowing many different types of hardware vendors to coexist. Most of these solutions however have aimed at industry-specific interoperability but not the size of the sensor network and the large amount of data which is collected in course of its lifetime. In this paper we use well studied data compression algorithms which optimize on bringing down the data redundancy which is related to correlated sensor readings and using a probability model to efficiently compress data at the cluster heads. As in the case of sensor networks the data reliability goes down as the network resource depletes and these types of networks lacks any central synchronization making it even more a global problem to compare different reading at the central coordinator. The complexity of calibrating each sensor and using an adaptable measured threshold to correct the reading from sensors is a severe drain in terms of network resources and energy consumption. In this paper we separate the task of comparative global analysis to a central coordinator and use a reference PM ax which is a normalized probability of individual source which reflects the current lifetime reliability of the sensors calculated at the cluster heads which then is compared with the current global reliability index based on all the PMax of cluster heads. As this implementation does not need any synchronization at the local nodes it uses compress once and stamp locally without any threshold such as application specific calibration values (30±C ) and the summarization can be application independent making it more a sensor network reliability index and using it independent of the actual measured values.
- 1 January 2008
- Published by Walter de Gruyter GmbH in International Journal on Smart Sensing and Intelligent Systems
- Vol. 1 (4) , 912-921
Open AccessTraining Data Compression Algorithms and Reliability in Large Wireless Sensor Networks
With the availability of low-cost sensor nodes there have been many standards developed to integrate and network these nodes to form a reliable network allowing many different types of hardware vendors to coexist. Most of these solutions however have aimed at industry-specific interoperability but not the size of the sensor network and the large amount of data which is collected in course of its lifetime. In this paper we use well studied data compression algorithms which optimize on bringing down the data redundancy which is related to correlated sensor readings and using a probability model to efficiently compress data at the cluster heads. As in the case of sensor networks the data reliability goes down as the network resource depletes and these types of networks lacks any central synchronization making it even more a global problem to compare different reading at the central coordinator. The complexity of calibrating each sensor and using an adaptable measured threshold to correct the reading from sensors is a severe drain in terms of network resources and energy consumption. In this paper we separate the task of comparative global analysis to a central coordinator and use a reference PM ax which is a normalized probability of individual source which reflects the current lifetime reliability of the sensors calculated at the cluster heads which then is compared with the current global reliability index based on all the PMax of cluster heads. As this implementation does not need any synchronization at the local nodes it uses compress once and stamp locally without any threshold such as application specific calibration values (30±C ) and the summarization can be application independent making it more a sensor network reliability index and using it independent of the actual measured values.
- 1 October 2006
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- No. 23248432,p. 58-62
High-Throughput Montgomery Modular Multiplication
The efficiency of public key encryption schemes like RSA and elliptic curve cryptography can be improved using fast modular multiplication schemes. In this paper, the authors propose an efficient Montgomery modular multiplication technique that employs multi-bit shifting and carry-save addition to perform long-integer arithmetic and hence conventional lengthy additions required at each stage are avoided. The corresponding hardware realization is optimal in terms of delay and offers high data throughput compared to the recently proposed designs while it occupies slightly more area. The optimization is technology independent and thus should suit well for not only FPGA implementation but also ASIC. The design has been evaluated on Virtex2 series FPGA for practical bit lengths of 512,1024 and 2048 bit
- 1 October 2006
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- No. 23248432,p. 58-62
High-Throughput Montgomery Modular Multiplication
The efficiency of public key encryption schemes like RSA and elliptic curve cryptography can be improved using fast modular multiplication schemes. In this paper, the authors propose an efficient Montgomery modular multiplication technique that employs multi-bit shifting and carry-save addition to perform long-integer arithmetic and hence conventional lengthy additions required at each stage are avoided. The corresponding hardware realization is optimal in terms of delay and offers high data throughput compared to the recently proposed designs while it occupies slightly more area. The optimization is technology independent and thus should suit well for not only FPGA implementation but also ASIC. The design has been evaluated on Virtex2 series FPGA for practical bit lengths of 512,1024 and 2048 bit
- Open Access
Reduced Area Low Power High Throughput BCD Adders for IEEE 754r Format
IEEE 754r is the ongoing revision to the IEEE 754 floating point standard and a major enhancement to the standard is the addition of decimal format. Firstly, this paper proposes novel two transistor AND and OR gates. The proposed AND gate has no power supply, thus it can be referred as the Powerless AND gate. Similarly, the proposed two transistor OR gate has no ground and can be referred as Groundless OR. Secondly for IEEE 754r format, two novel BCD adders called carry skip and carry look-ahead BCD adders are also proposed in this paper. In order to design the carry look-ahead BCD adder, a novel 4 bit carry look-ahead adder called NCLA is proposed which forms the basic building block of the proposed carry look-ahead BCD adder. Finally, the proposed two transistors AND and OR gates are used to provide the optimized small area low power high throughput circuitries of the proposed BCD adders.
Open AccessReduced Area Low Power High Throughput BCD Adders for IEEE 754r Format
IEEE 754r is the ongoing revision to the IEEE 754 floating point standard and a major enhancement to the standard is the addition of decimal format. Firstly, this paper proposes novel two transistor AND and OR gates. The proposed AND gate has no power supply, thus it can be referred as the Powerless AND gate. Similarly, the proposed two transistor OR gate has no ground and can be referred as Groundless OR. Secondly for IEEE 754r format, two novel BCD adders called carry skip and carry look-ahead BCD adders are also proposed in this paper. In order to design the carry look-ahead BCD adder, a novel 4 bit carry look-ahead adder called NCLA is proposed which forms the basic building block of the proposed carry look-ahead BCD adder. Finally, the proposed two transistors AND and OR gates are used to provide the optimized small area low power high throughput circuitries of the proposed BCD adders.
- Open Access
Novel Reversible TSG Gate and Its Application for Designing Components of Primitive Reversible/Quantum ALU
In recent years, reversible logic has emerged as a promising computing paradigm having application in low power CMOS, quantum computing, nanotechnology, and optical computing. The classical set of gates such as AND, OR, and EXOR are not reversible. This paper utilizes a new 4 * 4 reversible gate called TSG gate to build the components of a primitive reversible/quantum ALU. The most significant aspect of the TSG gate is that it can work singly as a reversible full adder, that is reversible full adder can now be implemented with a single gate only. A Novel reversible 4:2 compressor is also designed from the TSG gate which is later used to design a novel 8x8 reversible Wallace tree multiplier. It is proved that the adder, 4:2 compressor and multiplier architectures designed using the TSG gate are better than their counterparts available in literature, in terms of number of reversible gates and garbage outputs. This is perhaps, the first attempt to design a reversible 4:2 compressor and a reversible Wallace tree multiplier as far as existing literature and our knowledge is concerned. Thus, this paper provides an initial threshold to build more complex systems which can execute complicated operations using reversible logic.
Open AccessNovel Reversible TSG Gate and Its Application for Designing Components of Primitive Reversible/Quantum ALU
In recent years, reversible logic has emerged as a promising computing paradigm having application in low power CMOS, quantum computing, nanotechnology, and optical computing. The classical set of gates such as AND, OR, and EXOR are not reversible. This paper utilizes a new 4 * 4 reversible gate called TSG gate to build the components of a primitive reversible/quantum ALU. The most significant aspect of the TSG gate is that it can work singly as a reversible full adder, that is reversible full adder can now be implemented with a single gate only. A Novel reversible 4:2 compressor is also designed from the TSG gate which is later used to design a novel 8x8 reversible Wallace tree multiplier. It is proved that the adder, 4:2 compressor and multiplier architectures designed using the TSG gate are better than their counterparts available in literature, in terms of number of reversible gates and garbage outputs. This is perhaps, the first attempt to design a reversible 4:2 compressor and a reversible Wallace tree multiplier as far as existing literature and our knowledge is concerned. Thus, this paper provides an initial threshold to build more complex systems which can execute complicated operations using reversible logic.
- 24 May 2006
- Published by SPIE-Intl Soc Optical Eng
- Vol. 6264, 62640H
Design of Wallace tree multiplier and other components of a quantum ALU using reversible TSG gate
This paper presents the design of a novel modified Wallace tree multiplier, using the reversible TSG gate proposed by the authors earlier. The novelty of the TSG gate is that it can also work singly as a reversible full adder. The TSG gate is also used in this paper to design various other reversible arithmetic and logical components that can be assembled to realize a primitive reversible/quantum ALU. It is also shown that these components are optimal, in terms of number of reversible gates and garbage outputs, compared to other designs existing in literature.
- 24 May 2006
- Published by SPIE-Intl Soc Optical Eng
- Vol. 6264, 62640H
Design of Wallace tree multiplier and other components of a quantum ALU using reversible TSG gate
This paper presents the design of a novel modified Wallace tree multiplier, using the reversible TSG gate proposed by the authors earlier. The novelty of the TSG gate is that it can also work singly as a reversible full adder. The TSG gate is also used in this paper to design various other reversible arithmetic and logical components that can be assembled to realize a primitive reversible/quantum ALU. It is also shown that these components are optimal, in terms of number of reversible gates and garbage outputs, compared to other designs existing in literature.
- Open Access
Novel Reversible Multiplier Architecture Using Reversible TSG Gate
In the recent years, reversible logic has emerged as a promising technology having its applications in low power CMOS, quantum computing, nanotechnology, and optical computing. The classical set of gates such as AND, OR, and EXOR are not reversible. Recently a 4 * 4 reversible gate called TSG is proposed. The most significant aspect of the proposed gate is that it can work singly as a reversible full adder, that is reversible full adder can now be implemented with a single gate only. This paper proposes a NXN reversible multiplier using TSG gate. It is based on two concepts. The partial products can be generated in parallel with a delay of d using Fredkin gates and thereafter the addition can be reduced to log2N steps by using reversible parallel adder designed from TSG gates. Similar multiplier architecture in conventional arithmetic (using conventional logic) has been reported in existing literature, but the proposed one in this paper is totally based on reversible logic and reversible cells as its building block. A 4x4 architecture of the proposed reversible multiplier is also designed. It is demonstrated that the proposed multiplier architecture using the TSG gate is much better and optimized, compared to its existing counterparts in literature; in terms of number of reversible gates and garbage outputs. Thus, this paper provides the initial threshold to building of more complex system which can execute more complicated operations using reversible logic.
Open AccessNovel Reversible Multiplier Architecture Using Reversible TSG Gate
In the recent years, reversible logic has emerged as a promising technology having its applications in low power CMOS, quantum computing, nanotechnology, and optical computing. The classical set of gates such as AND, OR, and EXOR are not reversible. Recently a 4 * 4 reversible gate called TSG is proposed. The most significant aspect of the proposed gate is that it can work singly as a reversible full adder, that is reversible full adder can now be implemented with a single gate only. This paper proposes a NXN reversible multiplier using TSG gate. It is based on two concepts. The partial products can be generated in parallel with a delay of d using Fredkin gates and thereafter the addition can be reduced to log2N steps by using reversible parallel adder designed from TSG gates. Similar multiplier architecture in conventional arithmetic (using conventional logic) has been reported in existing literature, but the proposed one in this paper is totally based on reversible logic and reversible cells as its building block. A 4x4 architecture of the proposed reversible multiplier is also designed. It is demonstrated that the proposed multiplier architecture using the TSG gate is much better and optimized, compared to its existing counterparts in literature; in terms of number of reversible gates and garbage outputs. Thus, this paper provides the initial threshold to building of more complex system which can execute more complicated operations using reversible logic.
- Open Access
An Extension to DNA Based Fredkin Gate Circuits: Design of Reversible Sequential Circuits using Fredkin Gates
In recent years, reversible logic has emerged as a promising computing paradigm having its applications in low power computing, quantum computing, nanotechnology, optical computing and DNA computing. The classical set of gates such as AND, OR, and EXOR are not reversible. Recently, it has been shown how to encode information in DNA and use DNA amplification to implement Fredkin gates. Furthermore, in the past Fredkin gates have been constructed using DNA, whose outputs are used as inputs for other Fredkin gates. Thus, it can be concluded that arbitrary circuits of Fredkin gates can be constructed using DNA. This paper provides the initial threshold to building of more complex system having reversible sequential circuits and which can execute more complicated operations. The novelty of the paper is the reversible designs of sequential circuits using Fredkin gate. Since, Fredkin gate has already been realized using DNA, it is expected that this work will initiate the building of complex systems using DNA. The reversible circuits designed here are highly optimized in terms of number of gates and garbage outputs. The modularization approach that is synthesizing small circuits and thereafter using them to construct bigger circuits is used for designing the optimal reversible sequential circuits.
Open AccessAn Extension to DNA Based Fredkin Gate Circuits: Design of Reversible Sequential Circuits using Fredkin Gates
In recent years, reversible logic has emerged as a promising computing paradigm having its applications in low power computing, quantum computing, nanotechnology, optical computing and DNA computing. The classical set of gates such as AND, OR, and EXOR are not reversible. Recently, it has been shown how to encode information in DNA and use DNA amplification to implement Fredkin gates. Furthermore, in the past Fredkin gates have been constructed using DNA, whose outputs are used as inputs for other Fredkin gates. Thus, it can be concluded that arbitrary circuits of Fredkin gates can be constructed using DNA. This paper provides the initial threshold to building of more complex system having reversible sequential circuits and which can execute more complicated operations. The novelty of the paper is the reversible designs of sequential circuits using Fredkin gate. Since, Fredkin gate has already been realized using DNA, it is expected that this work will initiate the building of complex systems using DNA. The reversible circuits designed here are highly optimized in terms of number of gates and garbage outputs. The modularization approach that is synthesizing small circuits and thereafter using them to construct bigger circuits is used for designing the optimal reversible sequential circuits.
- Open Access
A New Reversible TSG Gate and Its Application For Designing Efficient Adder Circuits
In the recent years, reversible logic has emerged as a promising technology having its applications in low power CMOS, quantum computing, nanotechnology, and optical computing. The classical set of gates such as AND, OR, and EXOR are not reversible. This paper proposes a new 4 * 4 reversible gate called TSG gate. The proposed gate is used to design efficient adder units. The most significant aspect of the proposed gate is that it can work singly as a reversible full adder i.e reversible full adder can now be implemented with a single gate only. The proposed gate is then used to design reversible ripple carry and carry skip adders. It is demonstrated that the adder architectures designed using the proposed gate are much better and optimized, compared to their existing counterparts in literature; in terms of number of reversible gates and garbage outputs. Thus, this paper provides the initial threshold to building of more complex system which can execute more complicated operations using reversible logic.
Open AccessA New Reversible TSG Gate and Its Application For Designing Efficient Adder Circuits
In the recent years, reversible logic has emerged as a promising technology having its applications in low power CMOS, quantum computing, nanotechnology, and optical computing. The classical set of gates such as AND, OR, and EXOR are not reversible. This paper proposes a new 4 * 4 reversible gate called TSG gate. The proposed gate is used to design efficient adder units. The most significant aspect of the proposed gate is that it can work singly as a reversible full adder i.e reversible full adder can now be implemented with a single gate only. The proposed gate is then used to design reversible ripple carry and carry skip adders. It is demonstrated that the adder architectures designed using the proposed gate are much better and optimized, compared to their existing counterparts in literature; in terms of number of reversible gates and garbage outputs. Thus, this paper provides the initial threshold to building of more complex system which can execute more complicated operations using reversible logic.
- Open Access
Novel BCD Adders and Their Reversible Logic Implementation for IEEE 754r Format
IEEE 754r is the ongoing revision to the IEEE 754 floating point standard and a major enhancement to the standard is the addition of decimal format. This paper proposes two novel BCD adders called carry skip and carry look-ahead BCD adders respectively. Furthermore, in the recent years, reversible logic has emerged as a promising technology having its applications in low power CMOS, quantum computing, nanotechnology, and optical computing. It is not possible to realize quantum computing without reversible logic. Thus, this paper also paper provides the reversible logic implementation of the conventional BCD adder as the well as the proposed Carry Skip BCD adder using a recently proposed TSG gate. Furthermore, a new reversible gate called TS-3 is also being proposed and it has been shown that the proposed reversible logic implementation of the BCD Adders is much better compared to recently proposed one, in terms of number of reversible gates used and garbage outputs produced. The reversible BCD circuits designed and proposed here form the basis of the decimal ALU of a primitive quantum CPU.
Open AccessNovel BCD Adders and Their Reversible Logic Implementation for IEEE 754r Format
IEEE 754r is the ongoing revision to the IEEE 754 floating point standard and a major enhancement to the standard is the addition of decimal format. This paper proposes two novel BCD adders called carry skip and carry look-ahead BCD adders respectively. Furthermore, in the recent years, reversible logic has emerged as a promising technology having its applications in low power CMOS, quantum computing, nanotechnology, and optical computing. It is not possible to realize quantum computing without reversible logic. Thus, this paper also paper provides the reversible logic implementation of the conventional BCD adder as the well as the proposed Carry Skip BCD adder using a recently proposed TSG gate. Furthermore, a new reversible gate called TS-3 is also being proposed and it has been shown that the proposed reversible logic implementation of the BCD Adders is much better compared to recently proposed one, in terms of number of reversible gates used and garbage outputs produced. The reversible BCD circuits designed and proposed here form the basis of the decimal ALU of a primitive quantum CPU.
- 1 January 2006
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- No. 21593442,p. 1-4
Modified Montgomery Modular Inversion with Reduced Number of Multiplications
In this paper, a modified algorithm to compute Montgomery modular Inverse that requires less number of Montgomery modular multiplications compared to the best known methods in literature is proposed. A method is also suggested for computing the Montgomery inverse using a modular multiplication algorithm recently proposed by Rainer et al. to compute the modular product. Our approaches are optimal in terms of computational delay and the practical efficiency has been evaluated for an operand length of 521-bit that is of interest to practical cryptographic applications. The proposed algorithms are expected to be of eminent importance for high-speed arithmetic
- 1 January 2006
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- No. 21593442,p. 1-4
Modified Montgomery Modular Inversion with Reduced Number of Multiplications
In this paper, a modified algorithm to compute Montgomery modular Inverse that requires less number of Montgomery modular multiplications compared to the best known methods in literature is proposed. A method is also suggested for computing the Montgomery inverse using a modular multiplication algorithm recently proposed by Rainer et al. to compute the modular product. Our approaches are optimal in terms of computational delay and the practical efficiency has been evaluated for an operand length of 521-bit that is of interest to practical cryptographic applications. The proposed algorithms are expected to be of eminent importance for high-speed arithmetic