Epileptic EEG detection using neural networks and post-classification (2008)
Electroencephalogram (previous termEEG)next term has established itself as an important means of identifying and analyzing previous termepilepticnext term seizure activity in humans. In most cases,...
Epileptic EEG detection using neural networks and post-classification (2008)
Electroencephalogram (previous termEEG)next term has established itself as an important means of identifying and analyzing previous termepilepticnext term seizure activity in humans. In most cases,...
A New ATPG Technique (ExpoTan) for Testing Analog Circuits (2007)
Varaprasad, BKSVL, Patnaik, LM, Jamadagni, HS, Agrawal, VK
In analog testing, usage of a single sinusoid as a test signal when compared to multitone signal, and fault detection with digital counting technique, facilitate the test implementation with simple...
A New ATPG Technique (ExpoTan) for Testing Analog Circuits (2007)
Varaprasad, BKSVL, Patnaik, LM, Jamadagni, HS, Agrawal, VK
In analog testing, usage of a single sinusoid as a test signal when compared to multitone signal, and fault detection with digital counting technique, facilitate the test implementation with simple...
Low complexity, and high fidelity image compression using fixed threshold method (2006)
Baligar, VP, Patnaik, LM, Nagabhushana, GR
This paper deals with the design and implementation of an image coding algorithm based on fixed threshold method. Threshold is the Peak Absolute Error (PAE) allowed in the reconstructed image. It has...
Low complexity, and high fidelity image compression using fixed threshold method (2006)
Baligar, VP, Patnaik, LM, Nagabhushana, GR
This paper deals with the design and implementation of an image coding algorithm based on fixed threshold method. Threshold is the Peak Absolute Error (PAE) allowed in the reconstructed image. It has...
Recently there has been a great need for efficient classification techniques in the field of medical imaging to accurately detect various human brain diseases. Extracting essential features from the...
Recently there has been a great need for efficient classification techniques in the field of medical imaging to accurately detect various human brain diseases. Extracting essential features from the...
High compression and low order linear predictor for lossless coding of grayscale images (2003)
Baligar, Vishwanath P, Patnaik, LM, Nagabhushana, GR
In this paper we propose a novel method for designing block-wise lossless image compression scheme using linear predictors. In this prediction scheme, the prediction for each pixel is formed by using...
Space–time adaptive processing (STAP) is a well-known technique in the area of air borne surveillance radars, which is used to detect weak target returns embedded in strong ground clutter,...
Adaptively altering hyper-parameter for Improved Reconstruction in PET (2003)
Mondal, PP, Rajan, K, Patnaik, LM
It is well known that as the iterations of the maximum likelihood algorithm are continued, density estimates become more and more noisy. In situations where some prior knowledge about the object...
Hybrid Reconstruction in Bayesian Domain (2003)
Mondal, Partha P, Rajan, K, Patnaik, LM
Image reconstruction in Bayesian framework is far more advantageous over other reconstruction methods like convolution back projection, weighted least square method and maximum likelihood estimation....
High compression and low order linear predictor for lossless coding of grayscale images (2003)
Baligar, Vishwanath P, Patnaik, LM, Nagabhushana, GR
In this paper we propose a novel method for designing block-wise lossless image compression scheme using linear predictors. In this prediction scheme, the prediction for each pixel is formed by using...
Space–time adaptive processing (STAP) is a well-known technique in the area of air borne surveillance radars, which is used to detect weak target returns embedded in strong ground clutter,...
Adaptively altering hyper-parameter for Improved Reconstruction in PET (2003)
Mondal, PP, Rajan, K, Patnaik, LM
It is well known that as the iterations of the maximum likelihood algorithm are continued, density estimates become more and more noisy. In situations where some prior knowledge about the object...
Hybrid Reconstruction in Bayesian Domain (2003)
Mondal, Partha P, Rajan, K, Patnaik, LM
Image reconstruction in Bayesian framework is far more advantageous over other reconstruction methods like convolution back projection, weighted least square method and maximum likelihood estimation....
Evolutionary approach for mining association rules on dynamic databases (2003)
Shenoy, Deepa P, Srinivasa, KG, Venugopal, KR, Patnaik, LM
A large volume of transaction data is generated everyday in a number of applications. These dynamic data sets have immense potential for reflecting changes in customer behaviour patterns. One of the...
The state of VLSI testing (2002)
Patnaik, LM, Jamadagni, HS, Agrawal, VK, Varaprasad, BKSVL
The phenomenal development in electronic systems has, in large part, the advances in Very Large Scale of Integration (VLSI) semiconductor technologies to thank. Performance, area, power and testing...
The state of VLSI testing (2002)
Patnaik, LM, Jamadagni, HS, Agrawal, VK, Varaprasad, BKSVL
The phenomenal development in electronic systems has, in large part, the advances in Very Large Scale of Integration (VLSI) semiconductor technologies to thank. Performance, area, power and testing...
CBP and ART image reconstruction algorithms on media and DSP processors (2001)
Computed Tomography (CT) image reconstruction algorithms such as convolution back-projection (CBP) and algebraic reconstruction technique (ART) are highly compute-intensive for today's single...
Genetic programming based pattern classification with feature space partitioning (2001)
Kishore, JK, Patnaik, LM, Mani, V, Agrawal, VK
Genetic programming (GP) is an evolutionary technique and is gaining attention for its ability to learn the underlying data relationships and express them in a mathematical manner. Although GP uses...
Genetic programming based pattern classification with feature space partitioning (2001)
Kishore, JK, Patnaik, LM, Mani, V, Agrawal, VK
Genetic programming (GP) is an evolutionary technique and is gaining attention for its ability to learn the underlying data relationships and express them in a mathematical manner. Although GP uses...
CBP and ART image reconstruction algorithms on media and DSP processors (2001)
Computed Tomography (CT) image reconstruction algorithms such as convolution back-projection (CBP) and algebraic reconstruction technique (ART) are highly compute-intensive for today's single...
Target detection through image processing and resilient propagation algorithms (2000)
This paper deals with target detection studies using the image processing method as well as resilient propagation-based neural network paradigm. In the resilient propagation-based algorithms, the...
Application of Genetic Programming for Multicategory Pattern Classification (2000)
Kishore, JK, Patnaik, LM, Mani, V, Agrawal, VK
This paper explores the feasibility of applying genetic programming (GP) to multicategory pattern classification problem for the first time. GP can discover relationships among observed data and...
Application of Genetic Programming for Multicategory Pattern Classification (2000)
Kishore, JK, Patnaik, LM, Mani, V, Agrawal, VK
This paper explores the feasibility of applying genetic programming (GP) to multicategory pattern classification problem for the first time. GP can discover relationships among observed data and...
Target detection through image processing and resilient propagation algorithms (2000)
This paper deals with target detection studies using the image processing method as well as resilient propagation-based neural network paradigm. In the resilient propagation-based algorithms, the...
We analyse the fault-tolerant parameters and topological properties of a hierarchical network of hypercubes. We take a close look at the Extended Hypercube (EH) and the Hyperweave (HW) architectures...
Exact Output Response Computation of RC Interconnects Under Polynomial Input Waveforms (1999)
Accurate output response computation of RC interconnects under various input excitations is a key issue in deep submicron delay analysis. In this paper, we present an exact analysis of output...
The convolution backprojection (CBP) and Fourier inversion method (FIM) are popular tomographic image reconstruction techniques. However, the time required to reconstruct an image has been the major...
Exact Output Response Computation of RC Interconnects Under Polynomial Input Waveforms (1999)
Accurate output response computation of RC interconnects under various input excitations is a key issue in deep submicron delay analysis. In this paper, we present an exact analysis of output...
The convolution backprojection (CBP) and Fourier inversion method (FIM) are popular tomographic image reconstruction techniques. However, the time required to reconstruct an image has been the major...
Performance evaluation of ATM switch scheduling algorithms for video transmission (1998)
In this paper, we aim to provide Quality of Service for video data over Asynchronous Transfer Mode (ATM) networks in the presence of voice calls and non-real-time data. We investigate the behaviour...
Fault-tolerant message routing in the extended hypercube (1998)
Kumar, MJ, Patnaik, LM, Nag, B
In real-time computing applications, it is important to have parallel computing systems that not only exhibit high performance but also continue to perform reliably under faulty conditions. The...
Performance evaluation of ATM switch scheduling algorithms for video transmission (1998)
In this paper, we aim to provide Quality of Service for video data over Asynchronous Transfer Mode (ATM) networks in the presence of voice calls and non-real-time data. We investigate the behaviour...
High-Speed Parallel Implementation of a Modified PBR Algorithm on DSP-Based EH Topology (1997)
Rajan, K, Patnaik, LM, Ramakrishna, J
Algebraic Reconstruction Technique (ART) is an age-old method used for solving the problem of three-dimensional (3-D) reconstruction from projections in electron microscopy and radiology. In medical...
Distributed Algorithms for Mobile Hosts (1997)
Patnaik, LM, Ramakrishna, AK, Muralidharan, R
In a mobile environment the physical movement of hosts causes changes in the physical topology of the network with time. Therefore, the direct execution of the existing distributed algorithms in a...
A generalized stochastic high-level Petri net model for performance analysis (1997)
Abstract: We present a generalized stochastic high-level Petri net (GSHLPN) model for evaluating the performance of parallel/distributed systems. In our model, we have classified the transitions of...
Implementation of Art1 and Art2 Artificial Neural Networks on Ring and Mesh Architectures (1997)
The Artificial Neural Networks (ANNs) are being used to solve a variety of problems in pattern recognition, robotic control, VLSI CAD and other areas. In most of these applications, a speedy response...
Distributed Algorithms for Mobile Hosts (1997)
Patnaik, LM, Ramakrishna, AK, Muralidharan, R
In a mobile environment the physical movement of hosts causes changes in the physical topology of the network with time. Therefore, the direct execution of the existing distributed algorithms in a...
High-Speed Parallel Implementation of a Modified PBR Algorithm on DSP-Based EH Topology (1997)
Rajan, K, Patnaik, LM, Ramakrishna, J
Algebraic Reconstruction Technique (ART) is an age-old method used for solving the problem of three-dimensional (3-D) reconstruction from projections in electron microscopy and radiology. In medical...
High-speed Image reconstruction based on CBP and Fourier Inversion Methods (1997)
Rajan, K, Patnaik, LM, Ramakrishna, J
Computed Tomography (CT) image reconstruction algorithms such as convolution backprojection (CBP) and the Fourier inversion method (FIM) are highly compute-intensive applications for today’s single...
High-speed Image reconstruction based on CBP and Fourier Inversion Methods (1997)
Rajan, K, Patnaik, LM, Ramakrishna, J
Computed Tomography (CT) image reconstruction algorithms such as convolution backprojection (CBP) and the Fourier inversion method (FIM) are highly compute-intensive applications for today’s single...
Automatic Loop Parallelization (1997)
Parallel processing has been used to increase performance of computing systems for the past several years. In principle, parallelism can be achieved by using a large number of processors. However,...
A Formalism to Model Task Execution in Distributed Systems (1996)
This paper introduces a formalism to model task execution in distributed computing systems. The proposed formalism, based on a partial order semantic model, extends standard temporal logic to specify...
A Formalism to Model Task Execution in Distributed Systems (1996)
This paper introduces a formalism to model task execution in distributed computing systems. The proposed formalism, based on a partial order semantic model, extends standard temporal logic to specify...
A novel path delay fault simulator using binary logic (1996)
Majhi, AK, Jacob, J, Patnaik, LM
A novel path delay fault simulator for combinational logic circuits which is capable of detecting both robust and nonrobust paths is presented. Particular emphasis has been given for the use of...
Distributed Logic Simulation: Time-First Evaluation Vs. Event-Driven Algorithms (1996)
With the increasing complexity of VLSI circuits, simulation of digital circuits is becoming a more complex and time-consuming task. General purpose parallel processing machines are increasingly being...
A novel path delay fault simulator using binary logic (1996)
Majhi, AK, Jacob, J, Patnaik, LM
A novel path delay fault simulator for combinational logic circuits which is capable of detecting both robust and nonrobust paths is presented. Particular emphasis has been given for the use of...
Distributed Logic Simulation: Time-First Evaluation Vs. Event-Driven Algorithms (1996)
With the increasing complexity of VLSI circuits, simulation of digital circuits is becoming a more complex and time-consuming task. General purpose parallel processing machines are increasingly being...
Linear Array Implementation of the EM Algorithm for PET Image Reconstruction (1995)
The PET image reconstruction based on the EM hypothalgorithm has several attractive advantages over the conventional convolution backprojection algorithms. However, the PET image reconstruction based...
A Genetic Algorithm-Based Circuit Partitioner For Mcms (1995)
Majhi, Ananta K, Patnaik, LM, Ramanc, Srilata
Multichip Modules (MCMs) is a packaging technology gaining importance, because it reduces the interconnect delays across chips, by bringing the interconnect delays closer in magnitude to the on-chip...
Linear Array Implementation of the EM Algorithm for PET Image Reconstruction (1995)
The PET image reconstruction based on the EM hypothalgorithm has several attractive advantages over the conventional convolution backprojection algorithms. However, the PET image reconstruction based...
An extended evolutionary programming algorithm for VLSI channel routing (1995)
Rao, Prahlada BB, Patnaik, LM, Hansdah, RC
Channel routing is an important part of circuit layout in VLSI design. This paper presents an evolutionary programming-based two-layer channel router (EPCHR) that uses an integer representation....
Parallel implementation of the EM algorithm for PET image reconstruction (1995)
Rajan, K, Patnaik, LM, Ramakrishna, J
The PET image reconstruction based on the EM algorithm has several attractive advantages over the conventional convolution backprojection algorithms. However, two major drawbacks impede the routine...
An extended evolutionary programming algorithm for VLSI channel routing (1995)
Rao, Prahlada BB, Patnaik, LM, Hansdah, RC
Channel routing is an important part of circuit layout in VLSI design. This paper presents an evolutionary programming-based two-layer channel router (EPCHR) that uses an integer representation....
High-speed Computation of the EM Algorithm for PET Image Reconstruction (1994)
Rajan, K, Patnaik, LM, Ramakrishna, J
The PET image reconstruction based on the EM algorithm has several attractive advantages over the conventional convolution backprojection algorithms. However, two major drawbacks have impeded the...
Efficient interprocessor communication is a key parameter to achieve high performance in distributed memory multicomputer networks. Thus. modelling and analysing message communication latency is...
Adaptive Probabilities of Crossover and Mutation in Genetic Algorithms (1994)
In this paper we describe an efficient approach for multimodal function optimization using Genetic Algorithms(Gas). We recommend the use of adaptive probabilities of crossover and mutation to realize...
Behera, TK, Mishra, BS, Patnaik, LM, Girault, C
This paper describes a Petri net-based methodology that has been developed for the performance analysis of Real-Time Systems (RTS). A Flexible Manufacturing System (FMS), which is a case of a...
High-speed Computation of the EM Algorithm for PET Image Reconstruction (1994)
Rajan, K, Patnaik, LM, Ramakrishna, J
The PET image reconstruction based on the EM algorithm has several attractive advantages over the conventional convolution backprojection algorithms. However, two major drawbacks have impeded the...
Adaptive Probabilities of Crossover and Mutation in Genetic Algorithms (1994)
In this paper we describe an efficient approach for multimodal function optimization using Genetic Algorithms(Gas). We recommend the use of adaptive probabilities of crossover and mutation to realize...
A Genetic Algorithm for Channel Routing Using Inter-Cluster Mutation (1994)
Rao, Prahlada BB, Patnaik, LM, Hansdah, RC
In this paper, we propose an algorithm for the channel routing problem based on genetic approach that uses a new type of mutation, called inter-cluster mutation . The performance of genetic...
Efficient interprocessor communication is a key parameter to achieve high performance in distributed memory multicomputer networks. Thus. modelling and analysing message communication latency is...
Parallel implementation of the EM algorithm for PET image reconstruction (1994)
Rajan, K, Patnaik, LM, Ramakrishna, J
The PET image reconstruction based on the EM algorithm has several attractive advantages over the conventional convolution backprojection algorithms. However, two major drawbacks impede the routine...
Behera, TK, Mishra, BS, Patnaik, LM, Girault, C
This paper describes a Petri net-based methodology that has been developed for the performance analysis of Real-Time Systems (RTS). A Flexible Manufacturing System (FMS), which is a case of a...
A Genetic Algorithm for Channel Routing Using Inter-Cluster Mutation (1994)
Rao, Prahlada BB, Patnaik, LM, Hansdah, RC
In this paper, we propose an algorithm for the channel routing problem based on genetic approach that uses a new type of mutation, called inter-cluster mutation . The performance of genetic...
Distributed memory systems for simulating artificial neural networks (1993)
In executing tasks involving intelligent information processing, the human brain performs better than the digital computer. The human brain derives its power from a large number $[O(10^{11})]$ of...
Effective Fokker-Planck equation: Path-integral formalism (1993)
We derive an effective Fokker-Planck equation for a nonlinear non-Markovian stochastic process using pathintegral formalism. The effective Fokker-Planck equation of our approximation scheme is local...
Fault-Tolerance Analysis of Hypercube Systems Using Petri Net Theory (1993)
Studies of performance disregarding reliability or reliability ignoring performance do not give a complete picture of the capability of parallel /distributed systems However, a combined study of...
An approach to compute the mean-first-passage time (MFPT) in bistable systems driven by colored noise is presented. The approach is valid in the limit of large but finite noise correlation time and...
A Simulation-Based Test Generation Scheme Using Genetic Algorithms (1993)
This paper discusses a Genetic Algorithm-based method of generating test vectors for detecting faults in combinational circuits. The GA-based approach combines the merits of two techniques that have...
Parallel Genetic Algorithm for Channel Routing (1993)
Rao, Prahlada BB, Patnaik, LM, Hansdah, RC
In this paper, we propose a new channel routing algorithm based on genetic approach. This involves designing a new encoding scheme and an evaluation function used by the genetic algorithm (GA) for...
An approach to compute the mean-first-passage time (MFPT) in bistable systems driven by colored noise is presented. The approach is valid in the limit of large but finite noise correlation time and...
Distributed memory systems for simulating artificial neural networks (1993)
In executing tasks involving intelligent information processing, the human brain performs better than the digital computer. The human brain derives its power from a large number $[O(10^{11})]$ of...
Fault-Tolerance Analysis of Hypercube Systems Using Petri Net Theory (1993)
Studies of performance disregarding reliability or reliability ignoring performance do not give a complete picture of the capability of parallel /distributed systems However, a combined study of...
Effective Fokker-Planck equation: Path-integral formalism (1993)
We derive an effective Fokker-Planck equation for a nonlinear non-Markovian stochastic process using pathintegral formalism. The effective Fokker-Planck equation of our approximation scheme is local...
Binomially distributed populations for modelling GAs (1993)
We discuss a novel model for analyzing the working of genetic algorithms, when the objective function is a function of unitation. The model is exact (not approximate), and is valid for infinite...
A Simulation-Based Test Generation Scheme Using Genetic Algorithms (1993)
This paper discusses a Genetic Algorithm-based method of generating test vectors for detecting faults in combinational circuits. The GA-based approach combines the merits of two techniques that have...
Parallel Genetic Algorithm for Channel Routing (1993)
Rao, Prahlada BB, Patnaik, LM, Hansdah, RC
In this paper, we propose a new channel routing algorithm based on genetic approach. This involves designing a new encoding scheme and an evaluation function used by the genetic algorithm (GA) for...
Binomially distributed populations for modelling GAs (1993)
We discuss a novel model for analyzing the working of genetic algorithms, when the objective function is a function of unitation. The model is exact (not approximate), and is valid for infinite...
Current trends in parallel computing (1992)
The main emphasis of the author's work has been directed towards achieving efficient parallel solutions to the complex computing problems encountered in scientific and engineering applications, by...
Mahadevan, I. and L.M. Patnaik, Performance evaluation of bidirectional associative memory on a transputer-based parallel system, Parallel Computing 18 (1992) 401-413. In this paper we discdss a...
Extended Hypercube: A Hierarchical Interconnection Network of Hypercubes (1992)
A new interconnection topology-the extended hypercube-consisting of an interconnection network of k-cubes is discussed. The extended hypercube is a hierarchical, expansive, recursive structure with a...
A Force Directed Hill-Climbing Placement Algorithm (1992)
In this paper, we propose a heuristic procedure for finding near-optimal placement of VLSI circuit modules on a two dimensional layout. This heuristic procedure combines ideas from a greedy placement...
Extended Hypercube: A Hierarchical Interconnection Network of Hypercubes (1992)
A new interconnection topology-the extended hypercube-consisting of an interconnection network of k-cubes is discussed. The extended hypercube is a hierarchical, expansive, recursive structure with a...
A Force Directed Hill-Climbing Placement Algorithm (1992)
In this paper, we propose a heuristic procedure for finding near-optimal placement of VLSI circuit modules on a two dimensional layout. This heuristic procedure combines ideas from a greedy placement...
Improved Parametric Models and DPCM Techniques for ECG Data Compression (1992)
Madhukar, Budagavi, Patnaik, LM, Murthy, ISN
This paper presents a novel algorithm for compression of single lead Electrocardiogram (ECG) signals. The method is based on Pole-Zero modelling of the Discrete Cosine transformed (DCT) signal. An...
Performability Studies of Hypercube Architectures (1992)
We propose a novel technique to study composite reliability and performance (Performability) measures of hypercube systems using Generalized Stochastic Petri Nets (GSPNs).This technique essentially...
T-Algorithm-Based Logic Simulation on Distributed Systems (1992)
Increase in the complexity of VLSI digital circuit it sign demands faster logic simulation techniques than those currently available. One of the ways of speeding up existing logic simulataon...
Mahadevan, I. and L.M. Patnaik, Performance evaluation of bidirectional associative memory on a transputer-based parallel system, Parallel Computing 18 (1992) 401-413. In this paper we discdss a...
Current trends in parallel computing (1992)
The main emphasis of the author's work has been directed towards achieving efficient parallel solutions to the complex computing problems encountered in scientific and engineering applications, by...
Logic simulation algorithm on network of transputers (1992)
Explores the possibility of mapping a T-algorithm based logic simulation algorithm onto a network of transputers interconnected by high speed links. The set of gates at a particular level is...
Improved Parametric Models and DPCM Techniques for ECG Data Compression (1992)
Madhukar, Budagavi, Patnaik, LM, Murthy, ISN
This paper presents a novel algorithm for compression of single lead Electrocardiogram (ECG) signals. The method is based on Pole-Zero modelling of the Discrete Cosine transformed (DCT) signal. An...
Performability Studies of Hypercube Architectures (1992)
We propose a novel technique to study composite reliability and performance (Performability) measures of hypercube systems using Generalized Stochastic Petri Nets (GSPNs).This technique essentially...
T-Algorithm-Based Logic Simulation on Distributed Systems (1992)
Increase in the complexity of VLSI digital circuit it sign demands faster logic simulation techniques than those currently available. One of the ways of speeding up existing logic simulataon...
Logic simulation algorithm on network of transputers (1992)
Explores the possibility of mapping a T-algorithm based logic simulation algorithm onto a network of transputers interconnected by high speed links. The set of gates at a particular level is...
Parallel maze routing on hypercube computers (1991)
The routing problem of VLSI layout design is computationally very expensive because of the inherent complexity of the task. Consequently, with the trend to increasing complexity of VLSI circuits, the...
Performance studies of a transputer-based extended hypercube (1991)
Discusses the implementation aspects and performance studies of a transputer-based extended hypercube whose design is aimed at reducing cost and increasing utilization factor. A comparative study of...
Formal Timing Analysis of Distributed Systems (1991)
Although a large number of formal methods have been reported in the literature, most of them are applicable only at the initial stages of software development. A major reason for this situation is...
An Algorithm for Discrete Event Logic Simulation on Distributed Systems (1991)
Sundaram, S, Mohan, TS, Patnaik, LM
Increase in the complexity of VLSI digital circuit design demands faster logic simulation techniques than those currently available. One of the ways of spreading up existing logic simulation...
Temporal logic is widely acclaimed to be a highly successful tool for analyzing non-real-time properties of programs. However, a few fundamental problems arise while designing temporal logic-based...
A New Approach to Specify Real-time Behavior of Distributed Systems (1991)
Specification of real-time behavior of a system requires a significantly different approach compared to specification of the system's non-real-time behavior. Also, a specification formalism should be...
Associative Memory Design: Fokker-Planck Formalism (1991)
A design methodology for associative memory(AM) using Fokker- Planck formalism is proposed. This method allows AM to be designed for noisy conditions by taking into account the noise level to be...
Simulated Annealing-Based Channel Routing on Hypercube Computers (1991)
Mall, R, Patnaik, LM, Raman, Srilata
Many times, routing of signal nets in the layout design of VLSI circuits turns out to be a bottleneck in designing complex chips, due to the inherent compute-intensive nature of this task. Parallel...
In this paper, we discuss parallel implementation of an artificial neural network for pattern association, the Bidirectional Associative Memory(BAM). Transputer-based parallel architectures like...
Efficient Implementation of Bidirectional Associative Memories on the Extended Hypercube (1991)
Bidirectional associative memories (BAMs) are being used extensively for solving a variety of problems related to pattern recognition. The simulation of BAMs comprising of large number of neurons...
Parallel maze routing on hypercube computers (1991)
The routing problem of VLSI layout design is computationally very expensive because of the inherent complexity of the task. Consequently, with the trend to increasing complexity of VLSI circuits, the...
Performance studies of a transputer-based extended hypercube (1991)
Discusses the implementation aspects and performance studies of a transputer-based extended hypercube whose design is aimed at reducing cost and increasing utilization factor. A comparative study of...
The authors present a technique for reducing the search-space of the genetic algorithm (GA) to improve its performance in searching for the globally optimal set of connection-weights. They use the...
Formal Timing Analysis of Distributed Systems (1991)
Although a large number of formal methods have been reported in the literature, most of them are applicable only at the initial stages of software development. A major reason for this situation is...
An Algorithm for Discrete Event Logic Simulation on Distributed Systems (1991)
Sundaram, S, Mohan, TS, Patnaik, LM
Increase in the complexity of VLSI digital circuit design demands faster logic simulation techniques than those currently available. One of the ways of spreading up existing logic simulation...
Temporal logic is widely acclaimed to be a highly successful tool for analyzing non-real-time properties of programs. However, a few fundamental problems arise while designing temporal logic-based...
Simulated Annealing-Based Channel Routing on Hypercube Computers (1991)
Mall, R, Patnaik, LM, Raman, Srilata
Many times, routing of signal nets in the layout design of VLSI circuits turns out to be a bottleneck in designing complex chips, due to the inherent compute-intensive nature of this task. Parallel...
Associative Memory Design: Fokker-Planck Formalism (1991)
A design methodology for associative memory(AM) using Fokker- Planck formalism is proposed. This method allows AM to be designed for noisy conditions by taking into account the noise level to be...
In this paper, we discuss parallel implementation of an artificial neural network for pattern association, the Bidirectional Associative Memory(BAM). Transputer-based parallel architectures like...
Efficient Implementation of Bidirectional Associative Memories on the Extended Hypercube (1991)
Bidirectional associative memories (BAMs) are being used extensively for solving a variety of problems related to pattern recognition. The simulation of BAMs comprising of large number of neurons...
A New Approach to Specify Real-time Behavior of Distributed Systems (1991)
Specification of real-time behavior of a system requires a significantly different approach compared to specification of the system's non-real-time behavior. Also, a specification formalism should be...
The authors present a technique for reducing the search-space of the genetic algorithm (GA) to improve its performance in searching for the globally optimal set of connection-weights. They use the...
Systolic Evaluation of Polynomial Expressions (1990)
High-speed evaluation of a large number of polynomial expressions has potential applications in the modeling and real-time display of objects in computer graphics. Using VLSI techniques, chips called...
Systolic Evaluation of Polynomial Expressions (1990)
High-speed evaluation of a large number of polynomial expressions has potential applications in the modeling and real-time display of objects in computer graphics. Using VLSI techniques, chips called...
Specification and Verification of Timing Properties of Distributed Real-Time Systems (1990)
There are no proficient formal tools available till now for specifying and analyzing the timing properties of distributed real-time systems. In this paper, we present a formalism for specification...
Specification and Verification of Timing Properties of Distributed Real-Time Systems (1990)
There are no proficient formal tools available till now for specifying and analyzing the timing properties of distributed real-time systems. In this paper, we present a formalism for specification...
An Efficient Scheme for Interprocessor Communication Using Dual-Ported RAMs (1989)
Jagadish, N, Kumar, Mohan J, Patnaik, LM
An approach for interprocessor interconnection is described in which communication between the processor nodes involves writing into and reading from a common memory area. The communicating...
An Efficient Scheme for Interprocessor Communication Using Dual-Ported RAMs (1989)
Jagadish, N, Kumar, Mohan J, Patnaik, LM
An approach for interprocessor interconnection is described in which communication between the processor nodes involves writing into and reading from a common memory area. The communicating...
Systolic Architectures in Curve Generation (1989)
Mathias, PC, Patnaik, LM, Ramesh, Sudha
The use of B-spline polynomials for the generation and display of smooth curves and surfaces in computer graphics is widely accepted. However, the algorithms to generate such smooth curves and...
Systolic Architectures in Curve Generation (1989)
Mathias, PC, Patnaik, LM, Ramesh, Sudha
The use of B-spline polynomials for the generation and display of smooth curves and surfaces in computer graphics is widely accepted. However, the algorithms to generate such smooth curves and...
Byzantine-resilient distributed computing systems (1987)
This paper is aimed at reviewing the notion of Byzantine-resilient distributed computing systems, the relevant protocols and their possible applications as reported in the literature. The three...
Algorithm for incremental compaction of geometrical layouts (1987)
In this paper, a new incremental algorithm for layout compaction is proposed. In addition to its linear time performance in terms of the number of rectangles in the layout, we also describe how...
An efficient geometrical design rule checker is proposed, based on operations on quadtrees, which represent VLSI mask layouts. The time complexity of the design rule checker is O(N), where N is the...
Integrating voice and data on SALAN: an experimental local area network (1986)
Gopalakrishnan, M, Patnaik, LM
This paper is concerned with the integration of voice and data on an experimental local area network used by the School of Automation, of the Indian Institute of Science. SALAN (School of Automation...
GEODERM: geometric shape design system using an entity-relationship model (1986)
GEODERM, a microcomputer-based solid modeller, which incorporates the parametric object model, is discussed. The entity-relationship model, which is used to describe the conceptual schema of the...
Design and Performance Evaluation of EXMAN: An EXtended MANchester Data Flow Computer (1986)
Patnaik, LM, Govindarajan, R, Ramadoss, NS
Data flow computers are high-speed machines in which an instruction is executed as soon as all its operands are available. This paper describes the EXtended MANchester (EXMAN) data flow computer...
A study of placement algorithms through trial interchange of logic modules (1985)
Nandy, Soumitra K, Patnaik, LM
Based on trial interchanges, this paper develops three algorithms for the solution of the placement problem of logic modules in a circuit. A significant decrease in the computation time of such...
Generalized Query-By-Rule: a heterogeneous database query language (1985)
This paper describes the design and implementation of a high-level query language called Generalized Query-By-Rule (GQBR) which supports retrieval, insertion, deletion and update operations. This...
GRDB: A general purpose relational database system (1985)
This article discusses the design and development of GRDB (General Purpose Relational Data Base System) which has been implemented on a DEC-1090 system in Pascal. GRDB is a general purpose database...
Design of a Multibus-compatible colour graphics subsystem (1984)
Manohar, Swami, Murali, N, Patnaik, LM
Colour graphics subsystems can be used in a variety of applications such as high-end business graphics, low-end scientific computations, and for realtime display of process control diagrams. The...
Implementation of CSP-S for description of distributed algorithms (1984)
The implementation of CSP-S (a subset of CSP)—a high level language for distributed programming—is presented in this paper. The language CSP-S features a parallel command, communication by...
DFL: A Data Flow Language (1984)
Many novel computer architectures like array and multiprocessors which achieve high performance through the use of concurrency exploit variations of the von Neumann model of computation. The...
Functional programming systems revisited (1984)
Functional Programming (FP) systems are modified and extended to form Nondeterministic Functional Programming (NFP) systems in which nondeterministic programs can be specified and both deterministic...
ADAMIS: a database for medical information systems (1983)
This paper describes the design and implementation of ADAMIS (‘A database for medical information systems’). ADAMIS is a relational database management system for a general hospital environment....
Data definition and manipulation languages for a CAD database (1983)
In this paper the main features of ARDBID (A Relational Database for Interactive Design) have been described. An overview of the organization of the database has been presented and a detailed...
Hierarchical Control of an Ammonia Reactor (1983)
Patnaik, LM, Viswanadham, N, Sarma, IG
An approach is presented for hierarchical control of an ammonia reactor, which is a key unit process in a nitrogen fertilizer complex. The aim of the control system is to ensure safe operation of the...
Case study of a microcomputer-minicomputer link (1982)
A microcomputer-minicomputer link, useful in the implementation of network configurations involving microcomputers and minicomputers, is described. The link, between a PDP-11 minicomputer and an 8080...
Implementation of an interactive relational graphics database (1982)
The benefits that accrue from the use of design database include (i) reduced costs of preparing data for application programs and of producing the final specification, and (ii) possibility of later...
An interactive graphics system for 2-D drawing and design (1982)
Srikant, YN, Vidyasagar, D, Patnaik, LM
This paper is about a software system, GRASS-Graphic Software System for 2-D drawing and design—which has been implemented on a PDP-11/35 system with RSX-11M operating system. It is a low cost...
Self-tuning minimum-variance control of nonlinear systems of the Hammerstein model (1981)
Anbumani, K, Patnaik, LM, Sarma, I
Self-tuning is applied to the control of nonlinear systems represented by the Hammerstein model wherein the nonlinearity is any odd-order polynomial. But control costing is not feasible in general....
Steady state optimization of an ammonia reactor (1980)
Patnaik, LM, Viswanadham, N, Sarma, IG
A hybrid simulation technique for identification and steady state optimization of a tubular reactor used in ammonia synthesis is presented. The parameter identification program finds the catalyst...
Computer Control Algorithms for a Tubular Ammonia Reactor (1980)
Patnaik, LM, Viswanadham, N, Sarma, Isukapalli G
The specific objective of this paper is to develop direct digital control strategies for an ammonia reactor using the quadratic regulator theory and compare the performance of the resultant control...
Computer Control Algorithms for a Tubular Ammonia Reactor (1980)
Patnaik, LM, Viswanadham, N, Sarma, Isukapalli G
The specific objective of this paper is to develop direct digital control strategies for an ammonia reactor using the quadratic regulator theory and compare the performance of the resultant control...