Data input method for a holographic digital data storage system
View Patent ↗A data input method is applied to a holographic digital data storage system in which sequential binary input data bits are arranged in an interleaved manner among pages. A first data bit is arranged in a specific position of a predetermined page, a second data bit is arranged in a specific position having similar beam intensity with that of the first data bit. Using this method, the holographic digital data storage system can be less affected by the adverse effect of spatial beam intensity variations and makes the entire data interleaved automatically to obtain more stable output data.
1. A method for arranging input binary data bits among a plurality of pages to be stored in a holographic storage medium, each page including M×N storage positions, one data bit being arranged at one storage position,
wherein an X number of sequential binary data bits are arranged among successive Q pages and at least one data bit is arranged in each of Q pages, M, N, X, Q being positive integers greater than 1 and X being greater than Q,
wherein X=n×Q, with n being an integer smaller than M×N and n data bets are arranged in each of Q pages,
wherein the X number of data bits are arranged on an m bits per page basis at a time, m being a positive integer not greater than n,
wherein the X number of data bits are arranged at same positions in each page on an m bits per page basis at a time, and
wherein the m corresponds to 1.
2. The method of claim 1 , wherein the pages are consecutively sequenced.
3. The method of claim 2 , wherein if a binary differential coding is employed, original data bits are arranged at a specific position of odd(even) number pages among Q pages and inverse data bits of original data bits are arranged at the same position corresponding to the original data bits in even(odd) number pages among Q pages.
4. A method for arranging input binary data bits among a plurality of pages to be stored in a holographic storage medium, each page including M×N storage positions, one data bit being arranged at one storage position,
wherein an n×Q number of sequential binary data bits are arranged at same positions in each page among successive Q pages on an one bit per page basis at a time, n being an integer smaller than M×N and n data bits are arranged in each of Q pages, M, N, Q being positive integers greater than 1.
5. The method of claim 4 , wherein the pages are sequenced consecutively.
6. The method of claim 5 , wherein if a binary differential coding is employed, original data bits are arranged at a specific position of odd(even) number pages among Q pages and inverse data bits of original data bits are arranged at the same position corresponding to the original data bits in even(odd) number pages among Q pages.