Min-Kuan Chang
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Min-Kuan Chang has a total of 38 co-authors. Here are the top co-authors by number of shared publications:
- Feng-Tsun Chien
Institute of Electronics, National Yang Ming Chiao Tung University, Hsinchu, Taiwan
7 shared publications - Guu-Chang Yang
Department of Electrical Engineering and the Graduate Institute of Communication Engineering, National Chung Hsing University, Taichung City, Taiwan
3 shared publications - Yu-Wei Chan
Chung Chou University of Science and Technology
3 shared publications - Yu-Wei Chan
Bachelor Degree Program of Artificial Intelligence, National Taichung University of Science and Technology, Taichung 404336, Taiwan
3 shared publications - Chia-Hung Yeh
Department of Electrical Engineering, National Taiwan Normal University, Taipei 10610, Taiwan
2 shared publications Feng-Wen Lo
Department of Electrical Engineering, Graduate Institute of Communication Engineering, National Chung Hsing University, Taichung, Taiwan
2 shared publications
Latest Publications
- 26 August 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Communications Letters
- Vol. 28 (10) , 2298-2302
GenSC: Generative Semantic Communication Systems Using BART-Like Model
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.
- 26 August 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Communications Letters
- Vol. 28 (10) , 2298-2302
GenSC: Generative Semantic Communication Systems Using BART-Like Model
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 May 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Internet of Things Journal
- Vol. 10 (20) , 18346-18363
An Improved Two-Hop Rendezvous Model With Buffer-Aided Relays in Channel-Hopping Cognitive-Radio Wireless Networks for Internet of Things
In this article, two-hop transmissions in channel-hopping (CH) cognitive-radio wireless networks (CRWNs) with buffer-aided relays are studied. The two-hop relay (rendezvous) model is improved using symmetric CH sequences, which are more suitable for practical CRWNs than the old model using asymmetric ones. A proper buffer storage size in the relays is formulated to minimize the two-hop data-transfer latency. The lower and upper bounds of the steady-state maximum-time-to-rendezvous (MTTR) and throughput with relays are derived with formal proofs. Using the proper buffer size, both metrics can be better controlled and found no worse than twice the original MTTR and throughput without relays. To explore the impacts of utilization probability of Internet of Things (IoT) devices to their performances in a small-scale CRWN, the single-region rendezvous-success (RS) rate and throughput are formulated. For a large-scale CRWN, the model is extended to formulate the multiregion RS rate and throughput with and without relays for the first time. Numerical studies of these analytical models are performed and validated with computer simulations. In summary, the transmission range and number of rendezvousing IoT devices are improved in the large-scale CRWN with relays, and the multiregion RS rate and throughput with relays are found better than those without relays.
- 29 May 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Internet of Things Journal
- Vol. 10 (20) , 18346-18363
An Improved Two-Hop Rendezvous Model With Buffer-Aided Relays in Channel-Hopping Cognitive-Radio Wireless Networks for Internet of Things
In this article, two-hop transmissions in channel-hopping (CH) cognitive-radio wireless networks (CRWNs) with buffer-aided relays are studied. The two-hop relay (rendezvous) model is improved using symmetric CH sequences, which are more suitable for practical CRWNs than the old model using asymmetric ones. A proper buffer storage size in the relays is formulated to minimize the two-hop data-transfer latency. The lower and upper bounds of the steady-state maximum-time-to-rendezvous (MTTR) and throughput with relays are derived with formal proofs. Using the proper buffer size, both metrics can be better controlled and found no worse than twice the original MTTR and throughput without relays. To explore the impacts of utilization probability of Internet of Things (IoT) devices to their performances in a small-scale CRWN, the single-region rendezvous-success (RS) rate and throughput are formulated. For a large-scale CRWN, the model is extended to formulate the multiregion RS rate and throughput with and without relays for the first time. Numerical studies of these analytical models are performed and validated with computer simulations. In summary, the transmission range and number of rendezvousing IoT devices are improved in the large-scale CRWN with relays, and the multiregion RS rate and throughput with relays are found better than those without relays.
- 24 May 2023
- Published by Springer Nature
- p. 67-76
Communication-Efficient Federated Learning with Model Pruning
- 24 May 2023
- Published by Springer Nature
- p. 67-76
Communication-Efficient Federated Learning with Model Pruning
- 6 January 2021
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Communications Letters
- Vol. 25 (5) , 1729-1733
Two-Hop Transmissions in Asynchronous Channel-Hopping Cognitive Radio Wireless Networks With Buffer-Aided Relays
Due to physical constraints or channel impairments, direct (one-hop) communications among secondary nodes may not be possible in cognitive-radio wireless networks (CRWNs). In this letter, the rendezvous problems of two-hop transmissions using a relay node with buffer of different sizes in channel-hopping (CH) CRWNs are studied. A two-hop rendezvous protocol operating with suitable asynchronous CH sequences is proposed. A new performance metric, maximum time-to-rendezvous-with-relay (MTTRr), and throughput are derived for different buffer sizes. The studies find that (i) both MTTRr and throughput improve as the buffer size increases but see no further improvement beyond a certain buffer size, and (ii) the proposed two-hop rendezvous model has only slight performance penalties as compared to the conventional (one-hop) counterpart.
- 6 January 2021
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Communications Letters
- Vol. 25 (5) , 1729-1733
Two-Hop Transmissions in Asynchronous Channel-Hopping Cognitive Radio Wireless Networks With Buffer-Aided Relays
Due to physical constraints or channel impairments, direct (one-hop) communications among secondary nodes may not be possible in cognitive-radio wireless networks (CRWNs). In this letter, the rendezvous problems of two-hop transmissions using a relay node with buffer of different sizes in channel-hopping (CH) CRWNs are studied. A two-hop rendezvous protocol operating with suitable asynchronous CH sequences is proposed. A new performance metric, maximum time-to-rendezvous-with-relay (MTTRr), and throughput are derived for different buffer sizes. The studies find that (i) both MTTRr and throughput improve as the buffer size increases but see no further improvement beyond a certain buffer size, and (ii) the proposed two-hop rendezvous model has only slight performance penalties as compared to the conventional (one-hop) counterpart.
- 29 December 2020
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Communications
- Vol. 69 (4) , 2148-2162
SINR and Delay Analyses in Two-Way Full-Duplex SWIPT-Enabled Relaying Systems
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.
- 29 December 2020
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Communications
- Vol. 69 (4) , 2148-2162
SINR and Delay Analyses in Two-Way Full-Duplex SWIPT-Enabled Relaying Systems
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.
- Open Access
- 3 February 2020
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 8, 24385-24396
A Coalitional Graph Game Approach for Minimum Transmission Broadcast in IoT Networks
In this work, we consider the broadcast mechanisms for both reliable links and unreliable links in the Internet of Things (IoT) networks. Focusing on the minimum transmission broadcast (MTB) problem, we propose an efficient algorithm, termed as the Connected Dominating Set Algorithm based on Coalitional Graph Game (CDSA-CGG), to find the minimum connected dominating set (MCDS). Distinct from related work in the literature which adopts a non-cooperative game approach and assumes the interaction among nodes is limited to neighboring nodes, we formulate the interaction and cooperation among nodes over reliable links and over unreliable links as a connected forwarding graph based on coalitional graph game. We prove that the forwarding graph constructed by CDSA-CGG is a Nash network. In addition, we also prove that the final resulting graph is pairwise stable. The simulation results show that the proposed coalition graph game-based algorithm performs well in terms of the number of transmissions, convergence rate, and lifetime of nodes.
- 3 February 2020
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 8, 24385-24396
Open AccessA Coalitional Graph Game Approach for Minimum Transmission Broadcast in IoT Networks
In this work, we consider the broadcast mechanisms for both reliable links and unreliable links in the Internet of Things (IoT) networks. Focusing on the minimum transmission broadcast (MTB) problem, we propose an efficient algorithm, termed as the Connected Dominating Set Algorithm based on Coalitional Graph Game (CDSA-CGG), to find the minimum connected dominating set (MCDS). Distinct from related work in the literature which adopts a non-cooperative game approach and assumes the interaction among nodes is limited to neighboring nodes, we formulate the interaction and cooperation among nodes over reliable links and over unreliable links as a connected forwarding graph based on coalitional graph game. We prove that the forwarding graph constructed by CDSA-CGG is a Nash network. In addition, we also prove that the final resulting graph is pairwise stable. The simulation results show that the proposed coalition graph game-based algorithm performs well in terms of the number of transmissions, convergence rate, and lifetime of nodes.
- Open Access
- 14 August 2019
- Published by Springer Nature in EURASIP Journal on Advances in Signal Processing
- Vol. 2019 (1) , 1-8
A novel non-negative matrix factorization technique for decomposition of Chinese characters with application to secret sharing
- 14 August 2019
- Published by Springer Nature in EURASIP Journal on Advances in Signal Processing
- Vol. 2019 (1) , 1-8
Open AccessA novel non-negative matrix factorization technique for decomposition of Chinese characters with application to secret sharing
- 19 May 2019
- Published by Springer Nature in Lecture Notes in Electrical Engineering
- p. 364-369
A Coalitional Graph Game Framework for Broadcasting in Wireless Networks
- 19 May 2019
- Published by Springer Nature in Lecture Notes in Electrical Engineering
- p. 364-369
A Coalitional Graph Game Framework for Broadcasting in Wireless Networks
- 15 February 2019
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Communications
- Vol. 67 (5) , 3167-3181
On the Accumulated Loopback Self-Interference of Two-Way Full-Duplex AF Relaying Systems
- 15 February 2019
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Communications
- Vol. 67 (5) , 3167-3181
On the Accumulated Loopback Self-Interference of Two-Way Full-Duplex AF Relaying Systems
- 19 January 2019
- Published by Springer Nature in The Journal of Supercomputing
- Vol. 76 (8) , 6195-6218
Matching game-based hierarchical spectrum sharing in cooperative cognitive radio networks
- 19 January 2019
- Published by Springer Nature in The Journal of Supercomputing
- Vol. 76 (8) , 6195-6218
Matching game-based hierarchical spectrum sharing in cooperative cognitive radio networks