13 citations · 30 across the 13 of their papers we have counts for
14 papers
Fast Bipartitioned Hybrid Adder Utilizing Carry Select and Carry Lookahead Logic
Padmanabhan Balasubramanian, Douglas L. Maskell
We present a novel fast bipartitioned hybrid adder (FBHA) that utilizes carry-select and carry-lookahead logic. The proposed FBHA is an accurate adder with a significant part and a…
Neural Combinatorial Optimization Algorithms for Solving Vehicle Routing Problems: A Comprehensive Survey with Perspectives
Xuan Wu, Di Wang, Lijie Wen +6
Although several surveys on Neural Combinatorial Optimization (NCO) solvers specifically designed to solve Vehicle Routing Problems (VRPs) have been conducted, they did not cover t…
Fault-Tolerant Design Approach Based on Approximate Computing
P Balasubramanian, D L Maskell
Triple Modular Redundancy (TMR) has been traditionally used to ensure complete tolerance to a single fault or a faulty processing unit, where the processing unit may be a circuit o…
Gate-Level Static Approximate Adders
P Balasubramanian, R Nayar, D L Maskell
This work compares and analyzes static approximate adders which are suitable for FPGA and ASIC type implementations. We consider many static approximate adders and evaluate their p…
Area Optimized Quasi Delay Insensitive Majority Voter for TMR Applications
P Balasubramanian, D L Maskell, N E Mastorakis
Mission-critical and safety-critical applications generally tend to incorporate triple modular redundancy (TMR) to embed fault tolerance in their physical implementations. In a TMR…
Indicating Asynchronous Multipliers
P Balasubramanian, D L Maskell, N E Mastorakis
Multiplication is a basic arithmetic operation that is encountered in almost all general-purpose microprocessing and digital signal processing applications, and multiplication is p…