检索结果-内蒙古大学图书馆

A new computational decoding complexity measure of convolutional codes

EURASIP JOURNAL ON ADVANCES IN SIGNAL PROCESSING 2014年第1期2014卷 1页

作者： Benchimol, Isaac B. Pimentel, Cecilio Souza, Richard Demo Uchoa-Filho, Bartolomeu F. Fed Inst Amazonas IFAM BR-69077000 Manaus Amazonas Brazil Fed Univ Pernambuco UFPE BR-50670901 Recife PE Brazil Fed Univ Technol Parana UTFPR BR-80230901 Curitiba Parana Brazil Univ Fed Santa Catarina BR-88040900 Florianopolis SC Brazil

This paper presents a computational complexity measure of convolutional codes well suitable for software implementations of the Viterbi algorithm (VA) operating with hard decision. We investigate the number of arithmetic operations performed by the decoding process over the conventional and minimal trellis modules. A relation between the complexity measure defined in this work and the one defined by McEliece and Lin is investigated. We also conduct a refined computer search for good convolutional codes (in terms of distance spectrum) with respect to two minimal trellis complexity measures. Finally, the computational cost of implementation of each arithmetic operation is determined in terms of machine cycles taken by its execution using a typical digital signal processor widely used for low-power telecommunications applications.

关键词： Convolutional codes Computational complexity decoding complexity Distance spectrum Trellis module Viterbi algorithm

来源：评论

学校读者我要写书评

暂无评论

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 vertices, edges and mergers. We obtain bounds on these complexities as extensions of well-known dimension/length profile (DLP) bounds, Codes meeting these bounds minimize all the complexity measures simultaneously;conversely, a code attaining the bound for total span length, vertices, or edges, must likewise attain it for all the others, We define a notion of ''uniform'' optimality that embraces different domains of optimization, such as different permutations of a code or different codes with the same parameters, and we give examples of uniformly optimal codes and permutations, We also give some conditions that identify certain cases when no code or permutation can meet the bounds, In addition to DLP-based bounds, we derive new inequalities relating one complexity measure to another, which can be used in conjunction with known. bounds on one measure to imply bounds on the others, As an application, we infer new bounds on maximum state and edge complexity and on total vertices and edges from bounds on span lengths.

关键词： trellis decoding block codes decoding complexity minimal trellises dimension/length profiles

来源：评论

学校读者我要写书评

暂无评论

Performance and decoding complexity of nonbinary LDPC codes for magnetic recording

引用

IEEE TRANSACTIONS ON MAGNETICS 2008年第1期44卷 211-216页

作者： Chang, Wu Cruz, J. R. Univ Oklahoma Sch Elect & Comp Engn Norman OK 73019 USA

We consider a group of high-performance q-ary low-density parity-check (LDPC) coded perpendicular magnetic recording channels (PMRCs) with optimized targets and codes over various field sizes. We show that the nonbinary LDPC-coded PMRCs provide 1-dB coding gain over a practical implementation of a good binary LDPC-coded PMRC at user density of 1.22, and evaluate the decoding complexities of these systems in terms of both the number of floating-point (FLP) operations and the computational time. decoding complexity ratios of nonbinary LDPC-coded PMRCs to the binary LDPC-coded system are presented. After careful analysis, we conclude that the time complexity ratios are always smaller than the ratios obtained by the number of FLP operations, which do not exceed 7.42. Furthermore, experimental results show that the size of the Galois field does not affect the decoding complexity.

关键词： decoding complexity iterative decoding low-density parity-check codes partial response channels perpendicular magnetic recording

来源：评论

学校读者我要写书评

暂无评论

Reduce the decoding complexity: segment linear network coding

引用

The Journal of China Universities of Posts and Telecommunications 2013年第6期20卷 55-61页

作者： GUO Yi-jun HAO Jian-jun YUE Guang-xin School of Telecommunication Engineering Beijing University of Posts and Telecommunications

The throughput gain obtained by linear network coding （LNC） grows as the generation size increases, while the decoding complexity also grows exponentially. High decoding complexity makes the decoder to be the bottleneck for high speed and large data transmissions. In order to reduce the decoding complexity of network coding, a segment linear network coding （SLNC） scheme is proposed. SLNC provides a general coding structure for the generation-based network coding. By dividing a generation into several segments and restraining the coding coefficients of the symbols within the same segment, SLNC splits a high-rank matrix inversion into several low-rank matrix inversions, therefore reduces the decoding complexity dramatically. In addition, two coefficient selection strategies are proposed for both centrally controlled networks and distributed networks respectively. The theoretical analysis and simulation results prove that SLNC achieves a fairly low decoding complexity at a cost of rarely few extra transmissions.

关键词： SLNC generation-based network coding random LNC decoding complexity extra transmission cost

来源：评论

学校读者我要写书评

暂无评论

Block-Orthogonal Space-Time Code Structure and Its Impact on QRDM decoding complexity Reduction

引用

IEEE JOURNAL OF SELECTED TOPICS IN SIGNAL PROCESSING 2011年第8期5卷 1438-1450页

作者： Ren, Tian Peng Guan, Yong Liang Yuen, Chau Zhang, Er Yang Natl Univ Def Technol Coll Elect Sci & Engn Changsha 410073 Hunan Peoples R China Nanyang Technol Univ Sch Elect & Elect Engn Singapore 639798 Singapore Singapore Univ Technol & Design Singapore 279623 Singapore

Full-rate space time codes (STCs) with rate = number of transmit antennas have high multiplexing gain, but high decoding complexity even when decoded using reduced-complexity decoders such as sphere or QRDM decoders. In this paper, we introduce a new code property of STC called block-orthogonal property, which can be exploited by QR-decomposition-based decoders to achieve significant decoding complexity reduction without performance loss. We show that such complexity reduction principle can benefit the existing algebraic codes such as Perfect and DjABBA codes due to their inherent (but previously undiscovered) block-orthogonal property. In addition, we construct and optimize new full-rate block-orthogonal STC (BOSTC) that further maximize the QRDM complexity reduction potential. Simulation results of bit error rate (BER) performance against decoding complexity show that the new BOSTC outperforms all previously known codes as long as the QRDM decoder operates in reduced-complexity mode, and the code exhibits a desirable complexity saturation property.

关键词： Block-orthogonal space time codes (STC) decoding complexity orthogonal STC QRD-M algorithm quasi-orthogonal STC

来源：评论

学校读者我要写书评

暂无评论

Evaluating MPEG-4 video decoding complexity for an alternative video complexity verifier model

引用

IEEE TRANSACTIONS ON CIRCUITS AND SYSTEMS FOR VIDEO TECHNOLOGY 2002年第11期12卷 1034-1044页

作者： Valentim, J Nunes, P Pereira, F Univ Tecn Lisboa Inst Super Tecn Inst Telecommun P-1049001 Lisbon Portugal

MPEG-4 is the first object-based audiovisual coding standard. To control the minimum decoding complexity resources required at the decoder, the MPEG-4 Visual standard defines the so-called video buffering verifier mechanism, which includes three virtual buffer models, among them the video complexity verifier (VCV). This paper proposes an alternative VCV model, based on a set of macroblock (MB) relative decoding complexity weights assigned to the various NIB coding types used in MPEG-4 video coding. The new VCV model allows a more efficient use of the available decoding resources by preventing the overevaluation of the decoding complexity of certain MB types and thus making it possible to encode scenes (for the same profile@level decoding resources) which otherwise would be considered too demanding.

关键词： decoding complexity MPEG-4 standard profiles and levels video complexity verifier (VCV) model

来源：评论

学校读者我要写书评

暂无评论

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.

关键词： turbo codes single parity check modified turbo codes Codes SPC precoding decoding complexity decoding cost decoding

来源：评论

学校读者我要写书评

暂无评论

Construction of Block Orthogonal STBCs and Reducing Their Sphere decoding complexity

引用

IEEE TRANSACTIONS ON WIRELESS COMMUNICATIONS 2014年第5期13卷 2906-2919页

