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 195) Show all publications
Zaki, A., Mitra, P. P., Rasmussen, L. K. & Chatterjee, S. (2019). Estimate exchange over network is good for distributed hard thresholding pursuit. Signal Processing, 156, 1-11
Open this publication in new window or tab >>Estimate exchange over network is good for distributed hard thresholding pursuit
2019 (English)In: Signal Processing, ISSN 0165-1684, E-ISSN 1872-7557, Vol. 156, p. 1-11Article in journal (Refereed) Published
Abstract [en]

We investigate an existing distributed algorithm for learning sparse signals or data over networks. The algorithm is iterative and exchanges intermediate estimates of a sparse signal over a network. This learning strategy using exchange of intermediate estimates over the network requires a limited communication overhead for information transmission. Our objective in this article is to show that the strategy is good for learning in spite of limited communication. In pursuit of this objective, we first provide a restricted isometry property (RIP)-based theoretical analysis on convergence of the iterative algorithm. Then, using simulations, we show that the algorithm provides competitive performance in learning sparse signals vis-a-vis an existing alternate distributed algorithm. The alternate distributed algorithm exchanges more information including observations and system parameters.

Place, publisher, year, edition, pages
Elsevier, 2019
Keywords
Sparse learning, Distributed algorithm, Greedy pursuit algorithm, RIP analysis
National Category
Signal Processing
Identifiers
urn:nbn:se:kth:diva-240686 (URN)10.1016/j.sigpro.2018.10.010 (DOI)000453494200001 ()2-s2.0-85055577903 (Scopus ID)
Note

QC 20190110

Available from: 2019-01-10 Created: 2019-01-10 Last updated: 2019-01-10Bibliographically approved
Zaki, A., Mitra, P. P., Rasmussen, L. K. & Chatterjee, S. (2019). Estimate exchange over network is good for distributed hard thresholding pursuit. Signal Processing, 156, 1-11
Open this publication in new window or tab >>Estimate exchange over network is good for distributed hard thresholding pursuit
2019 (English)In: Signal Processing, ISSN 0165-1684, E-ISSN 1872-7557, Vol. 156, p. 1-11Article in journal (Refereed) Published
Abstract [en]

We investigate an existing distributed algorithm for learning sparse signals or data over networks. The algorithm is iterative and exchanges intermediate estimates of a sparse signal over a network. This learning strategy using exchange of intermediate estimates over the network requires a limited communication overhead for information transmission. Our objective in this article is to show that the strategy is good for learning in spite of limited communication. In pursuit of this objective, we first provide a restricted isometry property (RIP)-based theoretical analysis on convergence of the iterative algorithm. Then, using simulations, we show that the algorithm provides competitive performance in learning sparse signals vis-a-vis an existing alternate distributed algorithm. The alternate distributed algorithm exchanges more information including observations and system parameters.

Place, publisher, year, edition, pages
Elsevier, 2019
Keywords
Sparse learning, Distributed algorithm, Greedy pursuit algorithm, RIP analysis
National Category
Electrical Engineering, Electronic Engineering, Information Engineering
Identifiers
urn:nbn:se:kth:diva-240987 (URN)10.1016/j.sigpro.2018.10.010 (DOI)000453494200001 ()2-s2.0-85055577903 (Scopus ID)
Note

QC 20190110

Available from: 2019-01-10 Created: 2019-01-10 Last updated: 2019-01-10Bibliographically approved
Ciftci, B., Gross, J., Norrga, S., Kildehöj, L. & Nee, H.-P. (2018). A Proposal for Wireless Control of Submodules in Modular Multilevel Converters. In: : . Paper presented at 20th European Conference on Power Electronics and Applications.
Open this publication in new window or tab >>A Proposal for Wireless Control of Submodules in Modular Multilevel Converters
Show others...
2018 (English)Conference paper, Published paper (Refereed)
Abstract [en]

The modular multilevel converter is one of the most preferred converters for high-power conversion applications. Wireless control of the submodules can contribute to its evolution by lowering the material and labor costs of cabling and by increasing the availability of the converter. However, wireless control leads to many challenges for the control and modulation of the converter as well as for proper low-latency high-reliability communication. This paper investigates the tolerable asynchronism between phase-shifted carriers used in modulation from a wireless control point of view and proposes a control method along with communication protocol for wireless control. The functionality of the proposed method is validated by computer simulations in steady state.

Keywords
Modular multilevel converter, Wireless control
National Category
Electrical Engineering, Electronic Engineering, Information Engineering
Research subject
Electrical Engineering
Identifiers
urn:nbn:se:kth:diva-239736 (URN)000450299300223 ()2-s2.0-85057065852 (Scopus ID)9789075815290 (ISBN)
Conference
20th European Conference on Power Electronics and Applications
Note

