Change search
Link to record
Permanent link

Direct link
BETA
Alternative names
Publications (10 of 418) Show all publications
Do, H. T., Oechtering, T. J., Skoglund, M. & Vu, M. (2017). Interfering Relay Channels. Entropy, 19(9), Article ID 441.
Open this publication in new window or tab >>Interfering Relay Channels
2017 (English)In: Entropy, ISSN 1099-4300, E-ISSN 1099-4300, Vol. 19, no 9, 441Article in journal (Refereed) Published
Abstract [en]

This paper introduces and studies a model in which two relay channels interfere with each other. Motivated by practical scenarios in heterogeneous wireless access networks, each relay is assumed to be connected to its intended receiver through a digital link with finite capacity. Inner and outer bounds for achievable rates are derived and shown to be tight for new discrete memoryless classes, which generalize and unify several known cases involving interference and relay channels. Capacity region and sum capacity for multiple Gaussian scenarios are also characterized to within a constant gap. The results show the optimality or near-optimality of the quantize-bin-and-forward coding scheme for practically relevant relay-interference networks, which brings important engineering insight into the design of wireless communications systems.

Place, publisher, year, edition, pages
MDPI AG, 2017
Keyword
interference channel, relay channel, interference channel with two relays, interference relay channel, deterministic relay channel, quantize-forward, quantize-bin-and-forward, hash-forward, interference management
National Category
Electrical Engineering, Electronic Engineering, Information Engineering
Identifiers
urn:nbn:se:kth:diva-215829 (URN)10.3390/e19090441 (DOI)000411527100013 ()2-s2.0-85029153177 (Scopus ID)
Note

QC 20171017

Available from: 2017-10-17 Created: 2017-10-17 Last updated: 2017-11-29Bibliographically approved
Do, T. T., Ngo, H. Q., Duong, T. Q., Oechtering, T. & Skoglund, M. (2017). Massive MIMO Pilot Retransmission Strategies for Robustification Against Jamming. IEEE Wireless Communications Letters, 6(1), 58-61.
Open this publication in new window or tab >>Massive MIMO Pilot Retransmission Strategies for Robustification Against Jamming
Show others...
2017 (English)In: IEEE Wireless Communications Letters, ISSN 2162-2337, E-ISSN 2162-2345, Vol. 6, no 1, 58-61 p.Article in journal (Refereed) Published
Abstract [en]

This letter proposes anti-jamming strategies based on pilot retransmission for a single user uplink massive MIMO under jamming attack. A jammer is assumed to attack the system both in the training and data transmission phases. We first derive an achievable rate which enables us to analyze the effect of jamming attacks on the system performance. Counter-attack strategies are then proposed to mitigate this effect under two different scenarios: random and deterministic jamming attacks. Numerical results illustrate our analysis and benefit of the proposed schemes.

Place, publisher, year, edition, pages
IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC, 2017
Keyword
Massive MIMO, jamming, pilot retransmission
National Category
Electrical Engineering, Electronic Engineering, Information Engineering
Identifiers
urn:nbn:se:kth:diva-205139 (URN)10.1109/LWC.2016.2631163 (DOI)000395868700015 ()2-s2.0-85013651383 (Scopus ID)
Note

QC 20170412

Available from: 2017-04-12 Created: 2017-04-12 Last updated: 2017-11-29Bibliographically approved
Huang, S. & Skoglund, M. (2017). On linear coding over finite rings and applications to computing. Entropy, 19(5), Article ID 233.
Open this publication in new window or tab >>On linear coding over finite rings and applications to computing
2017 (English)In: Entropy, ISSN 1099-4300, E-ISSN 1099-4300, Vol. 19, no 5, 233Article in journal (Refereed) Published
Abstract [en]

