default search action
Hemanth Prabhu
Person information
- affiliation: Lund University, Sweden
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2021
- [c15]Hemanth Prabhu, Liang Liu
, Farhana Sheikh
A 1070 pJ/b 169 Mb/s Quad-core Digital Baseband SoC for Distributed and Cooperative Massive MIMO in 28 nm FD-SOI. VLSI Circuits 2021: 1-2 - 2020
- [c14]MinKeun Chung, Hemanth Prabhu, Farhana Sheikh, Ove Edfors, Liang Liu:
Low-Complexity Fully-Digital Phase Noise Suppression for Millimeter-Wave Systems. ISCAS 2020: 1-5
2010 – 2019
- 2019
- [c13]Steffen Malkowsky, Hemanth Prabhu, Liang Liu
A Programmable 16-Lane SIMD ASIP for Massive MIMO. ISCAS 2019: 1-5 - 2018
- [c12]Wei Tang, Hemanth Prabhu, Liang Liu
A 1.8Gb/s 70.6pJ/b 128×16 link-adaptive near-optimal massive MIMO detector in 28nm UTBB-FDSOI. ISSCC 2018: 224-226 - 2017
- [c11]Rakesh Gangarajaiah, Hemanth Prabhu, Ove Edfors
A Cholesky decomposition based massive MIMO uplink detector with adaptive interpolation. ISCAS 2017: 1-4 - [c10]Hemanth Prabhu, Joachim Neves Rodrigues, Liang Liu
3.6 A 60pJ/b 300Mb/s 128×8 Massive MIMO precoder-detector in 28nm FD-SOI. ISSCC 2017: 60-61 - 2015
- [j1]Chenxin Zhang, Hemanth Prabhu, Yangxurui Liu, Liang Liu
Energy Efficient Group-Sort QRD Processor With On-Line Update for MIMO Channel Pre-Processing. IEEE Trans. Circuits Syst. I Regul. Pap. 62-I(5): 1220-1229 (2015) - [c9]Hemanth Prabhu, Joachim Neves Rodrigues, Liang Liu
Algorithm and hardware aspects of pre-coding in massive MIMO systems. ACSSC 2015: 1144-1148 - [c8]Hemanth Prabhu, Fredrik Rusek, Joachim Neves Rodrigues, Ove Edfors
High throughput constant envelope pre-coder for massive MIMO systems. ISCAS 2015: 1502-1505 - [c7]Yangxurui Liu, Hemanth Prabhu, Liang Liu, Viktor Öwall:
Adaptive resource scheduling for energy efficient QRD processor with DVFS. SiPS 2015: 1-6 - 2014
- [c6]Chenxin Zhang, Hemanth Prabhu, Liang Liu
Energy efficient SQRD processor for LTE-A using a group-sort update scheme. ISCAS 2014: 193-196 - [c5]Hemanth Prabhu, Ove Edfors
Hardware efficient approximative matrix inversion for linear pre-coding in massive MIMO. ISCAS 2014: 1700-1703 - [c4]Hemanth Prabhu, Ove Edfors
A low-complex peak-to-average power reduction scheme for OFDM based massive MIMO systems. ISCCSP 2014: 114-117 - 2013
- [c3]Hemanth Prabhu, Joachim Neves Rodrigues, Ove Edfors
Approximative matrix inverse computations for very-large MIMO and applications to linear pre-coding systems. WCNC 2013: 2710-2715 - 2012
- [c2]Chenxin Zhang, Hemanth Prabhu, Liang Liu
Energy efficient MIMO channel pre-processor using a low complexity on-line update scheme. NORCHIP 2012: 1-4 - 2011
- [c1]Hemanth Prabhu, Sherine Thomas, Joachim Neves Rodrigues, Thomas Olsson, Anders Carlsson:
A GALS ASIC implementation from a CAL dataflow description. NORCHIP 2011: 1-4
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-05-08 20:58 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: