Change search
Link to record
Permanent link

Direct link
BETA
Alternative names
Publications (10 of 446) Show all publications
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-04-09Bibliographically 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
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-03-24
Vu, M. T., Oechtering, T. J. & Skoglund, M. (2019). Testing in identification systems. In: 2018 IEEE Information Theory Workshop, ITW 2018: . Paper presented at 2018 IEEE Information Theory Workshop, ITW 2018, 25 November 2018 through 29 November 2018. Institute of Electrical and Electronics Engineers Inc.
Open this publication in new window or tab >>Testing in identification systems
2019 (English)In: 2018 IEEE Information Theory Workshop, ITW 2018, Institute of Electrical and Electronics Engineers Inc. , 2019Conference paper, Published paper (Refereed)
Abstract [en]

We study a hypothesis testing problem to decide whether or not an observation sequence is related to one of users in a database which contains compressed versions of users' data. Our main interest lies on the characterization of the exponent of the probability of the second kind of error when the number of users in the database grows exponentially. We show a lower bound on the error exponent and identify special cases where the bound is tight. Next, we study the -achievable error exponent and show a sub-region where the lower bound is tight.

Place, publisher, year, edition, pages
Institute of Electrical and Electronics Engineers Inc., 2019
Keywords
Information-spectrum method, Mixture distribution, Strong converse, Errors, Error exponent, Hypothesis testing, Information spectrum, Lower bounds, Mixture distributions, Second kinds, Sub-regions, Information theory
National Category
Electrical Engineering, Electronic Engineering, Information Engineering
Identifiers
urn:nbn:se:kth:diva-248277 (URN)10.1109/ITW.2018.8613310 (DOI)2-s2.0-85062066143 (Scopus ID)9781538635995 (ISBN)
Conference
2018 IEEE Information Theory Workshop, ITW 2018, 25 November 2018 through 29 November 2018
Note

QC 20190405

Available from: 2019-04-05 Created: 2019-04-05 Last updated: 2019-04-05Bibliographically approved
Wang, Q., Sun, H. & Skoglund, M. (2019). The -error capacity of symmetric PIR with byzantine adversaries. In: 2018 IEEE Information Theory Workshop, ITW 2018: . Paper presented at 2018 IEEE Information Theory Workshop, ITW 2018, 25 November 2018 through 29 November 2018. Institute of Electrical and Electronics Engineers Inc.
Open this publication in new window or tab >>The -error capacity of symmetric PIR with byzantine adversaries
2019 (English)In: 2018 IEEE Information Theory Workshop, ITW 2018, Institute of Electrical and Electronics Engineers Inc. , 2019Conference paper, Published paper (Refereed)
Abstract [en]

The capacity of symmetric private information retrieval with K messages, N servers (out of which any T may collude), and an omniscient Byzantine adversary (who can corrupt any B answers) is shown to be 1 − T +2 B N [1], under the requirement of zero probability of error. In this work, we show that by weakening the adversary slightly (either providing secret low rate channels between the servers and the user, or limiting the observation of the adversary), and allowing vanishing probability of error, the capacity increases to 1 − T + B N

Place, publisher, year, edition, pages
Institute of Electrical and Electronics Engineers Inc., 2019
Keywords
Information theory, Capacity increase, Error capacity, Low rates, Private information retrieval, Probability of errors, Errors
National Category
Electrical Engineering, Electronic Engineering, Information Engineering
Identifiers
urn:nbn:se:kth:diva-248276 (URN)10.1109/ITW.2018.8613332 (DOI)2-s2.0-85062090056 (Scopus ID)9781538635995 (ISBN)
Conference
2018 IEEE Information Theory Workshop, ITW 2018, 25 November 2018 through 29 November 2018
Note

QC 20190408

