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

Turbo Product Codes: Applications, Challenges, and Future Directions

IEEE COMMUNICATIONS SURVEYS AND TUTORIALS 2016年第4期18卷 3052-3069页

作者： Mukhtar, H. Al-Dweik, A. Shami, A. Khalifa Univ Dept Elect & Comp Engn Abu Dhabi 27788 U Arab Emirates Western Univ Dept Elect & Comp Engn London ON N6A 5B9 Canada

Turbo product codes (TPCs) have been integrated in several practical applications, and hence, they have been considered widely in the literature where the main aim is improving the error performance and/or reducing the computational and implementation complexity. This paper presents a comprehensive survey of the research that focuses on TPCs in terms of encoding, decoding, error performance, and complexity. Moreover, this paper also considers the advantages of integrating TPCs in hybrid automatic repeat request systems where power optimization becomes very efficient and the complexity can be reduced using the unique properties of TPCs such as error self-detection capabilities. Based on the surveyed literature, the pivotal open research issues in TPCs are presented and discussed.

关键词： Turbo codes product codes error control coding error correction iterative decoding error detection automatic repeat request soft decision decoding energy efficiency complexity reduction

来源：评论

学校读者我要写书评

暂无评论

Partial-prefix synchronizable codes

引用

IEEE TRANSACTIONS ON INFORMATION THEORY 2001年第5期47卷 1839-1848页

作者： van Wijngaarden, AJ Morita, H Univ Essen Gesamthsch Inst Expt Math Digital Commun Dept Essen Germany Univ Electrocommun Grad Sch Informat Syst Chofu Tokyo 182 Japan

A new class of codes for frame synchronization is proposed, Commonly, the beginning of every fixed or variable-length frame is identified by a given contiguous sequence called a prefix, To avoid the occurrence of the prefix elsewhere in the frame, a prefix synchronizable code (PS-code) is used. PS-codes have the property that the prefix does not occur in any codeword or in any concatenation of codewords in any position other than the first position. The new codes, termed partial-prefix synchronizable codes (PPS-codes), use a fixed sequence of symbols that is interspersed with symbols that carry information, The contiguous sequence from the first fixed symbol to the last fixed symbol is called a "partial-prefix." Consequently, not one but a set of possible prefixes is used, and none of these prefixes is allowed to occur at any other than the first position of a codeword, The cardinality of PPS-codes is determined, and coding algorithms are proposed which have a computational complexity proportional to the length of the codewords, It is demonstrated that in comparison with PS-codes, PPS-codes have similar coding and prefix detection complexity, but they have a larger code size and have better error control capabilities.

关键词： block codes combinatorial mathematics error control coding frame synchronization variable-length codes

来源：评论

学校读者我要写书评

暂无评论

On the security of the visual hash function

引用

JOURNAL OF ELECTRONIC IMAGING 2005年第1期14卷 013011.1-013011.1页

作者： Radhakrishnan, R Xiong, ZY Memon, N Polytech Univ Brooklyn NY 11201 USA Univ Illinois Champaign IL 61820 USA

Robust hash functions are central to the security of multimedia content authentication systems. Such functions are sensitive to a key but are robust to many allowed signal processing operations on the underlying content. The robustness of the hash function to changes in the original content implies the existence of a cluster in the feature space around the original contents feature vector, any point within which getting hashed to the same output. The shape and size of the cluster determines the trade-off between the robustness offered and the security of the authentication system based on the robust hash function. The clustering itself is based on a secret key and hence unknown to the attacker However, we show that the specific clustering arrived at by the robust visual hash function (VHF) may be possible to learn. Given just an input and its hash bits, we show how to construct a statistical model of the hash function, without any knowledge of the secret key used to compute the hash. We also show how to use this model to engineer arbitrary and malicious collisions. Finally, we propose one possible modification to VHF so that constructing a model that mimics its behavior becomes difficult. 2005 SPIE and IS&T.

关键词： Visualization Image processing Statistical analysis Image compression Multimedia Signal processing Data modeling Feature extraction Statistical modeling error control coding

来源：评论

学校读者我要写书评

