Suchergebnisse - combinational-circuit decoding complexity

Andere Suchmöglichkeiten:

  • Treffer 1 - 14 von 14
Treffer weiter einschränken
  1. 1

    Two reliability-based iterative majority-logic decoding algorithms for LDPC codes von Huang, Q, Kang, J, Zhang, L, Lin, S, Abdel-Ghaffar, K

    ISSN: 0090-6778, 1558-0857
    Veröffentlicht: New York, NY IEEE 01.12.2009
    Verö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. 2

    Fast, minimal decoding complexity, systematic (13, 8) single-error-correcting codes for on-chip DRAM applications von Kazeminejad, A

    ISSN: 0013-5194
    Veröffentlicht: 29.03.2001
    Verö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. 3

    An Improved Majority-Logic Decoder Offering Massively Parallel Decoding for Real-Time Control in Embedded Systems von Bertram, Juliane, Hauck, Peter, Huber, Michael

    ISSN: 0090-6778
    Veröffentlicht: New York, NY IEEE 01.12.2013
    Verö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. 4

    Joint detection–decoding of majority-logic decodable non-binary low-density parity-check coded modulation systems: an iterative noise reduction algorithm von Zhao, Shancheng, Wang, Xuepeng, Wang, Teng, Bai, Baoming, Ma, Xiao

    ISSN: 1751-8628, 1751-8636
    Veröffentlicht: Stevenage The Institution of Engineering and Technology 01.07.2014
    Verö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. 5

    Efficient Error Correcting Codes for On-Chip DRAM Applications for Space Missions von Baloch, S., Arslan, T., Stoica, A.

    ISBN: 9780780388703, 0780388704
    ISSN: 1095-323X
    Veröffentlicht: IEEE 2005
    Verö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. 6

    Fast, minimal decoding complexity, systematic (13, 8) single-error-correcting codes for on-chip DRAM applications von Kazeminejad, A

    ISSN: 0013-5194, 1350-911X
    Veröffentlicht: Stevenage John Wiley & Sons, Inc 29.03.2001
    Verö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. 7

    High-Performance and Energy-Efficient CNFET-Based Designs for Ternary Logic Circuits von Jaber, Ramzi A., Kassem, Abdallah, El-Hajj, Ahmad M., El-Nimri, Lina A., Haidar, Ali Massoud

    ISSN: 2169-3536, 2169-3536
    Veröffentlicht: Piscataway IEEE 2019
    Veröffentlicht in IEEE access (2019)
    “… )] and combinational circuits [ternary decoder (TDecoder), ternary half-adder (THA), and ternary multiplier (TMUL …”
    Volltext
    Journal Article
  8. 8

    Fast, minimal decoding complexity, system level, binary systematic (41, 32) single-error-correcting codes for on-chip DRAM applications von Amir, K., Eric, B.

    ISBN: 9780769512037, 0769512038
    ISSN: 1550-5774
    Veröffentlicht: IEEE 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. 9

    Novel method of designing all optical frequency-encoded Fredkin and Toffoli logic gates using semiconductor optical amplifiers von Garai, S.K.

    ISSN: 1751-8768, 1751-8776
    Veröffentlicht: Stevenage The Institution of Engineering & Technology 01.12.2011
    Verö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. 10

    Two efficient and low-complexity iterative reliability-based majority-logic decoding algorithms for LDPC codes von Qin Huang, Jingyu Kang, Li Zhang, Shu Lin, Abdel-Ghaffar, K.

    ISBN: 9781424449828, 1424449820
    Veröffentlicht: IEEE 01.01.2009
    Verö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. 11

    Computational complexity of controllability/observability problems for combinational circuits von Fujiwara, H.

    ISBN: 9780818608674, 0818608676
    Veröffentlicht: IEEE Comput. Soc. Press 1988
    “… The computational complexity of fault detection problems and various controllability and observability problems for combinational logic circuits are analyzed …”
    Volltext
    Tagungsbericht
  12. 12

    Customized Algorithms for High Performance Memory Test in Advanced Technology Node von Shomo Chen, Ning Huang, Ting-Pu Tai, Niu, A.

    ISBN: 0769538649, 9780769538648
    ISSN: 1081-7735
    Veröffentlicht: IEEE 01.11.2009
    Verö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. 13

    Early outpoint insertion for high-level software vs. RTL formal combinational equivalence verification von Xiushan Feng, Hu, A.J.

    ISBN: 1595933816, 9781595933812
    ISSN: 0738-100X
    Veröffentlicht: IEEE 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. 14

    Complexity of decoders--I: Classes of decoding rules von Savage, J.

    ISSN: 0018-9448, 1557-9654
    Veröffentlicht: IEEE 01.11.1969
    Verö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