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

International Symposium on Information Theory and Its Applications, ISITA

作者： Shigeki Miyake Junya Honda Hirosuke Yamamoto Network Innovation Laboratories NTT Musashino Tokyo Japan Graduate School of Information Science and Technology University of Tokyo Tokyo Japan Graduate School of Frontier Sciences University of Tokyo Chiba Japan

ISBN: (纸本)9781424420681

Linear code linear programming (LCLP) proposed by Feldman is one of the promising methods to implement the lossy source coding process efficiently. In the encoding and decoding of a lossy source code constructed by sparse matrices, we propose auxiliary methods to obtain approximate optimal values in the case where the output of LCLP takes non-integer values. In a simulation, the proposed method attains smaller average distortions than the time-sharing bound.

关键词： source coding Sparse matrices Electronic mail Linear programming Maximum likelihood decoding Encoding Linear code Iterative decoding Time sharing computer systems Iterative algorithms

来源：评论

学校读者我要写书评

暂无评论

Power optimization of wireless systems utilizing space-time block coding and successively refinable source coding

Power optimization of wireless systems utilizing space-time ...

引用

IEEE Conference on Vehicular Technology (VTC)

作者： H. Yousefi'zadeh H. Jafarkhani M. Moshfeghi Department of Electrical Engineering and Computer Science University of California Irvine USA

In this paper, power optimization of wireless systems utilizing multiple transmit antennas and successively refinable source coding is considered. We present a solution to a formulation of an optimization problem aimed at minimizing total power consumption of such wireless systems subject to a given level of QoS and an overall available bit rate. Our formulation takes into consideration the power consumption related to source coding, channel coding, and layered transmission of multiple transmit antennas. In our study, we consider a Gauss-Markov source model, a Rayleigh fading channel along with the Gilbert-Elliott loss model, and a space-time transmission block code.

关键词： Block codes source coding Transmitting antennas Energy consumption Bit rate Channel coding Gaussian channels Power system modeling Fading Propagation losses

来源：评论

学校读者我要写书评

暂无评论

An innovation analysis of LZ77 and LZ78 Compression Algorithms for Data Compression & source coding

An innovation analysis of LZ77 and LZ78 Compression Algorith...

引用

International Conference on Computing and Networking Technology (ICCNT)

作者： Rakesh Kumar Giri Abhinav Mishra Aruna Sri Rongali Laxmi A. Bewoor R Raghavendra M. S. Kavitha Department of Computer Science & Engineering Sunrise University Alwar India Centre of Research Impact and Outcome Chitkara University Rajpura Punjab India Department of Information Technology Emphasis/Technology Software Engineer Ph.D University of The Cumberlands US Department of Computer Engineering Vishwakarma Institute of Technology Pune INDIA College of Computing Sciences And Information Technology Jain (deemed to be) University Bangalore Karnataka India Department of ECER. M. K. Engineering College RSM Nagar Kavaraipettai

ISBN: (数字)9798350370249

ISBN: (纸本)9798350370270

This paper evaluates innovation on two of the most widely used compression algorithms — the LZ77 and the LZ78 algorithms — for information compression and supply coding programs. A detailed assessment of these algorithms presents insights approximately their design philosophy, technical traits, and performance metrics. Additionally, the studies offer a complete overview of their packages and implementations. The paper investigates the prominent considerations for implementing compression algorithms and analyzes their relative blessings and downsides. An exploration of the constraints of every algorithm is likewise undertaken. Furthermore, the research explores distinctive design elements of the algorithms, such as data structure, compression engine, and set of rules optimization. Eventually, the paper assesses the algorithms by reading the exchange-offs between their performance and complexity. This study facilitates practitioners and developers to apprehend the results of using those algorithms for diverse compression and supply coding applications. It can assist practitioners in identifying the first-class compression set of rules for their unique application needs. This paper gives an innovative evaluation of the LZ77 and LZ78 Compression Algorithms. These algorithms are algorithms designed for statistics compression and source coding. They’re used to take a given series of characters (or bits) and encode them right into an area-green representation. The innovation evaluation presents a valuable perception of how the algorithms improve compression ratios and shop area. It also discusses the effect of positive parameters such as window length, repeat cycle, and buffer size on compression efficiency. ultimately, the paper will speak to future studies’ challenges in this region and the capability packages of those algorithms.

