The original paper is in English. Non-English content has been machine-translated and may contain typographical errors or mistranslations. ex. Some numerals are expressed as "XNUMX".
Copyrights notice
The original paper is in English. Non-English content has been machine-translated and may contain typographical errors or mistranslations. Copyrights notice
채널 코딩에 사용되는 LDPC 코드 이론을 소스 코딩에 적용하는 연구는 분산 소스 코딩 등 여러 연구 분야에서 많은 주목을 받아왔다. 본 논문에서는 충실도 기준에 따른 소스 코딩 문제를 고려한다. Matsunagaet al. 그리고 Martinianet al. 이진 알파벳, 균일 분포 및 충실도 기준의 해밍 측정 조건 하에서 손실 코드를 구성했습니다. 우리는 결과를 확장하고 이진 알파벳, 반드시 균일하지 않은 분포, 제한되고 가산되는 충실도 측정의 확장된 조건에서 손실 코드를 구성하고 코드가 최적의 비율, 비율-왜곡 함수를 달성할 수 있음을 보여줍니다. . Z에 대한 LDPC 행렬 분석에 격자에 대한 랜덤 워크 공식을 적용함으로써q어디로 q 는 소수이므로 이진 알파벳 조건의 결과와 유사한 결과가 Z에 대해 유지됨을 보여줍니다.q, 다중 알파벳 조건.
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
부
Shigeki MIYAKE, Jun MURAMATSU, "A Construction of Lossy Source Code Using LDPC Matrices" in IEICE TRANSACTIONS on Fundamentals,
vol. E91-A, no. 6, pp. 1488-1501, June 2008, doi: 10.1093/ietfec/e91-a.6.1488.
Abstract: Research into applying LDPC code theory, which is used for channel coding, to source coding has received a lot of attention in several research fields such as distributed source coding. In this paper, a source coding problem with a fidelity criterion is considered. Matsunaga et al. and Martinian et al. constructed a lossy code under the conditions of a binary alphabet, a uniform distribution, and a Hamming measure of fidelity criterion. We extend their results and construct a lossy code under the extended conditions of a binary alphabet, a distribution that is not necessarily uniform, and a fidelity measure that is bounded and additive and show that the code can achieve the optimal rate, rate-distortion function. By applying a formula for the random walk on lattice to the analysis of LDPC matrices on Zq, where q is a prime number, we show that results similar to those for the binary alphabet condition hold for Zq, the multiple alphabet condition.
URL: https://global.ieice.org/en_transactions/fundamentals/10.1093/ietfec/e91-a.6.1488/_p
부
@ARTICLE{e91-a_6_1488,
author={Shigeki MIYAKE, Jun MURAMATSU, },
journal={IEICE TRANSACTIONS on Fundamentals},
title={A Construction of Lossy Source Code Using LDPC Matrices},
year={2008},
volume={E91-A},
number={6},
pages={1488-1501},
abstract={Research into applying LDPC code theory, which is used for channel coding, to source coding has received a lot of attention in several research fields such as distributed source coding. In this paper, a source coding problem with a fidelity criterion is considered. Matsunaga et al. and Martinian et al. constructed a lossy code under the conditions of a binary alphabet, a uniform distribution, and a Hamming measure of fidelity criterion. We extend their results and construct a lossy code under the extended conditions of a binary alphabet, a distribution that is not necessarily uniform, and a fidelity measure that is bounded and additive and show that the code can achieve the optimal rate, rate-distortion function. By applying a formula for the random walk on lattice to the analysis of LDPC matrices on Zq, where q is a prime number, we show that results similar to those for the binary alphabet condition hold for Zq, the multiple alphabet condition.},
keywords={},
doi={10.1093/ietfec/e91-a.6.1488},
ISSN={1745-1337},
month={June},}
부
TY - JOUR
TI - A Construction of Lossy Source Code Using LDPC Matrices
T2 - IEICE TRANSACTIONS on Fundamentals
SP - 1488
EP - 1501
AU - Shigeki MIYAKE
AU - Jun MURAMATSU
PY - 2008
DO - 10.1093/ietfec/e91-a.6.1488
JO - IEICE TRANSACTIONS on Fundamentals
SN - 1745-1337
VL - E91-A
IS - 6
JA - IEICE TRANSACTIONS on Fundamentals
Y1 - June 2008
AB - Research into applying LDPC code theory, which is used for channel coding, to source coding has received a lot of attention in several research fields such as distributed source coding. In this paper, a source coding problem with a fidelity criterion is considered. Matsunaga et al. and Martinian et al. constructed a lossy code under the conditions of a binary alphabet, a uniform distribution, and a Hamming measure of fidelity criterion. We extend their results and construct a lossy code under the extended conditions of a binary alphabet, a distribution that is not necessarily uniform, and a fidelity measure that is bounded and additive and show that the code can achieve the optimal rate, rate-distortion function. By applying a formula for the random walk on lattice to the analysis of LDPC matrices on Zq, where q is a prime number, we show that results similar to those for the binary alphabet condition hold for Zq, the multiple alphabet condition.
ER -