default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDRajib Lochan Das
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2020
[j5]Rajib Lochan Das
, Vishwas Trivedi:
An Adaptive Upper Threshold Based Gain Function for the ZA-PNLMS Algorithm. IEEE Trans. Circuits Syst. II Express Briefs 67-II(10): 2274-2278 (2020)- [c8]K. Sesha Sai Anudeep, Kuldeep Khoria, Rajib Lochan Das:
Improving Steady-State Performance of the UT-ZA-PNLMS Algorithm for Sparse Systems. SPCOM 2020: 1-5 - [c7]Rajib Lochan Das:
ℓ1/ℓ0 Regularized Conjugate Gradient Based Sparse Adaptive Algorithms. SPCOM 2020: 1-5
2010 – 2019
- 2017
- [j4]Rajib Lochan Das, Manish Narwaria:
Lorentzian Based Adaptive Filters for Impulsive Noise Environments. IEEE Trans. Circuits Syst. I Regul. Pap. 64-I(6): 1529-1539 (2017) - 2016
- [j3]Rajib Lochan Das, Mrityunjoy Chakraborty:
Improving the Performance of the PNLMS Algorithm Using l1 Norm Regularization. IEEE ACM Trans. Audio Speech Lang. Process. 24(7): 1280-1290 (2016) - [c6]Vinay Chakravarthi Gogineni, Subrahmanyam Mula, Rajib Lochan Das, Mrityunjoy Chakraborty:
Performance analysis of proportionate-type LMS algorithms. SPA 2016: 177-181 - 2015
- [j2]Rajib Lochan Das, Mrityunjoy Chakraborty:
On Convergence of Proportionate-Type Normalized Least Mean Square Algorithms. IEEE Trans. Circuits Syst. II Express Briefs 62-II(5): 491-495 (2015) - [i2]Rajib Lochan Das, Mrityunjoy Chakraborty:
Zero Attracting PNLMS Algorithm and Its Convergence in Mean. CoRR abs/1507.02921 (2015) - 2014
- [c5]Vinay Chakravarthi Gogineni, Rajib Lochan Das, Mrityunjoy Chakraborty:
Proportionate-type hard thresholding adaptive filter for sparse system identification. APSIPA 2014: 1-6 - [c4]Rajib Lochan Das, Mrityunjoy Chakraborty:
A variable step-size zero attracting proportionate normalized least mean square algorithm. ISCAS 2014: 1187-1190 - 2013
- [j1]Siddhartha Satpathi, Rajib Lochan Das, Mrityunjoy Chakraborty:
Improving the Bound on the RIP Constant in Generalized Orthogonal Matching Pursuit. IEEE Signal Process. Lett. 20(11): 1074-1077 (2013) - [c3]Rajib Lochan Das, Mrityunjoy Chakraborty:
Sparse adaptive filtering by iterative hard thresholding. APSIPA 2013: 1-6 - [i1]Siddhartha Satpathi, Rajib Lochan Das, Mrityunjoy Chakraborty:
Improved Bounds on RIP for Generalized Orthogonal Matching Pursuit. CoRR abs/1302.0490 (2013) - 2012
- [c2]Rajib Lochan Das, Mrityunjoy Chakraborty:
A zero attracting proportionate normalized least mean square algorithm. APSIPA 2012: 1-4 - [c1]Rajib Lochan Das, Mrityunjoy Chakraborty:
Sparse adaptive filters - An overview and some new results. ISCAS 2012: 2745-2748
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-05-08 21:47 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
