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

combined source and channel coding with JPEG2000 and rate-compatible low-density parity-check codes

IEEE TRANSACTIONS ON SIGNAL PROCESSING 2006年第3期54卷 1160-1164页

作者： Pan, X Cuhadar, A Banihashemi, AH Carleton Univ Dept Syst & Comp Engn BCWS Ctr Ottawa ON K1S 5B6 Canada

Rate-compatible low-density parity-check (RC-LDPC) codes are used to provide unequal error protection for the robust and efficient transmission of JPEG2000 compressed images over noisy channels. The total bit budget is partitioned between the source and the channel coding by using a Viterbi algorithm (VA) applied to a search trellis, and appropriate channel code rates are assigned to the source blocks. The performance of the proposed scheme is evaluated on binary symmetric channels (BSCs). Experimental results indicate that the proposed scheme compares favorably with other combined source/channel coding schemes over a variety of channel conditions and transmission bit rates. In particular, the proposed scheme outperforms similar schemes based on turbo codes and irregular repeat-accumulate codes by up to about 1.1 and 1 dB in the expected peak signal-to-noise ratio (PSNR) of reconstructed images, respectively.

关键词： combined source/channel coding image coding JPEG2000 progressive-edge-growth (PEG) construction rate allocation rate-compatible low-density parity-check (RC-LDPC)codes unequal error protection (UEP)

来源：评论

学校读者我要写书评

暂无评论

A fast trellis-based rate-allocation algorithm for robust transmission of progressively coded images over noisy channels

引用

IEEE TRANSACTIONS ON COMMUNICATIONS 2006年第1期54卷 1-6页

作者： Pan, X Banihashemi, AH Cuhadar, A Carleton Univ Dept Syst & Comp Engn Ottawa ON K1S 5B6 Canada

We propose a fast trellis-based rate-allocation algorithm for robust transmission of progressively coded images over noisy channels. The algorithm, which is an improved version of a similar algorithm by Banister et al., is based on the application of the Viterbi algorithm to a search trellis. This trellis is a substantially trimmed version of the one used by Banister et al.. The proposed algorithm is applied to images encoded by the set partitioning in hierarchical trees and the Joint Photographers Expert Group 2000 for transmission over binary symmetric channels. For different total bit budgets and channel parameters, speed-up factors of up to about three orders of magnitude are achieved.

关键词： combined source/channel coding Joint Photographers Expert Group (JPEG) 2000 joint source/channel coding progressive image coding rate-allocation algorithm set partitioning in hierarchical trees (SPIHT) trellis unequal error protection (UEP) Viterbi algorithm (VA)

来源：评论

学校读者我要写书评

暂无评论

Dependent source and channel rate allocation for video transmission

引用

IEEE TRANSACTIONS ON WIRELESS COMMUNICATIONS 2004年第1期3卷 258-268页

作者： Bystrom, M Stockhammer, T Boston Univ Dept Elect & Comp Engn Boston MA 02215 USA Tech Univ Munich Inst Commun Engn D-80290 Munich Germany

A general joint source-channel rate allocation scheme for a dependent video coding environment is presented. It is assumed that the source coders rely on motion-compensated prediction, and thus error propagation will contribute significantly to the degradation of the reconstructed video. The rate allocation methodology is based upon generation of operational distortion-rate characteristics. In order to reduce computational complexity, these surfaces and the channel code performance are modeled. An analytic method for computing optimal rate allocation across frames in a video sequence is then introduced. Comparisons are made between equal error protection and unequal error protection over video frames. Results are shown for H.263 compressed video used in conjunction with rate-compatible punctured convolutional codes.

关键词： combined source/channel coding resource allocation video compression

来源：评论

学校读者我要写书评

暂无评论

A Distortion Optimal Rate Allocation Algorithm for Transmission of Embedded Bitstreams over Noisy channels

引用

IEEE TRANSACTIONS ON COMMUNICATIONS 2008年第10期56卷 1581-1584页

作者： Banihashemi, Amir H. Hatam, Ahmad Carleton Univ BCWS Ctr Ottawa ON K1S 5B6 Canada Carleton Univ Dept Syst & Comp Engn Ottawa ON K1S 5B6 Canada

We propose a distortion optimal rate allocation algorithm for robust transmission of embedded bitstreams over noisy channels. The algorithm is based on the backward application of a Viterbi-like algorithm to a search trellis, and can be applied to both scenarios of fixed and variable channel packet length problems, referred to as FPP and VPP, respectively. For the VPP, the complexity of the algorithm is comparable to the welt-known dynamic programming approach of Chande and Farvardin. For the FPP, where no low-complexity algorithm is known, the complexity of the proposed algorithm is O(N-2), where N is the number of transmitted packets.

关键词： combined source/channel coding distortion optimal rate allocation algorithm embedded bitstreams embedded coding joint source/channel coding progressively coded bitstreams trellis unequal error protection Viterbi algorithm

来源：评论

学校读者我要写书评

暂无评论

combined HUFFMAN AND CONVOLUTIONAL-CODES - CONCATENATED FORM WITHOUT FEEDBACK

引用

ELECTRONICS LETTERS 1990年第6期26卷 367-368页

作者： HONARY, B SHAW, M DARNELL, M UNIV HULL DEPT ELECTR ENGNHULL WARWICK COMMUN RES GRPHULL HU6 7RXN HUMBERSIDEENGLAND

The authors present a new scheme for joint source and channel coding is introduced in which both Huffman coding and convolutional coding are used in a concatenated form. This is a reduction in overall complexity, in c... 详细信息

关键词： Huffman coding codes combined source/channel coding complexity reduction concatenated form convolutional codes decoding encoding

来源：评论

学校读者我要写书评

暂无评论

Iterative joint source-channel decoding of speech spectrum parameters over an additive white Gaussian noise channel

引用

IEEE TRANSACTIONS ON AUDIO SPEECH AND LANGUAGE PROCESSING 2006年第1期14卷 152-162页

作者： Subramaniam, AD Gardner, WR Rao, BD Univ Calif San Diego Dept Elect & Comp Engn La Jolla CA 92122 USA

In this paper, we show how the Gaussian mixture modeling framework used to develop efficient source encoding schemes can be further exploited to model source statistics during channel decoding in an iterative framework to develop an effective joint source-channel decoding scheme. The joint probability density function (PDF) of successive source frames is modeled as a Gaussian mixture model (GMM). Based on previous work, the marginal source statistics provided by the GMM is used at the encoder to design a low-complexity memoryless source encoding scheme. The source encoding scheme has the specific advantage of providing good estimates to the probability of occurrence of a given source code-point based on the GMM. The proposed iterative decoding procedure works with any channel code whose decoder can implement the soft-output Viterbi algorithm that uses a priori information (APRI-SOVA) or the BCJR algorithm to provide extrinsic information on each source encoded bit. The source decoder uses the GMM model and the channel decoder output to provide a priori information back to the channel decoder. Decoding is done in an iterative manner by trading extrinsic information between the source and channel decoders. Experimental results showing improved decoding performance are provided in the application of speech spectrum parameter compression and communication.

关键词： combined source/channel coding robust coding for noisy channels

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：