• About
  • Policies
  • What is openaccess
  • Library
  • Contact
Advanced search
      View Item 
      •   BUIR Home
      • Scholarly Publications
      • Faculty of Engineering
      • Department of Electrical and Electronics Engineering
      • View Item
      •   BUIR Home
      • Scholarly Publications
      • Faculty of Engineering
      • Department of Electrical and Electronics Engineering
      • View Item
      JavaScript is disabled for your browser. Some features of this site may not work without it.

      Linear MMSE-optimal turbo equalization using context trees

      Thumbnail
      View / Download
      4.3 Mb
      Author
      Kim, K.
      Kalantarova, N.
      Kozat, S. S.
      Singer, A. C.
      Date
      2013
      Source Title
      IEEE Transactions on Signal Processing
      Print ISSN
      1053-587X
      Publisher
      IEEE
      Volume
      61
      Issue
      12
      Pages
      3041 - 3055
      Language
      English
      Type
      Article
      Item Usage Stats
      172
      views
      124
      downloads
      Abstract
      Formulations of the turbo equalization approach to iterative equalization and decoding vary greatly when channel knowledge is either partially or completely unknown. Maximum aposteriori probability (MAP) and minimum mean-square error (MMSE) approaches leverage channel knowledge to make explicit use of soft information (priors over the transmitted data bits) in a manner that is distinctly nonlinear, appearing either in a trellis formulation (MAP) or inside an inverted matrix (MMSE). To date, nearly all adaptive turbo equalization methods either estimate the channel or use a direct adaptation equalizer in which estimates of the transmitted data are formed from an expressly linear function of the received data and soft information, with this latter formulation being most common. We study a class of direct adaptation turbo equalizers that are both adaptive and nonlinear functions of the soft information from the decoder. We introduce piecewise linear models based on context trees that can adaptively approximate the nonlinear dependence of the equalizer on the soft information such that it can choose both the partition regions as well as the locally linear equalizer coefficients in each region independently, with computational complexity that remains of the order of a traditional direct adaptive linear equalizer. This approach is guaranteed to asymptotically achieve the performance of the best piecewise linear equalizer, and we quantify the MSE performance of the resulting algorithm and the convergence of its MSE to that of the linear minimum MSE estimator as the depth of the context tree and the data length increase.
      Keywords
      Context tree
      Context tree
      Decision feedback
      Nonlinear equalization
      Piecewise linear
      Turbo equalizations
      Equalizers
      Estimation
      Iterative decoding
      Knowledge management
      Nonlinear feedback
      Piecewise linear techniques
      Trees (mathematics)
      Permalink
      http://hdl.handle.net/11693/20934
      Published Version (Please cite this version)
      http://dx.doi.org/10.1109/TSP.2013.2256899
      Collections
      • Department of Electrical and Electronics Engineering 3524
      Show full item record

      Browse

      All of BUIRCommunities & CollectionsTitlesAuthorsAdvisorsBy Issue DateKeywordsTypeDepartmentsThis CollectionTitlesAuthorsAdvisorsBy Issue DateKeywordsTypeDepartments

      My Account

      Login

      Statistics

      View Usage StatisticsView Google Analytics Statistics

      Bilkent University

      If you have trouble accessing this page and need to request an alternate format, contact the site administrator. Phone: (312) 290 1771
      Copyright © Bilkent University - Library IT

      Contact Us | Send Feedback | Off-Campus Access | Admin | Privacy