The Experts below are selected from a list of 44871 Experts worldwide ranked by ideXlab platform
T I Yuk - One of the best experts on this subject based on the ideXlab platform.
-
exact evaluation of block error rate using Correct Probability for space time codes
International Symposium on Information Theory, 2007Co-Authors: Z Zhang, S W Cheung, T I YukAbstract:Union bound based on pair-wise error Probability (PEP) has been widely used for error-rate performance evaluation of space-time (S-T) codes. At low signal-to-noise ratios (SNRs), the PEP is not very accurate, leading to a loose union bound. A numerical integration method using Correct Probability is proposed in this paper for the evaluation of block-error rate (BLER) of S-T codes. Numerical results have shown that the proposed method can provide exact BLER evaluation for S-T codes.
-
ISIT - Exact Evaluation of Block-Error Rate Using Correct Probability for Space-Time Codes
2007 IEEE International Symposium on Information Theory, 2007Co-Authors: Z Zhang, S W Cheung, T I YukAbstract:Union bound based on pair-wise error Probability (PEP) has been widely used for error-rate performance evaluation of space-time (S-T) codes. At low signal-to-noise ratios (SNRs), the PEP is not very accurate, leading to a loose union bound. A numerical integration method using Correct Probability is proposed in this paper for the evaluation of block-error rate (BLER) of S-T codes. Numerical results have shown that the proposed method can provide exact BLER evaluation for S-T codes.
-
Upper bound for block-error rate of S-T codes
Electronics Letters, 2007Co-Authors: Z Zhang, S W Cheung, T I YukAbstract:A novel upper bound is proposed using Correct Probability for evaluation of block-error rate of space-time codes at low signal-to-noise ratio. Analytical and numerical results show that, at low SNR, the proposed bound is tighter and more accurate than that of the Union Bound using the pair-wise error Probability.
Z Zhang - One of the best experts on this subject based on the ideXlab platform.
-
exact evaluation of block error rate using Correct Probability for space time codes
International Symposium on Information Theory, 2007Co-Authors: Z Zhang, S W Cheung, T I YukAbstract:Union bound based on pair-wise error Probability (PEP) has been widely used for error-rate performance evaluation of space-time (S-T) codes. At low signal-to-noise ratios (SNRs), the PEP is not very accurate, leading to a loose union bound. A numerical integration method using Correct Probability is proposed in this paper for the evaluation of block-error rate (BLER) of S-T codes. Numerical results have shown that the proposed method can provide exact BLER evaluation for S-T codes.
-
ISIT - Exact Evaluation of Block-Error Rate Using Correct Probability for Space-Time Codes
2007 IEEE International Symposium on Information Theory, 2007Co-Authors: Z Zhang, S W Cheung, T I YukAbstract:Union bound based on pair-wise error Probability (PEP) has been widely used for error-rate performance evaluation of space-time (S-T) codes. At low signal-to-noise ratios (SNRs), the PEP is not very accurate, leading to a loose union bound. A numerical integration method using Correct Probability is proposed in this paper for the evaluation of block-error rate (BLER) of S-T codes. Numerical results have shown that the proposed method can provide exact BLER evaluation for S-T codes.
-
Upper bound for block-error rate of S-T codes
Electronics Letters, 2007Co-Authors: Z Zhang, S W Cheung, T I YukAbstract:A novel upper bound is proposed using Correct Probability for evaluation of block-error rate of space-time codes at low signal-to-noise ratio. Analytical and numerical results show that, at low SNR, the proposed bound is tighter and more accurate than that of the Union Bound using the pair-wise error Probability.
Yasutada Oohama - One of the best experts on this subject based on the ideXlab platform.
-
On a Relationship between the Correct Probability of Estimation from Correlated Data and Mutual Information
IEICE Transactions on Fundamentals of Electronics Communications and Computer Sciences, 2018Co-Authors: Yasutada OohamaAbstract:Let $X$, $Y$ be two correlated discrete random variables. We consider an estimation of $X$ from encoded data $\varphi(Y)$ of $Y$ by some encoder function $\varphi(Y)$. We derive an inequality describing a relation of the Correct Probability of estimation and the mutual information between $X$ and $\varphi(Y)$. This inequality may be useful for the secure analysis of crypto system when we use the success Probability of estimating secret data as a security criterion. It also provides an intuitive meaning of the secrecy exponent in the strong secrecy criterion.
-
Exponent Function for Stationary Memoryless Channels with Input Cost at Rates above the Capacity.
arXiv: Information Theory, 2017Co-Authors: Yasutada OohamaAbstract:We consider the stationaly memoryless channels with input cost. We prove that for transmission rates above the capacity the Correct Probability of decoding tends to zero exponentially as the block length $n$ of codes tends to infinity. In the case where both of channel input and output sets are finite, we determine the optimal exponent function on the above exponential decay of the Correct Probability. To derive this result we use a new technique called the recuresive method, which is based on the information spectrum approach. The recursive method utilize a certain recursive structure on the information spectrum quantities.
-
ITW - Strong converse for state dependent channels with full state information at the sender and partial state information at the receiver
2016 IEEE Information Theory Workshop (ITW), 2016Co-Authors: Yasutada OohamaAbstract:We consider the state dependent channels with full state information with at the sender and partial state information at the receiver. For this state dependent channel, the channel capacity under rate constraint on the state information at the decoder was determined by Steinberg. In this paper, we study the Correct Probability of decoding at rates above the capacity. We prove that when the transmission rate is above the capacity this Probability goes to zero exponentially and derive an explicit lower bound of this exponent function.
-
Strong Converse Exponent for State Dependent Channels With Full State Information at the Sender
arXiv: Information Theory, 2016Co-Authors: Yasutada OohamaAbstract:We consider the state dependent channels with full state information with at the sender. For this state dependent channel, the channel capacity was determined by Gel'fand and Pinsker. In this paper, we study the Correct Probability of decoding at rates above the capacity. We prove that when the transmission rate is above the capacity this Probability goes to zero exponentially and derive an explicit lower bound of this exponent function.
-
Strong Converse Exponent for State Dependent Channels with Full State Information at the Sender and Partial State Information at the Receiver
arXiv: Information Theory, 2016Co-Authors: Yasutada OohamaAbstract:We consider the state dependent channels with full state information with at the sender and partial state information at the receiver. For this state dependent channel, the channel capacity under rate constraint on the state information at the decoder was determined by Steinberg. In this paper, we study the Correct Probability of decoding at rates above the capacity. We prove that when the transmission rate is above the capacity this Probability goes to zero exponentially and derive an explicit lower bound of this exponent function.
S W Cheung - One of the best experts on this subject based on the ideXlab platform.
-
exact evaluation of block error rate using Correct Probability for space time codes
International Symposium on Information Theory, 2007Co-Authors: Z Zhang, S W Cheung, T I YukAbstract:Union bound based on pair-wise error Probability (PEP) has been widely used for error-rate performance evaluation of space-time (S-T) codes. At low signal-to-noise ratios (SNRs), the PEP is not very accurate, leading to a loose union bound. A numerical integration method using Correct Probability is proposed in this paper for the evaluation of block-error rate (BLER) of S-T codes. Numerical results have shown that the proposed method can provide exact BLER evaluation for S-T codes.
-
ISIT - Exact Evaluation of Block-Error Rate Using Correct Probability for Space-Time Codes
2007 IEEE International Symposium on Information Theory, 2007Co-Authors: Z Zhang, S W Cheung, T I YukAbstract:Union bound based on pair-wise error Probability (PEP) has been widely used for error-rate performance evaluation of space-time (S-T) codes. At low signal-to-noise ratios (SNRs), the PEP is not very accurate, leading to a loose union bound. A numerical integration method using Correct Probability is proposed in this paper for the evaluation of block-error rate (BLER) of S-T codes. Numerical results have shown that the proposed method can provide exact BLER evaluation for S-T codes.
-
Upper bound for block-error rate of S-T codes
Electronics Letters, 2007Co-Authors: Z Zhang, S W Cheung, T I YukAbstract:A novel upper bound is proposed using Correct Probability for evaluation of block-error rate of space-time codes at low signal-to-noise ratio. Analytical and numerical results show that, at low SNR, the proposed bound is tighter and more accurate than that of the Union Bound using the pair-wise error Probability.
Kentaro Kato - One of the best experts on this subject based on the ideXlab platform.
-
Upper Bounds on Optimal Correct Probability of Quantum State Discrimination with and without Inconclusive Results
arXiv: Quantum Physics, 2016Co-Authors: Kenji Nakahira, Tsuyoshi Sasaki Usuda, Kentaro KatoAbstract:We propose an upper bound on the maximum Correct Probability of quantum measurements. The proposed bound is obtained by a suboptimal solution to the dual problem of the optimal state discrimination problems. We derive that a slightly modified version of the proposed bound is tighter than that proposed by Qiu et al. [Phys. Rev. A 81, 042329 (2010)]. We also propose an upper bound on the maximum Correct Probability with a fixed rate of inconclusive results. The performance of the proposed bounds are evaluated through numerical experiments.
