Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

A simple proof of a known blind channel identifiability result

From MaRDI portal
Publication:2732801
Jump to:navigation, search

DOI10.1109/78.740150zbMath1012.94539OpenAlexW2104027433MaRDI QIDQ2732801

Georgios B. Giannakis, Erchin Serpedin

Publication date: 2 December 2001

Published in: IEEE Transactions on Signal Processing (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/af1594634740d55ca1e0a23878866e81bb5ffa92


zbMATH Keywords

Sylvester matrixblind identificationequalizationSIMO channelVandermonde vectors


Mathematics Subject Classification ID

Estimation and detection in stochastic control theory (93E10) Identification in stochastic control theory (93E12) Channel models (including quantum) in information and communication theory (94A40) Communication theory (94A05)


Related Items (1)

Rayleigh quotient methods for estimating common roots of noisy univariate polynomials






This page was built for publication: A simple proof of a known blind channel identifiability result

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:2732801&oldid=15593167"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 3 February 2024, at 13:56.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki