Abstract: The system and method for inverse halftoning using a partitioning look-up table (LUT) provides an improvement on a conventional LUT method for inverse halftoning, and a hardware implementation thereof. The method includes the partitioning of the single LUT into N smaller look-up tables (s-LUTs). After partitioning, N s-LUTs are generated, which can be stored in separate memory blocks, allowing parallel access to more than one s-LUT at any time. Such parallelization is not possible with only one LUT stored in a single memory block. Additionally, two or more templates (represented as r templates) with different pixels at position 0 can be retrieved from the halftone image concurrently. Further, the contents of the single LUT are partitioned into Ns-LUTs, thus the total entries in Ns-LUTs are equal to the entries in the single LUT of the conventional LUT based method of inverse halftoning.

Abstract: The system and method for inverse halftoning using a partitioning look-up table (LUT) provides an improvement on a conventional LUT method for inverse halftoning, and a hardware implementation thereof. The method includes the partitioning of the single LUT into N smaller look-up tables (s-LUTs). After partitioning, N s-LUTs are generated, which can be stored in separate memory blocks, allowing parallel access to more than one s-LUT at any time. Such parallelization is not possible with only one LUT stored in a single memory block. Additionally, two or more templates (represented as r templates) with different pixels at position 0 can be retrieved from the halftone image concurrently. Further, the contents of the single LUT are partitioned into Ns-LUTs, thus the total entries in Ns-LUTs are equal to the entries in the single LUT of the conventional LUT based method of inverse halftoning.