Change search
Link to record
Permanent link

Direct link
BETA
Rasmussen, Lars KildehöjORCID iD iconorcid.org/0000-0001-7182-9543
Alternative names
Publications (10 of 191) Show all publications
Li, N., Xiao, M. & Rasmussen, L. K. (2018). Optimized Cooperative Multiple Access in Industrial Cognitive Networks. IEEE Transactions on Industrial Informatics, 14(6), 2666-2676
Open this publication in new window or tab >>Optimized Cooperative Multiple Access in Industrial Cognitive Networks
2018 (English)In: IEEE Transactions on Industrial Informatics, ISSN 1551-3203, E-ISSN 1941-0050, Vol. 14, no 6, p. 2666-2676Article in journal (Refereed) Published
Abstract [en]

We consider optimized cooperation in joint orthogonal multiple access and nonorthogonal multiple access in industrial cognitive networks, in which lots of devices may have to share spectrum and some devices (e.g., those for critical control devices) have higher transmission priority, known as primary users. We consider one secondary transmitter (less important devices) as a potential relay between a primary transmitter and receiver pair. The choice of cooperation scheme differs in terms of use cases. With decode-and-forward relaying, the channel between the primary and secondary users limits the achievable rates especially when it experiences poor channel conditions. To alleviate this problem, we apply analog network coding to directly combine the received primary message for relaying with the secondary message. We find achievable rate regions for these two schemes over Rayleigh fading channels. We then investigate an optimization problem jointly considering orthogonalmultiple access and nonorthogonal multiple access, where the secondary rate is maximized under the constraint of maintaining the primary rate. We find both analytical solutions as well as solutions based on experiments through the time sharing strategy between the primary and secondary system and the transmit power allocation strategy at the secondary transmitter. We show the performance improvements of exploiting analog network coding and the impacts of cooperative schemes and user geometry on achievable rates and resource sharing strategies.

Place, publisher, year, edition, pages
IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC, 2018
Keywords
Analog network coding, industrial cooperative networks, nonorthogonal multiple access, optimization, spectrum sharing
National Category
Telecommunications
Identifiers
urn:nbn:se:kth:diva-231205 (URN)10.1109/TII.2017.2788428 (DOI)000434297100034 ()2-s2.0-85041177610 (Scopus ID)
Note

QC 20180629

Available from: 2018-06-29 Created: 2018-06-29 Last updated: 2018-06-29Bibliographically approved
Li, N., Rasmussen, L. K. & Xiao, M. (2018). Performance Analysis of Cognitive User Cooperation Using Binary Network Coding. IEEE Transactions on Vehicular Technology, 67(8), 7355-7369
Open this publication in new window or tab >>Performance Analysis of Cognitive User Cooperation Using Binary Network Coding
2018 (English)In: IEEE Transactions on Vehicular Technology, ISSN 0018-9545, E-ISSN 1939-9359, Vol. 67, no 8, p. 7355-7369Article in journal (Refereed) Published
Abstract [en]

We consider a cognitive radio network where a primary and a secondary transmitter, respectively, communicate a message to their primary and secondary receivers over a packet-based wireless link, using a joint automatic-repeat-request (ARQ) error control scheme. The secondary transmitter assists in the retransmission of the primary message, which improves the primary performance, and as a reward it is granted limited access to the transmission resources. Conventional ARQ, as well as two network-coding schemes are investigated for applications in the retransmission phase; namely the static network-coding scheme and the adaptive network-coding scheme. For each scheme we analyze the transmission process by investigating the distribution of the number of transmission attempts. We divide every frame into three transmission sessions and in each session we discover that the number of transmission attempts follows a certain negative binomial distribution, in which case can be further approximated by a normal distribution. Considering both the cases of an adaptive frame size and a truncated frame size, we derive analytical results on system performances and discuss the comparison of three schemes. Besides, the approximation method greatly reduces the complexity of transmission analysis, especially in the truncated frame-size case. Numerical results show that our analysis are valid and closely match the simulations.

Place, publisher, year, edition, pages
Institute of Electrical and Electronics Engineers (IEEE), 2018
Keywords
Cognitive radio, cooperation, network coding, performance analysis
National Category
Telecommunications
Identifiers
urn:nbn:se:kth:diva-234618 (URN)10.1109/TVT.2018.2833494 (DOI)000441788300050 ()2-s2.0-85046448645 (Scopus ID)
Note

QC 20180913

