M
Mahdi Shabany
Researcher at Sharif University of Technology
Publications - 81
Citations - 1785
Mahdi Shabany is an academic researcher from Sharif University of Technology. The author has contributed to research in topics: MIMO & Throughput (business). The author has an hindex of 19, co-authored 78 publications receiving 1353 citations. Previous affiliations of Mahdi Shabany include MaxLinear & University of Toronto.
Papers
More filters
Journal ArticleDOI
Cuffless Blood Pressure Estimation Algorithms for Continuous Health-Care Monitoring
TL;DR: An efficient algorithm based on the pulse arrival time (PAT) for the continuous and cuffless estimation of the systolic BP, diastolic blood pressure (DBP), and mean arterial pressure (MAP) values is presented.
Proceedings ArticleDOI
Cuff-less high-accuracy calibration-free blood pressure estimation using pulse transit time
TL;DR: A novel method is proposed for accurate and reliable estimation of blood pressure that is calibration-free by extraction of several physiological parameters from Photoplethysmography (PPG) signal as well as utilizing signal processing and machine learning algorithms.
Journal ArticleDOI
Nonlinear Cuffless Blood Pressure Estimation of Healthy Subjects Using Pulse Transit Time and Arrival Time
TL;DR: The results show that the proposed method, exploiting the introduced nonlinear model with the use of PAT index or PTT index, provides a reliable estimation of SBP and DBP.
Journal ArticleDOI
A 675 Mbps, 4 $\times$ 4 64-QAM K-Best MIMO Detector in 0.13 $\mu{\rm m}$ CMOS
Mahdi Shabany,P.G. Gulak +1 more
TL;DR: A novel scalable pipelined VLSI architecture for a 4 × 4 64-QAM hard-output multiple-input-multiple-output (MIMO) detector based on K-best lattice decoders that operates at a significantly higher throughput compared to the best previously published design.
Proceedings ArticleDOI
The application of lattice-reduction to the K-Best algorithm for near-optimal MIMO detection
Mahdi Shabany,P. Glenn Gulak +1 more
TL;DR: An efficient lattice-reduction (LR) aided implementation of the K-best algorithm is proposed for the general infinite lattice detection problem, which is realized with about 80% less complexity than currently reported architectures.