Change search
Link to record
Permanent link

Direct link
BETA
Alternative names
Publications (10 of 460) 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
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
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
Wiese, M., Oechtering, T. J., Johansson, K. H., Papadimitratos, P., Sandberg, H. & Skoglund, M. (2019). Secure Estimation and Zero-Error Secrecy Capacity. IEEE Transactions on Automatic Control, 64(3), 1047-1062
Open this publication in new window or tab >>Secure Estimation and Zero-Error Secrecy Capacity
Show others...
2019 (English)In: IEEE Transactions on Automatic Control, ISSN 0018-9286, E-ISSN 1558-2523, Vol. 64, no 3, p. 1047-1062Article in journal (Refereed) Published
Abstract [en]

We study the problem of securely estimating the states of an unstable dynamical system subject to non-stochastic disturbances. The estimator obtains all its information through an uncertain channel, which is subject to nonstochastic disturbances as well, and an eavesdropper obtains a disturbed version of the channel inputs through a second uncertain channel. An encoder observes and block encodes the states in such a way that, upon sending the generated codeword, the estimator's error is bounded and a security criterion is satisfied, thereby ensuring that the eavesdropper obtains as little state information as possible. Two security criteria are considered and discussed with the help of a numerical example. A sufficient condition on the uncertain wiretap channel, i.e., the pair formed by the uncertain channel from the encoder to the estimator and the uncertain channel from the encoder to the eavesdropper is derived, which ensures that a bounded estimation error and security are achieved. This condition is also shown to be necessary for a subclass of uncertain wiretap channels. To formulate the condition, the zero-error secrecy capacity of uncertain wiretap channels is introduced, i.e., the maximal rate at which data can be transmitted from the encoder to the estimator in such a way that the eavesdropper is unable to reconstruct the transmitted data. Finally, the zero-error secrecy capacity of uncertain wiretap channels is studied.

Place, publisher, year, edition, pages
IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC, 2019
Keywords
Secure state estimation, uncertain wiretap channel, zero-error secrecy capacity
National Category
Computer and Information Sciences
Identifiers
urn:nbn:se:kth:diva-247828 (URN)10.1109/TAC.2018.2849620 (DOI)000460415600012 ()2-s2.0-85048871914 (Scopus ID)
Note

QC 20190326

Available from: 2019-03-26 Created: 2019-03-26 Last updated: 2019-03-26Bibliographically approved
B. da Silva Jr., J. M., Ghauch, H., Fodor, G., Skoglund, M. & Fischione, C. (2019). Smart Antenna Assignment is Essential in Full-Duplex Communications. IEEE Transactions on Communications
Open this publication in new window or tab >>Smart Antenna Assignment is Essential in Full-Duplex Communications
Show others...
2019 (English)In: IEEE Transactions on Communications, ISSN 0090-6778, E-ISSN 1558-0857Article in journal (Refereed) Submitted
Abstract [en]

Full-duplex communications have the potential to almost double the spectralefficiency. To realize such a potentiality, the signal separation at base station’s antennasplays an essential role. This paper addresses the fundamentals of such separationby proposing a new smart antenna architecture that allows every antenna to beeither shared or separated between uplink and downlink transmissions. The benefitsof such architecture are investigated by an assignment problem to optimally assignantennas, beamforming and power to maximize the weighted sum spectral efficiency.We propose a near-to-optimal solution using block coordinate descent that divides theproblem into assignment problems, which are NP-hard, a beamforming and powerallocation problems. The optimal solutions for the beamforming and power allocationare established while near-to-optimal solutions to the assignment problems are derivedby semidefinite relaxation. Numerical results indicate that the proposed solution isclose to the optimum, and it maintains a similar performance for high and low residualself-interference powers. With respect to the usually assumed antenna separationtechnique and half-duplex transmission, the sum spectral efficiency gains increase withthe number of antennas. We conclude that our proposed smart antenna assignment forsignal separation is essential to realize the benefits of multiple antenna full-duplexcommunications.

Place, publisher, year, edition, pages
IEEE, 2019
Keywords
full-duplex, semidefinite programming, beamforming, antenna splitting, antenna assignment
National Category
Telecommunications
Research subject
Electrical Engineering
Identifiers
urn:nbn:se:kth:diva-246496 (URN)
Funder
Lars Hierta Memorial Foundation, FO2017-0236
Note

QCR 20190320

Available from: 2019-03-19 Created: 2019-03-19 Last updated: 2019-05-20Bibliographically approved
Wang, Q. & Skoglund, M. (2019). Symmetric Private Information Retrieval from MDS Coded Distributed Storage With Non-Colluding and Colluding Servers. IEEE Transactions on Information Theory, 65(8), 5160-5175
Open this publication in new window or tab >>Symmetric Private Information Retrieval from MDS Coded Distributed Storage With Non-Colluding and Colluding Servers
2019 (English)In: IEEE Transactions on Information Theory, ISSN 0018-9448, E-ISSN 1557-9654, Vol. 65, no 8, p. 5160-5175Article in journal (Refereed) Published
Abstract [en]

A user wants to retrieve a file from a database without revealing the identity of the file retrieved to the operator of the database (server), which is known as the problem of private information retrieval (PIR). If it is further required that the user obtains no information about the other files in the database, the concept of symmetric PIR (SPIR) is introduced to guarantee privacy for both parties. For SPIR, the server(s) need to access some randomness independent of the database, to protect the content of undesired files from the user. The information-theoretic capacity of SPIR is defined as the maximum number of information bits of the desired file retrieved per downloaded bit. In this paper, the problem of SPIR is studied for a distributed storage system with N servers (nodes), where all data (including the files and the randomness) are stored in a distributed way. Specifically, the files are stored by an (N, K-C)-MDS storage code. The randomness is distributedly stored such that any K-C servers store independent randomness information. We consider two scenarios regarding to the ability of the storage nodes to cooperate. In the first scenario considered, the storage nodes do not communicate or collude. It is shown that the SPIR capacity for MDS-coded storage (hence called MDS-SPIR) is 1 - K-C/N, when the amount of the total randomness of distributed nodes (unavailable at the user) is at least K-C/N-K-C times the file size. Otherwise, the MDS-SPIR capacity equals zero. The second scenario considered is the T-colluding SPIR problem (hence called TSPIR). Specifically, any T out of N servers may collude, that is, they may communicate their interactions with the user to guess the identity of the requested file. In the special case with K-C = 1, i.e., the database is replicated at each node, the capacity of TSPIR is shown to be 1 - T/N, with the ratio of the total randomness size relative to the file size be at least T/N-T. For TSPIR with MDS-coded storage (called MDS-TSPIR for short), when restricted to schemes with additive randomness where the servers add the randomness to the answers regardless of the queries received, the capacity is proved to equal 1 - K-C+T-1/N, with total randomness at least K-C+T-1/N-K-C-T+1 times the file size. The MDS-TSPIR capacity for general schemes remains an open problem.

Place, publisher, year, edition, pages
Institute of Electrical and Electronics Engineers (IEEE), 2019
Keywords
Private information retrieval, capacity, colluding servers, distributed storage, MDS codes
National Category
Communication Systems
Identifiers
urn:nbn:se:kth:diva-255728 (URN)10.1109/TIT.2019.2903206 (DOI)000476740600035 ()2-s2.0-85069527144 (Scopus ID)
Note

QC 20190814

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

Search in DiVA

Show all publications