Change search
Link to record
Permanent link

Direct link
BETA
Alternative names
Publications (10 of 73) Show all publications
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, 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
Keyword
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
Si, Z., Ma, J. & Thobaben, R. (2015). Coded Cooperation for Multiway Relaying in Wireless Sensor Networks. Sensors, 15(7), 15265-15284.
Open this publication in new window or tab >>Coded Cooperation for Multiway Relaying in Wireless Sensor Networks
2015 (English)In: Sensors, ISSN 1424-8220, E-ISSN 1424-8220, Vol. 15, no 7, 15265-15284 p.Article in journal (Refereed) Published
Abstract [en]

Wireless sensor networks have been considered as an enabling technology for constructing smart cities. One important feature of wireless sensor networks is that the sensor nodes collaborate in some manner for communications. In this manuscript, we focus on the model of multiway relaying with full data exchange where each user wants to transmit and receive data to and from all other users in the network. We derive the capacity region for this specific model and propose a coding strategy through coset encoding. To obtain good performance with practical codes, we choose spatially-coupled LDPC (SC-LDPC) codes for the coded cooperation. In particular, for the message broadcasting from the relay, we construct multi-edge-type (MET) SC-LDPC codes by repeatedly applying coset encoding. Due to the capacity-achieving property of the SC-LDPC codes, we prove that the capacity region can theoretically be achieved by the proposed MET SC-LDPC codes. Numerical results with finite node degrees are provided, which show that the achievable rates approach the boundary of the capacity region in both binary erasure channels and additive white Gaussian channels.

Keyword
wireless sensor networks, multiway relay channel, capacity region, coset encoding, multi-edge-type LDPC codes, spatially-coupled LDPC codes
National Category
Electrical Engineering, Electronic Engineering, Information Engineering
Identifiers
urn:nbn:se:kth:diva-175941 (URN)10.3390/s150715265 (DOI)000361788200022 ()26131675 (PubMedID)2-s2.0-84934765174 (Scopus ID)
Funder
The Swedish Foundation for International Cooperation in Research and Higher Education (STINT), IB2015-5959
Note

QC 20151102

Available from: 2015-11-02 Created: 2015-10-26 Last updated: 2017-12-01Bibliographically approved
Gabry, F., Zappone, A., Thobaben, R., Jorswieck, E. A. & Skoglund, M. (2015). Energy Efficiency Analysis of Cooperative Jamming in Cognitive Radio Networks with Secrecy Constraints. IEEE Wireless Communications Letters, 4(4), 437-440, Article ID 7106492.
Open this publication in new window or tab >>Energy Efficiency Analysis of Cooperative Jamming in Cognitive Radio Networks with Secrecy Constraints
Show others...
2015 (English)In: IEEE Wireless Communications Letters, ISSN 2162-2337, E-ISSN 2162-2345, Vol. 4, no 4, 437-440 p., 7106492Article in journal (Refereed) Published
Abstract [en]

We investigate energy-efficient cooperation for secrecy in cognitive radio networks. In particular, we consider a four-node cognitive scenario where the secondary receiver is treated as a potential eavesdropper with respect to the primary transmission. The cognitive transmitter should ensure that the primary message is not leaked to the secondary user by using cooperative jamming. We investigate the optimal power allocation and power splitting at the secondary transmitter for our cognitive model to maximize the secondary energy efficiency (EE) under secrecy constraints. We formulate and analyze an important EE Stackelberg game between the two transmitters aiming at maximizing their utilities. We illustrate the analytical results through our geometrical model, highlighting the EE performance of the system and the impact of the Stackelberg game.

Keyword
cognitive radio, Cooperative jamming, energy efficiency, game theory, Security, Balloons, Jamming, Transmitters, Analytical results, Cognitive radio network, Energy efficiency analysis, Geometrical modeling, Optimal power allocation, Primary transmission
National Category
Electrical Engineering, Electronic Engineering, Information Engineering
Identifiers
urn:nbn:se:kth:diva-175015 (URN)10.1109/LWC.2015.2432802 (DOI)000377307900024 ()2-s2.0-84940395428 (Scopus ID)
Note

QC 20151130

Available from: 2015-11-30 Created: 2015-10-09 Last updated: 2017-12-01Bibliographically approved
Lin, P.-H. -., Gabry, F., Thobaben, R., Jorswieck, E. & Skoglund, M. (2015). Interference neutralization vs clean relaying in cognitive radio networks with secrecy. In: Proceedings of the 12th International Conference on Mobile and Ubiquitous Systems: Computing, Networking and Services, MOBIQUITOUS 2015. Paper presented at 12th International Conference on Mobile and Ubiquitous Systems: Computing, Networking and Services, MOBIQUITOUS 2015, 22 July 2015 through 24 July 2015 (pp. 240-246). IEEE conference proceedings.
Open this publication in new window or tab >>Interference neutralization vs clean relaying in cognitive radio networks with secrecy
Show others...
2015 (English)In: Proceedings of the 12th International Conference on Mobile and Ubiquitous Systems: Computing, Networking and Services, MOBIQUITOUS 2015, IEEE conference proceedings, 2015, 240-246 p.Conference paper, Published paper (Refereed)
Abstract [en]

In this paper we study cognitive radio networks with secrecy constraints on the primary transmission. In particular we consider several transmission schemes for the secondary transmitter, namely interference neutralization (IN) and cooperative jamming with and without clean relaying (CR). We derive and analyze the achievable secondary rate performance of the schemes. Furthermore we thoroughly investigate the advantages and shortcomings of these schemes through numerical simulations in a geometric model where we highlight the impact of the users' locations and show the important difference in all schemes depending on the topology. Our results show that the secondary transmitter can successfully adapt its transmission scheme (and parameters), i.e., either IN or CR, depending on its location to maximize its rate while insuring perfect secrecy of the primary transmission.

Place, publisher, year, edition, pages
IEEE conference proceedings, 2015
Keyword
Cognitive radio, Interference neutralization, Jamming, Physical layer security, Relaying, Network layers, Radio transmission, Topology, Transmissions, Transmitters, Ubiquitous computing, Cognitive radio network, Cooperative jamming, Geometric modeling, Interference neutralizations, Primary transmission, Transmission schemes
National Category
Telecommunications
Identifiers
urn:nbn:se:kth:diva-181632 (URN)2-s2.0-84946030890 (Scopus ID)9781631900723 (ISBN)
Conference
12th International Conference on Mobile and Ubiquitous Systems: Computing, Networking and Services, MOBIQUITOUS 2015, 22 July 2015 through 24 July 2015
Note

QC 20160314

Available from: 2016-03-14 Created: 2016-02-02 Last updated: 2017-06-02Bibliographically approved
Lin, P.-H. -., Gabry, F., Thobaben, R., Jorswieck, E. & Skoglund, M. (2015). Multi-phase transmission for secure cognitive radio networks. In: 2015 IEEE International Conference on Communication Workshop, ICCW 2015: . Paper presented at IEEE International Conference on Communication Workshop, ICCW 2015, 8 June 2015 through 12 June 2015 (pp. 475-479). IEEE conference proceedings.
Open this publication in new window or tab >>Multi-phase transmission for secure cognitive radio networks
Show others...
2015 (English)In: 2015 IEEE International Conference on Communication Workshop, ICCW 2015, IEEE conference proceedings, 2015, 475-479 p.Conference paper, Published paper (Refereed)
Abstract [en]

In this paper we study secure communications with weak secrecy constraint in a cognitive radio channel, where the secondary receiver is treated as a potential eavesdropper with respect to the primary transmission. The primary's secrecy rate and the transmission scheme should be kept unchanged whether the secondary users transmit or not. We derive the achievable rate of the discrete memoryless multi-phase cognitive channel. To against the information leakage due to the use of Gelfand-Pinsker coding at the secondary transmitter, we derive the corresponding constraints to guarantee the primary's secure transmission. We then specialize the results to the additive white Gaussian noise channels. Numerical results show the advantages of using the proposed multiple-phase transmission scheme over the traditional ones without the additional phase.

Place, publisher, year, edition, pages
IEEE conference proceedings, 2015
Keyword
Gaussian noise (electronic), Radio transmission, Secure communication, Transmissions, White noise, Additive white Gaussian noise channel, Cognitive radio channels, Cognitive radio network, Information leakage, Phase transmission, Primary transmission, Secure transmission, Transmission schemes, Cognitive radio
National Category
Telecommunications
Identifiers
urn:nbn:se:kth:diva-181641 (URN)10.1109/ICCW.2015.7247225 (DOI)000380459900080 ()2-s2.0-84947772669 (Scopus ID)9781467363051 (ISBN)
Conference
IEEE International Conference on Communication Workshop, ICCW 2015, 8 June 2015 through 12 June 2015
Note

QC 20160314

