<efrbr:recordSet xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns:efrbr="http://vfrbr.info/efrbr/1.1" xmlns:efrbr-work="http://vfrbr.info/efrbr/1.1/work" xmlns:efrbr-expression="http://vfrbr.info/efrbr/1.1/expression" xmlns:efrbr-manifestation="http://vfrbr.info/efrbr/1.1/manifestation" xmlns:efrbr-person="http://vfrbr.info/efrbr/1.1/person" xmlns:efrbr-corporateBody="http://vfrbr.info/efrbr/1.1/corporateBody" xmlns:efrbr-concept="http://vfrbr.info/efrbr/1.1/concept" xmlns:efrbr-structure="http://vfrbr.info/efrbr/1.1/structure" xmlns:efrbr-responsible="http://vfrbr.info/efrbr/1.1/responsible" xmlns:efrbr-subject="http://vfrbr.info/efrbr/1.1/subject" xmlns:efrbr-other="http://vfrbr.info/efrbr/1.1/other" xsi:schemaLocation="http://vfrbr.info/efrbr/1.1 http://vfrbr.info/schemas/1.1/efrbr.xsd"><efrbr:entities><efrbr-work:work identifier="http://purl.tuc.gr/dl/dias/A35861DE-3D72-4F98-AB7C-08B54B679544"><efrbr-work:titleOfTheWork>Robustness of least-squares and subspace methods for blind channel identification/equalization algorithms with respect to channel undermodeling</efrbr-work:titleOfTheWork></efrbr-work:work><efrbr-expression:expression identifier="http://purl.tuc.gr/dl/dias/A35861DE-3D72-4F98-AB7C-08B54B679544"><efrbr-expression:titleOfTheExpression>Robustness of least-squares and subspace methods for blind channel identification/equalization algorithms with respect to channel undermodeling</efrbr-expression:titleOfTheExpression><efrbr-expression:formOfExpression vocabulary="DIAS:TYPES">
            Πλήρης Δημοσίευση σε Συνέδριο
            Conference Full Paper
         </efrbr-expression:formOfExpression><efrbr-expression:dateOfExpression type="issued">2015-11-09</efrbr-expression:dateOfExpression><efrbr-expression:dateOfExpression type="published">1998</efrbr-expression:dateOfExpression><efrbr-expression:languageOfExpression vocabulary="iso639-1">en</efrbr-expression:languageOfExpression><efrbr-expression:summarizationOfContent>The least-squares and the subspace methods are
well known approaches for blind channel identification/equalization.
When the order of the channel is
known, the algorithms are able to identify the channel,
under the so-called length and zero conditions. Furthermore,
in the noiseless case, the channel can be perfectly
equalized. Less is known about the performance of
these algorithms in the cases in which the channel order
is underestimated. We partition the true impulse response
into the significant part and the tails. We show
that the m-th order least-squares or subspace methods
estimate an impulse response which is “close” to the
m-th order significant part of the true impulse response.
The closeness depends on the diversity of the m-th order
significant part and the size of the “unmodeled” part</efrbr-expression:summarizationOfContent><efrbr-expression:useRestrictionsOnTheExpression type="creative-commons">http://creativecommons.org/licenses/by/4.0/</efrbr-expression:useRestrictionsOnTheExpression><efrbr-expression:note type="conference name">European Signal Processing Conference</efrbr-expression:note></efrbr-expression:expression><efrbr-person:person identifier="http://users.isc.tuc.gr/~aliavas"><efrbr-person:nameOfPerson vocabulary="TUC:LDAP">
            Liavas Athanasios
            Λιαβας Αθανασιος
         </efrbr-person:nameOfPerson></efrbr-person:person><efrbr-person:person identifier="http://viaf.org/viaf/41841418"><efrbr-person:nameOfPerson vocabulary="VIAF">
            Delmas, Fernand
         </efrbr-person:nameOfPerson></efrbr-person:person><efrbr-person:person identifier="http://viaf.org/viaf/26294699"><efrbr-person:nameOfPerson vocabulary="VIAF">
            Regalia, Phillip A., 1962-
         </efrbr-person:nameOfPerson></efrbr-person:person></efrbr:entities><efrbr:relationships><efrbr-structure:structureRelations><efrbr-structure:realizedThrough sourceEntity="work" targetEntity="expression" sourceURI="http://purl.tuc.gr/dl/dias/A35861DE-3D72-4F98-AB7C-08B54B679544" targetURI="http://purl.tuc.gr/dl/dias/A35861DE-3D72-4F98-AB7C-08B54B679544"/></efrbr-structure:structureRelations><efrbr-responsible:responsibleRelations><efrbr-responsible:createdBy sourceEntity="work" targetEntity="person" sourceURI="http://purl.tuc.gr/dl/dias/A35861DE-3D72-4F98-AB7C-08B54B679544" targetURI="http://users.isc.tuc.gr/~aliavas"/><efrbr-responsible:realizedBy sourceEntity="expression" role="author" targetEntity="person" sourceURI="http://purl.tuc.gr/dl/dias/A35861DE-3D72-4F98-AB7C-08B54B679544" targetURI="http://users.isc.tuc.gr/~aliavas"/><efrbr-responsible:realizedBy sourceEntity="expression" role="author" targetEntity="person" sourceURI="http://purl.tuc.gr/dl/dias/A35861DE-3D72-4F98-AB7C-08B54B679544" targetURI="http://viaf.org/viaf/41841418"/><efrbr-responsible:realizedBy sourceEntity="expression" role="author" targetEntity="person" sourceURI="http://purl.tuc.gr/dl/dias/A35861DE-3D72-4F98-AB7C-08B54B679544" targetURI="http://viaf.org/viaf/26294699"/></efrbr-responsible:responsibleRelations><efrbr-subject:subjectRelations/><efrbr-other:otherRelations/></efrbr:relationships></efrbr:recordSet>