The Experts below are selected from a list of 548835 Experts worldwide ranked by ideXlab platform
Michael W. Marcellin - One of the best experts on this subject based on the ideXlab platform.
-
Selecting Two-Bit Bit Flipping Algorithms for Collective Error Correction
arXiv: Information Theory, 2012Co-Authors: Dung Viet Nguyen, Bane Vasic, Michael W. MarcellinAbstract:A class of two-bit bit flipping Algorithms for decoding low-density parity-check codes over the binary symmetric channel was proposed in [1]. Initial results showed that decoders which employ a group of these Algorithms operating in parallel can offer low error floor decoding for high-speed applications. As the number of two-bit bit flipping Algorithms is large, designing such a decoder is not a trivial task. In this paper, we describe a procedure to select collections of Algorithms that work well together. This procedure relies on a recursive process which enumerates error configurations that are uncorrectable by a Given Algorithm. The error configurations uncorrectable by a Given Algorithm form its trapping set profile. Based on their trapping set profiles, Algorithms are selected so that in parallel, they can correct a fixed number of errors with high probability.
-
ISIT - Selecting two-bit bit flipping Algorithms for collective error correction
2012 IEEE International Symposium on Information Theory Proceedings, 2012Co-Authors: Dung Viet Nguyen, Bane Vasic, Michael W. MarcellinAbstract:A class of two-bit bit flipping Algorithms for decoding low-density parity-check codes over the binary symmetric channel was proposed in [1]. Initial results showed that decoders which employ a group of these Algorithms operating in parallel can offer low error floor decoding for high-speed applications. As the number of two-bit bit flipping Algorithms is large, designing such a decoder is not a trivial task. In this paper, we describe a procedure to select collections of Algorithms that work well together. This procedure relies on a recursive process which enumerates error configurations that are uncorrectable by a Given Algorithm. The error configurations uncorrectable by a Given Algorithm form its trapping set profile. Based on their trapping set profiles, Algorithms are selected so that in parallel, they can correct a fixed number of errors with high probability.
Dung Viet Nguyen - One of the best experts on this subject based on the ideXlab platform.
-
Selecting Two-Bit Bit Flipping Algorithms for Collective Error Correction
arXiv: Information Theory, 2012Co-Authors: Dung Viet Nguyen, Bane Vasic, Michael W. MarcellinAbstract:A class of two-bit bit flipping Algorithms for decoding low-density parity-check codes over the binary symmetric channel was proposed in [1]. Initial results showed that decoders which employ a group of these Algorithms operating in parallel can offer low error floor decoding for high-speed applications. As the number of two-bit bit flipping Algorithms is large, designing such a decoder is not a trivial task. In this paper, we describe a procedure to select collections of Algorithms that work well together. This procedure relies on a recursive process which enumerates error configurations that are uncorrectable by a Given Algorithm. The error configurations uncorrectable by a Given Algorithm form its trapping set profile. Based on their trapping set profiles, Algorithms are selected so that in parallel, they can correct a fixed number of errors with high probability.
-
ISIT - Selecting two-bit bit flipping Algorithms for collective error correction
2012 IEEE International Symposium on Information Theory Proceedings, 2012Co-Authors: Dung Viet Nguyen, Bane Vasic, Michael W. MarcellinAbstract:A class of two-bit bit flipping Algorithms for decoding low-density parity-check codes over the binary symmetric channel was proposed in [1]. Initial results showed that decoders which employ a group of these Algorithms operating in parallel can offer low error floor decoding for high-speed applications. As the number of two-bit bit flipping Algorithms is large, designing such a decoder is not a trivial task. In this paper, we describe a procedure to select collections of Algorithms that work well together. This procedure relies on a recursive process which enumerates error configurations that are uncorrectable by a Given Algorithm. The error configurations uncorrectable by a Given Algorithm form its trapping set profile. Based on their trapping set profiles, Algorithms are selected so that in parallel, they can correct a fixed number of errors with high probability.
Bane Vasic - One of the best experts on this subject based on the ideXlab platform.
-
Selecting Two-Bit Bit Flipping Algorithms for Collective Error Correction
arXiv: Information Theory, 2012Co-Authors: Dung Viet Nguyen, Bane Vasic, Michael W. MarcellinAbstract:A class of two-bit bit flipping Algorithms for decoding low-density parity-check codes over the binary symmetric channel was proposed in [1]. Initial results showed that decoders which employ a group of these Algorithms operating in parallel can offer low error floor decoding for high-speed applications. As the number of two-bit bit flipping Algorithms is large, designing such a decoder is not a trivial task. In this paper, we describe a procedure to select collections of Algorithms that work well together. This procedure relies on a recursive process which enumerates error configurations that are uncorrectable by a Given Algorithm. The error configurations uncorrectable by a Given Algorithm form its trapping set profile. Based on their trapping set profiles, Algorithms are selected so that in parallel, they can correct a fixed number of errors with high probability.
-
ISIT - Selecting two-bit bit flipping Algorithms for collective error correction
2012 IEEE International Symposium on Information Theory Proceedings, 2012Co-Authors: Dung Viet Nguyen, Bane Vasic, Michael W. MarcellinAbstract:A class of two-bit bit flipping Algorithms for decoding low-density parity-check codes over the binary symmetric channel was proposed in [1]. Initial results showed that decoders which employ a group of these Algorithms operating in parallel can offer low error floor decoding for high-speed applications. As the number of two-bit bit flipping Algorithms is large, designing such a decoder is not a trivial task. In this paper, we describe a procedure to select collections of Algorithms that work well together. This procedure relies on a recursive process which enumerates error configurations that are uncorrectable by a Given Algorithm. The error configurations uncorrectable by a Given Algorithm form its trapping set profile. Based on their trapping set profiles, Algorithms are selected so that in parallel, they can correct a fixed number of errors with high probability.
Vladimir Kellö - One of the best experts on this subject based on the ideXlab platform.
-
Simple sparse matrix multiplication Algorithm
Computer Physics Communications, 1995Co-Authors: Daniel Král, Pavel Neogrády, Vladimir KellöAbstract:Abstract A simple Algorithm for multiplication of sparse matrices is proposed. This Algorithm can be easily incorporate into existing matrix multiplication routines. Behavior of the Given Algorithm on scalar and vector processors is discussed.
Dai Yu-xing - One of the best experts on this subject based on the ideXlab platform.
-
A Load Balancing Algorithm Based on Content for Distributed Web Server
2006Co-Authors: Dai Yu-xingAbstract:Based on the Given structural model of distributed web server system,a new dynamic load balancing Algorithm which is periodic update and in which both static content and dynamic content are included is proposed.Through the result gained by loading the Given Algorithm on the founded emulated flat,the conclusion that the Algorithm can balance the system load effectively is received.
-
The Implement of the Emluator System for the Load Balancing Algorithm for Distributed Web Server
Journal of Natural Science of Hunan Normal University, 2006Co-Authors: Dai Yu-xingAbstract:Based on the proposed load balancing Algorithm,the emulational flat is implemented.Through the result gained by loading the Given Algorithm on the founded emulational flat,the conclusion that the Algorithm can balance the system load effectively is received.