The Experts below are selected from a list of 5133 Experts worldwide ranked by ideXlab platform
M.r. Titchener - One of the best experts on this subject based on the ideXlab platform.
-
The synchronization of Variable-Length Codes
IEEE Transactions on Information Theory, 1997Co-Authors: M.r. TitchenerAbstract:Many Variable-Length Codes exhibit a tendency for resynchronization to occur automatically following any error. However, attempts to identify an underlying synchronization mechanism, and to accurately predict the expected synchronization delay, for even quite specific Variable-Length Codes, appear to have been largely unsuccessful. The present paper explores a novel method for estimating the synchronization performance for a wide variety of Variable-Length Codes, based on the T-Codes. T-Codes are a class of self-synchronizing Codes, which typically synchronize within 2-3 Codewords by a mechanism that derives from a recursive T-augmentation construction. It is observed that the T-Code mechanism for synchronization is followed, more or less, by other Variable-Length Codes wherever substantial numbers of Codewords are shared with a T-Code set. T-augmentation itself provides a means for assessing the contribution individual Codewords make to the overall synchronization process for a T-Code set. Thus Codeword differences between sets may be specifically evaluated to estimate the synchronization performance of a Variable-Length Code set from a closely related T-Code set.
J. Hagenauer - One of the best experts on this subject based on the ideXlab platform.
-
Iterative source/channel decoding based on a trellis representation for Variable Length Codes
2000 IEEE International Symposium on Information Theory (Cat. No.00CH37060), 1Co-Authors: R. Bauer, J. HagenauerAbstract:A new trellis representation for Variable Length Codes (VLC) is proposed which allows soft-in/soft-out decoding of these Codes. Applying the BCJR-algorithm on this trellis either symbol-level or bit-level reliability information for the Variable Length Coded sequence can be obtained. By using this soft-in/soft-out VLC deCoder for iterative ("turbo") decoding of a serially concatenated scheme consisting of an outer Variable Length Code and an inner convolutional Code separated by an interleaver significant gains can be yielded compared to a instantaneously deCoded Variable Length Code of the same overall source and channel Code rate.
-
Data Compression Conference - Iterative source/channel-decoding using reversible Variable Length Codes
Proceedings DCC 2000. Data Compression Conference, 1Co-Authors: R. Bauer, J. HagenauerAbstract:In this paper we describe a trellis representation of Variable Length Coded data which is capable of being used for bit-level or symbol-level maximum a posteriori (MAP) decoding of Variable Length Codes (VLC). A bit-level soft-input/soft-output module is derived and is applied in an iterative decoding structure consisting of an outer Variable Length Code and an inner convolutional Code. Due to their inherent redundancy reversible Variable Length Codes (RVLC) yield good results with this system. We present simulation results in terms of symbol error rate performance when the data is transmitted over a fully interleaved Rayleigh fading channel using BPSK modulation. As measure for the symbol error rate the Levenshtein distance is used which regards the self-synchronizing properties of Variable Length Codes better than a simple symbol-by-symbol comparison.
Shengchi Wu - One of the best experts on this subject based on the ideXlab platform.
-
the construction of binary huffman equivalent Codes with a greater number of synchronising Codewords
Ubiquitous Computing, 2012Co-Authors: Yuhming Huang, Shengchi WuAbstract:An inherent problem with a Variable-Length Code (VLC) is that even a single bit error can cause a loss of synchronisation, and thus lead to error propagation. Codeword synchronisation has been extensively studied as a means to overcome this drawback and efficiently stop error propagation. In this paper, we first present the sufficient and necessary conditions for the existence of binary Huffman equivalent Codes with the shortest, or at most two shortest, synchronising Codeword(s) of Length m + 1, where m (>1) is the shortest Codeword Length. Next, based on the results, we propose a unified approach for constructing each of these binary Huffman equivalent Codes with the shortest, or at most two shortest, synchronising Codeword(s) of Length m + 1, if such a Code exists for a given Length vector.
-
shortest synchronizing Codewords of a binary huffman equivalent Code
International Conference on Information Technology: Coding and Computing, 2003Co-Authors: Yuhming Huang, Shengchi WuAbstract:The inherent problem of a Variable-Length Code is that even a single bit error can cause loss of synchronization and may lead to error propagation. Synchronizing Codewords have been extensively studies as a mean to overcome the drawback and efficiently stop error propagation. First we prove the restatement of a result originally given by B. Ruder (1971) in a more straightforward way. Next, we present the necessary conditions for the existence of a binary Huffman equivalent Code with shortest synchronizing Codeword(s). Finally, with the help of derived conditional equations, a unified approach for constructing a binary Huffman equivalent Code with most shortest synchronizing Codeword(s) and most other synchronizing Codewords is proposed also.
R. Bauer - One of the best experts on this subject based on the ideXlab platform.
-
Iterative source/channel decoding based on a trellis representation for Variable Length Codes
2000 IEEE International Symposium on Information Theory (Cat. No.00CH37060), 1Co-Authors: R. Bauer, J. HagenauerAbstract:A new trellis representation for Variable Length Codes (VLC) is proposed which allows soft-in/soft-out decoding of these Codes. Applying the BCJR-algorithm on this trellis either symbol-level or bit-level reliability information for the Variable Length Coded sequence can be obtained. By using this soft-in/soft-out VLC deCoder for iterative ("turbo") decoding of a serially concatenated scheme consisting of an outer Variable Length Code and an inner convolutional Code separated by an interleaver significant gains can be yielded compared to a instantaneously deCoded Variable Length Code of the same overall source and channel Code rate.
-
Data Compression Conference - Iterative source/channel-decoding using reversible Variable Length Codes
Proceedings DCC 2000. Data Compression Conference, 1Co-Authors: R. Bauer, J. HagenauerAbstract:In this paper we describe a trellis representation of Variable Length Coded data which is capable of being used for bit-level or symbol-level maximum a posteriori (MAP) decoding of Variable Length Codes (VLC). A bit-level soft-input/soft-output module is derived and is applied in an iterative decoding structure consisting of an outer Variable Length Code and an inner convolutional Code. Due to their inherent redundancy reversible Variable Length Codes (RVLC) yield good results with this system. We present simulation results in terms of symbol error rate performance when the data is transmitted over a fully interleaved Rayleigh fading channel using BPSK modulation. As measure for the symbol error rate the Levenshtein distance is used which regards the self-synchronizing properties of Variable Length Codes better than a simple symbol-by-symbol comparison.
Yuhming Huang - One of the best experts on this subject based on the ideXlab platform.
-
the construction of binary huffman equivalent Codes with a greater number of synchronising Codewords
Ubiquitous Computing, 2012Co-Authors: Yuhming Huang, Shengchi WuAbstract:An inherent problem with a Variable-Length Code (VLC) is that even a single bit error can cause a loss of synchronisation, and thus lead to error propagation. Codeword synchronisation has been extensively studied as a means to overcome this drawback and efficiently stop error propagation. In this paper, we first present the sufficient and necessary conditions for the existence of binary Huffman equivalent Codes with the shortest, or at most two shortest, synchronising Codeword(s) of Length m + 1, where m (>1) is the shortest Codeword Length. Next, based on the results, we propose a unified approach for constructing each of these binary Huffman equivalent Codes with the shortest, or at most two shortest, synchronising Codeword(s) of Length m + 1, if such a Code exists for a given Length vector.
-
shortest synchronizing Codewords of a binary huffman equivalent Code
International Conference on Information Technology: Coding and Computing, 2003Co-Authors: Yuhming Huang, Shengchi WuAbstract:The inherent problem of a Variable-Length Code is that even a single bit error can cause loss of synchronization and may lead to error propagation. Synchronizing Codewords have been extensively studies as a mean to overcome the drawback and efficiently stop error propagation. First we prove the restatement of a result originally given by B. Ruder (1971) in a more straightforward way. Next, we present the necessary conditions for the existence of a binary Huffman equivalent Code with shortest synchronizing Codeword(s). Finally, with the help of derived conditional equations, a unified approach for constructing a binary Huffman equivalent Code with most shortest synchronizing Codeword(s) and most other synchronizing Codewords is proposed also.
-
ITCC - Shortest synchronizing Codewords of a binary Huffman equivalent Code
Proceedings ITCC 2003. International Conference on Information Technology: Coding and Computing, 1Co-Authors: Yuhming HuangAbstract:The inherent problem of a Variable-Length Code is that even a single bit error can cause loss of synchronization and may lead to error propagation. Synchronizing Codewords have been extensively studies as a mean to overcome the drawback and efficiently stop error propagation. First we prove the restatement of a result originally given by B. Ruder (1971) in a more straightforward way. Next, we present the necessary conditions for the existence of a binary Huffman equivalent Code with shortest synchronizing Codeword(s). Finally, with the help of derived conditional equations, a unified approach for constructing a binary Huffman equivalent Code with most shortest synchronizing Codeword(s) and most other synchronizing Codewords is proposed also.
