Border Handling for 2D Transpose Filter Structures on an FPGA
AbstractIt is sometimes desirable to implement filters using a transpose-form filter structure. However, managing image borders is generally considered more complex than it is with the more commonly used direct-form structure. This paper explores border handling for transpose-form filters, and proposes two novel mechanisms: transformation coalescing, and combination chain modification. For linear filters, coefficient coalescing can effectively exploit the digital signal processing blocks, resulting in the smallest resources requirements. Combination chain modification requires similar resources to direct-form border handling. It is demonstrated that the combination chain multiplexing can be split into two stages, consisting of a combination network followed by the transpose-form combination chain. The resulting transpose-form border handling networks are of similar complexity to the direct-form networks, enabling the transpose-form filter structure to be used where required. The transpose form is also significantly faster, being automatically pipelined by the filter structure. Of the border extension methods, zero-extension requires the least resources. View Full-Text
Share & Cite This Article
Bailey, D.G.; Ambikumar, A.S. Border Handling for 2D Transpose Filter Structures on an FPGA. J. Imaging 2018, 4, 138.
Bailey DG, Ambikumar AS. Border Handling for 2D Transpose Filter Structures on an FPGA. Journal of Imaging. 2018; 4(12):138.Chicago/Turabian Style
Bailey, Donald G.; Ambikumar, Anoop S. 2018. "Border Handling for 2D Transpose Filter Structures on an FPGA." J. Imaging 4, no. 12: 138.
Note that from the first issue of 2016, MDPI journals use article numbers instead of page numbers. See further details here.