The Experts below are selected from a list of 3744 Experts worldwide ranked by ideXlab platform
Immink, Kees A. Schouhamer - One of the best experts on this subject based on the ideXlab platform.
-
Efficient Design of Subblock Energy-Constrained Codes and Sliding Window-Constrained Codes
2020Co-Authors: Nguyen, Tuan Thanh, Cai Kui, Immink, Kees A. SchouhamerAbstract:The subblock energy-constrained codes (SECCs) and sliding window-constrained codes (SWCCs) have recently attracted attention due to various applications in communcation systems such as simultaneous energy and information transfer. In a SECC, each codewod is divided into smaller non-overlapping windows, called subblocks, and every subblock is constrained to carry sufficient energy. In a SWCC, the energy constraint is enforced over every window. In this work, we focus on the binary channel, where sufficient energy is achieved theoretically by using relatively high weight codes, and study SECCs and SWCCs under more general constraints, namely bounded SECCs and bounded SWCCs. We propose two methods to construct such codes with low redundancy and linear-time complexity, based on Knuth's balancing technique and sequence replacement technique. For certain codes parameters, our methods incur only one Redundant Bit. We also impose the minimum distance constraint for error correction capability of the designed codes, which helps to reduce the error propagation during decoding as well
Nguyen, Tuan Thanh - One of the best experts on this subject based on the ideXlab platform.
-
Efficient Design of Subblock Energy-Constrained Codes and Sliding Window-Constrained Codes
2020Co-Authors: Nguyen, Tuan Thanh, Cai Kui, Immink, Kees A. SchouhamerAbstract:The subblock energy-constrained codes (SECCs) and sliding window-constrained codes (SWCCs) have recently attracted attention due to various applications in communcation systems such as simultaneous energy and information transfer. In a SECC, each codewod is divided into smaller non-overlapping windows, called subblocks, and every subblock is constrained to carry sufficient energy. In a SWCC, the energy constraint is enforced over every window. In this work, we focus on the binary channel, where sufficient energy is achieved theoretically by using relatively high weight codes, and study SECCs and SWCCs under more general constraints, namely bounded SECCs and bounded SWCCs. We propose two methods to construct such codes with low redundancy and linear-time complexity, based on Knuth's balancing technique and sequence replacement technique. For certain codes parameters, our methods incur only one Redundant Bit. We also impose the minimum distance constraint for error correction capability of the designed codes, which helps to reduce the error propagation during decoding as well
Cai Kui - One of the best experts on this subject based on the ideXlab platform.
-
Efficient Design of Subblock Energy-Constrained Codes and Sliding Window-Constrained Codes
2020Co-Authors: Nguyen, Tuan Thanh, Cai Kui, Immink, Kees A. SchouhamerAbstract:The subblock energy-constrained codes (SECCs) and sliding window-constrained codes (SWCCs) have recently attracted attention due to various applications in communcation systems such as simultaneous energy and information transfer. In a SECC, each codewod is divided into smaller non-overlapping windows, called subblocks, and every subblock is constrained to carry sufficient energy. In a SWCC, the energy constraint is enforced over every window. In this work, we focus on the binary channel, where sufficient energy is achieved theoretically by using relatively high weight codes, and study SECCs and SWCCs under more general constraints, namely bounded SECCs and bounded SWCCs. We propose two methods to construct such codes with low redundancy and linear-time complexity, based on Knuth's balancing technique and sequence replacement technique. For certain codes parameters, our methods incur only one Redundant Bit. We also impose the minimum distance constraint for error correction capability of the designed codes, which helps to reduce the error propagation during decoding as well
Toyohiko Yatagai - One of the best experts on this subject based on the ideXlab platform.
-
modified signed digit arithmetic based on Redundant Bit representation
Applied Optics, 1994Co-Authors: Hongxin Huang, Masahide Itoh, Toyohiko YatagaiAbstract:Fully parallel modified signed-digit arithmetic operations are realized based on Redundant Bit representation of the digits proposed. A new truth-table minimizing technique is presented based on Redundant-Bitrepresentation coding. It is shown that only 34 minterms are enough for implementing one-step modified signed-digit addition and subtraction with this new representation. Two optical implementation schemes, correlation and matrix multiplication, are described. Experimental demonstrations of the correlation architecture are presented. Both architectures use fixed minterm masks for arBitrary-length operands, taking full advantage of the parallelism of the modified signed-digit number system and optics.
Hongxin Huang - One of the best experts on this subject based on the ideXlab platform.
-
modified signed digit arithmetic based on Redundant Bit representation
Applied Optics, 1994Co-Authors: Hongxin Huang, Masahide Itoh, Toyohiko YatagaiAbstract:Fully parallel modified signed-digit arithmetic operations are realized based on Redundant Bit representation of the digits proposed. A new truth-table minimizing technique is presented based on Redundant-Bitrepresentation coding. It is shown that only 34 minterms are enough for implementing one-step modified signed-digit addition and subtraction with this new representation. Two optical implementation schemes, correlation and matrix multiplication, are described. Experimental demonstrations of the correlation architecture are presented. Both architectures use fixed minterm masks for arBitrary-length operands, taking full advantage of the parallelism of the modified signed-digit number system and optics.