#### Filter Results:

- Full text PDF available (74)

#### Publication Year

2000

2017

- This year (10)
- Last 5 years (64)
- Last 10 years (75)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

- Yuval Cassuto, Moshe Schwartz, Vasken Bohossian, Jehoshua Bruck
- IEEE Transactions on Information Theory
- 2010

Several physical effects that limit the reliability and performance of multilevel flash memories induce errors that have low magnitudes and are dominantly asymmetric. This paper studies block codes for asymmetric limited-magnitude errors over q-ary channels. We propose code constructions and bounds for such channels when the number of errors is bounded by… (More)

- Yuval Cassuto, Mario Blaum
- IEEE Transactions on Information Theory
- 2010

A new coding framework is established for channels whose outputs are overlapping pairs of symbols. Such channels are motivated by storage applications in which the spatial resolution of the reader may be insufficient to isolate adjacent symbols. Reading symbols as pairs changes the coding-theoretic error model from the standard bounded number of symbol… (More)

Shingled magnetic recording is a promising technology to increase the capacity of hard-disk drives with no significant cost impact. Its main drawback is that random-write access to the disk is restricted due to overlap in the layout of data tracks. For computing and storage systems to enjoy the increased capacity, it is necessary to mitigate these access… (More)

- Yuval Cassuto, Eitan Yaakobi
- 2012 IEEE International Symposium on Information…
- 2012

We construct new WOM codes with practical design considerations. First the problem of 2 cell q-ary WOM codes is addressed with a construction that uses lattice tilings. The resulting codes for arbitrary numbers of input bits are shown to be within a small additive constant from the capacity. Then we introduce a new model of WOM codes that support data bits… (More)

- Yuval Cassuto, Eitan Yaakobi
- IEEE Trans. Information Theory
- 2014

To the body of works on re-write codes for constrained memories we add a comprehensive study in a direction that is especially relevant to practical storage. The subject of the paper is codes for the q-ary extension of the WOM model, with input sizes that are fixed throughout the write sequence. Seven code constructions are given with guarantees on the… (More)

- Yuval Cassuto, Shahar Kvatinsky, Eitan Yaakobi
- 2013 IEEE International Symposium on Information…
- 2013

In a memristor crossbar array, a memristor is positioned on each row-column intersection, and its resistance, low or high, represents two logical states. The state of every memristor can be sensed by the current flowing through the memristor. In this work, we study the sneak path problem in crossbars arrays, in which current can sneak through other cells,… (More)

- Saher Odeh, Yuval Cassuto
- MSST
- 2014

- Zhiying Wang, Omer Shaked, Yuval Cassuto, Jehoshua Bruck
- 2013 IEEE International Symposium on Information…
- 2013

A network switch routes data packets between its multiple input and output ports. Packets from input ports are stored upon arrival in a switch fabric comprising multiple memory banks. This can result in memory contention when distinct output ports request packets from the same memory bank, resulting in a degraded switching bandwidth. To solve this problem,… (More)

- Zhiying Wang, Han Mao Kiah, Yuval Cassuto
- 2015 IEEE International Symposium on Information…
- 2015

In this paper, we study a construction of binary switch codes. A switch code is a code such that a multi-set request of information symbols can be simultaneously recovered from disjoint sets of codeword symbols. Our construction is optimal in the sense that it has the smallest codeword length given its average encoding degree, which is logarithmic in the… (More)

- Yifat Levy, Jehoshua Bruck, +4 authors Shahar Kvatinsky
- Microelectronics Journal
- 2014

In-memory computation is one of the most promising features of memristive memory arrays. In this paper, we propose an array architecture that supports in-memory computation based on a logic array first proposed in 1972 by Sheldon Akers. The Akers logic array satisfies this objective since this array can realize any Boolean function, including bit sorting.… (More)