Mostrar el registro sencillo

dc.contributor.authorSantamaría Caballero, Luis Ignacio 
dc.contributor.authorRamírez García, David
dc.contributor.authorScharf, Louis L. 
dc.contributor.otherUniversidad de Cantabriaes_ES
dc.date.accessioned2018-12-19T14:05:48Z
dc.date.available2018-12-19T14:05:48Z
dc.date.issued2018
dc.identifier.isbn978-1-5386-1572-0
dc.identifier.isbn978-1-5386-1571-3
dc.identifier.otherTEC2016-75067-C4-4-Res_ES
dc.identifier.otherTEC2013-41718-Res_ES
dc.identifier.otherTEC2015-69648-REDCes_ES
dc.identifier.otherTEC2015-69868-C2-1-Res_ES
dc.identifier.otherTEC2017-86921-C2-2-Res_ES
dc.identifier.urihttp://hdl.handle.net/10902/15194
dc.description.abstractSubspace averaging is proposed and examined as a method of enumerating sources in large linear arrays, under conditions of low sample support. The key idea is to exploit shift invariance as a way of extracting many subspaces, which may then be approximated by a single extrinsic average. An automatic order determination rule for this extrinsic average is then the rule for determining the number of sources. Experimental results are presented for cases where the number of array snapshots is roughly half the number of array elements, and sources are well separated with respect to the Rayleigh limit.es_ES
dc.description.sponsorshipThe work of I. Santamaría has been partially supported by the Ministerio de Economía y Competitividad (MINECO) of Spain, and AEI/FEDER funds of the E.U., under grant TEC2016-75067-C4-4-R (CARMEN). The work of D. Ramírez has been partly supported by Ministerio de Economía of Spain under projects: OTOSIS (TEC2013-41718-R) and the COMONSENS Network (TEC2015-69648-REDC), by the Ministerio de Economía of Spain jointly with the European Commission (ERDF) under projects ADVENTURE (TEC2015-69868-C2-1-R) and CAIMAN (TEC2017-86921- C2-2-R), and by the Comunidad de Madrid under project CASI-CAM-CM (S2013/ICE-2845). The work of L. L. Scharf was supported by the National Science Foundation (NSF) under grant CCF-1018472.es_ES
dc.format.extent5 p.es_ES
dc.language.isoenges_ES
dc.publisherIEEEes_ES
dc.rights© 2018 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works.es_ES
dc.sourceIEEE Statistical Signal Processing Workshop (SSP), Freiburg, Germany, 2018, 323-327es_ES
dc.subject.otherArray processinges_ES
dc.subject.otherGrassmann manifoldes_ES
dc.subject.otherModel order estimationes_ES
dc.subject.otherSource enumerationes_ES
dc.subject.otherSubspace averaginges_ES
dc.titleSubspace averaging for source enumeration in large arrayses_ES
dc.typeinfo:eu-repo/semantics/conferenceObjectes_ES
dc.relation.publisherVersionhttps://doi.org/10.1109/SSP.2018.8450837es_ES
dc.rights.accessRightsopenAccesses_ES
dc.identifier.DOI10.1109/SSP.2018.8450837
dc.type.versionacceptedVersiones_ES


Ficheros en el ítem

Thumbnail

Este ítem aparece en la(s) siguiente(s) colección(ones)

Mostrar el registro sencillo