default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDzevdan Kapetanovic
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[i4]Dzevdan Kapetanovic:
Signal Recovery From Product of Two Vandermonde Matrices. CoRR abs/2401.15517 (2024)- 2023
- [j7]Dzevdan Kapetanovic
:
Sparse Channel Estimation From Discrete-Time Fourier Transform Beam Measurements. IEEE Trans. Wirel. Commun. 22(9): 6356-6368 (2023) - 2022
- [c17]Hongxiang Xie, Hao Wang, Dzevdan Kapetanovic:
Uplink MIMO Precoding Under Random Phase Imperfections. VTC Fall 2022: 1-5 - 2020
- [c16]Sha Hu, Wenquan Hu, Dzevdan Kapetanovic, Neng Wang:
Deep-Neural-Network Based Fall-Back Mechanism in Interference-Aware Receiver Design. ICASSP 2020: 1588-1892
2010 – 2019
- 2019
- [i3]Sha Hu, Dzevdan Kapetanovic, Neng Wang, Wenquan Hu:
Deep-Neural-Network based Fall-back Mechanism in Interference-Aware Receiver Design. CoRR abs/1905.10890 (2019) - 2017
- [c15]Dzevdan Kapetanovic, Naveed Butt, Rocco Di Taranto:
Downlink Resource Allocation with Multiple Users Per Resource and Modulation Assignment. VTC Fall 2017: 1-7 - 2015
- [j6]Dzevdan Kapetanovic, Gan Zheng, Fredrik Rusek:
Physical layer security for massive MIMO: An overview on passive eavesdropping and active attacks. IEEE Commun. Mag. 53(6): 21-27 (2015) - [j5]Dzevdan Kapetanovic, Hei Victor Cheng, Wai Ho Mow, Fredrik Rusek:
Lattice Structures of Precoders Maximizing the Minimum Distance in Linear Channels. IEEE Trans. Inf. Theory 61(2): 908-916 (2015) - [c14]Sina Maleki, Philippe Ciblat, Symeon Chatzinotas, Dzevdan Kapetanovic, Björn E. Ottersten:
Cooperative power and DoT estimation for a directive source. ACSSC 2015: 630-634 - [c13]Dzevdan Kapetanovic, Leif Wilhelmsson, Thomas Nilsson:
The impact of feedback on linear precoding for the two-user uplink MIMO channel with a zero forcing equalizer. PIMRC 2015: 39-44 - [c12]Magnus Åström, Bo Lincoln, Fredrik Nordström, Dzevdan Kapetanovic:
Squared channel matrix prediction for CSI reporting in Rayleigh fading channels. PIMRC 2015: 538-541 - [i2]Dzevdan Kapetanovic, Gan Zheng, Fredrik Rusek:
Physical Layer Security for Massive MIMO: An Overview on Passive Eavesdropping and Active Attacks. CoRR abs/1504.07154 (2015) - 2014
- [c11]Dzevdan Kapetanovic, Symeon Chatzinotas, Björn E. Ottersten:
Index assignment for multiple description repair in distributed storage systems. ICC 2014: 3896-3901 - [c10]Dzevdan Kapetanovic, Azzam Al-Nahari, Aleksandar Stojanovic, Fredrik Rusek:
Detection of active eavesdroppers in massive MIMO. PIMRC 2014: 585-589 - 2013
- [j4]Dzevdan Kapetanovic, Hei Victor Cheng, Wai Ho Mow, Fredrik Rusek:
Optimal Two-Dimensional Lattices for Precoding of Linear Channels. IEEE Trans. Wirel. Commun. 12(5): 2104-2113 (2013) - [j3]M. Majid Butt, Dzevdan Kapetanovic, Björn E. Ottersten:
Maximizing Minimum Throughput Guarantees: The Small Violation Probability Region. IEEE Wirel. Commun. Lett. 2(3): 271-274 (2013) - [c9]Dzevdan Kapetanovic, Gan Zheng, Kai-Kit Wong, Björn E. Ottersten:
Detection of pilot contamination attack using random training and massive MIMO. PIMRC 2013: 13-18 - [c8]Dzevdan Kapetanovic, M. Majid Butt, Symeon Chatzinotas, Björn E. Ottersten:
Secondary User Scheduling under Throughput Guarantees for the Primary Network. VTC Fall 2013: 1-5 - 2012
- [b1]Dzevdan Kapetanovic:
On Linear Transmission Systems. Lund University, Sweden, 2012 - [j2]Dzevdan Kapetanovic, Fredrik Rusek:
The Effect of Signaling Rate on Information Rate for Single Carrier Linear Transmission Systems. IEEE Trans. Commun. 60(2): 421-428 (2012) - [j1]Dzevdan Kapetanovic, Fredrik Rusek, Traian E. Abrudan, Visa Koivunen:
Construction of Minimum Euclidean Distance MIMO Precoders and Their Lattice Classifications. IEEE Trans. Signal Process. 60(8): 4470-4474 (2012) - [i1]Dzevdan Kapetanovic, Hei Victor Cheng, Wai Ho Mow, Fredrik Rusek:
A Lattice-Theoretic Characterization of Optimal Minimum-Distance Linear Precoders. CoRR abs/1204.1933 (2012) - 2011
- [c7]Dzevdan Kapetanovic, Hei Victor Cheng, Wai Ho Mow, Fredrik Rusek:
Optimal lattices for MIMO precoding. ISIT 2011: 2924-2928 - [c6]Dzevdan Kapetanovic, Fredrik Rusek:
Linear Precoders for Parallel Gaussian Channels with Low Decoding Complexity. VTC Fall 2011: 1-5 - 2010
- [c5]Dzevdan Kapetanovic, Fredrik Rusek:
A Comparison between Unitary and Non-Unitary Precoder Design for MIMO Channels with MMSE Detection and Limited Feedback. GLOBECOM 2010: 1-6 - [c4]Dzevdan Kapetanovic, Fredrik Rusek:
On Precoder Design under Maximum-Likelihood Detection for Quasi-Stationary MIMO Channels. ICC 2010: 1-5
2000 – 2009
- 2009
- [c3]Fredrik Rusek, Dzevdan Kapetanovic:
Design of close to optimal Euclidean distance MIMO-precoders. ISIT 2009: 1268-1272 - 2008
- [c2]Fredrik Rusek, Dzevdan Kapetanovic, John B. Anderson:
The effect of symbol rate on constrained capacity for linear modulation. ISIT 2008: 1093-1097 - 2007
- [c1]Dzevdan Kapetanovic, Fredrik Rusek:
Optimal Time-Frequency Occupancy of Finite Packet OFDM. PIMRC 2007: 1-5
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 2025-01-16 23:14 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:
