Min-Kuan Chang

Min-Kuan Chang


Research Focus & Metrics

Academic Career Length

15Years (2012-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications

26 August 2024 in IEEE Communications Letters
Verified
Journal Article
Closed access
MCMin-Kuan Chang
Min-Kuan Chang
CHChun-Tse Hsu
Chun-Tse Hsu
GYGuu-Chang Yang
Guu-Chang Yang
The current mindset of semantic communications focuses on how to have the sentence received exactly. However, as long as the received sentence and the original sentence are perceived the same or similarly, it can be reviewed as a successful semantic-level transmission. Hence, we design a new architecture for the semantic communication system based on BART-like model [1], called GenSC. The proposed GenSC further takes the token-level correlation between consecutive tokens into account during the semantic encoding and this bidirectional correlation helps correct or fill in a “semantically similar token” at the semantic decoder when a token is missing or corrupted during transmission. The simulation shows that compared to conventional approaches such as [2] and [3], GenSC can improve the bilingual evaluation understudy (BLEU) and semantic similarity (SS) scores at low SNR regions a lot and enjoy higher BLEU and SS scores at high SNR regions. When SNR is 0dB, GenSC outperforms [2] and [3] by around 30% (resp. 84%) and 18% (resp. 55%) in terms of BLEU (resp. SS), respectively.

29 December 2020 in IEEE Transactions on Communications
Verified
Journal Article
Closed access
KWKuo-Guan Wu
Kuo-Guan Wu
FCFeng-Tsun Chien
Feng-Tsun Chien
YLYu-Feng Lin
Yu-Feng Lin
MCMin-Kuan Chang
Min-Kuan Chang
We first investigate the accumulated loopback self-interference (ALSI) under amplify-and-forward (AF) protocol in two-way full-duplex (TWFD) relaying systems with simultaneous wireless information and power transfer (SWIPT). We analyze how SWIPT affects ALSI and establish the condition for ALSI to converge when there is no energy buffer. Unlike ALSI in TWFD relaying without SWIPT (Chang et al., 2019), ALSI in TWFD relaying with SWIPT always converges and does not grow unbounded. In addition, we study the delay performance in such a system under AF and decode-and-forward (DF) protocols. In AF protocol, the condition for successful signal transmissions is provided. When that condition is met, the received signals at the relay can always get through the channels but experience delays. Otherwise, the outage event occurs. In DF protocol, the best-effort scenario (having no energy buffer) and the QoS scenario (having energy buffer) are discussed. The probability of successful transmissions and the distribution of the delay in both scenarios are derived. Simulation results of DF protocol show that the best-effort scenario is suitable for the delay-tolerant service and the QoS scenario is suitable for the delay-sensitive service. Furthermore, AF protocol is more suitable for the service with less QoS demanding.

20 February 2013 in Wireless Networks
Verified
Journal Article
Closed access
PDF file
YCYu-Wei Chan
Yu-Wei Chan
FCFeng-Tsun Chien
Feng-Tsun Chien
RCRonald Y. Chang
Ronald Y. Chang
MCMin-Kuan Chang
Min-Kuan Chang
YCYeh-Ching Chung
Yeh-Ching Chung

9 August 2015 in Multimedia Tools and Applications
Verified
Journal Article
Closed access
PDF file
Guo-Shiang LinGuo-Shiang Lin
Guo-Shiang Lin
MCMin-Kuan Chang
Min-Kuan Chang
YCYu-Jui Chang
Yu-Jui Chang
Chia-Hung YehChia-Hung Yeh
Chia-Hung Yeh

14 August 2019 in EURASIP Journal on Advances in Signal Processing
Verified
Journal Article
Open access
PDF file
Chih-Yang LinChih-Yang Lin
Chih-Yang Lin
LKLi-Wei Kang
Li-Wei Kang
THTsung-Yi Huang
Tsung-Yi Huang
MCMin-Kuan Chang
Min-Kuan Chang
The decomposition of Chinese characters is difficult and has been rarely investigated in the literature. In this paper, we propose a novel non-negative matrix factorization (NMF) technique to decompose a Chinese character into several graphical components without considering the strokes of the character or any semantic or phonetic properties of the components. Chinese characters can usually be represented as binary images. However, traditional NMF is only suitable for representing general gray-level or color images. To decompose a binary image using NMF, we force all of the elements of the two matrices (obtained by factorizing the binary image/matrix to be decomposed) as close to 0 or 1 as possible. As a result, a Chinese character can be efficiently decomposed into several components, where each component is semantically unreadable. Moreover, our NMF-based Chinese character decomposition method is suitable for applications in visual secret sharing by distributing the shares (different character components) among multiple parties, so that only when the parties are taken together with their respective shares can the secret (the original Chinese character(s)) be reconstructed. Experimental results have verified the decomposition performance and the feasibility of the proposed method.