The Experts below are selected from a list of 5277 Experts worldwide ranked by ideXlab platform

Oscar C. Au - One of the best experts on this subject based on the ideXlab platform.

  • Error recovery of variable length code over BSC with arbitrary Crossover Probability
    IEEE Transactions on Communications, 2010
    Co-Authors: Jiantao Zhou, Oscar C. Au
    Abstract:

    The error recovery capability of variable length code (VLC) has been considered as an important performance and design criterion in addition to its coding efficiency. However, almost all of the existing methods for evaluating the error recovery capability of VLC assume that the transmission fault is a random single bit inversion. In this paper, we consider a more generalized problem of precisely evaluating the error recovery capability of VLC in the case that the encoded bit stream is transmitted over a BSC with arbitrary Crossover Probability. By making use of the Perron-Frobenius Theorem, we derive a very simple expression for the exact mean error propagation rate (MEPR), and show that the variance of error propagation rate (VEPR) is zero. We also prove that in the regime of very low Crossover Probability, the mean error propagation length (MEPL) derived for single inversion error case approaches a scaled value of the MEPR. Furthermore, we briefly discuss the problem of evaluating the error detection capability of non-exhaustive code over BSC.

  • Error recovery of variable length codes over BSC with arbitrary Crossover Probability
    2008 IEEE International Symposium on Information Theory, 2008
    Co-Authors: Jiantao Zhou, Oscar C. Au, Peter Hon-wah Wong
    Abstract:

    The error recovery capability of variable length code (VLC) has been considered as an important performance and design criterion in addition to its coding efficiency. However, almost all of the existing methods for evaluating the error recovery capability of VLC assume that the transmission fault is a random single bit inversion. In this paper, we consider a more generalized problem of precisely evaluating the error recovery capability of VLC in the case that the encoded bit stream is transmitted over a BSC with arbitrary Crossover Probability. By making use of the Perron-Frobenius Theorem, we derive a very simple expression for the exact mean symbol error rate (MSER) in Levenshtein distance sense. We also prove that in the very low Crossover Probability region, the mean error propagation length (MEPL) derived for single inversion error case approaches a scaled value of MSER. In addition, we briefly discuss the error recovery of VLC over Gilbert-Elliott channel, which is one of the simplest and practical models for a channel with memory.

  • ISIT - Error recovery of variable length codes over BSC with arbitrary Crossover Probability
    2008 IEEE International Symposium on Information Theory, 2008
    Co-Authors: Jiantao Zhou, Oscar C. Au, P. Hon-wah Wong
    Abstract:

    The error recovery capability of variable length code (VLC) has been considered as an important performance and design criterion in addition to its coding efficiency. However, almost all of the existing methods for evaluating the error recovery capability of VLC assume that the transmission fault is a random single bit inversion. In this paper, we consider a more generalized problem of precisely evaluating the error recovery capability of VLC in the case that the encoded bit stream is transmitted over a BSC with arbitrary Crossover Probability. By making use of the Perron-Frobenius Theorem, we derive a very simple expression for the exact mean symbol error rate (MSER) in Levenshtein distance sense. We also prove that in the very low Crossover Probability region, the mean error propagation length (MEPL) derived for single inversion error case approaches a scaled value of MSER. In addition, we briefly discuss the error recovery of VLC over Gilbert-Elliott channel, which is one of the simplest and practical models for a channel with memory.

  • Exact Symbol Error Rate for Variable Length Codes Over Binary Symmetric Channel
    2007 IEEE International Conference on Acoustics Speech and Signal Processing - ICASSP '07, 2007
    Co-Authors: Jiantao Zhou, Zhiqin Liang, Oscar C. Au
    Abstract:

    In this paper, we analyze the error recovery performance of variable length codes (VLCs) transmitted over binary symmetric channel (BSC). Simple expressions for the exact mean symbol error rate (MSER) and the exact variance of symbol error rate (VSER) for any Crossover Probability pe are presented. We also prove that the mean error propagation length (MEPE) derived for single bit inversion error case is a scaled value of MSER when pe tends to zero. Comparisons with simulations demonstrate the accuracy of the MSER and VSER expressions.

