Error control codes are necessary for transmission and storage of large volumes of date sensitive to errors. BCH codes and Reed Solomon codes are the most important class of multiple error correcting codes for binary and non-binary channels respectively. Peterson and later Berlekamp and Massey discovered powerful algorithms which became viable with the help of new digital technology. Use of Galois fields gave a structured approach to designing of these codes. This presentation deals with above in a very structured and systematic manner.
Ajay Kumar.Ph.D Research scholar at National Institute of Technology my mail id:-- ajaymodaliger@gmail.com
In this presentation slide i have Explained how to reducing Computational time complexity of Discrete Fourier transform(DFT) from O(n^2 ) to nlogn through Radix-2 .FFT Algorithm in this work i have also introduced how we can use Radix-2 FFT in encrypted signal processing application by considering homomarphic properties(RSA) of Paillier cryptosystem.
A real time autonomous soldier health monitoring andSudhakar Kumar
This presentation is based on the paper titled "A Real Time Autonomous Soldier Health Monitoring and Reporting System Using COTS Available Entities," available on http://ieeexplore.ieee.org/document/7306769/.
Error control codes are necessary for transmission and storage of large volumes of date sensitive to errors. BCH codes and Reed Solomon codes are the most important class of multiple error correcting codes for binary and non-binary channels respectively. Peterson and later Berlekamp and Massey discovered powerful algorithms which became viable with the help of new digital technology. Use of Galois fields gave a structured approach to designing of these codes. This presentation deals with above in a very structured and systematic manner.
Ajay Kumar.Ph.D Research scholar at National Institute of Technology my mail id:-- ajaymodaliger@gmail.com
In this presentation slide i have Explained how to reducing Computational time complexity of Discrete Fourier transform(DFT) from O(n^2 ) to nlogn through Radix-2 .FFT Algorithm in this work i have also introduced how we can use Radix-2 FFT in encrypted signal processing application by considering homomarphic properties(RSA) of Paillier cryptosystem.
A real time autonomous soldier health monitoring andSudhakar Kumar
This presentation is based on the paper titled "A Real Time Autonomous Soldier Health Monitoring and Reporting System Using COTS Available Entities," available on http://ieeexplore.ieee.org/document/7306769/.
The presentation covers important aspects of the AI introduction, applications and probable uses. In addition, one Nature Inspired Optimization algorithm is explained with mathematical formulation.
Bch and reed solomon codes generation in frequency domainMadhumita Tamhane
Digital signal processing is permeated with application of Fourier Transforms. When time variable is continuous, study of real-valued or complex valued signals rely heavily on Fourier transforms. Fourier Transforms also exist on the vector space of n-tuples over the Galois field GF(q) for many values of n, i.e. code-words. Cyclic codes can be defined as codes whose code-words have certain specific spectral components equal to zero. Conjugacy constraints provide an analogous condition for a finite field. BCH and Reed Solomon codes can be easily generated in frequency domain based on conjugacy constraints.
The presentation covers important aspects of the AI introduction, applications and probable uses. In addition, one Nature Inspired Optimization algorithm is explained with mathematical formulation.
Bch and reed solomon codes generation in frequency domainMadhumita Tamhane
Digital signal processing is permeated with application of Fourier Transforms. When time variable is continuous, study of real-valued or complex valued signals rely heavily on Fourier transforms. Fourier Transforms also exist on the vector space of n-tuples over the Galois field GF(q) for many values of n, i.e. code-words. Cyclic codes can be defined as codes whose code-words have certain specific spectral components equal to zero. Conjugacy constraints provide an analogous condition for a finite field. BCH and Reed Solomon codes can be easily generated in frequency domain based on conjugacy constraints.