Shiva K. Planjery

Learn More
—It is now well established that iterative decoding approaches the performance of Maximum Likelihood Decoding of sparse graph codes, asymptotically in the block length. For a finite length sparse code, iterative decoding fails on specific subgraphs generically termed as trapping sets. Trapping sets give rise to error floor, an abrupt degradation of the code(More)
In present day wireless applications, especially for time-varying channels, we require flexible coding schemes that utilize a minimum of bandwidth and can support different code rates. In addition, we require coding schemes that are simple in terms of complexity but give good performance. Recently a special class of turbo-like codes called repeat accumulate(More)
  • 1