liu.seSearch for publications in DiVA
Change search
Link to record
Permanent link

Direct link
BETA
Eriksson, Jonas
Publications (9 of 9) Show all publications
Eriksson, J., Moosavi, R. & Larsson, E. G. (2012). Complexity Reduction of Blind Decoding Schemes Using CRC Splitting. In: 2012 IEEE Global Communications Conference (GLOBECOM): . Paper presented at IEEE GLOBECOM 2012, 3-7 Dec 2012, Anaheim, California, USA (pp. 3731-3736). IEEE
Open this publication in new window or tab >>Complexity Reduction of Blind Decoding Schemes Using CRC Splitting
2012 (English)In: 2012 IEEE Global Communications Conference (GLOBECOM), IEEE , 2012, p. 3731-3736Conference paper, Published paper (Refereed)
Abstract [en]

Blind decoding, used on control channels of some multi-user wireless  access systems, is a technique for achieving adaptive modulation and  coding. The idea is to adapt the modulation and coding scheme to the  channel quality but instead of signaling the parameters used  explicitly, the receiver blindly tries a number of fixed parameter  combinations until a successful decoding attempt is detected, with  the help of a cyclic redundancy check. In this paper we suggest a  new method for reducing the complexity and energy consumption  associated with such blind decoding schemes. Our idea is to use a  mini-CRC injected early in the data stream to determine if the  current decoding attempt is using the correct modulation and coding  parameters. We analyze and exemplify the complexity gain of this  approach and also investigate the impact of the rearrangement of the  CRC scheme in terms of the probability of undetected error. The  presented results for the complexity gain are promising and the  impact on the error detection capability turns out to be small if  any.

Place, publisher, year, edition, pages
IEEE, 2012
Series
IEEE Global Communications Conference, Exhibition, & Industry Forum (GLOBECOM), ISSN 1930-529X
Keywords
Blind decoding, Adaptive coding and modulation, CRC splitting, Code detection
National Category
Communication Systems
Identifiers
urn:nbn:se:liu:diva-79226 (URN)10.1109/GLOCOM.2012.6503697 (DOI)978-1-4673-0919-6 (ISBN)978-1-4673-0920-2 (ISBN)
Conference
IEEE GLOBECOM 2012, 3-7 Dec 2012, Anaheim, California, USA
Available from: 2012-07-03 Created: 2012-07-03 Last updated: 2016-08-31Bibliographically approved
Moosavi, R., Eriksson, J., Larsson, E. G., Wiberg, N., Frenger, P. & Gunnarsson, F. (2010). Comparison of Strategies for Signaling of Scheduling Assignments in Wireless OFDMA. IEEE Transactions on Vehicular Technology, 59(9), 4527-4542
Open this publication in new window or tab >>Comparison of Strategies for Signaling of Scheduling Assignments in Wireless OFDMA
Show others...
2010 (English)In: IEEE Transactions on Vehicular Technology, ISSN 0018-9545, E-ISSN 1939-9359, Vol. 59, no 9, p. 4527-4542Article in journal (Refereed) Published
Abstract [en]

This paper considers transmission of scheduling information in  OFDMA-based cellular communication systems such as 3GPP long-term  evolution (LTE). These systems provide efficient usage of radio  resources by allowing users to be scheduled dynamically in both  frequency and time. This requires considerable amounts of scheduling  information to be sent to the users.  The paper compares two basic transmission strategies: transmitting a  separate scheduling message to each user versus broadcasting a joint  scheduling message to all users. Different scheduling granularities  are considered, as well as different scheduling algorithms. The  schemes are evaluated in the context of the LTE downlink using  multiuser system simulations, assuming a full-buffer situation.  The results show that separate transmission of the scheduling  information requires a slightly lower overhead than joint  broadcasting, when proportional fair scheduling is employed and the  users are spread out over the cell area. The results also indicate  that the scheduling granularity standardized for LTE provides a good  trade-off between scheduling granularity and overhead.

