Synthesizing complementary circuits automatically

Shen, Shengyu; Zhang, Jianmin; Qin, Ying; Li, Sikun

doi:10.1145/1687399.1687472

Cited by 7 publications

(24 citation statements)

References 22 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…(The care-state set S C can be generated by exact or approximated reachability analysis. For example, the latter approach was taken in [20] by time-frame expansion for dangling-state removal.) In the sequel, we shall simply assume that a care-state set S C is given.…”

Section: Problem Statementmentioning

confidence: 99%

“…Theorem 2 (see also [20]): Given a transition system T ( x, s, y, s ), suppose that to determine is the input …”

Section: ) Principlesmentioning

confidence: 99%

“…Recently Shen et al [20], [21] studied the decoder synthesis problem. A bounded decoder existence checking method was proposed [20], where the checking is with respect to a pre-specified parameter on observable output windows.…”

mentioning

confidence: 99%

“…A bounded decoder existence checking method was proposed [20], where the checking is with respect to a pre-specified parameter on observable output windows. If a decoder exists, an ALLSAT-based procedure is invoked to compute and simplify the corresponding decoding functions.…”

mentioning

confidence: 99%

“…Thirdly, an interpolation-based decoder synthesis approach is proposed, which eliminates the need for ALLSAT in enumerating all satisfying assignments and makes a decoder derivable along the existence checking. (Shen et al [20] suggested as future work using interpolation-based relation determinization [10] for decoder generation. Our interpolation formulation for decoder synthesis can be more direct and simpler than the prior method [10].)…”

mentioning

confidence: 99%

See 4 more Smart Citations

Automatic Decoder Synthesis: Methods and Case Studies

Liu¹,

Chou²,

Lin

et al. 2012

IEEE Trans. Comput.-Aided Des. Integr. Circuits Syst.

View full text Add to dashboard Cite

Abstract-Upon receiving the output sequence streaming from a sequential encoder, a decoder reconstructs the corresponding input sequence that streamed to the encoder. Such an encoding and decoding scheme is commonly encountered in communication, cryptography, signal processing, and other applications. Given an encoder specification, decoder design can be errorprone and time consuming. Its automation may help designers improve productivity and justify encoder correctness. Though recent advances showed promising progress, there is still no complete method that decides whether a decoder exists for a finite state transition system. The quest for completely automatic decoder synthesis remains. This paper presents a complete and practical approach to automating decoder synthesis via incremental SAT solving and Craig interpolation. Experiments show that, for decoder-existent cases, our method synthesizes decoders effectively; for decoder-nonexistent cases, our method concludes the non-existence instantly while prior methods may fail. Case studies are also conducted in synthesizing decoders for linear error-correcting codes.

show abstract

Section: Problem Statementmentioning

confidence: 99%

“…Theorem 2 (see also [20]): Given a transition system T ( x, s, y, s ), suppose that to determine is the input …”

Section: ) Principlesmentioning

confidence: 99%

mentioning

confidence: 99%

mentioning

confidence: 99%

mentioning

confidence: 99%