Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • 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
Fast Blind Recognition of Channel Codes
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
2014 (English)In: IEEE Transactions on Communications, ISSN 0090-6778, E-ISSN 1558-0857, Vol. 62, no 5, 1393-1405 p.Article 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. Vol. 62, no 5, 1393-1405 p.
National Category
Engineering and Technology
Identifiers
URN: urn:nbn:se:liu:diva-102536DOI: 10.1109/TCOMM.2014.050614.130297ISI: 000338028300001OAI: oai:DiVA.org:liu-102536DiVA: diva2:678868
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
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.
Series
Linköping Studies in Science and Technology. Dissertations, ISSN 0345-7524 ; 1556
National Category
Engineering and Technology
Identifiers
urn:nbn:se:liu:diva-102537 (URN)10.3384/diss.diva-102537 (DOI)978-91-7519-477-6 (ISBN)
Public defence
2014-01-17, Visionen, B-huset, Campus Valla, Linköpings universitet, Linköping, 13:15 (English)
Opponent
Supervisors
Available from: 2013-12-13 Created: 2013-12-13 Last updated: 2016-08-31Bibliographically approved

Open Access in DiVA

fulltext(311 kB)389 downloads
File information
File name FULLTEXT01.pdfFile size 311 kBChecksum SHA-512
40f59447b15b91aca05a23ce30d0a330dff4102d735d99cbfedce08e132ad3b032adbe15d67614273926d7978ad41f550cd8d679a52ce4da4e692860222991a9
Type fulltextMimetype application/pdf

Other links

Publisher's full text

Search in DiVA

By author/editor
Moosavi, RezaLarsson, Erik G.
By organisation
Communication SystemsThe Institute of Technology
In the same journal
IEEE Transactions on Communications
Engineering and Technology

Search outside of DiVA

GoogleGoogle Scholar
Total: 389 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

doi
urn-nbn

Altmetric score

doi
urn-nbn
Total: 704 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • 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