Available from: 2019-04-08 Created: 2019-04-08 Last updated: 2019-04-08Bibliographically approved
Stavrou, P. A., Charalambous, T., Charalambous, C. D., Loyka, S. & Skoglund, M. (2018). Asymptotic Reverse-Waterfilling Characterization of Nonanticipative Rate Distortion Function of Vector-Valued Gauss-Markov Processes with MSE Distortion. In: 2018 IEEE Conference on Decision and Control (CDC): . Paper presented at 57th IEEE Conference on Decision and Control, CDC 2018; Centre of the Fontainebleau in Miami Beach Miami; United States; 17 December 2018 through 19 December 2018 (pp. 14-20). Institute of Electrical and Electronics Engineers (IEEE), Article ID 8619725.
Open this publication in new window or tab >>Asymptotic Reverse-Waterfilling Characterization of Nonanticipative Rate Distortion Function of Vector-Valued Gauss-Markov Processes with MSE Distortion
Show others...
2018 (English)In: 2018 IEEE Conference on Decision and Control (CDC), Institute of Electrical and Electronics Engineers (IEEE), 2018, p. 14-20, article id 8619725Conference paper, Published paper (Refereed)
Abstract [en]

We analyze the asymptotic nonanticipative rate distortion function (NRDF) of vector-valued Gauss-Markov processes subject to a mean-squared error (MSE) distortion function. We derive a parametric characterization in terms of a reverse-waterfilling algorithm, that requires the solution of a matrix Riccati algebraic equation (RAE). Further, we develop an algorithm reminiscent of the classical reverse-waterfilling algorithm that provides an upper bound to the optimal solution of the reverse-waterfilling optimization problem, and under certain cases, it operates at the NRDF. Moreover, using the characterization of the reverse-waterfilling algorithm, we derive the analytical solution of the NRDF, for a simple two-dimensional parallel Gauss-Markov process. The efficacy of our proposed algorithm is demonstrated via an example.

Place, publisher, year, edition, pages
Institute of Electrical and Electronics Engineers (IEEE), 2018
Series
IEEE Conference on Decision and Control, ISSN 0743-1546
National Category
Control Engineering
Identifiers
urn:nbn:se:kth:diva-245099 (URN)10.1109/CDC.2018.8619725 (DOI)000458114800002 ()2-s2.0-85062186156 (Scopus ID)978-1-5386-1395-5 (ISBN)
Conference
57th IEEE Conference on Decision and Control, CDC 2018; Centre of the Fontainebleau in Miami Beach Miami; United States; 17 December 2018 through 19 December 2018
Note

QC 20190308

Available from: 2019-03-08 Created: 2019-03-08 Last updated: 2019-03-08Bibliographically approved
Schiessl, S., Al-Zubaidy, H., Skoglund, M. & Gross, J. (2018). Delay Performance of Wireless Communications With Imperfect CSI and Finite-Length Coding. IEEE Transactions on Communications, 66(12), 6527-6541
Open this publication in new window or tab >>Delay Performance of Wireless Communications With Imperfect CSI and Finite-Length Coding
2018 (English)In: IEEE Transactions on Communications, ISSN 0090-6778, E-ISSN 1558-0857, Vol. 66, no 12, p. 6527-6541Article in journal (Refereed) Published
Abstract [en]

With the rise of critical machine-to-machine applications, next generation wireless communication systems must meet challenging requirements with respect to latency and reliability. A key question in this context relates to channel state estimation, which allows the transmitter to adapt the code rate to the channel state. In this paper, we characterize the tradeoff between the training sequence length and data codeword length: shorter channel estimation leaves more time for the payload transmission but reduces the estimation accuracy and causes more decoding errors. Using lower coding rates can mitigate this effect, but may result in a higher backlog of data at the transmitter. In order to optimize the training sequence length and the rate adaptation scheme with respect to the delay performance, we employ queuing analysis on top of accurate models of the physical layer. We obtain an analytically tractable solution to the problem by deriving a closed-form approximation for the decoding error probability due to imperfect channel knowledge and finite-blocklength channel coding. The optimized training sequence length and rate adaptation strategy can reduce the delay violation probability by an order of magnitude, compared with suboptimal strategies that do not consider the delay constraints.

Place, publisher, year, edition, pages
IEEE, 2018
Keywords
Finite blocklength regime, imperfect CSI, rate adaptation, quasi-static fading, queuing analysis
National Category
Electrical Engineering, Electronic Engineering, Information Engineering
Identifiers
urn:nbn:se:kth:diva-241008 (URN)10.1109/TCOMM.2018.2860000 (DOI)000454112200051 ()2-s2.0-85050718946 (Scopus ID)
Note

