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

Direct link
Complexity Reduction of Blind Decoding Schemes Using CRC Splitting
Linköping University, Department of Electrical Engineering, Communication Systems. Linköping University, The Institute of Technology.
Linköping University, Department of Electrical Engineering, Communication Systems. Linköping University, The Institute of Technology.
Linköping University, Department of Electrical Engineering, Communication Systems. Linköping University, The Institute of Technology.ORCID iD: 0000-0002-7599-4367
2012 (English)In: 2012 IEEE Global Communications Conference (GLOBECOM), IEEE , 2012, 3731-3736 p.Conference 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. 3731-3736 p.
, IEEE Global Communications Conference, Exhibition, & Industry Forum (GLOBECOM), ISSN 1930-529X
Keyword [en]
Blind decoding, Adaptive coding and modulation, CRC splitting, Code detection
National Category
Communication Systems
URN: urn:nbn:se:liu:diva-79226DOI: 10.1109/GLOCOM.2012.6503697ISBN: 978-1-4673-0919-6 (online)ISBN: 978-1-4673-0920-2 (print)OAI: diva2:539218
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
In thesis
1. Improving the Efficiency of Control Signaling in Wireless Multiple Access Systems
Open this publication in new window or tab >>Improving the Efficiency of Control Signaling in Wireless Multiple Access Systems
2014 (English)Doctoral 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.

Place, publisher, year, edition, pages
Linköping: Linköping University Electronic Press, 2014. 36 p.
Linköping Studies in Science and Technology. Dissertations, ISSN 0345-7524 ; 1556
National Category
Engineering and Technology
urn:nbn:se:liu:diva-102537 (URN)10.3384/diss.diva-102537 (DOI)978-91-7519-477-6 (print) (ISBN)
Public defence
2014-01-17, Visionen, B-huset, Campus Valla, Linköpings universitet, Linköping, 13:15 (English)
Available from: 2013-12-13 Created: 2013-12-13 Last updated: 2016-08-31Bibliographically approved

Open Access in DiVA

Complexity Reduction of Blind Decoding Schemes Using CRC Splitting(268 kB)360 downloads
File information
File name FULLTEXT01.pdfFile size 268 kBChecksum SHA-512
Type fulltextMimetype application/pdf

Other links

Publisher's full text

Search in DiVA

By author/editor
Eriksson, JonasMoosavi, RezaLarsson, Erik G.
By organisation
Communication SystemsThe Institute of Technology
Communication Systems

Search outside of DiVA

GoogleGoogle Scholar
Total: 360 downloads
The number of downloads is the sum of all downloads of full texts. It may include eg previous versions that are now no longer available

Altmetric score

Total: 394 hits
ReferencesLink to record
Permanent link

Direct link