This paper presents a coding theorem for linear coding over finite rings, in the setting of the Slepian-Wolf source coding problem. This theorem covers corresponding achievability theorems of Elias (IRE Conv. Rec. 1955, 3, 37-46) and Csiszár (IEEE Trans. Inf. Theory 1982, 28, 585-592) for linear coding over finite fields as special cases. In addition, it is shown that, for any set of finite correlated discrete memoryless sources, there always exists a sequence of linear encoders over some finite non-field rings which achieves the data compression limit, the Slepian-Wolf region. Hence, the optimality problem regarding linear coding over finite non-field rings for data compression is closed with positive confirmation with respect to existence. For application, we address the problem of source coding for computing, where the decoder is interested in recovering a discrete function of the data generated and independently encoded by several correlated i.i.d. random sources. We propose linear coding over finite rings as an alternative solution to this problem. Results in Körner-Marton (IEEE Trans. Inf. Theory 1979, 25, 219-221) and Ahlswede-Han (IEEE Trans. Inf. Theory 1983, 29, 396-411, Theorem 10) are generalized to cases for encoding (pseudo) nomographic functions (over rings). Since a discrete function with a finite domain always admits a nomographic presentation, we conclude that both generalizations universally apply for encoding all discrete functions of finite domains. Based on these, we demonstrate that linear coding over finite rings strictly outperforms its field counterpart in terms of achieving better coding rates and reducing the required alphabet sizes of the encoders for encoding infinitely many discrete functions.

Place, publisher, year, edition, pages
MDPI AG, 2017
Keyword
Field, Linear coding, Ring, Source coding, Source coding for computing
National Category
Physical Sciences
Identifiers
urn:nbn:se:kth:diva-216497 (URN)10.3390/e19050233 (DOI)000404453700050 ()2-s2.0-85024833883 (Scopus ID)
Note

QC 20171201

Available from: 2017-12-01 Created: 2017-12-01 Last updated: 2017-12-01Bibliographically approved
Ghauch, H., Kim, T., Bengtsson, M. & Skoglund, M. (2017). Sum-Rate Maximization in Sub-28-GHz Millimeter-Wave MIMO Interfering Networks. IEEE Journal on Selected Areas in Communications, 35(7), 1649-1662.
Open this publication in new window or tab >>Sum-Rate Maximization in Sub-28-GHz Millimeter-Wave MIMO Interfering Networks
2017 (English)In: IEEE Journal on Selected Areas in Communications, ISSN 0733-8716, E-ISSN 1558-0008, Vol. 35, no 7, 1649-1662 p.Article in journal (Refereed) Published
Abstract [en]

MIMO systems in the lower part of the millimetre-wave (mmWave) spectrum band (i.e., below 28 GHz) do not exhibit enough directivity and selectively, as compared to their counterparts in higher bands of the spectrum (i.e., above 60 GHz), and thus still suffer from the detrimental effect of interference, on the system sum rate. As such systems exhibit large numbers of antennas and short coherence times for the channel, traditional methods of distributed coordination are ill-suited, and the resulting communication overhead would offset the gains of coordination. In this paper, we propose algorithms for tackling the sum-rate maximization problem that are designed to address the above-mentioned limitations. We derive a lower bound on the sum rate, a so-called difference of log and trace (DLT) bound, shed light on its tightness, and highlight its decoupled nature at both the transmitters and receivers. Moreover, we derive the solution to each of the subproblems that we dub non-homogeneous waterfilling (a variation on the MIMO waterfilling solution), and underline an inherent desirable feature: its ability to turn-OFF streams exhibiting low SINR, and contribute to greatly speeding up the convergence of the proposed algorithm. We then show the convergence of the resulting algorithm, max-DLT, to a stationary point of the DLT bound. Finally, we rely on extensive simulations of various network configurations, to establish the fast-converging nature of our proposed schemes, and thus their suitability for addressing the short coherence interval, as well as the increased system dimensions, arising when managing interference in lower bands of the mmWave spectrum. Moreover, our results suggest that interference management still brings about significant performance gains, especially in dense deployments.

Place, publisher, year, edition, pages
IEEE, 2017
Keyword
Sub-28 GHz millimeter-wave, interference management, fast-converging algorithms, distributed optimization, difference of log and trace (DLT), non-homogeneous waterfilling, max-DLT, alternating iterative maximal separation (AIMS)
National Category
Electrical Engineering, Electronic Engineering, Information Engineering
Identifiers
urn:nbn:se:kth:diva-210997 (URN)10.1109/JSAC.2017.2698779 (DOI)000404242600018 ()2-s2.0-85021337121 (Scopus ID)
Note

QC 20170807

