咨询与建议

限定检索结果

文献类型

  • 107 篇 期刊文献
  • 69 篇 会议
  • 2 篇 学位论文

馆藏范围

  • 178 篇 电子文献
  • 0 种 纸本馆藏

日期分布

学科分类号

  • 171 篇 工学
    • 142 篇 电气工程
    • 84 篇 信息与通信工程
    • 64 篇 计算机科学与技术...
    • 22 篇 电子科学与技术(可...
    • 8 篇 交通运输工程
    • 6 篇 机械工程
    • 4 篇 仪器科学与技术
    • 3 篇 软件工程
    • 2 篇 控制科学与工程
    • 1 篇 生物医学工程(可授...
  • 27 篇 理学
    • 23 篇 数学
    • 4 篇 物理学
    • 1 篇 生物学
  • 4 篇 医学
    • 4 篇 临床医学
    • 1 篇 特种医学
  • 2 篇 文学
    • 1 篇 外国语言文学
    • 1 篇 新闻传播学
  • 2 篇 管理学
    • 2 篇 管理科学与工程(可...
  • 1 篇 法学
    • 1 篇 社会学
  • 1 篇 教育学
    • 1 篇 教育学

主题

  • 178 篇 decoding complex...
  • 32 篇 decoding
  • 13 篇 complexity theor...
  • 12 篇 iterative decodi...
  • 10 篇 error correction...
  • 10 篇 diversity
  • 10 篇 convolutional co...
  • 9 篇 computational co...
  • 8 篇 encoding complex...
  • 8 篇 polar codes
  • 8 篇 parity check cod...
  • 8 篇 error exponent
  • 7 篇 codes
  • 7 篇 channel coding
  • 6 篇 concatenated cod...
  • 6 篇 turbo codes
  • 6 篇 block codes
  • 6 篇 ldpc codes
  • 6 篇 maximum likeliho...
  • 6 篇 mimo

机构

  • 8 篇 indian inst sci ...
  • 4 篇 nanyang technol ...
  • 3 篇 nanjing univ sch...
  • 2 篇 singapore univ t...
  • 2 篇 univ southern ca...
  • 2 篇 univ new s wales...
  • 2 篇 guangdong univ t...
  • 2 篇 singapore univ t...
  • 2 篇 beijing inst tec...
  • 2 篇 univ witwatersra...
  • 2 篇 sun yat sen univ...
  • 2 篇 russian acad sci...
  • 2 篇 univ turku dept ...
  • 2 篇 univ ulm dept te...
  • 2 篇 technion israel ...
  • 2 篇 osaka gakuin uni...
  • 2 篇 ozyegin univ dep...
  • 2 篇 department of el...
  • 2 篇 koc univ dept el...
  • 2 篇 lucent technol b...

作者

  • 5 篇 guan yong liang
  • 5 篇 pimentel cecilio
  • 5 篇 rajan b. sundar
  • 5 篇 souza richard de...
  • 4 篇 jiang hua
  • 4 篇 uchoa-filho bart...
  • 3 篇 kuo c. -c. jay
  • 3 篇 lee szu-wei
  • 3 篇 mceliece rj
  • 3 篇 aslam chaudhry a...
  • 3 篇 hisojo miguel an...
  • 3 篇 chen li
  • 3 篇 benchimol isaac
  • 3 篇 du sidan
  • 3 篇 hari k. v. s.
  • 3 篇 cai kui
  • 3 篇 zyablov v
  • 3 篇 deneire luc
  • 3 篇 cheun kyungwhoon
  • 3 篇 rajashekar raksh...

语言

  • 171 篇 英文
  • 4 篇 其他
  • 2 篇 中文
  • 1 篇 土耳其文
检索条件"主题词=decoding complexity"
178 条 记 录,以下是161-170 订阅
排序:
Squibs and discussions - decoding complexity in word-replacement translation models
收藏 引用
COMPUTATIONAL LINGUISTICS 1999年 第4期25卷 607-615页
作者: Knight, K Univ So Calif Inst Informat Sci Marina Del Rey CA 90292 USA
Statistical machine translation is a relatively new approach to the long-standing problem of translating human languages by computer. Current statistical techniques uncover translation rules from bilingual training te... 详细信息
来源: 评论
A new M-PSK code construction with good minimum Euclidean distance for AWGN channels
收藏 引用
IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES 2001年 第6期E84A卷 1564-1571页
作者: Ibn, A Tanabe, H Umeda, H Fukui Univ Dept Elect & Elect Engn Informat & Commun Syst Lab Fukui 9109507 Japan
An important goal in communication theory is to construct good minimum squared Euclidean distance (MSED) codes for transmission over additive white Gaussian noise (AWGN) channels. In this paper, a new construction met... 详细信息
来源: 评论
On algebraic soft-decision decoding algorithms for BCH codes
收藏 引用
IEEE TRANSACTIONS ON INFORMATION THEORY 2001年 第1期47卷 45-58页
作者: Kamiya, N NEC Corp Ltd C&C Media Res Labs Miyamae Ku Kawasaki Kanagawa 2168555 Japan
In this paper, three algebraic soft-decision decoding algorithms are presented for binary Bose-Chaudhuri-Hocquengham (BCH) codes. Two of these algorithms are based on the bounded distance (BD) +1 generalized minimum-d... 详细信息
来源: 评论
On the error exponent for woven convolutional codes with inner warp
收藏 引用
IEEE TRANSACTIONS ON INFORMATION THEORY 2001年 第3期47卷 1195-1199页
作者: Zyablov, VV Shavgulidze, S Johannesson, R Russian Acad Sci Inst Problems Informat Transmiss Moscow 101447 Russia Georgian Tech Univ Dept Digital Commun Theory Tbilisi 380075 Georgia Lund Univ Dept Informat Technol Informat Theory Grp S-22100 Lund Sweden
In this correspondence, the error exponents and decoding complexity of binary woven convolutional codes with outer and inner warp are studied. It is shown that for both constructions an error probability that is expon... 详细信息
来源: 评论
Modified turbo codes with low decoding complexity
收藏 引用
ELECTRONICS LETTERS 1998年 第23期34卷 2228-2229页
作者: Ping, L City Univ Hong Kong Dept Elect Engn 83 Tat Chee Ave Kowloon Peoples R China
A family of modified turbo codes with SPC precoding is presented. Compared viith standard turbo codes, the new scheme results in considerably lower decoding cost yet can achieve nearly the same performance.
来源: 评论
Design of trellis decoders for block-coded modulation schemes
收藏 引用
IEE PROCEEDINGS-COMMUNICATIONS 2000年 第1期147卷 1-7页
作者: Petronio, MA Carrasco, RA Staffordshire Univ Sch Engn & Adv Technol Stafford ST18 0AD Staffs England
Block-coded modulation (BCM) combines bandwidth-efficient modulation techniques with error-correction capabilities to allow efficient data transmission over mobile communication channels. The main shortcoming of BCM i... 详细信息
来源: 评论
On the error exponent for woven convolutional codes with outer warp
收藏 引用
IEEE TRANSACTIONS ON INFORMATION THEORY 1999年 第5期45卷 1649-1653页
作者: Zyablov, V Shavgulidze, S Skopintsev, O Höst, S Johannesson, R Univ Lund Dept Informat Technol Informat Theory Grp S-22100 Lund Sweden
In this correspondence the error exponent and the decoding complexity of binary woven convolutional codes with outer warp and with binary convolutional codes as outer and inner codes are studied. It is shown that an e... 详细信息
来源: 评论
On the complexity of decoding lattices using the Korkin-Zolotarev reduced basis
收藏 引用
IEEE TRANSACTIONS ON INFORMATION THEORY 1998年 第1期44卷 162-171页
作者: Banihashemi, AH Khandani, AK Univ Waterloo Dept Elect & Comp Engn Waterloo ON N2L 3G1 Canada
Upper and lower bounds are derived for the decoding complexity of a general lattice L. The bounds are in terms of the dimension n and the coding gain gamma of L, and are obtained based on a decoding algorithm Which is... 详细信息
来源: 评论
Trellis decoding complexity of linear block codes
收藏 引用
IEEE TRANSACTIONS ON INFORMATION THEORY 1996年 第6期42卷 1687-1697页
作者: Kiely, AB Dolinar, SJ McEliece, RJ Ekroot, LL Lin, W CALTECH DEPT ELECT ENGNPASADENACA 91109
In this partially tutorial paper, we examine minimal trellis representations of linear block codes and analyze several measures of trellis complexity: maximum state and edge dimensions, total span length, and total ve... 详细信息
来源: 评论
Low-complexity decoding of partial unit memory codes on preceded partial-response channels
收藏 引用
IEEE TRANSACTIONS ON INFORMATION THEORY 1997年 第3期43卷 1052-1058页
作者: Hole, MF Hole, KJ Department of Informatics University of Bergen Bergen Norway
Cosets of convolutional codes can be used to obtain large free Euclidean distances and short maximum zero-run lengths at the output of the 1 - D partial-response channel (PRC). We present a new soft-decision decoding ... 详细信息
来源: 评论