关键词： Measurement Technological innovation Image coding Codes Philosophical considerations source coding Green products Approximation algorithms Compression algorithms Optimization

来源：评论

学校读者我要写书评

暂无评论

An achievable rate region for distributed source coding and dispersive information routing

An achievable rate region for distributed source coding and ...

引用

IEEE International Symposium on Information Theory

作者： Kumar Viswanatha Emrah Akyol Kenneth Rose ECE Department University of California Santa Barbara USA

ISBN: (纸本)9781457705960

This paper considers the problem of optimal multi-hop routing of correlated sources over a network with multiple sinks and arbitrary network demands. We recently introduced a new routing paradigm in [10] called `dispersive information routing' (DIR), wherein the intermediate nodes are allowed to split a packet and forward a subset of the received bits on each forward path. DIR ensures that each sink receives just the information it requires to decode the sources it intends to reconstruct, and thereby outperforms conventional routing techniques in the literature. We proposed an encoding scheme called `power binning' which achieves complete rate region and the minimum cost under this paradigm when each sink is allowed to receive packets only from the sources it wants to reconstruct. This paper considers the optimum encoding scheme when every source can (possibly) communicate with every sink irrespective of what the sinks reconstruct. This generalization happens to be considerably more complex and we derive an achievable rate region and an associated achievable cost using principles from distributed source coding and multiple descriptions encoding.

关键词： Routing source coding Markov processes Dispersion Decoding

来源：评论

学校读者我要写书评

暂无评论

Two-Way source-Channel coding

引用

IEEE TRANSACTIONS ON INFORMATION THEORY 2021年第10期67卷 6507-6524页

作者： Weng, Jian-Jia Alajaji, Fady Linder, Tamas Natl Taiwan Ocean Univ Dept Elect Engn Keelung 202301 Taiwan Queens Univ Dept Math & Stat Kingston ON K7L 3N6 Canada

We propose an adaptive lossy joint source-channel coding (JSCC) scheme for sending correlated sources over two-terminal discrete-memoryless two-way channels (DM-TWCs). The main idea is to couple the independent operations of the terminals via an adaptive coding mechanism, which can mitigate cross-interference resulting from simultaneous channel transmissions and concurrently exploit the sources' correlation to reduce the end-to-end reconstruction distortions. Our adaptive JSCC scheme not only subsumes existing lossy coding methods for two-way simultaneous communication but also improves their performance. Furthermore, we derive outer bounds for our two-way lossy transmission problem and establish complete JSCC theorems in some special settings. In these special cases, a non-adaptive separate source-channel coding (SSCC) scheme achieves the optimal performance, thus simplifying the design of the source-channel communication system.

关键词： Channel coding source coding Protocols Propagation losses Adaptive coding Distortion Noise measurement Network information theory two-way channels lossy transmission joint source-channel coding correlated sources hybrid analog and digital coding superposition coding adaptive coding

来源：评论

学校读者我要写书评

暂无评论

Joint source/channel coding for variable length codes

引用

IEEE TRANSACTIONS ON COMMUNICATIONS 2000年第5期48卷 787-794页

作者： Sayood, K Otu, HH Demir, N Univ Nebraska Dept Elect Engn Lincoln NE 68588 USA LHS Commun Syst Inc Atlanta GA 30238 USA

When using Entropy coding over a noisy channel, it is customary to protect the highly vulnerable bitstream with error correcting code. In this paper, we propose a technique which utilizes the residual redundancy at th... 详细信息

关键词： error correction source coding variable length codes

来源：评论

学校读者我要写书评

暂无评论

Concatenated Spatially Coupled LDPC Codes With Sliding Window Decoding for Joint source-Channel coding

引用

IEEE TRANSACTIONS ON COMMUNICATIONS 2022年第2期70卷 851-864页

作者： Golmohammadi, Ahmad Mitchell, David G. M. New Mexico State Univ Klipsch Sch Elect & Comp Engn Las Cruces NM 88003 USA Bose Corp Framingham MA 01701 USA

In this paper, a method for joint source-channel coding (JSCC) based on concatenated spatially coupled low-density parity-check (SC-LDPC) codes is investigated. A construction consisting of two SC-LDPC codes is proposed: one for source coding and the other for channel coding, with a joint belief propagation-based decoder. Also, a novel windowed decoding (WD) scheme is presented with significantly reduced latency and complexity requirements. The asymptotic behavior for various graph node degrees is analyzed using a protograph-based Extrinsic Information Transfer (EXIT) chart analysis for both LDPC block codes with block decoding and for SC-LDPC codes with the WD scheme, showing robust performance for concatenated SC-LDPC codes. Simulation results show a notable performance improvement compared to existing state-of-the-art JSCC schemes based on LDPC codes with comparable latency and complexity constraints.

