Suchergebnisse - combinational-circuit decoding complexity
Andere Suchmöglichkeiten:
- combinational-circuit decoding complexity »
-
1
Two reliability-based iterative majority-logic decoding algorithms for LDPC codes
ISSN: 0090-6778, 1558-0857Veröffentlicht: New York, NY IEEE 01.12.2009Veröffentlicht in IEEE transactions on communications (01.12.2009)“… of decoding convergence and less decoding complexity. Compared to the sum-product algorithm for LDPC codes, they offer effective trade-offs between performance …”
Volltext
Journal Article -
2
Fast, minimal decoding complexity, systematic (13, 8) single-error-correcting codes for on-chip DRAM applications
ISSN: 0013-5194Veröffentlicht: 29.03.2001Veröffentlicht in Electronics letters (29.03.2001)“… A fast, minimal decoding complexity, binary systematic single-error-correcting code with one extra parity-bit penalty is presented …”
Volltext
Journal Article -
3
An Improved Majority-Logic Decoder Offering Massively Parallel Decoding for Real-Time Control in Embedded Systems
ISSN: 0090-6778Veröffentlicht: New York, NY IEEE 01.12.2013Veröffentlicht in IEEE transactions on communications (01.12.2013)“… A simple combinational circuit can perform the proposed decoding. In particular, we show how our decoder for the three-error-correcting code RM(2, 5 …”
Volltext
Journal Article -
4
Joint detection–decoding of majority-logic decodable non-binary low-density parity-check coded modulation systems: an iterative noise reduction algorithm
ISSN: 1751-8628, 1751-8636Veröffentlicht: Stevenage The Institution of Engineering and Technology 01.07.2014Veröffentlicht in IET communications (01.07.2014)“… In this study, the authors present a low-complexity iterative joint detection–decoding algorithm for majority-logic decodable non-binary low-density parity-check (LDPC …”
Volltext
Journal Article -
5
Efficient Error Correcting Codes for On-Chip DRAM Applications for Space Missions
ISBN: 9780780388703, 0780388704ISSN: 1095-323XVeröffentlicht: IEEE 2005Veröffentlicht in 2005 IEEE Aerospace Conference (2005)“… These new, codes-based circuits can be used in combinational circuits and in on-chip random access memories of reconfigurable architectures with high performance and ultimate minimum decoding/encoding complexity …”
Volltext
Tagungsbericht -
6
Fast, minimal decoding complexity, systematic (13, 8) single-error-correcting codes for on-chip DRAM applications
ISSN: 0013-5194, 1350-911XVeröffentlicht: Stevenage John Wiley & Sons, Inc 29.03.2001Veröffentlicht in Electronics letters (29.03.2001)“… Fast, minimal decoding complexity (13, 8) binary systematic single-error-correcting codes are proposed for on-chip DRAM applications. These (13, 8 …”
Volltext
Journal Article -
7
High-Performance and Energy-Efficient CNFET-Based Designs for Ternary Logic Circuits
ISSN: 2169-3536, 2169-3536Veröffentlicht: Piscataway IEEE 2019Veröffentlicht in IEEE access (2019)“… )] and combinational circuits [ternary decoder (TDecoder), ternary half-adder (THA), and ternary multiplier (TMUL …”
Volltext
Journal Article -
8
Fast, minimal decoding complexity, system level, binary systematic (41, 32) single-error-correcting codes for on-chip DRAM applications
ISBN: 9780769512037, 0769512038ISSN: 1550-5774Veröffentlicht: IEEE 2001Veröffentlicht in Proceedings 2001 IEEE International Symposium on Defect and Fault Tolerance in VLSI Systems (2001)“… Fast, minimal decoding complexity, system level, binary systematic (41, 32) single-error-correcting codes for on-chip DRAM applications are presented. These (41, 32 …”
Volltext
Tagungsbericht -
9
Novel method of designing all optical frequency-encoded Fredkin and Toffoli logic gates using semiconductor optical amplifiers
ISSN: 1751-8768, 1751-8776Veröffentlicht: Stevenage The Institution of Engineering & Technology 01.12.2011Veröffentlicht in IET optoelectronics (01.12.2011)“… Reversible logic gates have attracted significant attention to researchers in the field of optics and optoelectronics because of its wide applications in sequential and combinational circuit …”
Volltext
Journal Article -
10
Two efficient and low-complexity iterative reliability-based majority-logic decoding algorithms for LDPC codes
ISBN: 9781424449828, 1424449820Veröffentlicht: IEEE 01.01.2009Veröffentlicht in 2009 IEEE Information Theory Workshop (01.01.2009)“… convergence and less decoding complexity. Compared to the sum-product algorithm for LDPC codes, they offer effective trade-offs between performance and decoding complexity …”
Volltext
Tagungsbericht -
11
Computational complexity of controllability/observability problems for combinational circuits
ISBN: 9780818608674, 0818608676Veröffentlicht: IEEE Comput. Soc. Press 1988Veröffentlicht in International Symposium on Fault-Tolerant Computing, 18th, 1988 (FTCS-18): Digest of Papers (1988)“… The computational complexity of fault detection problems and various controllability and observability problems for combinational logic circuits are analyzed …”
Volltext
Tagungsbericht -
12
Customized Algorithms for High Performance Memory Test in Advanced Technology Node
ISBN: 0769538649, 9780769538648ISSN: 1081-7735Veröffentlicht: IEEE 01.11.2009Veröffentlicht in 2009 Asian Test Symposium (01.11.2009)“… This paper describes how ASIC vendors can develop customized memory test algorithms to enhance their overall IC testing strategy. BIST test algorithm was used …”
Volltext
Tagungsbericht -
13
Early outpoint insertion for high-level software vs. RTL formal combinational equivalence verification
ISBN: 1595933816, 9781595933812ISSN: 0738-100XVeröffentlicht: IEEE 2006Veröffentlicht in 2006 43rd ACM/IEEE Design Automation Conference (2006)“… Ever-growing complexity is forcing design to move above RTL. For example, golden functional models are being written as clearly as possible in software and not optimized or intended for synthesis …”
Volltext
Tagungsbericht -
14
Complexity of decoders--I: Classes of decoding rules
ISSN: 0018-9448, 1557-9654Veröffentlicht: IEEE 01.11.1969Veröffentlicht in IEEE transactions on information theory (01.11.1969)“… Under the assumption that these rules are implemented with combinational circuits and sequential machines constructed with AND gates, OR gates, INVERTERS, and binary memory cells, bounds are derived on their complexity …”
Volltext
Journal Article

