A Memory-Efficient Compensation Algorithm for Vertical Crosstalk in 8K LCD Panelsopen access
- Authors
- Lee, Yongwoo; Choi, Kiwon; Park, Hyeryoung; Kim, Yong Ju; Choi, Kookhyun; Jeon, Jae-Hong; Ko, Min Jae
- Issue Date
- Oct-2025
- Publisher
- MDPI
- Keywords
- LCD; vertical crosstalk; compensation algorithm; high-resolution display
- Citation
- ELECTRONICS, v.14, no.19, pp 1 - 12
- Pages
- 12
- Indexed
- SCIE
SCOPUS
- Journal Title
- ELECTRONICS
- Volume
- 14
- Number
- 19
- Start Page
- 1
- End Page
- 12
- URI
- https://scholarworks.bwise.kr/hanyang/handle/2021.sw.hanyang/209091
- DOI
- 10.3390/electronics14193965
- ISSN
- 2079-9292
2079-9292
- Abstract
- As ultra-high resolution liquid crystal displays (LCDs) advance, crosstalk has become a critical challenge due to the reduced spacing of electronic circuits and increased signal frequencies. In particular, vertical crosstalk (V-CT) in vertical-alignment LCDs arises mainly from fringing electric fields generated by data lines, along with secondary contributions from data line–pixel coupling effect, thin-film transistor leakage, and other factors. To resolve V-CT, we propose a memory-efficient compensation algorithm implemented on a field-programmable gate array as a customized timing controller. The proposed algorithm achieves compensation accuracy within 2% while significantly reducing memory requirements. A conventional 7680 × 4320 pixel LCD panel requires approximately 796 MB of memory for compensation data, whereas our method reduces this to only 0.37 MB—a nearly 2000-fold reduction—by referencing only preceding pixel information. This approach enables cost-effective implementation, faster processing, and enhanced image quality. Overall, the proposed method provides a practical and scalable solution for resolving V-CT in 8K LCD panels, establishing a new benchmark for high-resolution display technologies.
- Files in This Item
-
Go to Link
- Appears in
Collections - 서울 공과대학 > 서울 화학공학과 > 1. Journal Articles

Items in ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.