QC 20190109

Available from: 2019-01-09 Created: 2019-01-09 Last updated: 2019-01-09Bibliographically approved
Liang, X., Javid, A. M., Skoglund, M. & Chatterjee, S. (2018). DISTRIBUTED LARGE NEURAL NETWORK WITH CENTRALIZED EQUIVALENCE. In: 2018 IEEE INTERNATIONAL CONFERENCE ON ACOUSTICS, SPEECH AND SIGNAL PROCESSING (ICASSP): . Paper presented at 2018 IEEE INTERNATIONAL CONFERENCE ON ACOUSTICS, SPEECH AND SIGNAL PROCESSING (ICASSP) (pp. 2976-2980). IEEE
Open this publication in new window or tab >>DISTRIBUTED LARGE NEURAL NETWORK WITH CENTRALIZED EQUIVALENCE
2018 (English)In: 2018 IEEE INTERNATIONAL CONFERENCE ON ACOUSTICS, SPEECH AND SIGNAL PROCESSING (ICASSP), IEEE, 2018, p. 2976-2980Conference paper, Published paper (Refereed)
Abstract [en]

In this article, we develop a distributed algorithm for learning a large neural network that is deep and wide. We consider a scenario where the training dataset is not available in a single processing node, but distributed among several nodes. We show that a recently proposed large neural network architecture called progressive learning network (PLN) can be trained in a distributed setup with centralized equivalence. That means we would get the same result if the data be available in a single node. Using a distributed convex optimization method called alternating-direction-method-of-multipliers (ADMM), we perform training of PLN in the distributed setup.

Place, publisher, year, edition, pages
IEEE, 2018
Keywords
Distributed learning, neural networks, data parallelism, convex optimization
National Category
Communication Systems
Identifiers
urn:nbn:se:kth:diva-237152 (URN)10.1109/ICASSP.2018.8462179 (DOI)000446384603029 ()2-s2.0-85054237028 (Scopus ID)
Conference
2018 IEEE INTERNATIONAL CONFERENCE ON ACOUSTICS, SPEECH AND SIGNAL PROCESSING (ICASSP)
Note

QC 20181025

Available from: 2018-10-25 Created: 2018-10-25 Last updated: 2018-10-25Bibliographically approved
Vu, M. T., Oechtering, T. J. & Skoglund, M. (2018). Gaussian hierarchical identification with pre-processing. In: Data Compression Conference Proceedings: . Paper presented at 2018 Data Compression Conference, DCC 2018, 27 March 2018 through 30 March 2018 (pp. 277-286). Institute of Electrical and Electronics Engineers Inc.
Open this publication in new window or tab >>Gaussian hierarchical identification with pre-processing
2018 (English)In: Data Compression Conference Proceedings, Institute of Electrical and Electronics Engineers Inc. , 2018, p. 277-286Conference paper, Published paper (Refereed)
Abstract [en]

In this work we consider a two-stage identification problem with pre-processing where the users' data and observation are Gaussian distributed. In the first stage the processing unit returns a list of compatible users using the information from the first storage layer and the pre-processed observation. Then, the refined search is performed in the second stage where the processing unit returns the exact user's identity and a corresponding reconstruction sequence. We provide a complete rate-distortion trade-off for the Gaussian setting.

Place, publisher, year, edition, pages
Institute of Electrical and Electronics Engineers Inc., 2018
Keywords
Compression, Identification system, Compaction, Digital storage, Economic and social effects, Electric distortion, Gaussian distribution, Image coding, Signal distortion, Gaussian distributed, Gaussian setting, Hierarchical identification, Pre-processing, Processing units, Rate distortion trade-off, Storage layers, Two-stage identification, Data compression
National Category
Computer and Information Sciences
Identifiers
urn:nbn:se:kth:diva-238076 (URN)10.1109/DCC.2018.00036 (DOI)2-s2.0-85050965248 (Scopus ID)9781538648834 (ISBN)
Conference
2018 Data Compression Conference, DCC 2018, 27 March 2018 through 30 March 2018
Note

Conference code: 138136; Export Date: 30 October 2018; Conference Paper; CODEN: DDCCF

QC 20190114

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

Search in DiVA

Show all publications