TSThambipillai Srikanthan

Thambipillai Srikanthan

*This is an algorithmically generated author record based on publicly available information.

Current Organizations / Institutes

The organizations/institutes from the scholar's latest article


Thambipillai Srikanthan has a total of 123 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • GPSFormer: A Global Perception and Local Structure Fitting-Based Transformer for Point Cloud Understanding

    by Changshuo Wang, Meiqing Wu, Siew-Kei Lam, Xin Ning, Shangshu Yu, Ruiping Wang, Weijun Li, Thambipillai Srikanthan


  • Open Access

    A Versatile Approach for Adaptive Grid Mapping and Grid Flex-Graph Exploration with a Field-Programmable Gate Array-Based Robot Using Hardware Schemes

    by Mudasar Basha, Munuswamy Siva Kumar, Mangali Chinna Chinnaiah, Siew-Kei Lam, Thambipillai Srikanthan, Gaddam Divya Vani, Narambhatla Janardhan, Dodde Hari Krishna, Sanjay Dubey

    Robotic exploration in dynamic and complex environments requires advanced adaptive mapping strategies to ensure accurate representation of the environments. This paper introduces an innovative grid flex-graph exploration (GFGE) algorithm designed for single-robot mapping. This hardware-scheme-based algorithm leverages a combination of quad-grid and graph structures to enhance the efficiency of both local and global mapping implemented on a field-programmable gate array (FPGA). This novel research work involved using sensor fusion to analyze a robot’s behavior and flexibility in the presence of static and dynamic objects. A behavior-based grid construction algorithm was proposed for the construction of a quad-grid that represents the occupancy of frontier cells. The selection of the next exploration target in a graph-like structure was proposed using partial reconfiguration-based frontier-graph exploration approaches. The complete exploration method handles the data when updating the local map to optimize the redundant exploration of previously explored nodes. Together, the exploration handles the quadtree-like structure efficiently under dynamic and uncertain conditions with a parallel processing architecture. Integrating several algorithms into indoor robotics was a complex process, and a Xilinx-based partial reconfiguration approach was used to prevent computing difficulties when running many algorithms simultaneously. These algorithms were developed, simulated, and synthesized using the Verilog hardware description language on Zynq SoC. Experiments were carried out utilizing a robot based on a field-programmable gate array (FPGA), and the resource utilization and power consumption of the device were analyzed.


  • Open Access

    Hardware Schemes for Smarter Indoor Robotics to Prevent the Backing Crash Framework Using Field Programmable Gate Array-Based Multi-Robots

    by Mudasar Basha, Munuswamy Siva Kumar, Mangali Chinna Chinnaiah, Siew-Kei Lam, Thambipillai Srikanthan, Janardhan Narambhatla, Hari Krishna Dodde, Sanjay Dubey

    The use of smart indoor robotics services is gradually increasing in real-time scenarios. This paper presents a versatile approach to multi-robot backing crash prevention in indoor environments, using hardware schemes to achieve greater competence. Here, sensor fusion was initially used to analyze the state of multi-robots and their orientation within a static or dynamic scenario. The proposed novel hardware scheme-based framework integrates both static and dynamic scenarios for the execution of backing crash prevention. A round-robin (RR) scheduling algorithm was composed for the static scenario. Dynamic backing crash prevention was deployed by embedding a first come, first served (FCFS) scheduling algorithm. The behavioral control mechanism of the distributed multi-robots was integrated with FCFS and adaptive cruise control (ACC) scheduling algorithms. The integration of multiple algorithms is a challenging task for smarter indoor robotics, and the Xilinx-based partial reconfiguration method was deployed to avoid computational issues with multiple algorithms during the run-time. These methods were coded with Verilog HDL and validated using an FPGA (Zynq)-based multi-robot system.


  • Geometry-Based Parking Assistance Using Sensor Fusion for Robots With Hardware Schemes

    by M. C. Chinnaiah, G. Divya Vani, Srinivasa Rao Karumuri, Thambipillai Srikanthan, Siew-Kei Lam, Janardhan Narambhatla, D. Hari Krishna, Sanjay Dubey

    Mobile robots parking in indoor environments, trending towards complex problems, has motivated the development of new hardware computational paradigms. In this paper, we present a novel and effective research for addressing parking assistance in slot identification based on the geometry of a mobile robots using sensor data fusion with hardware schemes. This paper has been abstracted into three levels. Initially, the geometry of the mobile robots was analyzed using multi-sensory fusion at the gateway and parking slots of the indoor environment. A heuristic algorithm was developed to analyze the vehicle geometry patterns. Reconfigurable computing architectures have been developed for geometry analysis with respect to measurements of individuals or groups of robots as leader-follower and rendezvous approaches. The next level of the proposed algorithm estimates the availability of parking slots as per mobile robots geometry using a customized accelerator approach. Mobile robots navigate parking spaces using parking assistance and environmental maps. Parking assistance is integrated with direction-based path planning and odometer techniques are embedded in a known environmental navigation map. A Zynq XC7Z020-CLG484-1 Field Programmable Gate Array (FPGA) was deployed to validate and implemented the design using Xilinx Vivado 2017.4. This paper presents essential information for indoor logistics industries, hospital services, and domestic services at home.


  • Open Access

    A Versatile Approach to Polygonal Object Avoidance in Indoor Environments with Hardware Schemes Using an FPGA-Based Multi-Robot

    by Mudasar Basha, Munuswamy Siva Kumar, Mangali Chinna Chinnaiah, Siew-Kei Lam, Thambipillai Srikanthan, Narambhatla Janardhan, Dodde Hari Krishna, Sanjay Dubey

    Service robots perform versatile functions in indoor environments. This study focuses on obstacle avoidance using flock-type indoor-based multi-robots. Each robot was developed with rendezvous behavior and distributed intelligence to perform obstacle avoidance. The hardware scheme-based obstacle-avoidance algorithm was developed using a bio-inspired flock approach, which was developed with three stages. Initially, the algorithm estimates polygonal obstacles and their orientations. The second stage involves performing avoidance at different orientations of obstacles using a heuristic based Bug2 algorithm. The final stage involves performing a flock rendezvous with distributed approaches and linear movements using a behavioral control mechanism. VLSI architectures were developed for multi-robot obstacle avoidance algorithms and were coded using Verilog HDL. The novel design of this article integrates the multi-robot’s obstacle approaches with behavioral control and hardware scheme-based partial reconfiguration (PR) flow. The experiments were validated using FPGA-based multi-robots.


  • DNN Model Theft Through Trojan Side-Channel on Edge FPGA Accelerator

    by Srivatsan Chandrasekar, Siew-Kei Lam, Srikanthan Thambipillai


  • Open Access

    Area-Time Efficient Two-Dimensional Reconfigurable Integer DCT Architecture for HEVC

    by Pramod Kumar Meher, Siew-Kei Lam, Thambipillai Srikanthan, Dong Hwan Kim, Sang Yoon Park

    In this paper, we present area-time efficient reconfigurable architectures for the implementation of the integer discrete cosine transform (DCT), which supports all the transform lengths to be used in High Efficiency Video Coding (HEVC). We propose three 1D reconfigurable architectures that can be configured for the computation of the DCT of any of the prescribed lengths such as 4, 8, 16, and 32. It is shown that matrix multiplication schemes involving fewer adders can be used to derive parallel architectures for 1D integer DCT of different lengths. A novel transposition buffer is designed to be used for the proposed 2D DCT architecture, which offers double the throughput without increasing the size of the transposition buffer. We determine the optimal pipeline locations in the proposed design through the precise estimation of propagation delays and the critical path so that the area-delay-product is optimized and all the output samples are obtained in the same cycle in spite of the recursive nature of the structure. Implementation results show that the proposed 2D integer DCT architectures provide significantly higher throughput per unit area than the existing designs for HEVC.


  • Power-Efficient Mapping of Large Applications on Modern Heterogeneous FPGAs

    by Kalindu Herath, Alok Prakash, Suhaib A. Fahmy, Thambipillai Srikanthan

    The increasing size of modern FPGAs allows for ever more complex applications to be mapped onto them. However, long design implementation times for large designs can severely affect design productivity. A modular design methodology can improve design productivity in a divide and conqueror fashion but at the expense of degraded performance and power consumption of the resulting implementation. To reduce the dominant power dissipation component in FPGAs, the routing power, methodologies have been proposed that consider data communication between modules during module formation and placement on the FPGA. Selecting proper mapping region on target FPGAs, on the other hand, is becoming a critical process because of the heterogeneous resources and column arrangements in modern FPGAs. Selecting inappropriate FPGA regions for mapping could lead to degraded performance. Hence, we propose a methodology that uses communication-aware module placement, such that modules are mapped by selecting the best shape and region on the FPGA factoring the columnar resource arrangements. Additionally, techniques for module locking and splitting have been proposed for deterministic convergence of the algorithm and for improved module placement. This methodology exhibits nearly 19% routing power reduction with respect to commercial CAD flows without any degradation in achievable performance.


  • Improving accuracy of HPC-based malware classification for embedded platforms using gradient descent optimization

    by Manaar Alam, Debdeep Mukhopadhyay, Sai Praveen Kadiyala, Siew-Kei Lam, Thambipillai Srikanthan


  • Side-Channel Assisted Malware Classifier with Gradient Descent Correction for Embedded Platforms

    by Manaar Alam, Debdeep Mukhopadhyay, Sai Praveen Kadiyala, Siew Kei Lam, Thambipillai Srikanthan