EE Seminar: Dana Kalinsky

~~Dana Kalinsky, 
M.Sc. student under the supervision of Prof. Simon Litsyn

Wednesday, January 21, 2015 at 15:00
Room 011, Kitot Bldg., Faculty of Engineering

New Bounds on the Capacity of (d,k)-RLL Codes

Abstract

The usage of run-length limited codes is very wide today in magnetic and optical storage as well as in fiber-optic and wireless communication applications. When dealing with one-dimensional systems we can achieve an exact capacity value of the code, that is the asymptotic information rate as defined by Shannon. The emergence of two-dimensional systems, for example holographic storage systems arises the challenge to calculate the capacity of higher dimensional run-length limited codes. In higher dimension systems exact capacity values are rare. One can find many attempts to overcome the calculation difficulties and to bound the capacity of high dimension run-length limited systems.
In this thesis we attempt to improve estimates of the capacity of two-dimensional run-length limited systems. By further developing the probability approach introduced by Schwartz and Vardy, we suggest a new method to calculate the capacity bound of run-length limited systems. We show that an improvement in the capacity bound is possible in some scenarios.
Specifically, for one-dimensional and two-dimensional run-length limited systems, (0,k)-RLL, we achieve better upper bounds when k is even. For one-dimensional systems we compare our results to the exact capacity values and show that our results converge to the exact capacity values as k grows.