C Paramasivam

Dr. C Paramasivam

orcid

Research Focus & Metrics

Academic Career Length

14Years (2013-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
16 January 2025 in IEEE Access
Verified
Journal Article
Open access
CPC Paramasivam
C Paramasivam
SCSandeep Singh Chauhan
Sandeep Singh Chauhan
VMV. P. Meena
V. P. Meena
ASA. Sreejagathi
A. Sreejagathi
BHB. A. V. N. Hasini
B. A. V. N. Hasini
Abdessamad DidiAbdessamad Didi
Abdessamad Didi
Coordinate rotational digital computer (CORDIC) algorithm is an iterative method and it performs the vector rotation operation by micro-rotation with scaling operation in each iteration. This study introduces a high-performance power-efficient new scaling-free coordinate rotational digital computer (NSF-CORDIC) algorithm to perform vector rotation operation in circular coordinates. The scaling operation required in the existing algorithm has been completely removed by the fourth-order approximation of Taylor series (TS). The number of iterations is reduced by an optimized shift value prediction technique for known and fixed angles, like the twiddle factor angle available in the fast Fourier transform (FFT) algorithm. The angle of convergence (AOC) of the algorithm is 57.1°, and it is extended to 180° using the pre-rotation operation and optimized shift value prediction technique. In addition to that, the new CORDIC cell architecture is designed to perform Taylor series-based iterations. Further, a memory-based FFT architecture is designed using a new CORDIC cell. In the FFT architecture, the CORDIC cell performs all the multiplication of twiddle factor. Therefore, the complex constant multiplier required to execute the twiddle factor multiplication is eliminated. The proposed architectures are implemented in the Zynq-7ZC706 FPGA board using the Vivado EDA tool. The scaling-free CORDIC cell architecture has 31% and 3% slice reduction, 72% and 45% slice delay product reduction, and 38% and 23% power reduction compared to the two different existing scaling-free CORDIC designs. The memory-based FFT architecture has 37.8% and 19.6% slice reduction, 38.4% and 27% slice delay product reduction, and 45% and 34% power reduction compared to the two different existing memory-based FFT architecture.


6 February 2026 in Sustainable Futures
Verified
Journal Article
Open access
TMTumelo Nigel Moyo
Tumelo Nigel Moyo
CPC Paramasivam
C Paramasivam
TMTerence M Mashingaidze
Terence M Mashingaidze

1 February 2013
Verified
Conference Paper
Closed access
AMA. Malashri
A. Malashri
CPC Paramasivam
C Paramasivam
This paper presents a pipelined, reduced memory and low power CORDIC-based architecture for fast Fourier transform implementation. The proposed algorithm utilizes a new addressing scheme and the associated angle generator logic in order to remove any ROM usage for storing twiddle factors. CORDIC is implemented by a simple hardware through repeated shift-add operations Low power is achieved by the using the Coordinate Rotation Digital Computer algorithm in the place of conventional multiplication and furthermore, dynamic power consumption is reduced with no delay penalties.

15 September 2016
Verified
Conference Paper
Closed access
SVSuganya V
Suganya V
CPC Paramasivam
C Paramasivam
Most signal processing applications that uses real valued signals are designed and implemented using Fast Fourier algorithms. The imaginary parts of butterflies are scheduled in place of repeated operation for radix-23 and radix-24 butterfly structures to deal with the hybrid data path. Along with this scheduling technique folding methodology is used to reduce the redundant samples in the real valued signals. hardware complexity is reduced by using Multiple Delay Commutator (MDC) architecture for parallel samples. As a result of this butterfly structure, hardware complexity, area, power and delay is greatly reduced and the throughput is increased.

1 January 2013
Verified
Conference Paper
Closed access
BPB Pushparaj.
B Pushparaj.
CPC Paramasivam
C Paramasivam
This paper present a high-performance and low-complexity modified radix-2 5 512-point Fast Fourier transform (FFT) architecture using an eight data-path pipelined approach for high rate wireless personal area network applications. A novel modified radix-2 5 FFT algorithm that reduces the hardware complexity is proposed. This method can reduce the number of complex multiplications and the size of the twiddle factor memory. It also uses a complex constant multiplier instead of a complex Booth multiplier. The results demonstrate that the total gate count of the proposed FFT architecture is 11, 894. Furthermore the highest throughput rate is up to 2.4 GS/s at 310 MHz while requiring much less hardware complexity.