Skip to Main content Skip to Navigation
Journal articles

Efficient Decompression of Binary Encoded Balanced Ternary Sequences

Abstract : A balanced ternary digit, known as a trit, takes its values in {-1, 0, 1}. It can be encoded in binary as {11, 00, 01} for direct use in digital circuits. In this correspondence, we study the decompression of a sequence of bits into a sequence of binary encoded balanced ternary digits. We first show that it is useless in practice to compress sequences of more than 5 ternary values. We then provide two mappings, one to map 5 bits to 3 trits and one to map 8 bits to 5 trits. Both mappings were obtained by human analysis and lead to Boolean implementations that compare quite favorably with others obtained by tweaking assignment or encoding optimization tools. However, mappings that lead to better implementations may be feasible.
Document type :
Journal articles
Complete list of metadata

Cited literature [22 references]  Display  Hide  Download

https://hal.archives-ouvertes.fr/hal-02103214
Contributor : Alban Bourge <>
Submitted on : Thursday, April 18, 2019 - 10:52:00 AM
Last modification on : Friday, November 20, 2020 - 1:04:03 PM

File

b2t.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-02103214, version 1

Collections

CNRS | TIMA | UGA

Citation

Olivier Muller, Adrien Prost-Boucle, Alban Bourge, Frédéric Pétrot. Efficient Decompression of Binary Encoded Balanced Ternary Sequences. IEEE Transactions on Very Large Scale Integration (VLSI) Systems, IEEE, 2019. ⟨hal-02103214⟩

Share

Metrics

Record views

175

Files downloads

702