Place, publisher, year, edition, pages
IEEE, 2010
Keywords
Control signaling, resource allocation in wireless OFDMA, signaling of scheduling assignments, signaling overhead
National Category
Engineering and Technology
Identifiers
urn:nbn:se:liu:diva-58156 (URN)10.1109/TVT.2010.2066589 (DOI)000284087700029 ()
Note
©2010 IEEE. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE. Reza Moosavi, Jonas Eriksson, Erik G. Larsson, Niclas Wiberg, Pål Frenger and Fredrik Gunnarsson, Comparison of Strategies for Signaling of Scheduling Assignments in Wireless OFDMA, 2010, IEEE Transactions on Vehicular Technology. http://dx.doi.org/10.1109/TVT.2010.2066589 Available from: 2010-08-09 Created: 2010-08-09 Last updated: 2017-12-12
Moosavi, R., Eriksson, J. & Larsson, E. G. (2010). Differential Signaling of Scheduling Information in Wireless Multiple Access Systems. In: Proceedings of the IEEE Global Communications Conference (GLOBECOM). Paper presented at The IEEE Global Communications Conference (GLOBECOM), 06-10 December, Miami, FL, USA (pp. 1-6).
Open this publication in new window or tab >>Differential Signaling of Scheduling Information in Wireless Multiple Access Systems
2010 (English)In: Proceedings of the IEEE Global Communications Conference (GLOBECOM), 2010, p. 1-6Conference paper, Published paper (Refereed)
Abstract [en]

This paper considers the control signaling on the downlink in wireless multiple access systems, with focus on the part of the control signaling that carries information on the user's time/frequency scheduling assignments. A new idea is presented to reduce the amount of channel resources needed for this signaling. The idea is to exploit the fact that provided that only one single user is scheduled on each channel resource, then the different users' scheduling assignments are correlated. This correlation can be exploited by encoding the scheduling information differentially. In order to recover the scheduling information, a user must then decode the scheduling information of some of the others. This is possible, because on the downlink, all users can hear the transmission by the base station so that users with a high SNR may decode the control signaling sent to users with a lower SNR. We present a practical scheme to exploit this idea. Both analytical analysis and numerical examples illustrate that the proposed technique can provide a substantial reduction in signaling traffic.

Series
Global Telecommunications Conference, ISSN 1930-529X
National Category
Engineering and Technology
Identifiers
urn:nbn:se:liu:diva-57630 (URN)10.1109/GLOCOM.2010.5683176 (DOI)978-1-4244-5637-6 (ISBN)978-1-4244-5636-9 (ISBN)
Conference
The IEEE Global Communications Conference (GLOBECOM), 06-10 December, Miami, FL, USA
Note
©2010 IEEE. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE.: Reza Moosavi, Jonas Eriksson and Erik G. Larsson, Differential Signaling of Scheduling Information in Wireless Multiple Access Systems, 2010, Proceedings of the IEEE Global Communications Conference 2010 (GLOBECOM 2010).Available from: 2010-06-24 Created: 2010-06-24 Last updated: 2016-08-31Bibliographically approved
Eriksson, J., Moosavi, R., Larsson, E. G., Wiberg, N., Frenger, P. & Gunnarsson, F. (2009). On Coding of Scheduling Information in OFDM. In: Proceedings of the 69th IEEE Vehicular Technology Conference: . Paper presented at 69th IEEE Vehicular Technology Conference, Barcelona, Spain, 26-29 April, 2009.
Open this publication in new window or tab >>On Coding of Scheduling Information in OFDM
Show others...
2009 (English)In: Proceedings of the 69th IEEE Vehicular Technology Conference, 2009Conference paper, Published paper (Refereed)
Abstract [en]

Control signaling strategies for scheduling information in cellular OFDM systems are studied. A single-cell multiuser system model is formulated that provides system capacity estimates accounting for the signaling overhead. Different scheduling granularities are considered, including the one used in the specifications for the 3G Long Term Evolution (LTE). A greedy scheduling method is assumed, where each resource is assigned to the user for which it can support the highest number of bits. The simulation results indicate that the cost of control signaling does not outweigh the scheduling gain, when compared with a simple round-robin scheme that does not need signaling of scheduling information. Furthermore, in the studied scenario, joint coding and signaling of scheduling information over all selected users is found to be superior to separate coding and signaling for each user. The results also indicate that the scheduling granularity used for LTE provides better performance than the full granularity.