Available from: 2016-03-14 Created: 2016-02-02 Last updated: 2016-09-23Bibliographically approved
Blasco-Serrano, R., Zachariah, D., Sundman, D., Thobaben, R. & Skoglund, M. (2014). A Measurement Rate-MSE Tradeoff for Compressive Sensing Through Partial Support Recovery. IEEE Transactions on Signal Processing, 62(18), 4643-4658.
Open this publication in new window or tab >>A Measurement Rate-MSE Tradeoff for Compressive Sensing Through Partial Support Recovery
Show others...
2014 (English)In: IEEE Transactions on Signal Processing, ISSN 1053-587X, E-ISSN 1941-0476, Vol. 62, no 18, 4643-4658 p.Article in journal (Refereed) Published
Abstract [en]

We study the fundamental relationship between two relevant quantities in compressive sensing: the measurement rate, which characterizes the asymptotic behavior of the dimensions of the measurement matrix in terms of the ratio m/ log n (m being the number of measurements and n the dimension of the sparse signal), and the mean square estimation error. First, we use an information-theoretic approach to derive sufficient conditions on the measurement rate to reliably recover a part of the support set that represents a certain fraction of the total signal power when the sparsity level is fixed. Second, we characterize the mean square error of an estimator that uses partial support set information. Using these two parts, we derive a tradeoff between the measurement rate and the mean square error. This tradeoff is achievable using a two-step approach: first support set recovery, then estimation of the active components. Finally, for both deterministic and random signals, we perform a numerical evaluation to verify the advantages of the methods based on partial support set recovery.

Place, publisher, year, edition, pages
IEEE Signal Processing Society, 2014
Keyword
Compressive sensing, sparse signal, support recovery, MSE, performance tradeoff
National Category
Telecommunications
Identifiers
urn:nbn:se:kth:diva-144414 (URN)10.1109/TSP.2014.2321739 (DOI)000340847000001 ()2-s2.0-84906483401 (Scopus ID)
Funder
EU, FP7, Seventh Framework Programme, 257626
Note

QC 20140617

Available from: 2014-04-29 Created: 2014-04-22 Last updated: 2017-12-05Bibliographically approved
Amat, A. G. & Thobaben, R. (2014). An Introduction to Distributed Channel Coding. In: Channel coding: theory, algorithms, and applications (pp. 399-450). SAN DIEGO: ELSEVIER ACADEMIC PRESS INC.
Open this publication in new window or tab >>An Introduction to Distributed Channel Coding
2014 (English)In: Channel coding: theory, algorithms, and applications, SAN DIEGO: ELSEVIER ACADEMIC PRESS INC , 2014, 399-450 p.Chapter in book (Refereed)
Place, publisher, year, edition, pages
SAN DIEGO: ELSEVIER ACADEMIC PRESS INC, 2014
Keyword
parity-check codes, wireless relay channels, decode-and-forward, ldpc codes, performance analysis, convolutional-codes, cooperative diversity, design, capacity, networks
National Category
Electrical Engineering, Electronic Engineering, Information Engineering
Identifiers
urn:nbn:se:kth:diva-153405 (URN)10.1016/B978-0-12-396499-1.00009-1 (DOI)000341025000010 ()
Note

QC 20141009

Available from: 2014-10-09 Created: 2014-10-03 Last updated: 2014-10-09Bibliographically approved
Lin, P.-H. -., Gabry, F., Thobaben, R., Jorswieck, E. & Skoglund, M. (2014). Clean relaying in cognitive radio networks with variational distance secrecy constraint. In: 2014 IEEE Globecom Workshops, GC Wkshps 2014: . Paper presented at 2014 IEEE Globecom Workshops, GC Wkshps 2014, 8 December 2014 through 12 December 2014 (pp. 1337-1342). .
Open this publication in new window or tab >>Clean relaying in cognitive radio networks with variational distance secrecy constraint
Show others...
2014 (English)In: 2014 IEEE Globecom Workshops, GC Wkshps 2014, 2014, 1337-1342 p.Conference paper, Published paper (Refereed)
Abstract [en]

In this paper we investigate the cooperative secure communication in a four-node cognitive channel where the secondary receiver is treated as a potential eavesdropper with respect to the primary transmission with variational distance constraint. And the primary user's secrecy rate is required to be unchanged. We propose the clean relaying with the cooperative jamming scheme to achieve this goal, where the secondary transmitter splits its transmitting phase into two non-overlapped intervals after successfully decoding the primary message. Due to the considered secrecy metric, we resort to the information spectrum method, to derive the achievable secrecy rates for the primary user. Then we formulate the secondary user's rate maximization problem over the power allocation and time splitting at the cognitive transmitter under the constraint that primary user's secrecy rate is unchanged. Numerical results show that the secondary transmitter can choose clean relaying or pure cooperative jamming according to the relative positions of the nodes to achieve better performance than the one without any clean phase.