Available from: 2018-09-13 Created: 2018-09-13 Last updated: 2018-09-13Bibliographically approved
Zaki, A., Venkitaraman, A., Chatterjee, S. & Rasmussen, L. K. (2017). Distributed greedy sparse learning over doubly stochastic networks. In: 25th European Signal Processing Conference, EUSIPCO 2017: . Paper presented at 25th European Signal Processing Conference, EUSIPCO 2017, Kos International Convention CenterKos, Greece, 28 August 2017 through 2 September 2017 (pp. 361-364). Institute of Electrical and Electronics Engineers (IEEE), 2017
Open this publication in new window or tab >>Distributed greedy sparse learning over doubly stochastic networks
2017 (English)In: 25th European Signal Processing Conference, EUSIPCO 2017, Institute of Electrical and Electronics Engineers (IEEE), 2017, Vol. 2017, p. 361-364Conference paper, Published paper (Refereed)
Abstract [en]

In this paper, we develop a greedy algorithm for sparse learning over a doubly stochastic network. In the proposed algorithm, nodes of the network perform sparse learning by exchanging their individual intermediate variables. The algorithm is iterative in nature. We provide a restricted isometry property (RIP)-based theoretical guarantee both on the performance of the algorithm and the number of iterations required for convergence. Using simulations, we show that the proposed algorithm provides good performance.

Place, publisher, year, edition, pages
Institute of Electrical and Electronics Engineers (IEEE), 2017
National Category
Computer Engineering
Identifiers
urn:nbn:se:kth:diva-224301 (URN)10.23919/EUSIPCO.2017.8081229 (DOI)2-s2.0-85041494941 (Scopus ID)9780992862671 (ISBN)
Conference
25th European Signal Processing Conference, EUSIPCO 2017, Kos International Convention CenterKos, Greece, 28 August 2017 through 2 September 2017
Note

QC 20180316

Available from: 2018-03-16 Created: 2018-03-16 Last updated: 2018-03-16Bibliographically approved
Zaki, A., Venkitaraman, A., Chatterjee, S. & Rasmussen, L. K. (2017). Distributed Greedy Sparse Learning over Doubly Stochastic Networks. In: 2017 25TH EUROPEAN SIGNAL PROCESSING CONFERENCE (EUSIPCO): . Paper presented at 25th European Signal Processing Conference (EUSIPCO), AUG 28-SEP 02, 2017, GREECE (pp. 361-364). IEEE
Open this publication in new window or tab >>Distributed Greedy Sparse Learning over Doubly Stochastic Networks
2017 (English)In: 2017 25TH EUROPEAN SIGNAL PROCESSING CONFERENCE (EUSIPCO), IEEE , 2017, p. 361-364Conference paper, Published paper (Refereed)
Abstract [en]

In this paper, we develop a greedy algorithm for sparse learning over a doubly stochastic network. In the proposed algorithm, nodes of the network perform sparse learning by exchanging their individual intermediate variables. The algorithm is iterative in nature. We provide a restricted isometry property (RIP)-based theoretical guarantee both on the performance of the algorithm and the number of iterations required for convergence. Using simulations, we show that the proposed algorithm provides good performance.

Place, publisher, year, edition, pages
IEEE, 2017
Series
European Signal Processing Conference, ISSN 2076-1465
National Category
Communication Systems
Identifiers
urn:nbn:se:kth:diva-226275 (URN)000426986000073 ()2-s2.0-85041494941 (Scopus ID)978-0-9928-6267-1 (ISBN)
Conference
25th European Signal Processing Conference (EUSIPCO), AUG 28-SEP 02, 2017, GREECE
Note

QC 20180420

Available from: 2018-04-20 Created: 2018-04-20 Last updated: 2018-04-20Bibliographically approved
Zaki, A., Chatterjee, S. & Rasmussen, L. K. (2017). Generalized fusion algorithm for compressive sampling reconstruction and RIP-based analysis. Signal Processing, 139, 36-48
Open this publication in new window or tab >>Generalized fusion algorithm for compressive sampling reconstruction and RIP-based analysis
2017 (English)In: Signal Processing, ISSN 0165-1684, E-ISSN 1872-7557, Vol. 139, p. 36-48Article in journal (Refereed) Published
Abstract [en]

We design a Generalized Fusion Algorithm for Compressive Sampling (gFACS) reconstruction. In the gFACS algorithm, several individual compressive sampling (CS) reconstruction algorithms participate to achieve a better performance than the individual algorithms. The gFACS algorithm is iterative in nature and its convergence is proved under certain conditions using Restricted Isometry Property (RIP) based theoretical analysis. The theoretical analysis allows for the participation of any off-the-shelf or new CS reconstruction algorithm with simple modifications, and still guarantees convergence. We show modifications of some well-known CS reconstruction algorithms for their seamless use in the gFACS algorithm. Simulation results show that the proposed gFACS algorithm indeed provides better performance than the participating individual algorithms.