Available from: 2017-08-07 Created: 2017-08-07 Last updated: 2017-08-07Bibliographically approved
Gerami, M., Xiao, M. & Skoglund, M. (2017). Two-Layer Coding in Distributed Storage Systems With Partial Node Failure/Repair. IEEE Communications Letters, 21(4), 726-729.
Open this publication in new window or tab >>Two-Layer Coding in Distributed Storage Systems With Partial Node Failure/Repair
2017 (English)In: IEEE Communications Letters, ISSN 1089-7798, E-ISSN 1558-2558, Vol. 21, no 4, 726-729 p.Article in journal (Refereed) Published
Abstract [en]

We a distributed storage system where parts of the stored packets in storage nodes are subject to being lost. In a process, termed as the partial repair, the lost packets in a faulty node are recovered by the transmitted packets from other storage nodes and the available packets in the faulty node. To improve reliability of the stored data, and reduce the transmission costs, we propose a scheme that implements two-layer coding for storing files in the system. We study the minimum possible partial-repair bandwidth, and the codes that achieve the optimal bound.

Place, publisher, year, edition, pages
IEEE, 2017
Keyword
Network coding, Data storage systems, Optimization
National Category
Electrical Engineering, Electronic Engineering, Information Engineering
Identifiers
urn:nbn:se:kth:diva-208260 (URN)10.1109/LCOMM.2016.2646678 (DOI)000399388400010 ()2-s2.0-85018173583 (Scopus ID)
Note

QC 20170622

Available from: 2017-06-22 Created: 2017-06-22 Last updated: 2017-06-22Bibliographically approved
Do, T. T., Oechtering, T. J., Kim, S. M., Skoglund, M. & Peters, G. (2017). Uplink Waveform Channel With Imperfect Channel State Information and Finite Constellation Input. IEEE Transactions on Wireless Communications, 16(2), 1107-1119.
Open this publication in new window or tab >>Uplink Waveform Channel With Imperfect Channel State Information and Finite Constellation Input
Show others...
2017 (English)In: IEEE Transactions on Wireless Communications, ISSN 1536-1276, E-ISSN 1558-2248, Vol. 16, no 2, 1107-1119 p.Article in journal (Refereed) Published
Abstract [en]

This paper investigates the capacity limit of an uplink waveform channel assuming imperfect channel state information at the receiver (CSIR). Various realistic assumptions are incorporated into the problem, which make the study valuable for performance assessment of real cellular networks to identify potentials for performance improvements in practical receiver designs. We assume that the continuous-time received signal is first discretized by mismatched filtering based on the imperfect CSIR. The resulting discrete-time signals are then decoded considering two different decoding strategies, i.e., an optimal decoding strategy based on specific statistics of channel estimation errors and a sub-optimal decoding strategy treating the estimation error signal as additive Gaussian noise. Motivated by the proposed decoding strategies, we study the performance of the decision feedback equalizer for finite constellation inputs, in which inter-stream interferences are treated either using their true statistics or as Gaussian noise. Numerical results are provided to exemplify the benefit of exploiting the knowledge on the statistics of the channel estimation errors and inter-stream interferences. Simulations also assess the effect of the CSI imperfectness on the achievable rate, which reveal that finite constellation inputs are less sensitive to the estimation accuracy than Gaussian input, especially in the high SNR regime.

Place, publisher, year, edition, pages
IEEE Press, 2017
Keyword
Finite constellation input, imperfect CSI, mismatched filtering, uplink waveform channel
National Category
Electrical Engineering, Electronic Engineering, Information Engineering
Identifiers
urn:nbn:se:kth:diva-204102 (URN)10.1109/TWC.2016.2638420 (DOI)000395825200034 ()2-s2.0-85014906082 (Scopus ID)
Note

QC 20170329

Available from: 2017-03-29 Created: 2017-03-29 Last updated: 2017-11-29Bibliographically approved
Rezaei, F., Khalaj, B. H., Xiao, M. & Skoglund, M. (2016). Delay and Stability Analysis of Caching in Heterogeneous Cellular Networks. In: 2016 23RD INTERNATIONAL CONFERENCE ON TELECOMMUNICATIONS (ICT): . Paper presented at 23rd International Conference on Telecommunications (ICT), MAY 16-18, 2016, Thessaloniki, GREECE. IEEE.
Open this publication in new window or tab >>Delay and Stability Analysis of Caching in Heterogeneous Cellular Networks
2016 (English)In: 2016 23RD INTERNATIONAL CONFERENCE ON TELECOMMUNICATIONS (ICT), IEEE, 2016Conference paper, Published paper (Refereed)
Abstract [en]