Keyword
Cooperative communication, Jamming, Transmitters, Achievable secrecy rates, Cognitive radio network, Cooperative jamming, Information spectrum, Maximization problem, Overlapped intervals, Primary transmission, Variational distance, Cognitive radio
National Category
Communication Systems
Identifiers
urn:nbn:se:kth:diva-167036 (URN)10.1109/GLOCOMW.2014.7063619 (DOI)2-s2.0-84946691739 (Scopus ID)9781479974702 (ISBN)
Conference
2014 IEEE Globecom Workshops, GC Wkshps 2014, 8 December 2014 through 12 December 2014
Note

QC 20150521

Available from: 2015-05-21 Created: 2015-05-21 Last updated: 2015-11-17Bibliographically approved
Blasco-Serrano, R., Thobaben, R. & Skoglund, M. (2014). Communication and interference coordination. In: 2014 Information Theory and Applications Workshop, ITA 2014 - Conference Proceedings: . Paper presented at 2014 IEEE Information Theory and Applications Workshop, ITA 2014; San Diego, CA; United States; 9 February 2014 through 14 February 2014 (pp. 6804218). IEEE conference proceedings.
Open this publication in new window or tab >>Communication and interference coordination
2014 (English)In: 2014 Information Theory and Applications Workshop, ITA 2014 - Conference Proceedings, IEEE conference proceedings, 2014, 6804218- p.Conference paper, Published paper (Refereed)
Abstract [en]

We study the problem of controlling the interference created to an external observer by a communication processes. We model the interference in terms of its type (empirical distribution), and we analyze the consequences of placing constraints on the admissible type. Considering a single interfering link, we characterize the communication-interference capacity region. Then, we look at a scenario where the interference is jointly created by two users allowed to coordinate their actions prior to transmission. In this case, the tradeoff involves communication and interference as well as coordination. We establish an achievable communication-interference region and show that efficiency is significantly improved by coordination.

Place, publisher, year, edition, pages
IEEE conference proceedings, 2014
National Category
Telecommunications
Identifiers
urn:nbn:se:kth:diva-141012 (URN)10.1109/ITA.2014.6804218 (DOI)000351836500013 ()2-s2.0-84901207647 (Scopus ID)
Conference
2014 IEEE Information Theory and Applications Workshop, ITA 2014; San Diego, CA; United States; 9 February 2014 through 14 February 2014
Note

QC 20140617

Available from: 2014-02-05 Created: 2014-02-05 Last updated: 2015-06-15Bibliographically approved
Grosjean, L., Rasmussen, L. K., Thobaben, R. & Skoglund, M. (2014). Systematic LDPC Convolutional Codes: Asymptotic and Finite-Length Anytime Properties. IEEE Transactions on Communications, 62(12), 4165-4183.
Open this publication in new window or tab >>Systematic LDPC Convolutional Codes: Asymptotic and Finite-Length Anytime Properties
2014 (English)In: IEEE Transactions on Communications, ISSN 0090-6778, E-ISSN 1558-0857, ISSN 0090-6778, Vol. 62, no 12, 4165-4183 p.Article in journal (Refereed) Published
Abstract [en]

Here we propose an ensemble of non-terminated systematic LDPC convolutional codes with increasing memory, and show that over the binary erasure channel (BEC) these codes achieve anytime reliability asymptotically when decoded with an expanding-window message-passing decoder. The corresponding anytime exponents are determined through protograph-based extrinsic information transfer charts. Fundamental complications arising when transmitting with finite block lengths are identified and a combinatorial performance analysis, when transmitting over a static BEC with a fixed number of erasures per codeword block, is developed. Based on the performance analysis we explore the use of feedback for achieving anytime behavior with constraints on block length. To meet complexity constraints, with or without feedback, the code memory can be limited at the cost of an error floor emerging with a delay proportional to the memory constraint. Although the analysis is developed for a static BEC we show numerically that we can design efficient low-complexity finite-length codes with anytime properties even for the conventional BEC.

Place, publisher, year, edition, pages
IEEE, 2014
Keyword
Communications
National Category
Communication Systems
Identifiers
urn:nbn:se:kth:diva-157509 (URN)10.1109/TCOMM.2014.2364600 (DOI)000346793800001 ()2-s2.0-84919684286 (Scopus ID)
Note

QC 20150122

Available from: 2015-01-05 Created: 2014-12-10 Last updated: 2017-12-05Bibliographically approved
Organisations
Identifiers
ORCID iD: ORCID iD iconorcid.org/0000-0001-9307-484X

Search in DiVA

Show all publications