Autor: Kumari, S. - Katalog OPAC zbiorów

Skocz do pozycji: 1.

Tytuł:: Amended Adaptive Algorithm for Corpus Based Improved Speech Enhancement
Autorzy:: Priya, P. Shanmuga
Nidhyananthan, S. Selva
Kumari, R. Shantha Selva
Powiązania:: https://bibliotekanauki.pl/articles/226976.pdf
Data publikacji:: 2019
Wydawca:: Polska Akademia Nauk. Czytelnia Czasopism PAN
Tematy:: least mean square
normalised least mean square
amended normalised least mean square
blind source separation
Opis:: Speech enhancement objective is to improve the noisy speech signals for human perception. The intention of speech enhancement algorithm is to improve the performance of the communication, when the signal is occluded by noise. The quality and intelligibility of speech is reduced because of the presence of background noise. There are various adaptive filtering algorithms for speech enhancement. The existing least mean square and normalised least mean square algorithms have the problem of choosing the step size that guarantees the stability of the algorithm. To overcome this problem, we focus on speech enhancement by amended adaptive filtering. The proposed algorithm follows blind source separation strategy using adaptive filtering. Comparison of existing adaptive filtering algorithms with proposed algorithm justifies the amendment incorporated in this paper. Taking the objective criteria into account the algorithms has been tested for segmental signal to noise ratio (SegSNR), segmental mean square error (SegMSE), signal to noise ratio and mean square error. The proposed algorithm can be used for hand-free cell phone, hearing aids and teleconferencing systems.
Źródło:: International Journal of Electronics and Telecommunications; 2019, 65, 3; 513-517
2300-1933
Pojawia się w:: International Journal of Electronics and Telecommunications
Dostawca treści:: Biblioteka Nauki

Artykuł

Zmień widok

na półce

Skocz do pozycji: 2.

Tytuł:: High Performance DIF-FFT Using Dissimilar Partitioned LUT Based Distributed Arithmetic
Autorzy:: Cheepurupalli, Kusma Kumari
Charan, Muntha
Rao, Jammu Bhaskara
Noor, Mahammad S.
Powiązania:: https://bibliotekanauki.pl/articles/2055270.pdf
Data publikacji:: 2021
Wydawca:: Polska Akademia Nauk. Czytelnia Czasopism PAN
Tematy:: fast Fourier transform
adders
distributed arithmetic
DSP
Opis:: Real-time data processing systems utilize Digital Signal Processing (DSP) functions as the base modules. Most of the DSP functions involve the implementation of Fast Fourier Transform (FFT) to convert the signals from one domain to another domain. The major bottleneck of Decimation in frequency - Fast Fourier Transform (DIF-FFT) implementation lies in using a number of Multipliers. Distributed arithmetic (DA) is considered as one of the efficient techniques to implement DIF-FFT. In this approach, the multipliers are not used. The proposed technique exploits the very advantage of the look-up table by storing the Twiddle factors, thereby avoiding the multipliers required in the butterfly structure. DIF-FFT using Distributed Arithmetic (DIF-FFT DA) models, with different adders such as Ripple carry adder (RCA), Carry-lookahead adder (CLA), and Sklansky prefix graph adder, are proposed in this paper. The three proposed models are synthesized using Cadence 6.1 EDA tools with a 45nm CMOS technology. Compared to the traditional method, it is observed that the area is improved by 53.11%, 53.35%, and 50.15%, power is improved by 42.31%, 42.52%, and 40.39%, and delay is improved by 45.26%, 45.42%, 41.80%, respectively.
Źródło:: International Journal of Electronics and Telecommunications; 2021, 67, 4; 631--637
2300-1933
Pojawia się w:: International Journal of Electronics and Telecommunications
Dostawca treści:: Biblioteka Nauki

Artykuł

Zmień widok

na półce

Informacja

Wyszukujesz frazę "Kumari, S." wg kryterium: Autor

Źródło danych

Dostawca treści

Kolekcja

Rok wydania

Wydawca

Temat

Autor

Typ dokumentu

Język