Keywords
OFDM modulation, Cellular radio, Encoding, Scheduling, Multi-access systems
National Category
Control Engineering
Identifiers
urn:nbn:se:liu:diva-25575 (URN)10.1109/VETECS.2009.5073719 (DOI)000273169201093 ()978-1-4244-2517-4 (ISBN)
Conference
69th IEEE Vehicular Technology Conference, Barcelona, Spain, 26-29 April, 2009
Note

©2009 IEEE. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE. Jonas Eriksson, Reza Moosavi, Erik G. Larsson, Niklas Wiberg, Pål Frenger and Fredrik Gunnarsson, On Coding of Scheduling Information in OFDM, 2009, Proceedings of the 69th IEEE Vehicular Technology Conference (VTC'09). http://dx.doi.org/10.1109/VETECS.2009.5073719

Available from: 2009-10-08 Created: 2009-10-08 Last updated: 2018-07-05
Eriksson, J. (2007). A Probabilistic Lower Bound on the Maximum Size of a List-of-Two Decodable Code. Institutionen för Systemteknik, Linköpings Universitet
Open this publication in new window or tab >>A Probabilistic Lower Bound on the Maximum Size of a List-of-Two Decodable Code
2007 (English)Report (Other academic)
Place, publisher, year, edition, pages
Institutionen för Systemteknik, Linköpings Universitet, 2007
Series
LiTH-ISY-R, ISSN 1400-3902 ; 2814
National Category
Engineering and Technology
Identifiers
urn:nbn:se:liu:diva-57881 (URN)LiTH-ISY-R-2814 (ISRN)
Available from: 2010-07-02 Created: 2010-07-02 Last updated: 2014-06-18Bibliographically approved
Eriksson, J. (2007). A weight-based characterization of the set of correctable error patterns under list-of-2 decoding. ADVANCES IN MATHEMATICS OF COMMUNICATIONS, 1(3), 331-356
Open this publication in new window or tab >>A weight-based characterization of the set of correctable error patterns under list-of-2 decoding
2007 (English)In: ADVANCES IN MATHEMATICS OF COMMUNICATIONS, ISSN 1930-5346, Vol. 1, no 3, p. 331-356Article in journal (Refereed) Published
Abstract [en]

List decoding of block codes is an alternative approach to the decoding problem with appealing qualities. The fairly recent development of efficient algorithms for list decoding of Reed-Solomon codes spur new fuel to the study of this decoding strategy. In this paper we give a weight-based characterization of the set of correctable error patterns under list-of-2 decoding of (tau, 2)-list-decodable linear codes with known weight distribution. We apply our characterization of the set of correctable error patterns to a few codes in a family of low-rate list-of-2 decodable Reed-Solomon codes. We study the increase in error-correction performance obtained in a symmetric AWGN channel by using list-of-2 decoding instead of traditional decoding for these codes. Some simulation results for list-of-2 decoding on QAM channels using the Guruswami-Sudan algorithm for decoding of Reed-Solomon codes are also presented.

National Category
Engineering and Technology
Identifiers
urn:nbn:se:liu:diva-47978 (URN)
Available from: 2009-10-11 Created: 2009-10-11 Last updated: 2011-01-11
Eriksson, J. (2007). A Weight-Based Characterization of the Set of Correctable Error patterns Under List-of-2 Decoding. Institutionen för Systemteknik, Linköpings Universitet.
Open this publication in new window or tab >>A Weight-Based Characterization of the Set of Correctable Error patterns Under List-of-2 Decoding
2007 (English)Report (Other academic)
Abstract [en]

List decoding of block codes is an alternative approach to the decoding problem with appealing qualities. The fairly recent development of efficient algorithms for list decoding of Reed-Solomon codes spur new fuel to the study of this decoding strategy. In this paper we give a weight-based characterization of the set of correctable error patterns under list-of-2 decoding of (tau, 2)-list-decodable linear codes with known weight distribution. We apply our characterization of the set of correctable error patterns to a few codes in a family of low-rate list-of-2 decodable Reed-Solomon codes. We study the increase in error-correction performance obtained in a symmetric AWGN channel by using list-of-2 decoding instead of traditional decoding for these codes. Some simulation results for list-of-2 decoding on QAM channels using the Guruswami-Sudan algorithm for decoding of Reed-Solomon codes are also presented.

Place, publisher, year, edition, pages
Institutionen för Systemteknik, Linköpings Universitet., 2007
Series
LiTH-ISY-R, ISSN 1400-3902 ; 2777
Keywords
COMPUTER SCIENCE, THEORY & METHODS, MATHEMATICS, APPLIED
National Category
Engineering and Technology
Identifiers
urn:nbn:se:liu:diva-57879 (URN)LiTH-ISY-R-2777 (ISRN)
Available from: 2010-07-02 Created: 2010-07-02 Last updated: 2014-06-18Bibliographically approved
Eriksson, J. (2006). Aspects of List-of-Two Decoding. (Doctoral dissertation). : Institutionen för systemteknik
Open this publication in new window or tab >>Aspects of List-of-Two Decoding
2006 (English)Doctoral thesis, monograph (Other academic)
Abstract [en]

We study the problem of list decoding with focus on the case when we have a list size limited to two. Under this restriction we derive general lower bounds on the maximum possible size of a list-of-2-decodable code. We study the set of correctable error patterns in an attempt to obtain a characterization. For a special family of Reed-Solomon codes - which we identify and name 'class-I codes' - we give a weight-based characterization of the correctable error patterns under list-of-2 decoding. As a tool in this analysis we use the theoretical framework of Sudan's algorithm. The characterization is used in an exact calculation of the probability of transmission error in the symmetric channel when list-of-2 decoding is used. The results from the analysis and complementary simulations for QAM-systems show that a list-of-2 decoding gain of nearly 1 dB can be achieved.

Further we study Sudan's algorithm for list decoding of Reed-Solomon codes for the special case of the class-I codes. For these codes algorithms are suggested for both the first and second step of Sudan's algorithm. Hardware solutions for both steps based on the derived algorithms are presented.

Place, publisher, year, edition, pages
Institutionen för systemteknik, 2006. p. 124
Series
Linköping Studies in Science and Technology. Dissertations, ISSN 0345-7524 ; 1010
Keywords
list decoding, Sudan's algorithm, Reed-Solomon code
National Category
Telecommunications
Identifiers
urn:nbn:se:liu:diva-6919 (URN)91-85497-49-5 (ISBN)
Public defence
2006-05-12, Key1, Key, Linköpings universitet, Linköping, 13:15 (English)
Opponent
Supervisors
Available from: 2006-06-28 Created: 2006-06-28
Eriksson, J. (2000). List Decoding and Sudan's Algorithm.. In: Department of Telecommunications and Applied Information Theory TAIT, University of Ulm (Ed.), Winter School on Coding and Information Theory 2000: . Paper presented at Winter School on Coding and Information Theory, Reisensburg, University of Ulm, 2000 (pp. 2-2).
Open this publication in new window or tab >>List Decoding and Sudan's Algorithm.
2000 (English)In: Winter School on Coding and Information Theory 2000 / [ed] Department of Telecommunications and Applied Information Theory TAIT, University of Ulm, 2000, p. 2-2Conference paper, Published paper (Refereed)
National Category
Engineering and Technology
Identifiers
urn:nbn:se:liu:diva-57876 (URN)
Conference
Winter School on Coding and Information Theory, Reisensburg, University of Ulm, 2000
Available from: 2010-07-02 Created: 2010-07-02 Last updated: 2015-01-30
Organisations

Search in DiVA

Show all publications