2D Page Interleaving for Even Burst Error Dispersion
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Conventional interleaving techniques are inadequate in evenly spreading two-dimensional burst errors across an entire page in communication and information storage systems, particularly in holographic data storage, as they were developed for linear data input/output and fail to secure a consistent dispersion distance.
Innovation Solution
A two-dimensional interleaving method that divides a data page into blocks, rearranges block numbers to ensure a minimum dispersion distance between pixels of the same index in adjacent blocks, and relocates pixels using a specific mapping equation to create a modified page where neighboring pixels are spaced evenly apart, thereby spreading burst errors uniformly across the page.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If conventional interleaving techniques (block interleaver, cyclic shift interleaver, helical interleaver, random interleaver) are used, then data can be processed in a linear manner, but two-dimensional burst errors cannot be evenly spread across the entire page
Solution Approach 1:
The patent transitions from conventional one-dimensional linear interleaving to two-dimensional interleaving by dividing the data page into N×N blocks arranged in a two-dimensional grid. The block indices are rearranged using a two-dimensional mapping function that considers both row and column positions, enabling burst errors to be dispersed across the entire two-dimensional page area rather than along a linear path.
Solution Approach 2:
The data page is segmented into N×N blocks, where each block contains N×N pixels. This segmentation allows independent manipulation of block positions while maintaining the overall two-dimensional structure. By treating blocks as discrete units that can be rearranged, the system achieves better error dispersion while preserving data organization.
2Ease of manufacture
If data is processed in a linear manner with conventional interleavers, then implementation is simple, but dispersion distance between error-affected pixels is not consistent
Solution Approach 1:
The patent introduces a structured parameter-based approach using block indices (i, j) and a mapping function that transforms these indices to new positions (i', j') based on mathematical relationships. This parameter transformation ensures consistent dispersion distance D between pixels that were originally adjacent, while maintaining algorithmic simplicity through deterministic index calculations.
Solution Approach 2:
The block index mapping function serves as an intermediary that mediates between the original two-dimensional block positions and the rearranged positions. This intermediary transformation layer ensures that dispersion distance requirements are met while keeping the overall system structure simple and implementable through straightforward index calculations.
Data Source
AI summary
A two-dimensional interleaving method is provided. The two-dimensional interleaving method includes dividing a first page having N2×N2 pixels, N being a natural number, into a plurality of blocks, wherein each of the plurality of blocks includes N×N pixels, rearranging each of the plurality of the blocks of the first page into a second page, wherein each of two index located at same position in two adjacent block of the first page, respectively, is rearranged to have at least a dispersion distance D in the second page, and relocating an index pixel located at same position of each of the plurality of the blocks of the first page into a k-th block of the second page.