P
Parastoo Sadeghi
Researcher at University of New South Wales
Publications - 274
Citations - 4273
Parastoo Sadeghi is an academic researcher from University of New South Wales. The author has contributed to research in topics: Linear network coding & Network packet. The author has an hindex of 30, co-authored 264 publications receiving 3994 citations. Previous affiliations of Parastoo Sadeghi include Australian National University.
Papers
More filters
Journal ArticleDOI
Finite-state Markov modeling of fading channels - a survey of principles and applications
TL;DR: This article's goal is to provide an in-depth understanding of the principles of FSMC modeling of fading channels with its applications in wireless communication systems, and to introduce both FSMC models and flat-fading channels.
Journal ArticleDOI
A Survey of Medical Image Registration on Multicore and the GPU
TL;DR: This article looks at early, recent, and state-of-the-art methods for registration of medical images using a range of high-performance computing (HPC) architectures including symmetric multiprocessing (SMP), massively multiprocessioning (MMP), and architectures with distributed memory (DM), and nonuniform memory access (NUMA).
Journal ArticleDOI
Intrinsic Limits of Dimensionality and Richness in Random Multipath Fields
TL;DR: A lower bound on the largest eigenvalue of the Karhunen-Loegraveve (KL) expansion of random multipath fields is established, which quantifies, to some extent, the well-known reduction of multipath richness with reducing the angular power spread of multipATH angular power spectrum.
Book
Hilbert Space Methods in Signal Processing
TL;DR: In this article, the authors introduce the concept of Hilbert spaces and introduce operators, including bounded operators, compact operators, and integral operators, for signal concentration and joint spatio-spectral analysis on 2-sphere.
Proceedings ArticleDOI
On Coding for Cooperative Data Exchange
TL;DR: Upper and lower bounds on the optimal number of transmissions are established and an efficient algorithm with provable performance guarantees is presented, established through numerical simulations.