In this paper, we propose a general delay and stability performance analysis in Heterogeneous Cellular Caching Networks (HCCNs), based on queuing theory. We introduce new performance metrics in HCCNs and propose an optimization problem which minimizes the average experienced delay for users by ensuring the stability of the network. In addition, from the design perspective, we address the problem of finding the minimum cache size for the small cell base stations (SBSs) for having a tolerable average delay and also a stable network. Finally, the analytic expressions derived in this paper are validated through real trace-driven experiments on traffic of YouTube video requests.

Place, publisher, year, edition, pages
IEEE, 2016
Keyword
caching, delay, heterogeneous cellular networks, performance analysis, stability
National Category
Telecommunications
Identifiers
urn:nbn:se:kth:diva-197018 (URN)10.1109/ICT.2016.7500347 (DOI)000386851600005 ()2-s2.0-84979240029 (Scopus ID)978-1-5090-1990-8 (ISBN)
Conference
23rd International Conference on Telecommunications (ICT), MAY 16-18, 2016, Thessaloniki, GREECE
Note

QC 20161209

Available from: 2016-12-09 Created: 2016-11-28 Last updated: 2016-12-09Bibliographically approved
Sundman, D., Chatterjee, S. & Skoglund, M. (2016). Design and Analysis of a Greedy Pursuit for Distributed Compressed Sensing. IEEE Transactions on Signal Processing, 64(11), 2803-2818.
Open this publication in new window or tab >>Design and Analysis of a Greedy Pursuit for Distributed Compressed Sensing
2016 (English)In: IEEE Transactions on Signal Processing, ISSN 1053-587X, E-ISSN 1941-0476, Vol. 64, no 11, 2803-2818 p.Article in journal (Refereed) Published
Abstract [en]

We consider a distributed compressed sensing scenario where many sensors measure correlated sparse signals and the sensors are connected through a network. Correlation between sparse signals is modeled by a partial common support-set. For such a scenario, the main objective of this paper is to develop a greedy pursuit algorithm. We develop a distributed parallel pursuit (DIPP) algorithm based on exchange of information about estimated support-sets at sensors. The exchange of information helps to improve estimation of the partial common support-set, that in turn helps to gradually improve estimation of support-sets in all sensors, leading to a better quality reconstruction performance. We provide restricted isometry property (RIP) based theoretical analysis on the algorithm's convergence and reconstruction performance. Under certain theoretical requirements (i.e., under certain assumptions) on the quality of information exchange over the network and RIP parameters of sensor nodes, we show that the DIPP algorithm converges to a performance level that depends on a scaled additive measurement noise power (convergence in theory) where the scaling coefficient is a function of RIP parameters and information processing quality parameters. Using simulations, we show practical reconstruction performance of DIPP vis-a-vis amount of undersampling, signal-to-measurement-noise ratios and network-connectivity conditions.

Place, publisher, year, edition, pages
Institute of Electrical and Electronics Engineers (IEEE), 2016
Keyword
Compressed sensing, restricted isometry property, distributed estimation
National Category
Communication Systems
Identifiers
urn:nbn:se:kth:diva-187771 (URN)10.1109/TSP.2016.2523462 (DOI)000374993300006 ()2-s2.0-84969261390 (Scopus ID)
Note

QC 20160530

Available from: 2016-05-30 Created: 2016-05-30 Last updated: 2017-11-30Bibliographically approved
Larsson, P., Gross, J., Al-Zubaidy, H., Rasmussen, L. K. & Skoglund, M. (2016). Effective Capacity of Retransmission Schemes: A Recurrence Relation Approach. IEEE Transactions on Communications, 64(11), 4817-4835.
Open this publication in new window or tab >>Effective Capacity of Retransmission Schemes: A Recurrence Relation Approach
Show others...
2016 (English)In: IEEE Transactions on Communications, ISSN 0090-6778, E-ISSN 1558-0857, Vol. 64, no 11, 4817-4835 p.Article in journal (Refereed) Published
Abstract [en]