Place, publisher, year, edition, pages
ELSEVIER SCIENCE BV, 2017
Keywords
Compressive sampling, Greedy algorithm, RIP analysis, Fusion strategy
National Category
Signal Processing
Identifiers
urn:nbn:se:kth:diva-208710 (URN)10.1016/j.sigpro.2017.03.021 (DOI)000402214200004 ()2-s2.0-85017439915 (Scopus ID)
Note

QC 2017-06-12

Available from: 2017-06-12 Created: 2017-06-12 Last updated: 2017-06-15Bibliographically 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, p. 4817-4835Article 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
Keywords
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
Larsson, P., Rasmussen, L. K. & Skoglund, M. (2016). Throughput Analysis of Hybrid-ARQ -A Matrix Exponential Distribution Approach. IEEE Transactions on Communications, 64(1), 416-428
Open this publication in new window or tab >>Throughput Analysis of Hybrid-ARQ -A Matrix Exponential Distribution Approach
2016 (English)In: IEEE Transactions on Communications, ISSN 0090-6778, E-ISSN 1558-0857, Vol. 64, no 1, p. 416-428Article in journal (Refereed) Published
Abstract [en]

We propose a novel performance analysis framework for lossless- and truncated-hybrid automatic repeat request (HARQ) that enables neat, general, closed-form throughput expressions in a matrix exponential (ME) distribution form. This approach is applicable to all HARQ schemes for which the probability density function of the effective channel can be characterized by a rational Laplace transform, or equivalently, an ME-distribution. This includes, for example, repetition redundancy HARQ in ME distributed channels. Throughput expressions are also given for the K-truncated-HARQ N-fold diversity, ARQ N-fold diversity, and lossless-HARQ 2-fold diversity cases in the ME distributed channel. Schemes with effective channels of non-rational Laplace transforms, such as IR-HARQ, are explored using truncated continued fractions. A novel integration trick is developed for the integration of ME distributions with singular matrices and yields the simple throughput expression of lossless-HARQ. We also give general analytical expressions for the optimal throughput and optimal rate point that benefit from the compact ME-distribution form proposed.

Place, publisher, year, edition, pages
IEEE Press, 2016
Keywords
Hybrid-ARQ (HARQ), lossless-HARQ, truncated-HARQ, retransmission, repetition redundancy, chase combining, incremental redundancy, ARQ, throughput, matrix exponential distribution, rational Laplace transform, performance optimization
National Category
Communication Systems
Identifiers
urn:nbn:se:kth:diva-182166 (URN)10.1109/TCOMM.2015.2501294 (DOI)000368353700036 ()2-s2.0-84958149474 (Scopus ID)
Note

QC 20160218

Available from: 2016-02-18 Created: 2016-02-16 Last updated: 2017-11-30Bibliographically approved
Grosjean, L., Thobaben, R., Rasmussen, L. K. & Skoglund, M. (2016). Variable-rate anytime transmission with feedback. In: IEEE Vehicular Technology Conference: . Paper presented at 84th IEEE Vehicular Technology Conference, VTC Fall 2016, 18 September 2016 through 21 September 2016. IEEE, Article ID 7881963.
Open this publication in new window or tab >>Variable-rate anytime transmission with feedback
2016 (English)In: IEEE Vehicular Technology Conference, IEEE, 2016, article id 7881963Conference paper, Published paper (Refereed)
Abstract [en]

A generalization of the ensemble of non-terminated systematic LDPC convolutional codes developed in our previous work is proposed that allows us to design codes with lower rates than the original structure. We show that over the BEC, the modified codes have improved asymptotic and finite-length behavior and we determine the operational anytime exponent. Having shown the advantages of lowering the rate of the code, we propose a feedback protocol that permits encoder and decoder to operate at a variable rate. The rate is set on-the-fly and depends on the decoding success of the decoder. We describe the construction of the variable rate code structure and demonstrate by simulations the superiority of the variable rate scheme as compared to a scheme using a fixed rate.

Place, publisher, year, edition, pages
IEEE, 2016
Keywords
Convolutional codes, Decoding, Design codes, Feedback protocol, Finite length, LDPC convolutional codes, On the flies, Original structures, Variable rate, Variable rate codes, Codes (symbols)
National Category
Electrical Engineering, Electronic Engineering, Information Engineering
Identifiers
urn:nbn:se:kth:diva-210142 (URN)10.1109/VTCFall.2016.7881963 (DOI)000402610200441 ()2-s2.0-85016981677 (Scopus ID)9781509017010 (ISBN)
Conference
84th IEEE Vehicular Technology Conference, VTC Fall 2016, 18 September 2016 through 21 September 2016
Note

