liu.seSearch for publications in DiVA
Change search
Refine search result
1 - 13 of 13
CiteExportLink to result list
Permanent link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • oxford
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
Rows per page
  • 5
  • 10
  • 20
  • 50
  • 100
  • 250
Sort
  • Standard (Relevance)
  • Author A-Ö
  • Author Ö-A
  • Title A-Ö
  • Title Ö-A
  • Publication type A-Ö
  • Publication type Ö-A
  • Issued (Oldest first)
  • Issued (Newest first)
  • Created (Oldest first)
  • Created (Newest first)
  • Last updated (Oldest first)
  • Last updated (Newest first)
  • Disputation date (earliest first)
  • Disputation date (latest first)
  • Standard (Relevance)
  • Author A-Ö
  • Author Ö-A
  • Title A-Ö
  • Title Ö-A
  • Publication type A-Ö
  • Publication type Ö-A
  • Issued (Oldest first)
  • Issued (Newest first)
  • Created (Oldest first)
  • Created (Newest first)
  • Last updated (Oldest first)
  • Last updated (Newest first)
  • Disputation date (earliest first)
  • Disputation date (latest first)
Select
The maximal number of hits you can export is 250. When you want to export more records please use the Create feeds function.
  • 1.
    Eriksson, Jonas
    et al.
    Linköping University, Department of Electrical Engineering, Communication Systems. Linköping University, The Institute of Technology.
    Moosavi, Reza
    Linköping University, Department of Electrical Engineering, Communication Systems. Linköping University, The Institute of Technology.
    Larsson, Erik G.
    Linköping University, Department of Electrical Engineering, Communication Systems. Linköping University, The Institute of Technology.
    Complexity Reduction of Blind Decoding Schemes Using CRC Splitting2012In: 2012 IEEE Global Communications Conference (GLOBECOM), IEEE , 2012, p. 3731-3736Conference 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.

  • 2.
    Eriksson, Jonas
    et al.
    Linköping University, Department of Electrical Engineering, Communication Systems. Linköping University, The Institute of Technology.
    Moosavi, Reza
    Linköping University, Department of Electrical Engineering, Communication Systems. Linköping University, Faculty of Science & Engineering.
    Larsson, Erik G.
    Linköping University, Department of Electrical Engineering, Communication Systems. Linköping University, The Institute of Technology.
    Wiberg, Niclas
    Ericsson AB, Sweden.
    Frenger, Pål
    Ericsson AB, Sweden.
    Gunnarsson, Fredrik
    Linköping University, Department of Electrical Engineering, Automatic Control. Linköping University, The Institute of Technology.
    On Coding of Scheduling Information in OFDM2009In: Proceedings of the 69th IEEE Vehicular Technology Conference, 2009Conference 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.

  • 3.
    Larsson, Erik G.
    et al.
    Linköping University, Department of Electrical Engineering, Communication Systems. Linköping University, The Institute of Technology.
    Moosavi, Reza
    Linköping University, Department of Electrical Engineering, Communication Systems. Linköping University, The Institute of Technology.
    Piggybacking an Additional Lonely Bit on Linearly Coded Payload Data2012In: IEEE Wireless Communications Letters, ISSN 2162-2337, Vol. 1, no 4, p. 292-295Article in journal (Other academic)
    Abstract [en]

    We provide a coding scheme, by which an additional lonely bit can be piggybacked on a payload data packet encoded with a linear channel code, at no essential extra cost in power or bandwidth. The underlying principle is to use the additional bit to select which of two linear codes that should be used for encoding the payload packet, this way effectively creating a nonlinear code. We give a fast algorithm for detecting the additional bit, without decoding the data packet. Applications include control signaling, for example, transmission of ACK/NACK bits

  • 4.
    Moosavi, Reza
    Linköping University, Department of Electrical Engineering, Communication Systems. Linköping University, The Institute of Technology.
    Aspects of Control Signaling in Wireless Multiple Access Systems2011Licentiate thesis, comprehensive summary (Other academic)
    Abstract [en]

    From its first appearance, wireless communications has changed thelife for many people worldwide. Currently, more than half of the world's population are using wireless devices for various purposes on a daily basis. While the early wireless systems could provide simple and specific low-rate services, today's systems can support a variety of more advanced services some of which require high data rate communications. This includes for example web-browsing and streaming multimedia applications. To meet the high demands on the current systems, many technical solutions have been proposed. Many of these solutions are powerful in the sense of boosting the system performance, but on the other hand, they impose a substantial control signaling overhead on the system. The control signaling refers to sending the control information that is necessary to establish and/or maintain the connection as opposed to the payload data that is transmitted during the connection.

    In this thesis, we are interested in evaluating the relations between the gain of deploying new techniques and the amount of control signaling overhead they incur. Moreover we are interested in finding efficient algorithms that can potentially reduce the control signaling overhead. More specifically, we first focus on the part of the control signaling overhead that concerns sending the scheduling assignments that describe how the channel resources are allocated among the users. We compare two ways for the signaling of scheduling assignments and we will study how different parameters such as scheduling granularity impact the control signaling overhead. We also provide two schemes that reduce the control signaling overhead substantially. We then provide an algorithm for fast blind identification of channel codes. This algorithm is very useful in improving the so-called blind decoding performance. This is essential since blind decoding is used to achieve adaptive modulation and coding in the control channel of some of the wireless communication systems such as 3GPP Long Term Evolution.

    List of papers
    1. Comparison of Strategies for Signaling of Scheduling Assignments in Wireless OFDMA
    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
    2. Reducing Physical Layer Control Signaling Using Mobile-Assisted Scheduling
    Open this publication in new window or tab >>Reducing Physical Layer Control Signaling Using Mobile-Assisted Scheduling
    2013 (English)In: IEEE Transactions on Wireless Communications, ISSN 1536-1276, E-ISSN 1558-2248, Vol. 12, no 1, p. 368-379Article in journal (Refereed) Published
    Abstract [en]

    We present a scheme for reducing the part of the downlink signaling  traffic in wireless multiple access systems that contains scheduling  information.  The theoretical basis of the scheme is that the  scheduling decisions made by the base station are correlated with  the CSI reports from the mobiles.  This correlation can be exploited  by the source coding scheme that is used to compress the scheduling  maps before they are sent to the mobiles. In the proposed scheme,  this idea is implemented by letting the mobiles make tentative  scheduling decisions themselves, and then letting the base station  transmit "agreement maps" instead of raw scheduling maps to the  mobiles.  The agreement maps have lower entropy and they require  less resources to be transmitted than the original scheduling maps  do. The improvement can be substantial.  We also model the task of  finding the optimal scheduling assignments according to the proposed  scheme as a combinatorial optimization problem and present an  efficient algorithm to find the optimal solution.

    Place, publisher, year, edition, pages
    IEEE, 2013
    Keywords
    Mobile-assisted scheduling; Control signaling; Resource allocation; Signaling overhead
    National Category
    Engineering and Technology
    Identifiers
    urn:nbn:se:liu:diva-68071 (URN)10.1109/TWC.2012.120312.120680 (DOI)000314178100035 ()
    Available from: 2011-05-10 Created: 2011-05-10 Last updated: 2017-12-11
    3. Differential Signaling of Scheduling Information in Wireless Multiple Access Systems
    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
    4. A Fast Scheme for Blind Identification of Channel  Codes
    Open this publication in new window or tab >>A Fast Scheme for Blind Identification of Channel  Codes
    2011 (English)Conference paper, Published paper (Refereed)
    Abstract [en]

    We present a fast mechanism for determining which channel code that was used on a communication link. In the proposed scheme, the receiver does not need to receive the entire data to determine the actual code. Moreover, the proposed scheme can also be used to determine the interleaving/scrambling sequence that was used at the transmitter. We investigate the performance of the scheme for some standard convolutional codes.

    Place, publisher, year, edition, pages
    IEEE, 2011
    Series
    IEEE Global Communications Conference, Exhibition, & Industry Forum (GLOBECOM), ISSN 1930-529X
    National Category
    Engineering and Technology
    Identifiers
    urn:nbn:se:liu:diva-68072 (URN)10.1109/GLOCOM.2011.6133507 (DOI)978-1-4244-9267-1 (ISBN)978-1-4244-9266-4 (ISBN)
    Conference
    54th Annual IEEE Global Telecommunications Conference: "Energizing Global Communications", GLOBECOM 2011; Houston, TX; United States
    Note

    ©2011 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 and Erik G. Larsson, A Fast Scheme for Blind Identification of Channel Codes, 2011, accepted The 54th IEEE Global Communications Conference (GLOBECOM).

    Available from: 2011-05-10 Created: 2011-05-10 Last updated: 2016-09-13
  • 5.
    Moosavi, Reza
    Linköping University, Department of Electrical Engineering, Communication Systems. Linköping University, The Institute of Technology.
    Improving the Efficiency of Control Signaling in Wireless Multiple Access Systems2014Doctoral thesis, comprehensive summary (Other academic)
    Abstract [en]

    Prior to the transmission of payload data in any multiple access system, there is generally a need to send control information such as scheduling assignments, transmission parameters and HARQ acknowledgments. This process is called control signaling and has a significant impact on the overall system performance. This dissertation considers different aspects of control signaling and proposes some novel schemes for improving it. The dissertation is split into two parts where in the first part the focus is on the transmission of scheduling assignments, and in the second part the focus is on improving the “blind decoding” process that is used to achieve adaptive coding and modulation in transmission of control information.

    More specifically, in the first part of the dissertation we first compare the two conventional schemes for control signaling using extensive system simulations. In doing so, we use practical assumptions on the scheduling algorithm as well as on the compression and transmission of the scheduling information. We then provide two schemes for reducing the amount of control signaling that concerns the transmission of scheduling assignments. The first scheme, which is reminiscent of source coding with side information, uses the knowledge that each user has about its own channel condition to compress the scheduling information more effectively. The second scheme uses the fact that in wireless multiple access systems, a user with a given channel condition can in principle decode the data intended to the users that have weaker channels. Therefore, the idea is to send the scheduling information of different terminals in a differential manner starting from the user with the weakest channel and letting all the terminals overhear the transmission of one another. Finally, in the last section of this part we use some of the recent results in information theory to form a general framework for the comparison of different control signaling schemes. We formulate an optimization problem that for a given desired error probability finds the minimum required number of channel uses for a given signaling scheme.

    In the second part of the thesis, we propose three schemes for reducing the complexity of the blind decoding process. The first one is a novel scheme for fast blind identification of channel codes. More precisely, we propose an efficient algorithm that for a given sequence of received symbols and a given linear channel code, finds the posterior probability that all the parity check relations of the code aresatisfied. We then use this quantity to perform a sequential statistical hypotheses test that reduces the computational complexity of blind decoding. The idea in the second scheme is to broadcast a control message prior to the transmission of control information to instruct only a subset of the terminals (ideally only those terminals that have been scheduled for reception of payload data and hence benefit from performing a blind search attempt) to perform blind search decoding, which can be used for instance in LTE to reduce the complexity of the blind decoding process. Finally, in the third scheme we propose to split the CRC, used by the terminals to find their control information, into two parts and inject one part early in the control data stream so that the terminals can detect early if the current decoding attempt will be successful, which ultimately reduces the blind decoding complexity.

    List of papers
    1. Comparison of Strategies for Signaling of Scheduling Assignments in Wireless OFDMA
    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
    2. Reducing Physical Layer Control Signaling Using Mobile-Assisted Scheduling
    Open this publication in new window or tab >>Reducing Physical Layer Control Signaling Using Mobile-Assisted Scheduling
    2013 (English)In: IEEE Transactions on Wireless Communications, ISSN 1536-1276, E-ISSN 1558-2248, Vol. 12, no 1, p. 368-379Article in journal (Refereed) Published
    Abstract [en]

    We present a scheme for reducing the part of the downlink signaling  traffic in wireless multiple access systems that contains scheduling  information.  The theoretical basis of the scheme is that the  scheduling decisions made by the base station are correlated with  the CSI reports from the mobiles.  This correlation can be exploited  by the source coding scheme that is used to compress the scheduling  maps before they are sent to the mobiles. In the proposed scheme,  this idea is implemented by letting the mobiles make tentative  scheduling decisions themselves, and then letting the base station  transmit "agreement maps" instead of raw scheduling maps to the  mobiles.  The agreement maps have lower entropy and they require  less resources to be transmitted than the original scheduling maps  do. The improvement can be substantial.  We also model the task of  finding the optimal scheduling assignments according to the proposed  scheme as a combinatorial optimization problem and present an  efficient algorithm to find the optimal solution.

    Place, publisher, year, edition, pages
    IEEE, 2013
    Keywords
    Mobile-assisted scheduling; Control signaling; Resource allocation; Signaling overhead
    National Category
    Engineering and Technology
    Identifiers
    urn:nbn:se:liu:diva-68071 (URN)10.1109/TWC.2012.120312.120680 (DOI)000314178100035 ()
    Available from: 2011-05-10 Created: 2011-05-10 Last updated: 2017-12-11
    3. Differential Signaling of Scheduling Information in Wireless Multiple Access Systems
    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
    4. Optimized Encoding of Scheduling Assignments Using Finite Blocklength Coding Bounds
    Open this publication in new window or tab >>Optimized Encoding of Scheduling Assignments Using Finite Blocklength Coding Bounds
    2014 (English)In: Wireless Communications Letters, IEEE, ISSN 2162-2337, Vol. PP, no 99, p. 1-4Article in journal (Refereed) Published
    Abstract [en]

    We provide an analytical framework for optimizing the resources required for signaling of control information in wireless multiple access systems. In doing so, we use recent results in information theory, namely a new bound on the achievable rate in the finite blocklength regime by Polyanskiy. We formulate optimization problems for finding the minimum required number of channel uses such that the overall error probability in decoding the control information is below a given threshold for three different control signaling schemes.

    National Category
    Engineering and Technology
    Identifiers
    urn:nbn:se:liu:diva-102534 (URN)10.1109/WCL.2014.022314.140009 (DOI)
    Note

    On the day of the defence date the status of this article was Manuscript.

    Available from: 2013-12-13 Created: 2013-12-13 Last updated: 2016-08-31Bibliographically approved
    5. Fast Blind Recognition of Channel Codes
    Open this publication in new window or tab >>Fast Blind Recognition of Channel Codes
    2014 (English)In: IEEE Transactions on Communications, ISSN 0090-6778, E-ISSN 1558-0857, Vol. 62, no 5, p. 1393-1405Article in journal (Refereed) Published
    Abstract [en]

    We present a fast algorithm that, for a given input sequence and a linear channel code, computes the syndrome posterior probability (SPP) of the code, i.e., the probability that all parity check relations of the code are satisfied. According to this algorithm, the SPP can be computed blindly, i.e., given the soft information on a received sequence we can compute the SPP for the code without first decoding the bits. We show that the proposed scheme is efficient by investigating its computational complexity.

    We then consider two scenarios where our proposed SPP algorithm can be used. The first scenario is when we are interested in finding out whether a certain code was used to encode a data stream. We formulate a statistical hypothesis test and we investigate its performance. We also compare the performance of our scheme with that of an existing scheme. The second scenario deals with how we can use the algorithm for reducing the computational complexity of blind decoding process, the process that, for instance, is used by terminals in LTE for detection of control information. We propose a heuristic sequential statistical hypotheses test to use the fact that in real applications, the data arrives sequentially, and we investigate its performance using system simulations.

    Place, publisher, year, edition, pages
    IEEE, 2014
    National Category
    Engineering and Technology
    Identifiers
    urn:nbn:se:liu:diva-102536 (URN)10.1109/TCOMM.2014.050614.130297 (DOI)000338028300001 ()
    Note

    On the day of the defence date the status of this article was Manuscript.

    Available from: 2013-12-13 Created: 2013-12-13 Last updated: 2017-12-06Bibliographically approved
    6. Fast Identification of Control Signaling Aided by Please-Decode-Blindly (PDB) Messages
    Open this publication in new window or tab >>Fast Identification of Control Signaling Aided by Please-Decode-Blindly (PDB) Messages
    2012 (English)In: 2012 Swedish Communication Technologies Workshop (Swe-CTW), IEEE Press, 2012, p. 53-58Conference paper, Published paper (Refereed)
    Abstract [en]

    Blind decoding of control information is used in some wireless  multiple access systems such as LTE to achieve adaptive modulation  and coding, as well as to address the multiple access problem on the  control channel. Blind decoding incurs high computational complexity in mobile terminals. In this paper, we describe a scheme to reduce  the computational complexity associated with the blind decoding. The  main idea is to broadcast a "please-decode-blindly" message to all  terminals that are eligible for scheduling, to instruct a subset of  the terminals to perform the blind search. We propose two schemes to  implement our idea and we investigate their performances via system  simulations.

    Place, publisher, year, edition, pages
    IEEE Press, 2012
    Keywords
    Blind decoding, Adaptive coding and modulation, Control signaling
    National Category
    Communication Systems
    Identifiers
    urn:nbn:se:liu:diva-82104 (URN)10.1109/Swe-CTW.2012.6376289 (DOI)978-1-4673-4762-4 (ISBN)978-1-4673-4761-7 (priint) (ISBN)
    Conference
    IEEE Swedish Communication Technologies Workshop (Swe-CTW), 24-26 October, Lund, Sweden
    Available from: 2012-09-30 Created: 2012-09-30 Last updated: 2016-08-31Bibliographically approved
    7. Complexity Reduction of Blind Decoding Schemes Using CRC Splitting
    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
  • 6.
    Moosavi, Reza
    et al.
    Linköping University, Department of Electrical Engineering, Communication Systems. Linköping University, The Institute of Technology.
    Eriksson, Jonas
    Linköping University, Department of Electrical Engineering, Communication Systems. Linköping University, The Institute of Technology.
    Larsson, Erik G.
    Linköping University, Department of Electrical Engineering, Communication Systems. Linköping University, The Institute of Technology.
    Differential Signaling of Scheduling Information in Wireless Multiple Access Systems2010In: Proceedings of the IEEE Global Communications Conference (GLOBECOM), 2010, p. 1-6Conference 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.

  • 7.
    Moosavi, Reza
    et al.
    Linköping University, Department of Electrical Engineering, Communication Systems. Linköping University, The Institute of Technology.
    Eriksson, Jonas
    Linköping University, Department of Electrical Engineering, Communication Systems. Linköping University, The Institute of Technology.
    Larsson, Erik G.
    Linköping University, Department of Electrical Engineering, Communication Systems. Linköping University, The Institute of Technology.
    Wiberg, Niclas
    Ericsson Research Center at Linköping.
    Frenger, Pål
    Ericsson Research Center at Linköping.
    Gunnarsson, Fredrik
    Ericsson Research Center at Linköping.
    Comparison of Strategies for Signaling of Scheduling Assignments in Wireless OFDMA2010In: IEEE Transactions on Vehicular Technology, ISSN 0018-9545, E-ISSN 1939-9359, Vol. 59, no 9, p. 4527-4542Article in journal (Refereed)
    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.

  • 8.
    Moosavi, Reza
    et al.
    Linköping University, Department of Electrical Engineering, Communication Systems. Linköping University, The Institute of Technology.
    Larsson, Erik G.
    Linköping University, Department of Electrical Engineering, Communication Systems. Linköping University, The Institute of Technology.
    A Fast Scheme for Blind Identification of Channel  Codes2011Conference paper (Refereed)
    Abstract [en]

    We present a fast mechanism for determining which channel code that was used on a communication link. In the proposed scheme, the receiver does not need to receive the entire data to determine the actual code. Moreover, the proposed scheme can also be used to determine the interleaving/scrambling sequence that was used at the transmitter. We investigate the performance of the scheme for some standard convolutional codes.

  • 9.
    Moosavi, Reza
    et al.
    Linköping University, Department of Electrical Engineering, Communication Systems. Linköping University, The Institute of Technology.
    Larsson, Erik G.
    Linköping University, Department of Electrical Engineering, Communication Systems. Linköping University, The Institute of Technology.
    Fast Blind Recognition of Channel Codes2014In: IEEE Transactions on Communications, ISSN 0090-6778, E-ISSN 1558-0857, Vol. 62, no 5, p. 1393-1405Article in journal (Refereed)
    Abstract [en]

    We present a fast algorithm that, for a given input sequence and a linear channel code, computes the syndrome posterior probability (SPP) of the code, i.e., the probability that all parity check relations of the code are satisfied. According to this algorithm, the SPP can be computed blindly, i.e., given the soft information on a received sequence we can compute the SPP for the code without first decoding the bits. We show that the proposed scheme is efficient by investigating its computational complexity.

    We then consider two scenarios where our proposed SPP algorithm can be used. The first scenario is when we are interested in finding out whether a certain code was used to encode a data stream. We formulate a statistical hypothesis test and we investigate its performance. We also compare the performance of our scheme with that of an existing scheme. The second scenario deals with how we can use the algorithm for reducing the computational complexity of blind decoding process, the process that, for instance, is used by terminals in LTE for detection of control information. We propose a heuristic sequential statistical hypotheses test to use the fact that in real applications, the data arrives sequentially, and we investigate its performance using system simulations.

  • 10.
    Moosavi, Reza
    et al.
    Linköping University, Department of Electrical Engineering, Communication Systems. Linköping University, The Institute of Technology.
    Larsson, Erik G.
    Linköping University, Department of Electrical Engineering, Communication Systems. Linköping University, The Institute of Technology.
    Fast Identification of Control Signaling Aided by Please-Decode-Blindly (PDB) Messages2012In: 2012 Swedish Communication Technologies Workshop (Swe-CTW), IEEE Press, 2012, p. 53-58Conference paper (Refereed)
    Abstract [en]

    Blind decoding of control information is used in some wireless  multiple access systems such as LTE to achieve adaptive modulation  and coding, as well as to address the multiple access problem on the  control channel. Blind decoding incurs high computational complexity in mobile terminals. In this paper, we describe a scheme to reduce  the computational complexity associated with the blind decoding. The  main idea is to broadcast a "please-decode-blindly" message to all  terminals that are eligible for scheduling, to instruct a subset of  the terminals to perform the blind search. We propose two schemes to  implement our idea and we investigate their performances via system  simulations.

  • 11.
    Moosavi, Reza
    et al.
    Linköping University, Department of Electrical Engineering, Communication Systems. Linköping University, The Institute of Technology.
    Larsson, Erik G.
    Linköping University, Department of Electrical Engineering, Communication Systems. Linköping University, The Institute of Technology.
    Optimized Encoding of Scheduling Assignments Using Finite Blocklength Coding Bounds2014In: Wireless Communications Letters, IEEE, ISSN 2162-2337, Vol. PP, no 99, p. 1-4Article in journal (Refereed)
    Abstract [en]

    We provide an analytical framework for optimizing the resources required for signaling of control information in wireless multiple access systems. In doing so, we use recent results in information theory, namely a new bound on the achievable rate in the finite blocklength regime by Polyanskiy. We formulate optimization problems for finding the minimum required number of channel uses such that the overall error probability in decoding the control information is below a given threshold for three different control signaling schemes.

  • 12.
    Moosavi, Reza
    et al.
    Linköping University, Department of Electrical Engineering, Communication Systems. Linköping University, The Institute of Technology.
    Larsson, Erik G.
    Linköping University, Department of Electrical Engineering, Communication Systems. Linköping University, The Institute of Technology.
    Reducing Downlink Signaling Traffic in Wireless Systems Using Mobile-Assisted Scheduling2010In: Proceedings of the IEEE Global Communications Conference (GLOBECOM), 2010, p. 1-5Conference paper (Refereed)
    Abstract [en]

    We present an idea to reduce the part of the downlink signaling traffic in wireless multiple access systems that contains scheduling information. The theoretical basis of the scheme is that the scheduling decisions made by the base station are correlated with the CSI reports from the mobiles. This correlation can be exploited by the source coding scheme that is used to compress the scheduling maps before they are sent to the mobiles. In the proposed scheme, this idea is implemented by letting the mobiles make tentative scheduling decisions themselves, and then letting the base station transmit "agreement maps" instead of raw scheduling maps to the mobiles. The agreement maps have lower entropy and they require less resources to be transmitted than the original scheduling maps do. The improvement can be substantial.

  • 13.
    Moosavi, Reza
    et al.
    Linköping University, Department of Electrical Engineering, Communication Systems. Linköping University, The Institute of Technology.
    Larsson, Erik G.
    Linköping University, Department of Electrical Engineering, Communication Systems. Linköping University, The Institute of Technology.
    Reducing Physical Layer Control Signaling Using Mobile-Assisted Scheduling2013In: IEEE Transactions on Wireless Communications, ISSN 1536-1276, E-ISSN 1558-2248, Vol. 12, no 1, p. 368-379Article in journal (Refereed)
    Abstract [en]

    We present a scheme for reducing the part of the downlink signaling  traffic in wireless multiple access systems that contains scheduling  information.  The theoretical basis of the scheme is that the  scheduling decisions made by the base station are correlated with  the CSI reports from the mobiles.  This correlation can be exploited  by the source coding scheme that is used to compress the scheduling  maps before they are sent to the mobiles. In the proposed scheme,  this idea is implemented by letting the mobiles make tentative  scheduling decisions themselves, and then letting the base station  transmit "agreement maps" instead of raw scheduling maps to the  mobiles.  The agreement maps have lower entropy and they require  less resources to be transmitted than the original scheduling maps  do. The improvement can be substantial.  We also model the task of  finding the optimal scheduling assignments according to the proposed  scheme as a combinatorial optimization problem and present an  efficient algorithm to find the optimal solution.

1 - 13 of 13
CiteExportLink to result list
Permanent link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • oxford
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf