Zobrazeno 1 - 7
of 7
pro vyhledávání: '"Youngjun Hwang"'
Autor:
Jongyoun Kim, Byeongjae Kang, Hyuntae Kim, Su Hyun Choi, Jaehyoung Park, Hyeonwoo Jung, Youngjun Hwang, Sin Kwon, Kyoohee Woo, Youngu Lee
Publikováno v:
Journal of Materials Research and Technology, Vol 28, Iss , Pp 131-138 (2024)
In the rapidly advancing field of electronics, there is a growing demand for devices to be miniaturized with high-resolution patterns and compact, straightforward configurations, all while maintaining cost competitiveness. Precision patterning of con
Externí odkaz:
https://doaj.org/article/e7d94b287fe84967931b7f6a6e61b135
Autor:
Hyeonwoo Jung, Jongyoun Kim, Jaehyoung Park, Muhammad Jahankhan, Youngjun Hwang, Byeongjae Kang, Hyerin Kim, Ho‐Yeol Park, Pyeongkang Ahn, DuHyeon Um, Je‐Sung Jee, Won Suk Shin, BongSoo Kim, Sung‐Ho Jin, Chang Eun Song, Youngu Lee
Publikováno v:
EcoMat, Vol 6, Iss 1, Pp n/a-n/a (2024)
Abstract The transition of polymer solar cells (PSCs) from laboratory‐scale unit cells to industrial‐scale modules requires the development of new p‐type polymers for high‐performance large‐area PSC modules based on environmentally friendly
Externí odkaz:
https://doaj.org/article/75f62c810de0481d907cf84f23f27666
Publikováno v:
GLOBECOM 2022 - 2022 IEEE Global Communications Conference.
Publikováno v:
IEEE Transactions on Broadcasting. 63:1-10
A low-complexity decoding scheme of low-density parity-check codes for the layered-division multiplexing (LDM) systems in ATSC 3.0 is proposed. Based on the unique characteristic of the LDM and the special structure of a parity-check matrix (PCM) for
Publikováno v:
IEEE Transactions on Broadcasting. 63:293-303
Gallager’s decoding algorithms ${B}$ (GDB) and ${E}$ (GDE) for low-density parity-check codes have much lower computational complexity and much less required memory size than the sum-product algorithm (SPA). This is because GDB and GDE only use bin
Publikováno v:
IET Communications. 9:1191-1198
The extended min-sum (EMS) and improved EMS (I-EMS) algorithms for non-binary low-density parity-check codes over GF(q) significantly reduce the decoding complexity with an acceptable performance degradation, but they suffer from high latency because
Publikováno v:
IET Communications (Wiley-Blackwell). 2015, Vol. 9 Issue 9, p1248-1257. 10p. 4 Diagrams, 2 Charts, 4 Graphs.