暂无评论

Threshold decoding and a new class of threshold decodable codes

引用

IEE PROCEEDINGS-COMMUNICATIONS 1998年第5期145卷 289-296页

作者： Peng, XH Farrell, PG Univ Manchester Manchester M13 9PL Lancs England

An approach is introduced towards generalised threshold decoding, in which the threshold value is not necessarily a majority element. This approach can help extend the threshold decoding method to more types of code in order to benefit from having low decoding complexities. With the motivation of finding codes decodable by applying the general threshold decoding rule, a class of block codes, called parity-check-based codes? is investigated. The method of constructing this class of codes differs from traditional approaches, i.e. the encoding procedure is based on the given parity-check symbols, instead of information symbols, with the aim of having a simple decoding algorithm. Better code performance can be achieved with some of these codes than those using similar decoding methods.

关键词： error control coding threshold decoding threshold decodable codes

来源：评论

学校读者我要写书评

暂无评论

On the efficiency of the shortened error correcting codes

引用

INTERNATIONAL JOURNAL OF ELECTRICAL ENGINEERING EDUCATION 2013年第2期50卷 201-212页

作者： Liaperdos, I. Paraskevas, I. Potirakis, S. M. Technol Educ Inst Kalamata Dept Technol Informat & Telecommun Branch Sparta Sparta Greece Technol Educ Inst Piraeus Dept Elect Athens Greece

Shortening is a widely used technique aiming mainly to reduce the block size of an error correcting code and at the same time to enhance its efficiency. However, due to a common misapprehension, students tend to believe that maximum shortening retains maximum coding efficiency. In this work, an educational approach is presented which eliminates the aforementioned misapprehension. Specifically, the efficiency of the shortened error correcting codes is examined both theoretically and experimentally via simulations.

关键词： coding efficiency error control coding shortened codes

来源：评论

学校读者我要写书评

暂无评论

error Resilient Video coding Using Redundant Pictures

引用

IEEE TRANSACTIONS ON CIRCUITS AND SYSTEMS FOR VIDEO TECHNOLOGY 2009年第1期19卷 3-14页

作者： Zhu, Chunbo Wang, Ye-Kui Hannuksela, Miska M. Li, Houqiang Univ Sci & Technol China Dept Elect Engn & Informat Sci Hefei 230027 Peoples R China Nokia Res Ctr FIN-33721 Tampere Finland

This paper presents several error resilient video coding methods based on redundant pictures. We combine redundant picture coding with reference picture selection and reference picture list reordering to prevent error propagation in motion compensated video coding. A hierarchical redundant picture allocation method is employed to make a tradeoff between error resilience and coding efficiency. For improved end-to-end rate-distortion performance in packet loss environment, three adaptive redundant picture allocation methods are further developed, utilizing characteristics of the input video content. Simulation results show that the adaptive redundant picture coding methods can achieve average luma peak-signal-to-noise improvements up to 3.5 dB compared to the loss-aware rate distortion optimized intra macroblock refresh algorithm implemented in the H.264/AVC Joint Model (JM). The proposed redundant picture coding methods are standard-compliant and do not introduce any additional end-to-end delay, therefore suit for low-delay applications such as video telephony and video conferencing. Due to the good error resilience performance, some of the proposed redundant picture coding methods have been adopted and integrated into the JM.

关键词： error control coding error resilience redundant picture video coding

来源：评论

学校读者我要写书评

暂无评论

A network coding approach to cooperative diversity

引用

IEEE TRANSACTIONS ON INFORMATION THEORY 2007年第10期53卷 3714-3722页

作者： Xiao, Lei Fuja, Thomas E. Kliewer, Joerg Costello, Daniel J., Jr. Univ Notre Dame Dept Elect Engn Notre Dame IN 46556 USA

