Inferring Assertion for Complementary Synthesis

Shen, Shengyu; Qin, Ying; Wang, Ke-fei; Pang, Zhengbin; Zhang, Jianmin; Li, Sikun

doi:10.1109/tcad.2012.2190735

Cited by 3 publications

(5 citation statements)

References 7 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Table I shows all benchmarks used in this article. They come from our previous article [Shen et al 2012] and from Liu et al [2012]. Each column of Table I shows, respectively, the number of inputs, outputs, registers and gates of each benchmarks.…”

Section: Resultsmentioning

confidence: 99%

“…(1) By studying the five benchmarks used in our previous article [Shen et al 2012], we found that most of them have built-in flow control mechanisms. This isn't a surprise to us, because these benchmarks all come from real industrial projects.…”

Section: Resultsmentioning

confidence: 99%

“…[2011] by searching for loops in the state sequence, while the runtime overhead problem was addressed in Shen et al [2012] andLiu et al [2011] by interpolant [McMillan 2003]. Shen et al [2012] automatically inferred an assertion for configuration pins, which can lead to the decoder's existence. It can be seen as a special case of Algorithm 5, with the restriction that the inferred assertion must hold on all steps.…”

Section: Complementary Synthesismentioning

confidence: 99%

“…One of the most difficult jobs in designing communication and multimedia chips is to design and verify complex encoder and decoder pairs. The encoder maps its input variables i to its output variables o, while the decoder recovers i from o. Complementary synthesis [Shen et al 2009[Shen et al , 2010[Shen et al , 2011[Shen et al , 2012Liu et al 2011Liu et al , 2012Tu and Jiang 2013] eases this job by automatically generating a decoder from an encoder, with the assumption that i can always be uniquely determined by a bounded sequence of o.…”

Section: Introductionmentioning

confidence: 99%

“…The second step of this algorithm seems somewhat similar to that of Shen et al [2012] in the sense that both algorithms infer predicates that enable d or i to be uniquely determined. But the essential difference between them is that the algorithm of Shen et al [2012] infers a global assertion that must be enforced on all steps along the unrolled state transition sequence, while our algorithm infers a local predicate that is only enforced at the current step when we need to recover the value of d. Thus, our algorithm can be seen as a generalization of Shen et al [2012].…”

Section: Introductionmentioning

confidence: 99%

See 4 more Smart Citations

Complementary Synthesis for Encoder with Flow Control Mechanism

Qin

Shen

et al. 2015

ACM Trans. Des. Autom. Electron. Syst.

Self Cite

View full text Add to dashboard Cite

Complementary synthesis automatically generates an encoder's decoder with the assumption that the encoder's all input variables can always be uniquely determined by its output symbol sequence. However, to prevent the faster encoder from overwhelming the slower decoder, many encoders employ flow control mechanism that fails this assumption. Such encoders, when their output symbol sequences are too fast to be processed by the decoders, will stop transmitting data symbols, but instead transmitting idle symbols that can only uniquely determine a subset of the encoder's input variables. And the decoder should recognize and discard these idle symbols. This mechanism fails the assumption of all complementary synthesis algorithms, because some input variables can't be uniquely determined by the idle symbol. A novel algorithm is proposed to handle such encoders. First, it identifies all input variables that can be uniquely determined, and takes them as flow control variables. Second, it infers a predicate over these flow control variables that enables all other input variables to be uniquely determined. Third, it characterizes the decoder's Boolean function with Craig interpolant. Experimental results on several complex encoders indicate that this algorithm can always correctly identify the flow control variables, infer the predicates and generate the decoder's Boolean functions.

show abstract

Section: Resultsmentioning

confidence: 99%

Section: Resultsmentioning

confidence: 99%