Zobrazeno 1 - 10
of 13
pro vyhledávání: '"Ting-Yi Wu"'
Publikováno v:
IEEE Communications Letters. 27:1080-1084
Publikováno v:
IEEE Transactions on Industry Applications. 54:5609-5620
During the past one to two decades, the probabilistic forecasting of a wind-power generation has been regarded as a necessary input to decisions made for the purpose of reliable and economic power systems operations, especially since the penetration
Publikováno v:
IEEE Transactions on Communications. 66:1859-1870
Due to the growing interest in applying tail-biting convolutional coding techniques in real-time communication systems, fast decoding of tail-biting convolutional codes has become an important research direction. In this paper, a new maximum-likeliho
Publikováno v:
IEEE Communications Letters. 22:474-477
We propose an efficient tree search algorithm for determining the free distance of variable-length error-correcting codes (VLECs). A main idea behind the algorithm is to structure all pairs of code word-concatenated sequences as a tree, in which we s
Publikováno v:
IEEE Transactions on Industry Applications. 53:5139-5149
This study examines the optimal layout of an offshore wind farm for a fixed number of wind turbines (WTs) and a fixed area of coverage. After the optimal layout of the turbines is determined, the topology of the cable connections is optimized. The wi
Publikováno v:
ISIT
Constrained coding is used widely in digital communication and storage systems. In this paper, we study a generalized sliding window constraint called the skip-sliding window. A skip-sliding window (SSW) code is defined in terms of the length $L$ of
This work investigates the fundamental limits of communication over a noisy discrete memoryless channel that wears out, in the sense of signal-dependent catastrophic failure. In particular, we consider a channel that starts as a memoryless binary-inp
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::554a1d3d526cbea4db489d7354976df8
Publikováno v:
IEEE Transactions on Communications. 61:3553-3565
A joint source-channel coding problem that combines the efficient compression of discrete memoryless sources with their reliable communication over memoryless channels via binary prefix-free variable-length error-correcting codes (VLECs) is considere
Publikováno v:
IEEE Transactions on Communications. 58:3459-3469
In order to release the growing demand for computational complexity with respect to increasing information sequence length in the priority-first search decoding algorithm, a path elimination modification is proposed and also analyzed in this work. Sp
Publikováno v:
IEEE Transactions on Communications. 58:3175-3185
Variable length codes (VLCs) are widely adopted in many compression standards due to their good coding efficiency on average codeword length. However, an inherent problem with a VLC is that an error of even one bit can cause serious error propagation