作者： Jithamithra, G. R. Rajan, B. Sundar Indian Inst Sci Dept Elect Commun Engn Bangalore 560012 Karnataka India

A new class of Space Time Block Codes (STBCs) known as block orthogonal STBCs (BOSTBCs) was recently presented by Ren et al., which could be exploited by a QR decomposition decoder with M paths (QRDM decoder) to achieve significant decoding complexity reduction without performance loss. The block orthogonal property of the codes constructed, was however only shown via simulations. In this paper, we give analytical proofs for the block orthogonal structure of various existing codes in literature including codes formed as the sum of Clifford Unitary Weight Designs (CUWDs). We also show that, construction methods from Coordinate Interleaved Orthogonal Designs (CIODs), Cyclic Division Algebras (CDAs) and Crossed-Product Algebras (CPAs) can lead to BOSTBCs. In addition, we show that the block orthogonal STBCs offer a reduced decoding complexity when used in tandem with a fast sphere decoder using a depth first search approach. Simulation results involving decoding complexity show a 30% reduction in the number of floating point operations (FLOPS) of BOSTBCs as compared to STBCs without the block orthogonal structure.

关键词： Space-time block codes (STBC) block-orthogonal STBC decoding complexity sphere decoder

来源：评论

学校读者我要写书评

暂无评论

A New Blind SLM Scheme With Low decoding complexity for OFDM Systems

引用

IEEE TRANSACTIONS ON BROADCASTING 2012年第4期58卷 669-676页

作者： Joo, Hyun-Seung Heo, Seok-Joong Jeon, Hyun-Bae No, Jong-Seon Shin, Dong-Joon Seoul Natl Univ INMC Dept Elect Engn & Comp Sci Seoul 151744 South Korea Hanyang Univ Dept Elect Engn Seoul 133791 South Korea

In this paper, a new blind selected mapping (BSLM) scheme is proposed for orthogonal frequency division multiplexing systems. The proposed BSLM scheme embeds the side information identifying a phase sequence into itself by giving the optimal phase offset to the elements of each phase sequence, which are determined by the biorthogonal vectors for the partitioned subblocks. When U phase sequences and maximum likelihood decoder are used, the proposed BSLM scheme reduces the decoding complexity by (U - 2)/U compared with the conventional BSLM scheme. Also, pairwise error probability (PEP) analysis for the proposed BSLM scheme is performed over the fading channel. Based on the PEP analysis, the bit error rate (BER) performance of the proposed BSLM scheme is shown to be determined by the subblock partitioning and phase offset. Finally, it is shown that for QPSK and 16-QAM, the detection failure probability and the BER of the proposed BSLM scheme are almost the same as those of the conventional BSLM scheme through numerical analysis.

关键词： Blind selected mapping (BSLM) decoding complexity orthogonal frequency division multiplexing (OFDM) peak-to-average power ratio (PAPR) side information (SI)

来源：评论

学校读者我要写书评

暂无评论

Tradeoffs between error performance and decoding complexity in multilevel 8-PSK codes with UEP capabilities and multistage decoding

引用

IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES 2000年第8期E83A卷 1704-1712页

作者： Isaka, M Morelos-Zaragoza, RH Fossorier, MPC Lin, S Imai, H Univ Tokyo Inst Ind Sci Tokyo 1068558 Japan SONY Comp Sci Labs Inc Adv Telecommun Lab Tokyo 1410022 Japan Univ Hawaii Dept Elect Engn Honolulu HI 96822 USA Univ Calif Davis Dept Elect & Comp Engn Davis CA 95616 USA

In this paper, ne investigate multilevel coding and multistage decoding For satellite broadcasting with moderate decoding complexity. An unconventional signal set partitioning is used to achieve unequal error protection capabilities. Two possibilities are shown and analyzed for practical systems: (i) linear block component codes with near optimum decoding, (ii) punctured convolutional component codes Kith a common trellis structure.

关键词： multilevel codes multistage decoding tradeoffs decoding complexity error performance

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：