This paper proposes a network coding approach to cooperative diversity featuring the algebraic superposition of channel codes over a finite field. The scenario under consideration is one in which two "partners"-Node A and Node B-cooperate in transmitting information to a single destination;each partner transmits both locally generated information and relayed information that originated at the other partner. A key observation is that Node B already knows Node A's relayed information (because it originated at Node B) and can exploit that knowledge when decoding Node A's local information. This leads to an encoding scheme in which each partner transmits the algebraic superposition of its local and relayed information, and the superimposed codeword is interpreted differently at the two receivers- i.e., at the other partner and at the destination node-based on their different a priori knowledge. Decoding at the destination is then carried out by iterating between the codewords from the two partners. It is shown via simulation that the proposed scheme provides substantial coding gain over other cooperative diversity techniques, including those based on time multiplexing and signal (Euclidean space) superposition.

关键词： cooperative diversity error control coding fading channels iterative decoding network coding

来源：评论

学校读者我要写书评

暂无评论

Robust transmission of regions of interest in JPEG2000

引用

JOURNAL OF ELECTRONIC IMAGING 2006年第1期15卷 013008.1-013008.6页

作者： Sanchez, Victor F. Mandal, Mrinal Kr. Basu, Anup Univ Alberta Dept Elect & Comp Engn Edmonton AB T6G 2E8 Canada Univ Alberta Dept Comp Sci Edmonton AB T6G 2E8 Canada

We present a technique to robustly transmit regions of interest in the JPEG2000 framework. The technique assumes a prioritized region of interest coding and optimally assigns channel protection to the coded data according to the importance of every packet in the final bit stream. The mean energy of the transform coefficients contained in a packet, and the distance of a packet from the region of interest, determine the importance of every packet. Channel protection is achieved by means of a concatenation of a cyclic redundancy check outer coder and an inner rate-compatible convolutional coder. Simulation results performed over a Rayleigh-fading channel show an improvement in the visual quality of the reconstructed images. (c) 2006 SPIE and IS&T.

关键词： JPEG2000 Image quality Distortion error control coding Image compression Visualization Computer programming Image processing Signal to noise ratio Image resolution

来源：评论

学校读者我要写书评

暂无评论

Single byte error Correcting codes with double bit within a block error Correcting capability for memory systems

引用

IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES 2002年第2期E85A卷 513-517页

作者： Umanesan, G Fujiwara, E Tokyo Inst Technol Grad Sch Informat Sci & Engn Tokyo 1528552 Japan

Existing byte error control codes require too many check bits if applied to a memory system that uses recent semiconductor memory chips with wide I/O data such as 16 or 32 bits, i.e., b = 16 or 32. On the other hand, semiconductor memory chips are highly vulnerable to random double bit within a memory chip errors when they are used in some applications. such as satellite memory systems. Under this situation, it becomes necessary to design suitable new codes with double bit within a chip error correcting capability for computer memory systems. This correspondence proposes a class of codes called Double bit within a block error Correcting - Single b-bit byte error Correcting ((DEC)(B)-SbEC) codes where block and byte correspond to memory chip and memory sub-array data outputs, respectively. The proposed codes provide protection from both random double bit errors and single sub-array data faults. For most of the practical cases, the (DEC)(B)-SbEC codes presented in this correspondence have the capability of accommodating the check bits in a single dedicated memory chip.

关键词： Bit/Byte/Block error control coding random double bit within a block error double bit within a block error correcting - single b-bit byte error correcting ((DEC)(B)-SbEC) codes

来源：评论

学校读者我要写书评

暂无评论

A Simple Way to Compute Minimum Euclidean Distance for Synchronous Coded Multiuser Systems

引用

IEEE COMMUNICATIONS LETTERS 1998年第5期2卷 120-121页

作者： Wei, Lei Australian Natl Univ Fac Engn & Informat Technol Dept Engn Canberra ACT 0200 Australia

We show that the minimum squared Euclidean distance for a synchronous multiuser system using convolutional codes is no less than the product of the free distance of the code and the minimum Euclidean distance for the corresponding uncoded synchronous multiuser system. When all users use an identical convolutional code, equality holds. Thus the relationship can be used to compute the minimum squared Euclidean distance for a coded system. The results also indicate that in terms of maximizing the minimum squared Euclidean distance, it is better if all users use nonidentical error control codes.

关键词： error control coding minimum distance multiuser detection

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：