Jiantao Zhou - One of the best experts on this subject based on the ideXlab platform.

  • Error recovery of variable length code over BSC with arbitrary Crossover Probability
    IEEE Transactions on Communications, 2010
    Co-Authors: Jiantao Zhou, Oscar C. Au
    Abstract:

    The error recovery capability of variable length code (VLC) has been considered as an important performance and design criterion in addition to its coding efficiency. However, almost all of the existing methods for evaluating the error recovery capability of VLC assume that the transmission fault is a random single bit inversion. In this paper, we consider a more generalized problem of precisely evaluating the error recovery capability of VLC in the case that the encoded bit stream is transmitted over a BSC with arbitrary Crossover Probability. By making use of the Perron-Frobenius Theorem, we derive a very simple expression for the exact mean error propagation rate (MEPR), and show that the variance of error propagation rate (VEPR) is zero. We also prove that in the regime of very low Crossover Probability, the mean error propagation length (MEPL) derived for single inversion error case approaches a scaled value of the MEPR. Furthermore, we briefly discuss the problem of evaluating the error detection capability of non-exhaustive code over BSC.

  • Error recovery of variable length codes over BSC with arbitrary Crossover Probability
    2008 IEEE International Symposium on Information Theory, 2008
    Co-Authors: Jiantao Zhou, Oscar C. Au, Peter Hon-wah Wong
    Abstract:

    The error recovery capability of variable length code (VLC) has been considered as an important performance and design criterion in addition to its coding efficiency. However, almost all of the existing methods for evaluating the error recovery capability of VLC assume that the transmission fault is a random single bit inversion. In this paper, we consider a more generalized problem of precisely evaluating the error recovery capability of VLC in the case that the encoded bit stream is transmitted over a BSC with arbitrary Crossover Probability. By making use of the Perron-Frobenius Theorem, we derive a very simple expression for the exact mean symbol error rate (MSER) in Levenshtein distance sense. We also prove that in the very low Crossover Probability region, the mean error propagation length (MEPL) derived for single inversion error case approaches a scaled value of MSER. In addition, we briefly discuss the error recovery of VLC over Gilbert-Elliott channel, which is one of the simplest and practical models for a channel with memory.

  • ISIT - Error recovery of variable length codes over BSC with arbitrary Crossover Probability
    2008 IEEE International Symposium on Information Theory, 2008
    Co-Authors: Jiantao Zhou, Oscar C. Au, P. Hon-wah Wong
    Abstract:

    The error recovery capability of variable length code (VLC) has been considered as an important performance and design criterion in addition to its coding efficiency. However, almost all of the existing methods for evaluating the error recovery capability of VLC assume that the transmission fault is a random single bit inversion. In this paper, we consider a more generalized problem of precisely evaluating the error recovery capability of VLC in the case that the encoded bit stream is transmitted over a BSC with arbitrary Crossover Probability. By making use of the Perron-Frobenius Theorem, we derive a very simple expression for the exact mean symbol error rate (MSER) in Levenshtein distance sense. We also prove that in the very low Crossover Probability region, the mean error propagation length (MEPL) derived for single inversion error case approaches a scaled value of MSER. In addition, we briefly discuss the error recovery of VLC over Gilbert-Elliott channel, which is one of the simplest and practical models for a channel with memory.

  • Exact Symbol Error Rate for Variable Length Codes Over Binary Symmetric Channel
    2007 IEEE International Conference on Acoustics Speech and Signal Processing - ICASSP '07, 2007
    Co-Authors: Jiantao Zhou, Zhiqin Liang, Oscar C. Au
    Abstract:

    In this paper, we analyze the error recovery performance of variable length codes (VLCs) transmitted over binary symmetric channel (BSC). Simple expressions for the exact mean symbol error rate (MSER) and the exact variance of symbol error rate (VSER) for any Crossover Probability pe are presented. We also prove that the mean error propagation length (MEPE) derived for single bit inversion error case is a scaled value of MSER when pe tends to zero. Comparisons with simulations demonstrate the accuracy of the MSER and VSER expressions.

H. Chen - One of the best experts on this subject based on the ideXlab platform.

  • Distributed estimation over binary symmetric channels in wireless sensor networks
    IET Wireless Sensor Systems, 2011
    Co-Authors: B. Xu, M. Zeng, H. Chen
    Abstract:

    The problem of estimating an unknown parameter in wireless sensor networks with a fusion centre (FC) is studied. Each sensor observation is quantised as a result of the bandwidth constraint and then each quantised observation is transmitted to the FC over a binary symmetric channel (BSC). Under this setting, some estimators have been proposed but the maximum likelihood estimator (MLE) as well as the impact of the parameters of BSCs on the estimation performance are rarely considered. Assuming that the same one-bit quantiser is adopted at every sensor, the MLE and the Cramer - Rao lower bound (CRLB) are derived based on the quantised observations transmitted over BSCs. The impact of the capacity and the Crossover Probability of BSCs on the performance of the MLE and the CRLB are highlighted. The results reveal that the capacity of BSCs greatly influences both the performance of the MLE and the CRLB. It is also shown that both the performance of the MLE and the CRLB have the symmetric property with respect to the Crossover Probability of BSCs.

  • Distributed estimation over binary symmetric channels in wireless sensor networks
    IET Wireless Sensor Systems, 2011
    Co-Authors: B. Xu, M. Zeng, H. Chen
    Abstract:

    The problem of estimating an unknown parameter in wireless sensor networks with a fusion centre (FC) is studied. Each sensor observation is quantised as a result of the bandwidth constraint and then each quantised observation is transmitted to the FC over a binary symmetric channel (BSC). Under this setting, some estimators have been proposed but the maximum likelihood estimator (MLE) as well as the impact of the parameters of BSCs on the estimation performance are rarely considered. Assuming that the same one-bit quantiser is adopted at every sensor, the MLE and the Cramér - Rao lower bound (CRLB) are derived based on the quantised observations transmitted over BSCs. The impact of the capacity and the Crossover Probability of BSCs on the performance of the MLE and the CRLB are highlighted. The results reveal that the capacity of BSCs greatly influences both the performance of the MLE and the CRLB. It is also shown that both the performance of the MLE and the CRLB have the symmetric property with respect to the Crossover Probability of BSCs.