QC 20181203

Available from: 2018-12-02 Created: 2018-12-02 Last updated: 2018-12-10Bibliographically approved
Li, N., Xiao, M. & Rasmussen, L. K. (2018). Diverse Communication Modes in Cooperative Downlink Non-Orthogonal Multiple Access - Invited Paper. In: IEEE Vehicular Technology Conference: . Paper presented at 87th IEEE Vehicular Technology Conference, VTC Spring 2018, 3 June 2018 through 6 June 2018 (pp. 1-5). Institute of Electrical and Electronics Engineers Inc.
Open this publication in new window or tab >>Diverse Communication Modes in Cooperative Downlink Non-Orthogonal Multiple Access - Invited Paper
2018 (English)In: IEEE Vehicular Technology Conference, Institute of Electrical and Electronics Engineers Inc. , 2018, p. 1-5Conference paper, Published paper (Refereed)
Abstract [en]

We consider cooperation in downlink non-orthogonal multiple access (NOMA) in a network supporting diverse communication modes. One user (UE2) exists as a potential relay between a base station (BS) and another user (UE1). With relaying the signal for UE1, UE2 obtains the opportunity for its own transmission to UE3 in D2D mode, meanwhile maintaining the transmission efficiency for UE1. On the basis of supporting different communication modes, we propose a NOMA-based cooperation scheme at UE2 to combine the relay message with its own. We derive achievable rate regions for two cases depending on the status of the Rayleigh fading channel of the UE2. We find solutions based on experiments through the transmit power allocation strategy at the UE2 and(/or) the BS. We show the impacts of our cooperative scheme and the corresponding user geometry on the achievable rates and the resource sharing strategies. © 2018 IEEE.

Place, publisher, year, edition, pages
Institute of Electrical and Electronics Engineers Inc., 2018
Keywords
Fading channels, Rayleigh fading, Achievable rate region, Communication mode, Cooperative schemes, Diverse communications, Non orthogonal multiple accesses (NOMA), Non-orthogonal multiple access, Transmission efficiency, Transmit power allocation, Cooperative communication
National Category
Telecommunications
Identifiers
urn:nbn:se:kth:diva-238072 (URN)10.1109/VTCSpring.2018.8417569 (DOI)2-s2.0-85050976186 (Scopus ID)9781538663554 (ISBN)
Conference
87th IEEE Vehicular Technology Conference, VTC Spring 2018, 3 June 2018 through 6 June 2018
Note

Conference code: 138181; Export Date: 30 October 2018; Conference Paper; CODEN: IVTCD

QC 20190114

Available from: 2019-01-14 Created: 2019-01-14 Last updated: 2019-01-14Bibliographically approved
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
Larsson, P., Rasmussen, L. K. & Skoglund, M. (2018). The Golden Quantizer: The Complex Gaussian Random Variable Case. IEEE Wireless Communications Letters, 7(3), 312-315
Open this publication in new window or tab >>The Golden Quantizer: The Complex Gaussian Random Variable Case
2018 (English)In: IEEE Wireless Communications Letters, ISSN 2162-2337, E-ISSN 2162-2345, Vol. 7, no 3, p. 312-315Article in journal (Refereed) Published
Abstract [en]

The problem of quantizing a circularly symmetric complex Gaussian random variable is considered. For this purpose, we design two non-uniform quantizers, a high-rate- and a Lloyd-Max-quantizer, that are both based on the (golden angle) spiral-phyllotaxis packing principle. We find that the proposed schemes have lower mean-square error distortion compared to (non)-uniform polar/rectangular-quantizers, and near-identical to the best performing trained vector quantizers. The proposed quantizer scheme offers a structured design, a simple natural index ordering, and allows for any number of centroids.

Place, publisher, year, edition, pages
Institute of Electrical and Electronics Engineers (IEEE), 2018
Keywords
Non-uniform quantization, golden angle
National Category
Computer Sciences
Identifiers
urn:nbn:se:kth:diva-240235 (URN)10.1109/LWC.2017.2774824 (DOI)000436010400008 ()2-s2.0-85035136568 (Scopus ID)
Note

QC 20181214

Available from: 2018-12-14 Created: 2018-12-14 Last updated: 2018-12-14Bibliographically 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)10.23919/EUSIPCO.2017.8081229 (DOI)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-12-05Bibliographically 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
Organisations
Identifiers
ORCID iD: ORCID iD iconorcid.org/0000-0001-7182-9543

Search in DiVA

Show all publications