1243 search results - page 83 / 249 » Complexity reduction of C-Algorithm |
ICC
2007
IEEE
15 years 7 months ago
2007
IEEE
― In this paper, a modified bit-flipping decoding algorithm for low-density parity-check (LDPC) codes is proposed. Both improvement in performance and reduction in decoding delay...
TCAD
2008
15 years 1 months ago
2008
ion for Asynchronous Design Verification Hao Zheng, Member, IEEE, Jared Ahrens, Tian Xia, Member, IEEE This paper presents a compositional method with preserving abstraction for sc...
IPL
2007
15 years 1 months ago
2007
We present a new proof of PSPACE-hardness of the emptiness problem for alternating finite automata with a singleton alphabet. This result was shown by Holzer (1995) who used a pr...
ACTA
2004
15 years 1 months ago
2004
The generative capability of several variants of P systems with symport/antiport is studied via the simulation of counter automata. This leads to the reduction of the complexity, e...
TIP
2002
15 years 1 months ago
2002
In this correspondence, we prove that the affine invariants proposed recently by Yang and Cohen [1] are algebraically dependent. We show how to select an independent and complete s...