Viterbi algorithm for sparse channels

被引：0
|
作者：
Universita' di Padova, Padova, Italy [1 ]
机构：
来源：
IEEE Trans Commun | / 3卷 / 287-289期
关键词：
D O I：
暂无
中图分类号：
学科分类号：
摘要：
引用
收藏
相关论文
共 50 条
  • [21] Stopping Criteria Analysis of the OMP Algorithm for Sparse Channels Estimation
    Dziwoki, Grzegorz
    Izydorczyk, Jacek
    COMPUTER NETWORKS, CN 2015, 2015, 522 : 250 - 259
  • [22] Algorithm to estimate OFDM synchronization and sparse channels by ZC sequences
    Sun, Hu
    Hu, Fangming
    Du, Qiang
    Huazhong Keji Daxue Xuebao (Ziran Kexue Ban)/Journal of Huazhong University of Science and Technology (Natural Science Edition), 2013, 41 (10): : 6 - 10
  • [23] Viterbi-based algorithm for side-match vector quantization over noisy channels
    Kuo, CJ
    Lin, CS
    IEEE TRANSACTIONS ON COMMUNICATIONS, 1996, 44 (11) : 1455 - 1465
  • [24] COMPARISON OF COMPROMISE VITERBI ALGORITHM AND STANDARD EQUALIZATION TECHNIQUES OVER BAND-LIMITED CHANNELS
    MAGEE, FR
    IEEE TRANSACTIONS ON COMMUNICATIONS, 1975, CO23 (03) : 361 - 367
  • [25] Viterbi algorithm for DSP processors
    Plevel, S
    Javornik, T
    Ozimek, I
    Trobec, R
    Kandus, G
    INFORMACIJE MIDEM-JOURNAL OF MICROELECTRONICS ELECTRONIC COMPONENTS AND MATERIALS, 2001, 31 (01): : 33 - 38
  • [26] RANGE OF METRICS IN THE VITERBI ALGORITHM
    TORTELIER, P
    DUPONTEIL, D
    ANNALS OF TELECOMMUNICATIONS, 1990, 45 (7-8) : 377 - 383
  • [27] The Viterbi Algorithm for Subset Selection
    Maymon, Shay
    Eldar, Yonina C.
    IEEE SIGNAL PROCESSING LETTERS, 2015, 22 (05) : 524 - 528
  • [28] A parallel Viterbi decoding algorithm
    Reeve, JS
    CONCURRENCY AND COMPUTATION-PRACTICE & EXPERIENCE, 2001, 13 (02) : 95 - 102
  • [29] Suboptimum Viterbi algorithm for trellis-coded QAM scheme in multipath Rayleigh fading channels
    Jeong, GY
    Kim, CJ
    Lee, HJ
    ELECTRONICS LETTERS, 1997, 33 (11) : 938 - 939
  • [30] 2 EXTENSIONS OF THE VITERBI ALGORITHM
    BOULOUTAS, A
    HART, GW
    SCHWARTZ, M
    IEEE TRANSACTIONS ON INFORMATION THEORY, 1991, 37 (02) : 430 - 436
12345