5 results
Search Results
2. A New Method of Matrix Spectral Factorization.
- Author
-
Janashia, Gigla, Lagvilava, Edem, and Ephremidze, Lasha
- Subjects
FACTORIZATION ,ALGORITHMS ,MATHEMATICAL functions ,DATA compression ,WIRELESS communications ,INFORMATION filtering ,TECHNOLOGICAL innovations - Abstract
A new algorithm of matrix spectral factorization is proposed which can be applied to compute an approximate spectral factor of any positive definite matrix function which satisfies the Paley-Wiener condition. ref refid="fnote1"/ id="fnote1" asterisk="no"paraThis paper includes the detailed proofs for an innovative method for matrix spectral factorization that can be used in numerous applications, including filtering, data compression, and wireless communications. A U.S. patent application has been submitted for this innovation through the Technology Commercialization Center, University of Maryland.para [ABSTRACT FROM AUTHOR]
- Published
- 2011
- Full Text
- View/download PDF
3. Corrections to “Fine Asymptotics for Universal One-to-One Compression of Parametric Sources”.
- Author
-
Iri, Nematollah and Kosut, Oliver
- Subjects
INFORMATION theory ,SYSTEMS engineering ,STATE universities & colleges ,SYSTEMS theory ,COMPUTER engineering - Abstract
In The paper above , published in the April 2019 issue of the IEEE Transactions on Information Theory, the following change is noted. The affiliations of the authors were listed incorrectly due to a production error. The affiliations should be listed as follows: The authors were with the School of Electrical, Computer and Energy Engineering, Arizona State University, Tempe, AZ 85287 USA, while performing their research for. [ABSTRACT FROM AUTHOR]
- Published
- 2019
- Full Text
- View/download PDF
4. Degraded Broadcast Diamond Channels With Noncausal State Information at the Source.
- Author
-
Li, Min, Simeone, Osvaldo, and Yener, Aylin
- Subjects
BROADCASTING industry ,DIGITAL television ,DIGITAL communications ,TELECOMMUNICATION ,TELECOMMUNICATIONS laws & regulations ,TELECOMMUNICATION policy - Abstract
A state-dependent degraded broadcast diamond channel is studied where the source-to-relays cut is modeled with two noiseless, finite-capacity digital links with a degraded broadcasting structure, while the relays-to-destination cut is a general multiple access channel controlled by a random state. It is assumed that the source has noncausal channel state information and the relays have no state information. Under this model, first, the capacity is characterized for the case where the destination has state information, i.e., has access to the state sequence. It is demonstrated that in this case, a joint message and state transmission scheme via binning is optimal. Next, the case where the destination does not have state information, i.e., the case with state information at the source only, is considered. For this scenario, lower and upper bounds on the capacity are derived for the general discrete memoryless model. Achievable rates are then computed for the case in which the relays-to-destination cut is affected by an additive Gaussian state. Numerical results are provided that illuminate the performance advantages that can be accrued by leveraging noncausal state information at the source. [ABSTRACT FROM PUBLISHER]
- Published
- 2013
- Full Text
- View/download PDF
5. Rumors in a Network: Who's the Culprit?
- Author
-
Shah, Devavrat and Zaman, Tauhid
- Subjects
COMPUTER networks ,MAXIMUM likelihood statistics ,PROBABILITY theory ,COMPUTER simulation ,GRAPH theory ,COMPUTER algorithms ,ELECTRIC power transmission - Abstract
We provide a systematic study of the problem of finding the source of a rumor in a network. We model rumor spreading in a network with the popular susceptible-infected (SI) model and then construct an estimator for the rumor source. This estimator is based upon a novel topological quantity which we term rumor centrality. We establish that this is a maximum likelihood (ML) estimator for a class of graphs. We find the following surprising threshold phenomenon: on trees which grow faster than a line, the estimator always has nontrivial detection probability, whereas on trees that grow like a line, the detection probability will go to 0 as the network grows. Simulations performed on synthetic networks such as the popular small-world and scale-free networks, and on real networks such as an internet AS network and the U.S. electric power grid network, show that the estimator either finds the source exactly or within a few hops of the true source across different network topologies. We compare rumor centrality to another common network centrality notion known as distance centrality. We prove that on trees, the rumor center and distance center are equivalent, but on general networks, they may differ. Indeed, simulations show that rumor centrality outperforms distance centrality in finding rumor sources in networks which are not tree-like. [ABSTRACT FROM PUBLISHER]
- Published
- 2011
- Full Text
- View/download PDF
Discovery Service for Jio Institute Digital Library
For full access to our library's resources, please sign in.