The Experts below are selected from a list of 82497 Experts worldwide ranked by ideXlab platform
Tadahiko Sugibayashi - One of the best experts on this subject based on the ideXlab platform.
-
noncomplimentary rewriting and serial data Coding Scheme for shared sense amplifier open bit line dram
IEEE Journal of Solid-state Circuits, 1999Co-Authors: Satoshi Utsugi, M Hanyu, Y Muramatsu, Tadahiko SugibayashiAbstract:A noncomplimentary rewriting Scheme is proposed for open-bit-line DRAM's adopting a shared subsense amplifier. The Scheme can theoretically cancel inter-bit-line coupling noise down to zero. In order to suppress the peak in unselected word line noise, a serial-data Coding Scheme was also developed, This Scheme can reduce unselected word-line noise by at least 50%.
-
non complimentary rewriting and serial data Coding Scheme for shared sense amplifier open bit line drams
Symposium on VLSI Circuits, 1998Co-Authors: Satoshi Utsugi, M Hanyu, Y Muramatsu, Tadahiko SugibayashiAbstract:A non-complimentary rewriting Scheme is proposed for open-bit-line DRAMs adopting shared-sub-sense amplifier. The Scheme can theoretically cancel inter-bit-line coupling noise down to zero. In order to suppress the peak in word-line noise, a serial-data Coding Scheme was also developed. This Scheme can reduce word-line noise to at least 50%. These two circuits were applied to an experimental 1 Gb DRAM using 0.22 /spl mu/m CMOS process technology for file applications.
Shlomo Shamai - One of the best experts on this subject based on the ideXlab platform.
-
a Coding Scheme for colored gaussian wiretap channels with feedback
International Symposium on Information Theory, 2018Co-Authors: Yingbin Liang, Vincent H Poor, Shlomo ShamaiAbstract:In this paper, the finite-order autoregressive moving average (ARMA) Gaussian wiretap channel with noiseless causal feedback is considered, in which an eavesdropper receives noisy observations of the signals in both forward and feedback channels. It is shown that the generalized Schalkwijk-Kailath Scheme, a capacity-achieving Coding Scheme for the feedback Gaussian channel, achieves the same maximum rate for the same channel with the presence of an eavesdropper. Therefore, the secrecy capacity is equal to the feedback capacity without the presence of an eavesdropper for the feedback channel. Furthermore, the results are extended to the additive white Gaussian noise (AWGN) channel with quantized feedback. It is shown that the proposed Coding Scheme achieves a positive secrecy rate. As the amplitude of the quantization noise decreases to zero, the secrecy rate converges to the capacity of the AWGN channel.
-
A layered lattice Coding Scheme for a class of three user Gaussian interference channels
2008 46th Annual Allerton Conference on Communication Control and Computing, 2008Co-Authors: Sriram Sridharan, Amin Jafarian, Sriram Vishwanath, Syed A. Jafar, Shlomo ShamaiAbstract:The paper studies a class of three user Gaussian interference channels. A new layered lattice Coding Scheme is introduced as a transmission strategy. The use of lattice codes allows for an ldquoalignmentrdquo of the interference observed at each receiver. The layered lattice Coding is shown to achieve more than one degree of freedom for a class of interference channels and also achieves rates which are better than the rates obtained using the Han-Kobayashi Coding Scheme.
Cheng Huang - One of the best experts on this subject based on the ideXlab platform.
-
star an efficient Coding Scheme for correcting triple storage node failures
IEEE Transactions on Computers, 2008Co-Authors: Cheng HuangAbstract:Proper data placement Schemes based on erasure correcting codes are one of the most important components for a highly available data storage system. For such Schemes, low deCoding complexity for correcting (or recovering) storage node failures is essential for practical systems. In this paper, we describe a new Coding Scheme, which we call the STAR code, for correcting triple storage node failures (erasures). The STAR code is an extension of the double-erasure-correcting EVENODD code and a modification of the generalized triple-erasure-correcting EVENODD code. The STAR code is an Maximum Distance Separable (MDS) code and thus is optimal in terms of node failure recovery capability for a given data redundancy. We provide detailed STAR code deCoding algorithms for correcting various triple node failures. We show that the deCoding complexity of the STAR code is much lower than those of existing comparable codes; thus, the STAR code is practically very meaningful for storage systems that need higher reliability.
-
star an efficient Coding Scheme for correcting triple storage node failures
File and Storage Technologies, 2005Co-Authors: Cheng HuangAbstract:Proper data placement Schemes based on erasure correcting code are one of the most important components for a highly available data storage system. For such Schemes, low deCoding complexity for correcting (or recovering) storage node failures is essential for practical systems. In this paper, we describe a new Coding Scheme, which we call the STAR code, for correcting triple storage node failures (erasures). The STAR code is an extension of the double-erasure-correcting EVENODD code, and a modification of the generalized triple-erasure-correcting EVENODD code. The STAR code is an MDS code, and thus is optimal in terms of node failure recovery capability for a given data redundancy. We provide detailed STAR code's deCoding algorithms for correcting various triple node failures. We show that the deCoding complexity of the STAR code is much lower than those of the existing comparable codes, thus the STAR code is practically very meaningful for storage systems that need higher reliability
Satoshi Utsugi - One of the best experts on this subject based on the ideXlab platform.
-
noncomplimentary rewriting and serial data Coding Scheme for shared sense amplifier open bit line dram
IEEE Journal of Solid-state Circuits, 1999Co-Authors: Satoshi Utsugi, M Hanyu, Y Muramatsu, Tadahiko SugibayashiAbstract:A noncomplimentary rewriting Scheme is proposed for open-bit-line DRAM's adopting a shared subsense amplifier. The Scheme can theoretically cancel inter-bit-line coupling noise down to zero. In order to suppress the peak in unselected word line noise, a serial-data Coding Scheme was also developed, This Scheme can reduce unselected word-line noise by at least 50%.
-
non complimentary rewriting and serial data Coding Scheme for shared sense amplifier open bit line drams
Symposium on VLSI Circuits, 1998Co-Authors: Satoshi Utsugi, M Hanyu, Y Muramatsu, Tadahiko SugibayashiAbstract:A non-complimentary rewriting Scheme is proposed for open-bit-line DRAMs adopting shared-sub-sense amplifier. The Scheme can theoretically cancel inter-bit-line coupling noise down to zero. In order to suppress the peak in word-line noise, a serial-data Coding Scheme was also developed. This Scheme can reduce word-line noise to at least 50%. These two circuits were applied to an experimental 1 Gb DRAM using 0.22 /spl mu/m CMOS process technology for file applications.
Jeanfrancois Chamberland - One of the best experts on this subject based on the ideXlab platform.
-
a joint graph based Coding Scheme for the unsourced random access gaussian channel
Global Communications Conference, 2019Co-Authors: Asit Kumar Pradhan, Krishna R Narayanan, Vamsi K Amalladinne, Avinash Vem, Jeanfrancois ChamberlandAbstract:This article introduces a novel communication paradigm for the unsourced, uncoordinated Gaussian multiple access problem. The major components of the envisioned framework are as follows. The encoded bits of every message are partitioned into two groups. The first portion is transmitted using a compressive sensing Scheme, whereas the second set of bits is conveyed using a multi-user Coding Scheme. The compressive sensing portion is key in sidestepping some of the challenges posed by the unsourced aspect of the problem. The information afforded by the compressive sensing is employed to create a sparse random multi-access graph conducive to joint deCoding. This construction leverages the lessons learned from traditional IDMA into creating low- complexity Schemes for the unsourced setting and its inherent randomness. Under joint message- passing deCoding, the proposed Scheme offers superior performance compared to existing low- complexity alternatives. Findings are supported by numerical simulations.
-
a user independent serial interference cancellation based Coding Scheme for the unsourced random access gaussian channel
Information Theory Workshop, 2017Co-Authors: Krishna R Narayanan, Jun Cheng, Jeanfrancois ChamberlandAbstract:We propose a novel Coding Scheme for the unsourced multiple access channel model introduced by Polyanskiy [1]. This new paradigm is composed of four main ingredients: (i) the transmission period is partitioned into sub-blocks, thereby instituting a slotted framework; (ii) The message (data) is split into two parts and one part chooses an interleaver for a low density parity check (LDPC) type code. This part of the message is encoded using spreading sequences or codewords that are designed to be decoded by a compressed sensing type decoder; (iii) The other part of the message is encoded using a low density parity check (LDPC) type code and decoded using a joint message passing deCoding algorithm designed for the T-user binary input real adder channel; (iv) users repeat their codeword in multiple sub-blocks, with the transmission pattern being a deterministic function of message content and independent of the identity of the user. When this Coding Scheme is combined with serial interference cancellation, the ensuing communication infrastructure can offer significant performance improvements compared to the recently proposed Coding Scheme in [2] and results in the best performing Coding Scheme to date.
