Suchergebnisse - computational decoding complexity

  1. 1

    A new computational decoding complexity measure of convolutional codes von Benchimol, Isaac B, Pimentel, Cecilio, Souza, Richard Demo, Uchôa-Filho, Bartolomeu F

    ISSN: 1687-6180, 1687-6172, 1687-6180
    Veröffentlicht: Cham Springer International Publishing 04.12.2014
    Veröffentlicht in EURASIP journal on advances in signal processing (04.12.2014)
    “… This paper presents a computational complexity measure of convolutional codes well suitable for software implementations of the Viterbi algorithm (VA …”
    Volltext
    Journal Article
  2. 2

    Research on Low-complexity Decoding Method in Massive Antenna System von ZHENG Xianxia,WANG Haiquan,LI Fei,YING Mengyun,ZHOU Meijun

    ISSN: 1000-3428
    Veröffentlicht: Editorial Office of Computer Engineering 01.10.2017
    Veröffentlicht in Ji suan ji gong cheng (01.10.2017)
    “… In massive antenna system,the computational complexities of linear channel estimation and linear decoding …”
    Volltext
    Journal Article
  3. 3

    Computational Complexity of Decoding Orthogonal Space-Time Block Codes von Ayanoglu, E, Larsson, E G, Karipidis, E

    ISSN: 0090-6778, 1558-0857, 1558-0857
    Veröffentlicht: New York, NY IEEE 01.04.2011
    Veröffentlicht in IEEE transactions on communications (01.04.2011)
    “… The computational complexity of optimum decoding for an orthogonal space-time block code G N satisfying G N H G N = c(Σ k=1 K |s k | 2 …”
    Volltext
    Journal Article
  4. 4

    Achieving PAC Code Performance with SCL Decoding without Extra Computational Complexity von Gelincik, Samet, Mary, Philippe, Baudais, Jean-Yves, Savard, Anne

    ISSN: 1938-1883
    Veröffentlicht: IEEE 16.05.2022
    “… In this paper, we propose a code design method to decrease the number of low weight codewords for some information lengths with a very low computational complexity …”
    Volltext
    Tagungsbericht
  5. 5

    Low computational complexity methods for decoding of STBC in the uplink of a massive MIMO system von Mousavi, Seyed Hosein, Pourrostam, Jafar

    ISSN: 1687-1499, 1687-1472, 1687-1499
    Veröffentlicht: Cham Springer International Publishing 03.06.2020
    “… Reducing the computational complexity of the modern wireless communication systems such as massive MIMO configurations is of utmost interest …”
    Volltext
    Journal Article
  6. 6

    Computational Complexity Analysis of FEC Decoding on SDR Platforms von Wu, Zhenzhi, Gong, Chen, Liu, Dake

    ISSN: 1939-8018, 1939-8115, 1939-8115
    Veröffentlicht: New York Springer US 01.11.2017
    Veröffentlicht in Journal of signal processing systems (01.11.2017)
    “… The computational complexity evaluation is necessary for software defined Forward Error Correction (FEC) decoders …”
    Volltext
    Journal Article
  7. 7

    Low computational complexity joint iterative detection and decoding without ARQ in massive MIMO systems with UAVs von Mousavi, Seyed Hosein, Pourrostam, Jafar, Nangir, Mahdi

    ISSN: 0140-3664, 1873-703X
    Veröffentlicht: Elsevier B.V 01.08.2022
    Veröffentlicht in Computer communications (01.08.2022)
    “… Unmanned aerial vehicles (UAVs) have a wide range of military and commercial applications. UAVs play an important role in 6G networks due to their low cost and …”
    Volltext
    Journal Article
  8. 8

    On the Logical Computational Complexity Analysis of Turbo Decoding Algorithms for the LTE Standards von Beeharry, Y., Fowdur, T. P., Soyjaudah, K. M. S.

    ISSN: 0929-6212, 1572-834X
    Veröffentlicht: New York Springer US 01.05.2021
    Veröffentlicht in Wireless personal communications (01.05.2021)
    “… Evaluating the computational complexity of decoders is a very important aspect in the area of Error Control Coding …”
    Volltext
    Journal Article
  9. 9

    Improving the probability of complete decoding of random code by trading-off computational complexity von Chong, Zan-Kai, Goi, Bok-Min, Ohsaki, Hiroyuki, Bryan Ng, Cheng-Kuan, Ewe, Hong-Tat

    ISSN: 1751-8628, 1751-8636, 1751-8636
    Veröffentlicht: The Institution of Engineering and Technology 17.12.2015
    Veröffentlicht in IET Communications (17.12.2015)
    “… + 10 encoded symbols with high probability of complete decoding (PCD), i.e. 99.9% successful decoding, irrespective of the message length, k …”
    Volltext
    Journal Article
  10. 10

    Upper and Lower Bounds on the Computational Complexity of Polar Encoding and Decoding von Blake, Christopher G., Kschischang, Frank R.

    ISSN: 0018-9448, 1557-9654
    Veröffentlicht: New York IEEE 01.09.2019
    Veröffentlicht in IEEE transactions on information theory (01.09.2019)
    “… A general class of circuits that compute successive cancellation decoding adapted from Arıkan's butterfly network algorithm is defined …”
    Volltext
    Journal Article
  11. 11

    Linear computational complexity decoding for semi orthogonal full rate space time codes von Laufer, A, Bar-Ness, Y

    ISBN: 1612842550, 9781612842554
    ISSN: 1525-3511
    Veröffentlicht: IEEE 01.03.2011
    “… Communication with low complexity decoding is an important attribute for many applications …”
    Volltext
    Tagungsbericht
  12. 12

    Low-complexity optimal MPSK detection for spatial modulation von Hong-zhi MEN, Ming-lu JIN

    ISSN: 1000-436X
    Veröffentlicht: Editorial Department of Journal on Communications 01.08.2015
    Veröffentlicht in Tongxin Xuebao (01.08.2015)
    “… constellation,a low-complexity optimal detection which is independent to modulation order was developed.Since the approach avoids the exhaustive searching on signal constellation space,the computational complexity can be significantly …”
    Volltext
    Journal Article
  13. 13

    On Sequential Decoding Metric Function of Polarization-Adjusted Convolutional (PAC) Codes von Moradi, Mohsen

    ISSN: 0090-6778, 1558-0857
    Veröffentlicht: New York IEEE 01.12.2021
    Veröffentlicht in IEEE transactions on communications (01.12.2021)
    “… In this paper, we present a sequential decoding metric function, which leads to significantly improved computational complexity while maintaining the superiority of polarization-adjusted convolutional (PAC …”
    Volltext
    Journal Article
  14. 14

    Computational Complexity of Decoding Orthogonal Space-Time Block Codes von Ayanoglu, Ender, Larsson, Erik G, Karipidis, Eleftherios

    ISBN: 1424464021, 9781424464029
    ISSN: 1550-3607
    Veröffentlicht: IEEE 01.05.2010
    “… The computational complexity of optimum decoding for an orthogonal space-time block code is quantified …”
    Volltext
    Tagungsbericht
  15. 15
  16. 16
  17. 17

    A New Decoding Method for Reed-Solomon Codes Based on FFT and Modular Approach von Tang, Nianqi, Han, Yunghsiang S.

    ISSN: 0090-6778, 1558-0857
    Veröffentlicht: New York IEEE 01.12.2022
    Veröffentlicht in IEEE transactions on communications (01.12.2022)
    “… ) RS codes, where n is the code length and k is the code dimension, the proposed decoding algorithm has both the best asymptotic computational complexity O ( n log( n-k )+( n-k ) log 2 ( n-k …”
    Volltext
    Journal Article
  18. 18

    Application of syndrome based Turbo decoding with adaptive computational complexity in LTE downlink von Geldmacher, J., Hueske, K., Kosakowski, M., Götze, J.

    ISSN: 1684-9973, 1684-9965, 1684-9973
    Veröffentlicht: Katlenburg-Lindau Copernicus GmbH 18.09.2012
    Veröffentlicht in Advances in radio science (18.09.2012)
    “… This paper describes the application of an adaptive complexity decoder for the Long Term Evolution (LTE …”
    Volltext
    Journal Article
  19. 19

    Soft-Input Soft-Output Single Tree-Search Sphere Decoding von Studer, Christoph, Bölcskei, Helmut

    ISSN: 0018-9448, 1557-9654
    Veröffentlicht: New York, NY IEEE 01.10.2010
    Veröffentlicht in IEEE transactions on information theory (01.10.2010)
    “… The computational complexity of SISO detection often poses significant challenges for practical receiver implementations, in particular in the context of multiple-input multiple-output (MIMO …”
    Volltext
    Journal Article
  20. 20

    An Improved A^ Decoding Algorithm With List Decoding von Xu, Bin, Ying, Chenhao, Luo, Yuan

    ISSN: 2169-3536, 2169-3536
    Veröffentlicht: Piscataway IEEE 01.01.2018
    Veröffentlicht in IEEE access (01.01.2018)
    “… Comparing with hard decision decoding algorithms, soft decoding has a lower probability of bit error but a higher computational complexity …”
    Volltext
    Journal Article