Prof. Shaik Qadeer
'%3e%3cpath%20d='M22.1642%2019.0924C21.7317%2018.068%2021.1041%2017.1375%2020.3163%2016.3527C19.5309%2015.5656%2018.6006%2014.9381%2017.5766%2014.5048C17.5674%2014.5002%2017.5582%2014.4979%2017.5491%2014.4933C18.9774%2013.4616%2019.9059%2011.7811%2019.9059%209.88504C19.9059%206.74408%2017.3611%204.19922%2014.2201%204.19922C11.0792%204.19922%208.53429%206.74408%208.53429%209.88504C8.53429%2011.7811%209.46282%2013.4616%2010.8912%2014.4956C10.882%2014.5002%2010.8728%2014.5025%2010.8636%2014.5071C9.83652%2014.9404%208.91487%2015.5617%208.1239%2016.355C7.33685%2017.1404%206.70933%2018.0707%206.276%2019.0947C5.85031%2020.0972%205.62072%2021.172%205.59967%2022.2609C5.59905%2022.2853%205.60335%2022.3097%205.61229%2022.3325C5.62123%2022.3553%205.63465%2022.376%205.65174%2022.3935C5.66883%2022.4111%205.68926%2022.425%205.71182%2022.4345C5.73437%2022.444%205.7586%2022.4489%205.78308%2022.4489H7.15868C7.25956%2022.4489%207.3398%2022.3686%207.3421%2022.2701C7.38795%2020.5001%208.09868%2018.8425%209.35506%2017.5861C10.655%2016.2862%2012.3814%2015.5709%2014.2201%2015.5709C16.0588%2015.5709%2017.7852%2016.2862%2019.0852%2017.5861C20.3415%2018.8425%2021.0523%2020.5001%2021.0981%2022.2701C21.1004%2022.3709%2021.1807%2022.4489%2021.2815%2022.4489H22.6571C22.6816%2022.4489%2022.7058%2022.444%2022.7284%2022.4345C22.751%2022.425%2022.7714%2022.4111%2022.7885%2022.3935C22.8056%2022.376%2022.819%2022.3553%2022.8279%2022.3325C22.8369%2022.3097%2022.8412%2022.2853%2022.8406%2022.2609C22.8176%2021.165%2022.5907%2020.0989%2022.1642%2019.0924ZM14.2201%2013.8284C13.1678%2013.8284%2012.1773%2013.418%2011.4322%2012.6729C10.6871%2011.9278%2010.2767%2010.9374%2010.2767%209.88504C10.2767%208.83271%2010.6871%207.84227%2011.4322%207.09715C12.1773%206.35204%2013.1678%205.94165%2014.2201%205.94165C15.2724%205.94165%2016.2629%206.35204%2017.008%207.09715C17.7531%207.84227%2018.1635%208.83271%2018.1635%209.88504C18.1635%2010.9374%2017.7531%2011.9278%2017.008%2012.6729C16.2629%2013.418%2015.2724%2013.8284%2014.2201%2013.8284Z'%20fill='%238590A2'/%3e%3c/g%3e%3c/svg%3e)
Co-authors
Following
Followers
Research Focus & Metrics
Explore full metrics on Scilit
Academic Career Length
21Years (2006-Present)
(Calculated once Scilit publication data is synced: current year − year of first publication + 1)
Representative Publications
View All Publications1 September 2014
Conference Paper
Shaik QadeerMKMohammed Zafar Ali Khan
Mohammed Zafar Ali Khan
SSSyed Abdul Sattar
Syed Abdul Sattar
AHAhmed
Ahmed
The efficient computation of Discrete Fourier Transform (DFT) is an important issue as it is used in almost all fields of engineering for signal processing. This paper presents a different form of Radix-2 Fast Fourier Transform (FFT) based on Decimation in time (DIT) to compute DFT, discuss their implementation issues and derive it's signal to quantization noise ratio(SQNR) that further decreases the number of multiplication counts without affecting the number of additions of Radix-2 discrete Fourier Transform. It is achieved by simple scaling of Twiddle factor (TF) using a special scaling factor. This modification not only decreases the total flop counts from 5Nlog 2 N to ≈ 42/3 Nlog 2 N (6.66% fewer than the standard Radix-2 FFT algorithm) but also improves SQNR from 1 over 2N2 -2b to 9 over 15N2 -2b (1.6dB more than the standard Radix-2 FFT algorithm).
1 December 2018
Conference Paper
HSHarsha Keerthan Samudrala
Harsha Keerthan Samudrala
Shaik QadeerSASyed Azeemuddin
Syed Azeemuddin
ZKZafar Khan
Zafar Khan
In this paper we discuss the VLSI implementation of the new radix-2 Decimation In Time (DIT) Fast Fourier Transform (FFT) algorithm with reduced arithmetic complexity which is based on scaling the twiddle factor. Some signal processing require high performance FFT processors and to meet these performance requirements, the processor needs to be pipelined and parallelized. An optimized ASIC design is derived from this new radix-2 algorithm with fewer multipliers and adopted a complete parallel and pipelined architecture for hardware implementation of a 64 point FFT. The implementation results show that the proposed architecture significantly reduces the hardware area by 13.74 percent and power consumption by 16 percent when compared to the standard FFT architecture. Simulation of design units is done in Xilinx ISE WebPack 13.1 and synthesized using Cadence Encounter RTL Compiler.
1 December 2016
Conference Paper
MKMohammed Zafar Ali Khan
Mohammed Zafar Ali Khan
Shaik QadeerRader abd Brenner's ‘real-factor’ FFT can be applied to Radix-4 FFT to fetch saving in the multiplication counts. However in turn the number of addition count increases which results in increase in total flop count. For this in this paper two levels of saving ideas are proposed. First is a slight modification to Rader and Brenner's ‘real-factor’ FFT for Radix-4, which not only reduces the multiplication but also makes the total flop count equals to standard Radix-4 FFT. Second is to apply the scaling operation to the Twidlle Factors(TF) similar to Tangent FFT like one proposed by Frigo for split radix so that the net computational complexity is of the order of 4Nlog2N computation, where N is the size of FFT. As such the complexity order is same as Standard Split Radix FFT.
4 September 2018 in Microsystem Technologies
Journal Article
Shaik QadeerMKMohammed Yousuf Khan
Mohammed Yousuf Khan
NSN Shylashree
N ShylashreeVNVijay Nath
Vijay Nath20 November 2006 in IEEE Signal Processing Letters
Journal Article
MKM. Zafar Ali Khan
M. Zafar Ali Khan
Shaik QadeerA comb spectrum evaluation problem arises in the channel estimation of pilot symbol-assisted modulation (PSAM) systems and also in the (de)modulation of multichannel communication system based on orthogonal frequency division multiplexing (OFDM). In this letter, we decompose an M-component comb spectrum evaluation with transform length N into 1) a fast Fourier transform evaluation of transform length M of a length M vector, 2) which in turn is obtained from the lengthN input vector (by folding and scaling). This decomposition allows for the application of split-radix and radix-4 algorithms for evaluation of M length transform and efficient computation of the length M vector from the length N input vector, which is classically termed as "pruning." When N=2p, the comb spectrum computation requires only N/8+M/3log2 M nontrivial complex multiplications, if N/Mges8. In addition, conditions under which comb spectrum evaluation can be done in O(MlogM) complex multiplies are identified
10 October 2023 in Journal of The Institution of Engineers (India): Series B
Journal Article
Shaik QadeerHKHarsha Keerthan
Harsha KeerthanASAzeemuddin Syed
Azeemuddin SyedMKMohammed Khan
Mohammed KhanAbout Me
Dr. Shaik Qadeer is a distinguished Professor in the ECE Department at Lords Institute of Engineering and Technology (MJCET) in Hyderabad. [ppl-ai-file-upload.s3.amazonaws](https://ppl-ai-file-upload.s3.amazonaws.com/web/direct-files/attachments/145773284/12698ed2-c8c1-41b4-a52b-cf112e2f3115/cv-2.pdf)
## Professional Expertise
With over 25 years of academic and research experience, he holds dual PhDs—one in Electrical and Computer Engineering from JNTUH (2015) and another in Computer Science and Engineering from Bir Tikenderjit University (2025)—alongside an MTech in Digital Systems & Computer Electronics from JNTUH (2007) and a BE in ECE from Gulbarga University (1999, Rank #5). His research boasts strong metrics, including 25 Scopus publications, 13 SCI papers, 2 patents, an h-index of 7 (Google Scholar) and 5 (Scopus), and 107 total citations. [ppl-ai-file-upload.s3.amazonaws](https://ppl-ai-file-upload.s3.amazonaws.com/web/direct-files/attachments/145773284/12698ed2-c8c1-41b4-a52b-cf112e2f3115/cv-2.pdf)
## Key Achievements
Dr. Qadeer has served as Professor since 2016 and Associate Professor from 2009–2016 at MJCET, mentoring students, developing Data Science/AI curricula, and presenting at 4 European conferences. Notable roles include Visiting Professor at CDAC Bangalore for Data Analytics/ML, Official NPTEL Data Science Translator, 30 NPTEL credits with 4 Star Awards and Domain Certification, and Top 10 ranking in MJCET's IRINS. Contact hi