default search action
Aravindh Krishnamoorthy
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j5]Luis F. Abanto-Leon, Aravindh Krishnamoorthy, Andres Garcia-Saavedra, Gek Hong Sim, Robert Schober, Matthias Hollick:
Radio Resource Management Design for RSMA: Optimization of Beamforming, User Admission, and Discrete/Continuous Rates With Imperfect SIC. IEEE Trans. Mob. Comput. 23(12): 11498-11518 (2024) - [i15]Cheng Cheng, Sovan Das, Stefan Videv, Adrian Sparks, Sina Babadi, Aravindh Krishnamoorthy, Changmin Lee, Daniel Grieder, Kathleen Hartnett, Paul Rudy, James Raring, Marzieh Najafi, Vasilis K. Papanikolaou, Robert Schober, Harald Haas:
100 Gbps Indoor Access and 4.8 Gbps Outdoor Point-to-Point LiFi Transmission Systems using Laser-based Light Sources. CoRR abs/2402.16144 (2024) - [i14]Luis F. Abanto-Leon, Aravindh Krishnamoorthy, Andres Garcia-Saavedra, Gek Hong Sim, Robert Schober, Matthias Hollick:
Radio Resource Management Design for RSMA: Optimization of Beamforming, User Admission, and Discrete/Continuous Rates with Imperfect SIC. CoRR abs/2404.19611 (2024) - 2023
- [j4]Aravindh Krishnamoorthy
, Robert Schober
Downlink Massive MU-MIMO With Successively-Regularized Zero Forcing Precoding. IEEE Wirel. Commun. Lett. 12(1): 114-118 (2023) - 2022
- [j3]Aravindh Krishnamoorthy
Downlink MIMO-RSMA With Successive Null-Space Precoding. IEEE Trans. Wirel. Commun. 21(11): 9170-9185 (2022) - [c8]Rouaa Diab, Aravindh Krishnamoorthy, Robert Schober:
Precoding and Decoding Schemes for Downlink MIMO-RSMA with Simultaneous Diagonalization and User Exclusion. ICC Workshops 2022: 586-591 - [i13]Rouaa Diab, Aravindh Krishnamoorthy, Robert Schober:
Precoding and Decoding Schemes for Downlink MIMO-RSMA with Simultaneous Diagonalization and User Exclusion. CoRR abs/2202.01008 (2022) - [i12]Aravindh Krishnamoorthy, Robert Schober:
Downlink Massive MU-MIMO with Successively-Regularized Zero Forcing Precoding. CoRR abs/2206.08771 (2022) - 2021
- [j2]Aravindh Krishnamoorthy
Precoder Design and Statistical Power Allocation for MIMO-NOMA via User-Assisted Simultaneous Diagonalization. IEEE Trans. Commun. 69(2): 929-945 (2021) - [j1]Aravindh Krishnamoorthy
Uplink and Downlink MIMO-NOMA With Simultaneous Triangularization. IEEE Trans. Wirel. Commun. 20(6): 3381-3396 (2021) - [c7]Aravindh Krishnamoorthy, Robert Schober:
Successive Null-Space Precoder Design for Downlink MU-MIMO with Rate Splitting and Single-Stage SIC. ICC Workshops 2021: 1-6 - [c6]Aravindh Krishnamoorthy, Meng Huang, Robert Schober:
Precoder Design and Power Allocation for Downlink MIMO-NOMA via Simultaneous Triangularization. WCNC 2021: 1-6 - [i11]Aravindh Krishnamoorthy, Robert Schober:
Successive Null-Space Precoder Design for Downlink MU-MIMO with Rate Splitting and Single-Stage SIC. CoRR abs/2101.01147 (2021) - [i10]Aravindh Krishnamoorthy, Robert Schober:
Downlink MIMO-RSMA with Successive Null-Space Precoding. CoRR abs/2107.08294 (2021) - 2020
- [c5]Aravindh Krishnamoorthy, Robert Schober:
Statistical Power Allocation for Downlink Two-User Power-Domain MIMO-NOMA with Excess Degrees of Freedom. WSA 2020: 1-6 - [i9]Aravindh Krishnamoorthy, Zhiguo Ding, Robert Schober:
Precoder Design and Statistical Power Allocation for MIMO-NOMA via User-Assisted Simultaneous Diagonalization. CoRR abs/2005.02308 (2020) - [i8]Aravindh Krishnamoorthy, Meng Huang, Robert Schober:
Precoder Design and Power Allocation for Downlink MIMO-NOMA via Simultaneous Triangularization. CoRR abs/2006.04581 (2020) - [i7]Aravindh Krishnamoorthy, Robert Schober:
Uplink and Downlink MIMO-NOMA with Simultaneous Triangularization. CoRR abs/2006.06471 (2020)
2010 – 2019
- 2019
- [c4]Aravindh Krishnamoorthy, Robert Schober:
Precoder Design for Two-User Uplink MIMO-NOMA with Simultaneous Triangularization. GLOBECOM 2019: 1-6 - [c3]Aravindh Krishnamoorthy, Robert Schober, Zhiguo Ding:
Downlink Precoder Design for Two-User Power-Domain MIMO-NOMA with Excess Degrees of Freedom. ICC Workshops 2019: 1-6 - 2017
- [c2]Rudraksh Shrivastava, Marco Breiling
Vehicular SUDAS for 5G high mobility V2X scenarios. CSCN 2017: 104-108 - [c1]Aravindh Krishnamoorthy, Robert Schober, Marco Breiling
Resource Allocation for Outdoor-to-Indoor Compress-and-Forward SUDAS with Independent Relay Processing. VTC Fall 2017: 1-7 - 2014
- [i6]Aravindh Krishnamoorthy:
Symmetric QR Algorithm with Permutations. CoRR abs/1402.5086 (2014) - 2013
- [i5]Aravindh Krishnamoorthy:
On Coefficient Matrices Computation of Structured Vector Autoregressive Model. CoRR abs/1309.6290 (2013) - [i4]Aravindh Krishnamoorthy:
Linear Extended Whitening Filters. CoRR abs/1310.3454 (2013) - 2012
- [i3]Aravindh Krishnamoorthy, Kenan Kocagoez:
Singular Values using Cholesky Decomposition. CoRR abs/1202.1490 (2012) - 2011
- [i2]Aravindh Krishnamoorthy, Deepak Menon:
Matrix Inversion Using Cholesky Decomposition. CoRR abs/1111.4144 (2011) - [i1]Aravindh Krishnamoorthy, Leela Srikar Muppirisetty, Ravi Jandial:
Simulation Performance of MMSE Iterative Equalization with Soft Boolean Value Propagation. CoRR abs/1112.2628 (2011)
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-11-25 22:41 CET 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: