Change search
Link to record
Permanent link

Direct link
BETA
Alternative names
Publications (10 of 464) Show all publications
Ghauch, H., Kim, T., Fischione, C. & Skoglund, M. (2019). Compressive Sensing with Applications to Millimeter-wave Architectures. In: 2019 IEEE INTERNATIONAL CONFERENCE ON ACOUSTICS, SPEECH AND SIGNAL PROCESSING (ICASSP): . Paper presented at 44th IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP), MAY 12-17, 2019, Brighton, ENGLAND (pp. 7834-7838). IEEE
Open this publication in new window or tab >>Compressive Sensing with Applications to Millimeter-wave Architectures
2019 (English)In: 2019 IEEE INTERNATIONAL CONFERENCE ON ACOUSTICS, SPEECH AND SIGNAL PROCESSING (ICASSP), IEEE , 2019, p. 7834-7838Conference paper, Published paper (Refereed)
Abstract [en]

To make the system available at low-cost, millimeter-ave (mmWave) multiple-input multiple-output (MIMO) architectures employ analog arrays, which are driven by a limited number of radio frequency (RF) chains. One primary challenge of using large hybrid analog-digital arrays is that the digital baseband cannot directly access the signal to/from each antenna. To address this limitation, recent research has focused on retransmissions, iterative precoding, and subspace decomposition methods. Unlike these approaches that exploited the channel's low-rank, in this work we exploit the sparsity of the received signal at both the transmit/receive antennas. While the signal itself is de facto dense, it is well-known that most signals are sparse under an appropriate choice of basis. By delving into the structured compressive sensing (CS) framework and adapting them to variants of the mmWave hybrid architectures, we provide methodologies to recover the analog signal at each antenna from the (low-dimensional) digital signal. Moreover, we characterizes the minimal numbers of measurement and RF chains to provide this recovery, with high probability. We discuss their applications to common variants of the hybrid architecture. By leveraging the inherent sparsity of the received signal, our analysis reveals that a hybrid MIMO system can be " turned into" a fully digital one: the number of needed RF chains increases logarithmically with the number of antennas.

Place, publisher, year, edition, pages
IEEE, 2019
Series
International Conference on Acoustics Speech and Signal Processing ICASSP, ISSN 1520-6149
National Category
Telecommunications
Identifiers
urn:nbn:se:kth:diva-261067 (URN)10.1109/ICASSP.2019.8683604 (DOI)000482554008014 ()2-s2.0-85069003459 (Scopus ID)978-1-4799-8131-1 (ISBN)
Conference
44th IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP), MAY 12-17, 2019, Brighton, ENGLAND
Note

QC 20191001

Available from: 2019-10-01 Created: 2019-10-01 Last updated: 2019-10-01Bibliographically approved
Schiessl, S., Gross, J., Skoglund, M. & Caire, G. (2019). Delay Performance of the Multiuser MISO Downlink Under Imperfect CSI and Finite-Length Coding. IEEE Journal on Selected Areas in Communications, 37(4), 765-779
Open this publication in new window or tab >>Delay Performance of the Multiuser MISO Downlink Under Imperfect CSI and Finite-Length Coding
2019 (English)In: IEEE Journal on Selected Areas in Communications, ISSN 0733-8716, E-ISSN 1558-0008, Vol. 37, no 4, p. 765-779Article in journal (Refereed) Published
Abstract [en]

We use stochastic network calculus to investigate the delay performance of a multiuser MISO system with zero-forcing beamforming. First, we consider ideal assumptions with long codewords and perfect CSI at the transmitter, where we observe a strong channel hardening effect that results in very high reliability with respect to the maximum delay of the application. We then study the system under more realistic assumptions with imperfect CSI and finite blocklength channel coding. These effects lead to interference and to transmission errors, and we derive closed-form approximations for the resulting error probability. Compared to the ideal case, imperfect CSI and finite length coding cause massive degradations in the average transmission rate. Surprisingly, the system nevertheless maintains the same qualitative behavior as in the ideal case: as long as the average transmission rate is higher than the arrival rate, the system can still achieve very high reliability with respect to the maximum delay.

Place, publisher, year, edition, pages
IEEE, 2019
Keywords
Multiple-input multiple-output (MIMO), multiuser diversity, zero-forcing beamforming (ZFBF), stochastic network calculus, imperfect CSI, finite blocklength regime
National Category
Electrical Engineering, Electronic Engineering, Information Engineering Telecommunications
Identifiers
urn:nbn:se:kth:diva-248322 (URN)10.1109/JSAC.2019.2898759 (DOI)000461853500006 ()2-s2.0-85063288812 (Scopus ID)
Note

QC 20190409

Available from: 2019-04-09 Created: 2019-04-09 Last updated: 2019-05-17Bibliographically approved
Tolli, A., Ghauch, H., Kaleva, J., Komulainen, P., Bengtsson, M., Skoglund, M., . . . Pajukoski, K. (2019). Distributed Coordinated Transmission with Forward-Backward Training for 5G Radio Access. IEEE Communications Magazine, 57(1), 58-64
Open this publication in new window or tab >>Distributed Coordinated Transmission with Forward-Backward Training for 5G Radio Access
Show others...
2019 (English)In: IEEE Communications Magazine, ISSN 0163-6804, E-ISSN 1558-1896, Vol. 57, no 1, p. 58-64Article in journal (Refereed) Published
Abstract [en]

CoMP transmission and reception have been considered in cellular networks for enabling larger coverage, improved rates, and interference mitigation. To harness the gains of coordinated beamforming, fast information exchange over a backhaul connecting the cooperating BSs is required. In practice, the bandwidth and delay limitations of the backhaul may not be able to meet such stringent demands. These impairments motivate the study of cooperative approaches based only on local CSI that require minimal or no information exchange between the BSs. To this end, several distributed approaches are introduced for CB-CoMP. The proposed methods rely on the channel reciprocity and iterative spatially precoded over-the-air pilot signaling. We elaborate how F-B training facilitates distributed CB by allowing BSs and UEs to iteratively optimize their respective transmitters/receivers based on only locally measured CSI. The trade-off due to the overhead from the F-B iterations is discussed. We also consider the challenge of dynamic TDD where the UE-UE channel knowledge cannot be acquired at the BSs by exploiting channel reciprocity. Finally, standardization activities and practical requirements for enabling the proposed F-B training schemes in 5G radio access are discussed.

Place, publisher, year, edition, pages
IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC, 2019
National Category
Communication Systems
Identifiers
urn:nbn:se:kth:diva-244555 (URN)10.1109/MCOM.2018.1700199 (DOI)000457640200011 ()2-s2.0-85060522227 (Scopus ID)
Note

QC 20190313

Available from: 2019-03-13 Created: 2019-03-13 Last updated: 2019-03-13Bibliographically approved
Pitarokoilis, A. & Skoglund, M. (2019). Frequency Diversity versus Channel Training in Latency-Constrained Massive MIMO. In: 2019 IEEE 20th International Workshop on Signal Processing Advances in Wireless Communications (SPAWC): . Paper presented at 20th IEEE International Workshop on Signal Processing Advances in Wireless Communications, SPAWC 2019; Cannes; France; 2 July 2019 through 5 July 2019. Institute of Electrical and Electronics Engineers (IEEE), Article ID 8815578.
Open this publication in new window or tab >>Frequency Diversity versus Channel Training in Latency-Constrained Massive MIMO
2019 (English)In: 2019 IEEE 20th International Workshop on Signal Processing Advances in Wireless Communications (SPAWC), Institute of Electrical and Electronics Engineers (IEEE), 2019, article id 8815578Conference paper, Published paper (Refereed)
Abstract [en]

The effect of correlation between neighboring resource blocks (RBs) in the outage probability performance of OFDM-based Massive MIMO systems is investigated. An upper bound on the outage probability, which is the relevant performance metric for latency-constrained communication, of two operations that exploit this correlation structure is derived and compared with the base scenario of orthogonal communication, where the correlation is ignored. It is observed that substantial outage probability improvement can be reaped already when moderate correlation is present. Closed-form upper and lower bounds on the investigated outage probability are derived. The bounds are shown to be tight for a wide range of system parameters and can be used to draw insights on the optimal design of latency-constrained Massive MIMO systems.

Place, publisher, year, edition, pages
Institute of Electrical and Electronics Engineers (IEEE), 2019
Keywords
channel estimation, low-latency, Massive MIMO, ultra-reliable
National Category
Communication Systems
Identifiers
urn:nbn:se:kth:diva-262583 (URN)10.1109/SPAWC.2019.8815578 (DOI)2-s2.0-85072349037 (Scopus ID)9781538665282 (ISBN)
Conference
20th IEEE International Workshop on Signal Processing Advances in Wireless Communications, SPAWC 2019; Cannes; France; 2 July 2019 through 5 July 2019
Note

QC 20191022

Available from: 2019-10-22 Created: 2019-10-22 Last updated: 2019-10-22Bibliographically approved
Nekouei, E., Tanaka, T., Skoglund, M. & Johansson, K. H. (2019). Information-theoretic approaches to privacy in estimation and control. Annual Reviews in Control, 47, 412-422
Open this publication in new window or tab >>Information-theoretic approaches to privacy in estimation and control
2019 (English)In: Annual Reviews in Control, ISSN 1367-5788, E-ISSN 1872-9088, Vol. 47, p. 412-422Article, review/survey (Refereed) Published
Abstract [en]

Network control systems (NCSs) heavily rely on information and communication technologies for sharing information between sensors and controllers as well as controllers and actuators. When estimation, control or actuation tasks in a NCS are performed by an untrusted party, sharing information might result in the leakage of private information. The current paper reviews some of the recent results on the privacy-aware decision-making problems in NCSs. In particular, we focus on static and dynamic decision-making problems wherein privacy is measured using information-theoretic notions. We also review the applications of these problems in smart buildings and smart grids. 

Place, publisher, year, edition, pages
PERGAMON-ELSEVIER SCIENCE LTD, 2019
Keywords
Privacy, Information theory, Networked control systems
National Category
Control Engineering
Identifiers
urn:nbn:se:kth:diva-255503 (URN)10.1016/j.arcontrol.2019.04.006 (DOI)000474680200028 ()2-s2.0-85064542337 (Scopus ID)
Note

QC 20190926

Available from: 2019-09-26 Created: 2019-09-26 Last updated: 2019-09-26Bibliographically approved
Shokri-Ghadikolaei, H., Ghauch, H., Fischione, C. & Skoglund, M. (2019). Learning and Data Selection in Big Datasets. In: Proceedings of the 36th International Conference on MachineLearning, Long Beach, California, PMLR 97, 2019.: . Paper presented at 36th International Conference on MachineLearning, Long Beach, California, PMLR 97, 2019..
Open this publication in new window or tab >>Learning and Data Selection in Big Datasets
2019 (English)In: Proceedings of the 36th International Conference on MachineLearning, Long Beach, California, PMLR 97, 2019., 2019Conference paper, Published paper (Refereed)
Abstract [en]

Finding a dataset of minimal cardinality to characterize the optimal parameters of a model is of paramount importance in machine learning and distributed optimization over a network. This paper investigates the compressibility of large datasets. More specifically, we propose a framework that jointly learns the input-output mapping as well as the most representative samples of the dataset (sufficient dataset). Our analytical results show that the cardinality of the sufficient dataset increases sub-linearly with respect to the original dataset size. Numerical evaluations of real datasets reveal a large compressibility, up to 95%, without a noticeable drop in the learnability performance, measured by the generalization error.

Keywords
machine learning, optimization, non-convex, data compression
National Category
Computer Sciences
Research subject
Applied and Computational Mathematics, Optimization and Systems Theory; Information and Communication Technology; Computer Science
Identifiers
urn:nbn:se:kth:diva-260389 (URN)
Conference
36th International Conference on MachineLearning, Long Beach, California, PMLR 97, 2019.
Funder
Swedish Research Council
Note

QC 20191008

Available from: 2019-09-29 Created: 2019-09-29 Last updated: 2019-10-08Bibliographically approved
Zhang, Y., Xiao, M., Han, S., Skoglund, M. & Meng, W. (2019). On Precoding and Energy Efficiency of Full-Duplex Millimeter-Wave Relays. IEEE Transactions on Wireless Communications, 18(3), 1943-1956
Open this publication in new window or tab >>On Precoding and Energy Efficiency of Full-Duplex Millimeter-Wave Relays
Show others...
2019 (English)In: IEEE Transactions on Wireless Communications, ISSN 1536-1276, E-ISSN 1558-2248, Vol. 18, no 3, p. 1943-1956Article in journal (Refereed) Published
Abstract [en]

With large available bandwidth, millimeter wave (mm-wave) communications have attracted considerable research interests because of their potential to achieve multi-giga bps rates. However, one of the main challenges for mm-wave is high pathloss. To address this problem, full-duplex (FD) relaying can be used to increase the effective transmission distance and the spectral efficiency. Thus, studying the application of FD relaying in mm-wave communications will be of value. However, one of the main challenges in FD mm-wave relaying is the residual self-interference (SI), which includes line-of-sight (LOS) and non-LOS parts. To eliminate the SI and improve the spectral efficiency, we propose an orthogonal matching pursuit-based SI-cancellation precoding algorithm. Then, we propose an energy consumption model and analyze the energy efficiency performance. We formulate the joint spectral efficiency and energy efficiency optimization problem, which can be transformed into a convex problem. The numerical results show that the FD precoding scheme can effectively eliminate the residual SI and achieve approximately twice the spectral efficiency of the conventional half-duplex system. We also show that in low-spectral-efficiency regions, the optimal energy efficiency can be achieved, but the achievable energy efficiency will decrease in high-spectral-efficiency regions.

Place, publisher, year, edition, pages
Institute of Electrical and Electronics Engineers (IEEE), 2019
Keywords
Millimeter wave, full-duplex, self-interference cancellation, spectral efficiency, energy efficiency
National Category
Electrical Engineering, Electronic Engineering, Information Engineering
Identifiers
urn:nbn:se:kth:diva-248083 (URN)10.1109/TWC.2019.2900038 (DOI)000461345100035 ()2-s2.0-85062981811 (Scopus ID)
Note

QC 20190430

Available from: 2019-04-30 Created: 2019-04-30 Last updated: 2019-05-22Bibliographically approved
Bassi, G. & Skoglund, M. (2019). On the Mutual Information of Two Boolean Functions, with Application to Privacy. In: Proceedings 2019 IEEE International Symposium on Information Theory (ISIT): . Paper presented at IEEE International Symposium on Information Theory (ISIT), Paris, FRANCE, JUL 07-12, 2019 (pp. 1197-1201). IEEE
Open this publication in new window or tab >>On the Mutual Information of Two Boolean Functions, with Application to Privacy
2019 (English)In: Proceedings 2019 IEEE International Symposium on Information Theory (ISIT), IEEE , 2019, p. 1197-1201Conference paper, Published paper (Refereed)
Abstract [en]

We investigate the behavior of the mutual information between two Boolean functions of correlated binary strings. The covariance of these functions is found to be a crucial parameter in the aforementioned mutual information. We then apply this result in the analysis of a specific privacy problem where a user observes a random binary string. Under particular conditions, we characterize the optimal strategy for communicating the outcomes of a function of said string while preventing to leak any information about a different function.

Place, publisher, year, edition, pages
IEEE, 2019
National Category
Computer and Information Sciences
Identifiers
urn:nbn:se:kth:diva-263383 (URN)10.1109/ISIT.2019.8849315 (DOI)000489100301058 ()2-s2.0-85073144085 (Scopus ID)9781538692912 (ISBN)
Conference
IEEE International Symposium on Information Theory (ISIT), Paris, FRANCE, JUL 07-12, 2019
Note

QC 20191114

Available from: 2019-11-14 Created: 2019-11-14 Last updated: 2019-11-14Bibliographically approved
Vu, M. T., Oechtering, T. J. & Skoglund, M. (2019). Operational Equivalence of Distributed Hypothesis Testing and Identification Systems. In: Proceedings 2019 IEEE International Symposium on Information Theory (ISIT): . Paper presented at IEEE International Symposium on Information Theory (ISIT), Paris, FRANCE, JUL 07-12, 2019 (pp. 1999-2003). IEEE
Open this publication in new window or tab >>Operational Equivalence of Distributed Hypothesis Testing and Identification Systems
2019 (English)In: Proceedings 2019 IEEE International Symposium on Information Theory (ISIT), IEEE , 2019, p. 1999-2003Conference paper, Published paper (Refereed)
Abstract [en]

In this paper we revisit the connections of the distributed hypothesis testing against independence (HT) problem with the Wyner-Ahlswede-Korner (WAK) problem and the identification systems (ID). We show that the strong converse for the WAK problem is equivalent to the strong converse for the HT problem via constructive and nonconstructive transformations of codes. As another consequence of the transformation we provide a new exponentially strong converse equivalence statement. Applying the same idea, we prove a new result that the epsilon-identification capacity of the ID problem is equal to the maximum epsilon-exponent of type II of error in the HT problem when both side compression is allowed.

Place, publisher, year, edition, pages
IEEE, 2019
National Category
Computer and Information Sciences
Identifiers
urn:nbn:se:kth:diva-263388 (URN)10.1109/ISIT.2019.8849571 (DOI)000489100302019 ()2-s2.0-85073166961 (Scopus ID)
Conference
IEEE International Symposium on Information Theory (ISIT), Paris, FRANCE, JUL 07-12, 2019
Note

QC 20191114

Available from: 2019-11-14 Created: 2019-11-14 Last updated: 2019-11-14Bibliographically approved
Stavrou, F. & Skoglund, M. (2019). Optimization and Tracking of Scalar-Valued LQG Control Under Communication Link with Synchronized or Delayed CaSI at the Decoder. KTH Royal Institute of Technology
Open this publication in new window or tab >>Optimization and Tracking of Scalar-Valued LQG Control Under Communication Link with Synchronized or Delayed CaSI at the Decoder
2019 (English)Other (Other academic)
Place, publisher, year, pages
KTH Royal Institute of Technology, 2019
National Category
Control Engineering Signal Processing Communication Systems Other Electrical Engineering, Electronic Engineering, Information Engineering
Identifiers
urn:nbn:se:kth:diva-261427 (URN)
Note

QC 20191011

Available from: 2019-10-07 Created: 2019-10-07 Last updated: 2019-10-11Bibliographically approved
Organisations
Identifiers
ORCID iD: ORCID iD iconorcid.org/0000-0002-7926-5081

Search in DiVA

Show all publications