QC 20170630

Available from: 2017-06-30 Created: 2017-06-30 Last updated: 2017-06-30Bibliographically approved
Vehkapera, M., Riihonen, T., Girnyk, M., Björnson, E., Debbah, M., Kildehøj Rasmussen, L. & Wichman, R. (2015). Asymptotic analysis of asymmetric MIMO links: EVM limits for joint decoding of PSK and QAM. In: 2015 IEEE International Conference on Communications (ICC): . Paper presented at IEEE International Conference on Communications, ICC 2015, London, United Kingdom, 8 June 2015 through 12 June 2015 (pp. 1869-1873). IEEE conference proceedings, 2015
Open this publication in new window or tab >>Asymptotic analysis of asymmetric MIMO links: EVM limits for joint decoding of PSK and QAM
Show others...
2015 (English)In: 2015 IEEE International Conference on Communications (ICC), IEEE conference proceedings, 2015, Vol. 2015, p. 1869-1873Conference paper, Published paper (Refereed)
Abstract [en]

Hardware non-idealities in wireless transmitter electronics cause distortion that is not captured by conventional linear channel models; in fact, error-vector magnitude (EVM) measurements in conformance testing conceptually reduce their collective effect to an additive noise component at each subcarrier. Motivated by the EVM, the present paper considers a 'binoisy' multiple-input multiple-output (MIMO) channel model where the additional non-idealities manifest themselves as an additive distortion noise term at the transmit side. Through this extended MIMO relation, the effects of hardware impairments on the achievable rates of different digital modulation schemes are studied via large system analysis. The numerical results illustrate how tolerable EVM levels depend non-trivially on various factors, including the signal-to-noise ratio, modulation order and the level of asymmetry in antenna array configurations.

Place, publisher, year, edition, pages
IEEE conference proceedings, 2015
Series
IEEE International Conference on Communications, ISSN 1550-3607
Keywords
Statistical Physics, Capacity, Systems, CDMA
National Category
Communication Systems
Identifiers
urn:nbn:se:kth:diva-181157 (URN)10.1109/ICC.2015.7248597 (DOI)000371708102013 ()2-s2.0-84953708408 (Scopus ID)978-1-4673-6432-4 (ISBN)
Conference
IEEE International Conference on Communications, ICC 2015, London, United Kingdom, 8 June 2015 through 12 June 2015
Note

QC 20160216, QC 20160421

Available from: 2016-02-16 Created: 2016-01-29 Last updated: 2016-04-21Bibliographically approved
Vehkapera, M., Riihonen, T., Girnyk, M. A., Bjornson, E., Debbah, M., Kildehøj, L. & Wichman, R. (2015). Asymptotic Analysis of SU-MIMO Channels With Transmitter Noise and Mismatched Joint Decoding. IEEE Transactions on Communications, 63(3), 749-765
Open this publication in new window or tab >>Asymptotic Analysis of SU-MIMO Channels With Transmitter Noise and Mismatched Joint Decoding
Show others...
2015 (English)In: IEEE Transactions on Communications, ISSN 0090-6778, E-ISSN 1558-0857, Vol. 63, no 3, p. 749-765Article in journal (Refereed) Published
Abstract [en]

Hardware impairments in radio-frequency components of a wireless system cause unavoidable distortions to transmission that are not captured by the conventional linear channel model. In this paper, a "binoisy" single-user multiple-input multiple-output (SU-MIMO) relation is considered where the additional distortions are modeled via an additive noise term at the transmit side. Through this extended SU-MIMO channel model, the effects of transceiver hardware impairments on the achievable rate of multi-antenna point-to-point systems are studied. Channel input distributions encompassing practical discrete modulation schemes, such as, QAM and PSK, as well as Gaussian signaling are covered. In addition, the impact of mismatched detection and decoding when the receiver has insufficient information about the non-idealities is investigated. The numerical results show that for realistic system parameters, the effects of transmit-side noise and mismatched decoding become significant only at high modulation orders.

National Category
Telecommunications
Identifiers
urn:nbn:se:kth:diva-164468 (URN)10.1109/TCOMM.2014.2385051 (DOI)000351507600014 ()2-s2.0-84926326751 (Scopus ID)
Funder
Swedish Research Council
Note

QC 20150422

Available from: 2015-04-22 Created: 2015-04-17 Last updated: 2017-12-04Bibliographically approved
Organisations
Identifiers
ORCID iD: ORCID iD iconorcid.org/0000-0001-7182-9543

Search in DiVA

Show all publications