关键词： Codes Parity check codes Decoding source coding Convolutional codes Generators Sparse matrices Low-density parity-check (LDPC) codes spatially coupled codes joint source-channel coding window decoding

来源：评论

学校读者我要写书评

暂无评论

Toward a unified framework for modeling and analysis of diversity in joint source-channel coding

引用

IEEE TRANSACTIONS ON COMMUNICATIONS 2008年第1期56卷 90-101页

作者： Kwasinski, Andres Liu, K. J. Ray Texas Instruments Inc Germantown MD USA Univ Maryland Dept Elect & Comp Engn College Pk MD 20742 USA

The study of Joint source-Channel coding (JSCC) systems faces one major challenge in obtaining an analytical expression for the function that links end-to-end distortion with channel signal-to-noise ratio, the D-SNR curve. In this paper, for certain multimedia systems using practical source and channel codes in a JSCC bit rate allocation design, the D-SNR curve is shown to be well approximated by a set of carefully selected points where the relative contribution of channel errors to end-to-end distortion is small. This approach has the potential advantage that it could be applied to represent performance of many practical systems using JSCC bit rate allocation for which it is shown that the D-SNR function is approximately linear in log-log scales. A unified framework for the modeling, analysis and performance measurement of these systems is proposed by considering a view of diversity more general than its usual interpretation. This view extends that of diversity to include redundant information so coding and diversity gain are still used to characterize performance. Furthermore, the proposed approach is applied to study issues arising from using practical source and channel codes, including the effects on performance of channel codes of different strength or source codes with different compression efficiency.

关键词： adaptive coding source coding channel coding

来源：评论

学校读者我要写书评

暂无评论

Separation of source-Network coding and Channel coding in Wireline Networks

引用

IEEE TRANSACTIONS ON INFORMATION THEORY 2015年第4期61卷 1524-1538页

作者： Jalali, Shirin Effros, Michelle Princeton Univ Dept Elect Engn Princeton NJ 08544 USA CALTECH Dept Elect Engn Pasadena CA 91125 USA

In this paper, we prove the separation of source-network coding and channel coding in wireline networks. For the purposes of this paper, a wireline network is any network of independent, memoryless, point-to-point, and finite-alphabet channels used to transmit dependent sources either losslessly or subject to a distortion constraint. In deriving this result, we also prove that in a general memoryless network with dependent sources, lossless, and zero-distortion reconstruction are equivalent provided that the conditional entropy of each source given the other sources is nonzero. Furthermore, we extend the separation result to the case of continuous-alphabet and point-to-point channels, such as additive white Gaussian noise channels.

关键词： source coding channel coding network coding wireline network separation

来源：评论

学校读者我要写书评

暂无评论

Minimum distortion network code design for source coding over noisy channels

Minimum distortion network code design for source coding ove...

引用

IEEE International Symposium on Personal, Indoor and Mobile Radio Communications (PIMRC)

作者： Moonseo Park Seong-Lyun Kim Radio Resource Management & Optimization Laboratory School of Electrical and Electronic Engineering Yonsei University Seoul South Korea

ISBN: (纸本)9781424426430

The XOR network code is widely used in the conventional network coding. However, when the channel is noisy, the XOR code is suboptimal in terms of minimizing distortion in the source signal. We propose to use a new network code for the two-way relay channel, designed to minimize signal distortion due to the channel noise. We assume the source signal X is encoded by a source encoder and the sequence of symbols is transmitted over the two-way relay channel with noise. The received sequence of symbols may be corrupted by the channel noise, and Xcirc, the estimation of X, may be different from X. We design a new network code which minimizes the distortion between X and Xcirc. To provide an algorithm to obtain a network code with minimum distortion, we define the expected distortion associated with a network code. Starting with the XOR network code, we iteratively optimize the network code to obtain smaller expected distortion, while maintaining the Latin square constraint of the network code. New network code achieves substantial performance gain over the XOR network code.

关键词： source coding Relays Channel coding Network coding Bit error rate Protocols Design optimization Distortion Iterative algorithms Decoding

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：