Andrew C. Singer - One of the best experts on this subject based on the ideXlab platform.

  • Bayesian Sequential Detection for the BSC with Unknown Crossover Probability
    2006 IEEE International Symposium on Information Theory, 2006
    Co-Authors: Jill K. Nelson, Andrew C. Singer
    Abstract:

    We propose a novel scheme for detecting coded data transmitted over a communication channel that is either partially or entirely unknown. Viewing the unknown channel parameters as stochastic quantities drawn from a known Probability distribution, the likelihood of a sequence of data is derived using Bayesian techniques. A stack-like tree search algorithm is proposed for implementation of maximum likelihood (ML) sequence detection under the Bayesian metric. We apply the Bayesian scheme to the binary symmetric channel (BSC) with unknown Crossover Probability. The structure of the resulting metric is compared to both the conventional Fano metric and a universal metric presented in (Lapidoth and Ziv, IEEE Trans. IT 1999). Based on its relationship to the metric developed by Lapidoth and Ziv, the newly-derived metric is shown to be pairwise universal over the ensemble of random uniform codes

  • ISIT - Bayesian Sequential Detection for the BSC with Unknown Crossover Probability
    2006 IEEE International Symposium on Information Theory, 2006
    Co-Authors: Jill K. Nelson, Andrew C. Singer
    Abstract:

    We propose a novel scheme for detecting coded data transmitted over a communication channel that is either partially or entirely unknown. Viewing the unknown channel parameters as stochastic quantities drawn from a known Probability distribution, the likelihood of a sequence of data is derived using Bayesian techniques. A stack-like tree search algorithm is proposed for implementation of maximum likelihood (ML) sequence detection under the Bayesian metric. We apply the Bayesian scheme to the binary symmetric channel (BSC) with unknown Crossover Probability. The structure of the resulting metric is compared to both the conventional Fano metric and a universal metric presented in (Lapidoth and Ziv, IEEE Trans. IT 1999). Based on its relationship to the metric developed by Lapidoth and Ziv, the newly-derived metric is shown to be pairwise universal over the ensemble of random uniform codes.

B. Xu - One of the best experts on this subject based on the ideXlab platform.

  • Distributed estimation over binary symmetric channels in wireless sensor networks
    IET Wireless Sensor Systems, 2011
    Co-Authors: B. Xu, M. Zeng, H. Chen
    Abstract:

    The problem of estimating an unknown parameter in wireless sensor networks with a fusion centre (FC) is studied. Each sensor observation is quantised as a result of the bandwidth constraint and then each quantised observation is transmitted to the FC over a binary symmetric channel (BSC). Under this setting, some estimators have been proposed but the maximum likelihood estimator (MLE) as well as the impact of the parameters of BSCs on the estimation performance are rarely considered. Assuming that the same one-bit quantiser is adopted at every sensor, the MLE and the Cramer - Rao lower bound (CRLB) are derived based on the quantised observations transmitted over BSCs. The impact of the capacity and the Crossover Probability of BSCs on the performance of the MLE and the CRLB are highlighted. The results reveal that the capacity of BSCs greatly influences both the performance of the MLE and the CRLB. It is also shown that both the performance of the MLE and the CRLB have the symmetric property with respect to the Crossover Probability of BSCs.

  • Distributed estimation over binary symmetric channels in wireless sensor networks
    IET Wireless Sensor Systems, 2011
    Co-Authors: B. Xu, M. Zeng, H. Chen
    Abstract:

    The problem of estimating an unknown parameter in wireless sensor networks with a fusion centre (FC) is studied. Each sensor observation is quantised as a result of the bandwidth constraint and then each quantised observation is transmitted to the FC over a binary symmetric channel (BSC). Under this setting, some estimators have been proposed but the maximum likelihood estimator (MLE) as well as the impact of the parameters of BSCs on the estimation performance are rarely considered. Assuming that the same one-bit quantiser is adopted at every sensor, the MLE and the Cramér - Rao lower bound (CRLB) are derived based on the quantised observations transmitted over BSCs. The impact of the capacity and the Crossover Probability of BSCs on the performance of the MLE and the CRLB are highlighted. The results reveal that the capacity of BSCs greatly influences both the performance of the MLE and the CRLB. It is also shown that both the performance of the MLE and the CRLB have the symmetric property with respect to the Crossover Probability of BSCs.