z-logo
open-access-imgOpen Access
Two regularization constant selection methods for recursive least squares algorithm with convex regularization and their performance comparison in the sparse acoustic communication channel estimation
Author(s) -
Jun-Seok Lim,
Wooyoung Hong
Publication year - 2016
Publication title -
the journal of the acoustical society of korea
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.162
H-Index - 2
eISSN - 2287-3775
pISSN - 1225-4428
DOI - 10.7776/ask.2016.35.5.383
Subject(s) - regularization (linguistics) , recursive least squares filter , algorithm , regular polygon , constant (computer programming) , mathematics , least squares function approximation , channel (broadcasting) , mathematical optimization , computer science , artificial intelligence , statistics , adaptive filter , telecommunications , geometry , estimator , programming language

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here
Accelerating Research

Address

John Eccles House
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom