Zobrazeno 1 - 9
of 9
pro vyhledávání: '"Jenn-Shiang Lai"'
Publikováno v:
2018 23rd Asia and South Pacific Design Automation Conference (ASP-DAC).
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::18c438d457a08c1af946bc6318232ea1
https://doi.org/10.1109/aspdac.2018.8297313
https://doi.org/10.1109/aspdac.2018.8297313
Autor:
Tsung-Fu Hsieh, Jin-Fu Li, Yung-Fa Chou, Chih-Yen Lo, Kuan-Te Wu, Jenn-Shiang Lai, Ding-Ming Kwai
Publikováno v:
ITC-Asia
Dynamic random access memory (DRAM) is one key component in modern electronic systems. In this paper, we propose a software-hardware-cooperated built-in self-test (SHC-BIST) scheme for the channel-based DRAMs. The testing of DRAMs consists of two maj
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::bb9d147c4798155af986a536d2e0d1a4
https://doi.org/10.1109/itc-asia.2017.8097122
https://doi.org/10.1109/itc-asia.2017.8097122
Autor:
Shigeki Tomishima, Yung-Fa Chou, Wang Chun-Kai, Yung-Ching Hsieh, Shih-Lien Lu, Der-Min Yuan, Chi-Kang Chen, Chun-Wei Lo, Ding-Ming Kwai, Zhe Wang, Wei Wu, Jenn-Shiang Lai, Tah-Kang Joseph Ting, Li-Chin Tien, Hsu Wen-Pin, Chun-Peng Wu, Pat Stolt, Gyh-Bin Wang, Ming-Hung Wang, Chien-Chih Huang
Publikováno v:
ISSCC
In recent years, the demand for memory performance has grown rapidly due to the increasing number of cores on a single CPU, along with the integration of graphics processing units and other accelerators. Caching has been a very effective way to relie
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::aad31c0ef6fea55b2452c143e4569533
https://doi.org/10.1109/isscc.2017.7870432
https://doi.org/10.1109/isscc.2017.7870432
Autor:
Yun-Chao Yu, Kuan-Te Wu, Jenn-Shiang Lai, Chao-Hsun Chen, Ding-Ming Kwai, Chi-Chun Yang, Yung-Fa Chou, Chih-Yen Lo, Jin-Fu Li
Publikováno v:
VLSI-DAT
This paper proposes a hybrid BIST scheme for DRAMs. The hybrid BIST consists of a microcode-based controller to support the programmability of test algorithms and an FSM-based controller to support the in-field programmability of configuration parame
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::d6f4ccfce0d5553b910fa6685bde9404
https://doi.org/10.1109/vlsi-dat.2015.7114502
https://doi.org/10.1109/vlsi-dat.2015.7114502
Autor:
Chao-Hsun Chen, Chi-Chun Yang, Cheng-Wen Wu, Yung-Fa Chou, Jenn-Shiang Lai, Yun-Chao Yu, Jin-Fu Li, Chih-Yen Lo, Ding-Ming Kwai
Publikováno v:
ATS
Three-dimensional dynamic random access memory (3D DRAM) using through-silicon via (TSV) has been acknowledged as one good approach for overcoming the memory wall. However, the IO-channel power of a TSV-based 3D DRAM represents a significant portion
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::20da255161e8e3a50fd7e95929583e15
https://doi.org/10.1109/ats.2014.13
https://doi.org/10.1109/ats.2014.13
Publikováno v:
ISCAS
Scopus-Elsevier
Scopus-Elsevier
This paper presents a novel technique to map the minimum vertex cover and related problems onto the Hopfield neural networks. The proposed approach can be used to find near-optimum solutions for these problems in parallel, and particularly the networ
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::f5374bfb2b60afd4be6094d825e4fd04
https://doi.org/10.1109/iscas.1994.409578
https://doi.org/10.1109/iscas.1994.409578
Publikováno v:
Lecture Notes in Computer Science ISBN: 9783540568919
PARLE
PARLE
In [1], Lee, Funabiki and Takefuji proposed a parallel algorithm for solving the bipartite subgraph problem with the maximum neural networks. In this paper, we present a new algorithm based on the discrete Hopfield network to deal with the same probl
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::72ff209ed0abf24cda173f52e559bf72
https://doi.org/10.1007/3-540-56891-3_34
https://doi.org/10.1007/3-540-56891-3_34
Publikováno v:
Proceedings of IEEE International Symposium on Circuits & Systems - ISCAS '94; 1994, Issue 6, p269-269, 1p
Conference
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.