We consider the effective capacity performance measure of persistent-and truncated-retransmission schemes that can involve any combination of multiple transmissions per packet, multiple communication modes, or multiple packet communication. We present a structured unified analytical approach, based on a random walk model and recurrence relation formulation, and give exact effective capacity expressions for persistent hybrid automatic repeat request (HARQ) and for truncated-retransmission schemes. For the latter, effective capacity expressions are given for systems with finite (infinite) time horizon on an algebraic (spectral radius-based) form of a special block companion matrix. In contrast to prior HARQ models, assuming infinite time horizon, the proposed method does not involve a non-trivial per case modeling step. We give effective capacity expressions for several important cases that have not been addressed before, e.g., persistent-HARQ, truncated-HARQ, network-coded ARQ, two-mode-ARQ, and multilayer-ARQ. We propose an alternative quality-of-service-parameter (instead of the commonly used moment generating function parameter) that represents explicitly the target delay and the delay violation probability. This also enables the closed-form expressions for many of the studied systems. Moreover, we use the recently proposed matrix-exponential distributed modeling of wireless fading channels to provide the basis for numerous new effective capacity results for HARQ.

Place, publisher, year, edition, pages
IEEE, 2016
Keyword
Recurrence relation, retransmission, automatic repeat request, hybrid-ARQ, repetition redundancy, network coding, multilayer-ARQ, effective capacity, throughput, matrix exponential distribution, random walk
National Category
Telecommunications
Identifiers
urn:nbn:se:kth:diva-199563 (URN)10.1109/TCOMM.2016.2602864 (DOI)000388873800028 ()2-s2.0-84999748064 (Scopus ID)
Note

QC 20170113

Available from: 2017-01-13 Created: 2017-01-09 Last updated: 2017-11-29Bibliographically approved
Qi, N., Xiao, M., Tsiftsis, T. A., Skoglund, M., Cao, P. & Li, L. (2016). Energy-Efficient Cooperative Network Coding With Joint Relay Scheduling and Power Allocation. IEEE Transactions on Communications, 64(11), 4506-4519.
Open this publication in new window or tab >>Energy-Efficient Cooperative Network Coding With Joint Relay Scheduling and Power Allocation
Show others...
2016 (English)In: IEEE Transactions on Communications, ISSN 0090-6778, E-ISSN 1558-0857, Vol. 64, no 11, 4506-4519 p.Article in journal (Refereed) Published
Abstract [en]

The energy efficiency (EE) of a multi-user multi-relay system with the maximum diversity network coding (MDNC) is studied. We explicitly find the connection among the outage probability, energy consumption, and EE, and formulate the maximizing EE problem under the outage probability constraint. Relay scheduling (RS) and power allocation (PA) are applied to schedule the relay states (transmitting, sleeping, and so on) and optimize the transmitting power under the practical channel and power consumption models. Since the optimization problem is NP hard, to reduce computational complexity, the outage probability is first tightly approximated to a log-convex form. Furthermore, the EE is converted into a subtractive form based on the fractional programming. Then, a convex mixed-integer nonlinear problem is eventually obtained. With a generalized outer approximation algorithm, RS and PA are solved in an iterative manner. The Pareto-optimal curves between the EE and the target outage probability show the EE gains from PA and RS. Moreover, by comparing with the no network coding (NoNC) scenario, we conclude that with the same number of relays, MDNC can lead to EE gains. However, if RS is implemented, NoNC can outperform MDNC in terms of the EE when more relays are needed in the MDNC scheme.

Place, publisher, year, edition, pages
IEEE, 2016
Keyword
Energy efficiency-outage probability tradeoff, network coding, relay scheduling, power allocation, generalized outer approximation (GOA)
National Category
Telecommunications
Identifiers
urn:nbn:se:kth:diva-199561 (URN)10.1109/TCOMM.2016.2602830 (DOI)000388873800006 ()2-s2.0-84999740124 (Scopus ID)
Note

QC 20170113

Available from: 2017-01-13 Created: 2017-01-09 Last updated: 2017-11-29Bibliographically approved
Organisations
Identifiers
ORCID iD: ORCID iD iconorcid.org/0000-0002-7926-5081

Search in DiVA

Show all publications