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

High-Throughput Reconfigurable variable length coding Decoder for MPEG-2 and AVC/H.264

JOURNAL OF SIGNAL PROCESSING SYSTEMS FOR SIGNAL IMAGE AND VIDEO TECHNOLOGY 2016年第1期82卷 27-40页

作者： Lee, Gwo Giun (Chris) Chen, Chun-Fu Xu, Shu-Ming Hsiao, Ching-Jui Natl Cheng Kung Univ Dept Elect Engn Tainan 70101 Taiwan

This paper presents a reconfigurable architecture for two video coding standards, MPEG-2 and AVC/H.264. The proposed reconfigurable architecture dynamically configures the architecture to achieve multiple functions in variable length coding decoder and context-adaptive variable length coding decoder. By means of extracting the commonalities at the low-level dataflow, the designed reconfigurable architecture optimizes hardware resources and increases architectural flexibility through the reconfigurability in the adaptively constructing architecture. On the other hand, the proposed reconfigurable architecture combines several strategies in AVC/H.264 mode, and subsequently revises and integrates these mechanisms to achieve a high-throughput rate. As a consequence, the memory usage of the proposed reconfigurable architecture achieves 37.5 % memory bits saving and 46.7 % memory area reduction as compared to the individual implementation;moreover, in AVC/H.264 mode, this reconfigurable architecture requires only 50 cycles to decode one marcoblock on average. Due to the flexibility, the proposed reconfigurable architecture costs 10.8 K gates by using 0.18 mu m CMOS technology at the 108 MHz clock rate, and supports variable length coding in MPEG-2 with 1920x 1080@30fps and context-adaptive variable length coding in AVC/H.264 with 1920x1080@60fps. From the perspectives of architectural costs and supported functions, the proposed architecture surpasses the related works in the state of the art.

关键词： Reconfigurable architecture Dataflow Commonality extraction variable length coding AVC/H.264 MPEG-2

来源：评论

学校读者我要写书评

暂无评论

variable length Lossy coding Using an LDPC Code

引用

IEEE TRANSACTIONS ON INFORMATION THEORY 2014年第1期60卷 762-775页

作者： Honda, Junya Yamamoto, Hirosuke Univ Tokyo Dept Complex Sci & Engn Kashiwa Chiba 2778561 Japan

In this paper, a new variable length coding scheme using a low density parity check (LDPC) code is proposed for the lossy compression of general i.i.d. finite sources. It is proved that the proposed scheme achieves the rate-distortion function asymptotically for an LDPC ensemble. For our setting, Miyake-Muramatsu already proposed an asymptotically optimal LDPC coding scheme. In their scheme, a source sequence is first vector-quantized using an LDPC matrix and then it is compressed losslessly by fixed length coding with another LDPC matrix. However, it is not shown whether their scheme can attain good performance practically. This is mainly because of the difficulty of lossless coding by a fixed length code. In the proposed scheme, the lossless compression is performed by arithmetic coding instead of the fixed length code. Combined with vector-quantization using the reinforced belief propagation, the proposed scheme attains performance near the rate-distortion function practically with time complexity roughly equal to O(n log n) for length n source sequences.

关键词： Asymmetric sources LDPC codes lossy source coding variable length coding

来源：评论

学校读者我要写书评

暂无评论

MDVSC - Wireless Model Division Video Semantic Communication for 6G

MDVSC - Wireless Model Division Video Semantic Communication...

引用

2023 IEEE Globecom Workshops, GC Wkshps 2023

作者： Bao, Zhicheng Liang, Haotai Dong, Chen Xu, Xiaodong Liu, Geng Beijing University of Posts and Telecommunications State Key Laboratory of Networking and Switching Technology Beijing China Smart Shine Microelectronics Technology Co. Ltd. Beijing China

ISBN: (纸本)9798350370218

This paper proposes a new wireless video communication scheme to achieve high-efficiency video transmission over noisy channels. It exploits the idea of model division multiple access (MDMA) and extracts common semantic features across video frames. Besides, deep joint source-channel coding (JSCC) is applied to overcome the distortion caused by noisy channels. The proposed framework is collected under the name model division video semantic communication (MDVSC). In particular, temporal relative video frames are first transformed into a latent space for computing complexity reduction and data redistribution. Accordingly, a novel entropy-based variable length coding is developed further to compress semantic information under the communication bandwidth cost limitation. The whole MDVSC is an end-to-end learnable system. It can be formulated as an optimization problem to minimize end-to-end transmission distortion under restricted communication resources. Across standard video source test sequences, test results show that the MDVSC outperforms traditional wireless video coding schemes generally under perceptual quality metrics and has the ability to control code length precisely. © 2023 IEEE.

关键词： joint source-channel coding latent transform model division multiple access Semantic communications variable length coding video transmission

来源：评论

学校读者我要写书评

暂无评论

An Error Exponent for the AWGN Channel with Decision Feedback and Lattice coding 58

An Error Exponent for the AWGN Channel with Decision Feedbac...

引用

58th Annual Allerton Conference on Communication, Control, and Computing (Allerton)

作者： Palacio-Baus, Kenneth Devroye, Natasha Univ Illinois Chicago IL 60680 USA Univ Cuenca Cuenca Ecuador

ISBN: (数字)9798350399981

ISBN: (纸本)9798350399981

We present achievable error exponents for the AWGN channel with one bit noiseless feedback and an almostsure power constraint. As in Forney's decision feedback approach for discrete memoryless channels, the backward channel is used to request retransmissions from the transmitter whenever an erasure is declared at the decoder. Our erasure/re-transmission-request scheme introduces a novel erasure decoding rule built on top of a lattice-based code inspired by De Buda. Numerically, our scheme is seen to outperform the sphere packing bound (valid for block codes) at lower rates and higher SNRs.

关键词： Error exponents AWGN lattice Forney variable length coding

来源：评论

学校读者我要写书评

暂无评论

The role of compression in large scale data transfer and storage of typical biomedical signals at hospitals

引用

HEALTH INFORMATICS JOURNAL 2023年第4期29卷

作者： Jacobsson, Martin Seoane, Fernando Abtahi, Farhad KTH Royal Inst Technol Dept Biomed Engn & Hlth Syst Halsovagen 11 S-14152 Huddinge Sweden Karolinska Inst Dept Clin Sci Intervent & Technol Stockholm Sweden Univ Boras Dept Text Technol Boras Sweden Karolinska Univ Hosp Dept Med Technol Management & Dev Solna Sweden Karolinska Inst Dept Clin Sci Intervent & Technol Solna Sweden

In modern hospitals, monitoring patients' vital signs and other biomedical signals is standard practice. With the advent of data-driven healthcare, Internet of medical things, wearable technologies, and machine learning, we expect this to accelerate and to be used in new and promising ways, including early warning systems and precision diagnostics. Hence, we see an ever-increasing need for retrieving, storing, and managing the large amount of biomedical signal data generated. The popularity of standards, such as HL7 FHIR for interoperability and data transfer, have also resulted in their use as a data storage model, which is inefficient. This article raises concern about the inefficiency of using FHIR for storage of biomedical signals and instead highlights the possibility of a sustainable storage based on data compression. Most reported efforts have focused on ECG signals;however, many other typical biomedical signals are understudied. In this article, we are considering arterial blood pressure, photoplethysmography, and respiration. We focus on simple lossless compression with low implementation complexity, low compression delay, and good compression ratios suitable for wide adoption. Our results show that it is easy to obtain a compression ratio of 2.7:1 for arterial blood pressure, 2.9:1 for photoplethysmography, and 4.1:1 for respiration.

关键词： biomedical signals large-scale health data compression downsampling variable length coding

来源：评论

学校读者我要写书评

暂无评论

An evolvable hardware method based on elite Partheno-Genetic Algorithm

引用

APPLIED SOFT COMPUTING 2021年第PartA期113卷 107904-107904页

作者： Liu, Lijun Wang, Tao Army Engn Univ Shijiazhuang Peoples R China

Aiming at the shortcomings of traditional genetic algorithm (GA) in the overall evolution of hardware, such as slow speed and small scale, a method of evolvable hardware (EHW) based on elite Partheno-Genetic Algorithm (PGA) is proposed. To improve the evolution efficiency of EHW, the number of chromosomes is reduced, the length of the chromosome is increased, the elite node chain is reserved, and the connection relationship of non-elite nodes is adjusted. The experimental results show that: compared with the existing literature, the evolution speed is increased 144 times on average, the overall scale of evolution is increased 74.7 times, and the evolution efficiency is significantly improved. (C) 2021 Elsevier B.V. All rights reserved.

关键词： Elite Partheno-Genetic Algorithm Evolvable hardware Elite node chain variable length coding Overall evolution

来源：评论

学校读者我要写书评

暂无评论

An Effective Algorithm and Architecture for the High-Throughput Lossless Compression of High-Resolution Images

引用

IEEE ACCESS 2019年 7卷 138803-138815页

作者： Lee, Jaeshin Yun, Juwon Lee, Jinyoung Hwang, Imjae Hong, Dukki Kim, Youngsik Kim, Cheong Ghil Park, Woo-Chan Sejong Univ Dept Comp Engn Seoul 05006 South Korea Korea Polytech Univ Dept Game & Multimedia Engn Shihung 15073 South Korea Namseoul Univ Dept Comp Sci Cheonan 31020 South Korea

This paper proposes a high-throughput lossless image-compression algorithm based on Golomb-Rice coding and its hardware architecture. The proposed solution increases compression ratios (CRs) while preserving the throughput by taking advantage of a novel parallel variable-length sign coding (PVSC) algorithm that reduces the sign bits to achieve a higher CR. In addition, the proposed solution adopts and modifies the two existing compression algorithms to improve the overall compression performance. The experimental results show that the proposed solution yields an average CR of 3.12, which is higher than those achieved with the previous algorithms. The hardware implementation of the proposed solution for an 8x8 block unit achieves a throughput of 18 GBps and 24 GBps when encoding and decoding, respectively. This hardware performance is enough to handle 7680 x 4320@240-Hz image processing.

关键词： variable length coding lossless image compression DDPCM Golomb-Rice coding UHD

来源：评论

学校读者我要写书评

暂无评论

A Comparative Study Among Various Algorithms for Lossless Airborne LiDAR Data Compression 14

A Comparative Study Among Various Algorithms for Lossless Ai...

引用

14th International Computer Engineering Conference (ICENCO)

作者： Kotb, Ahmed Hassan, Safaa Hassan, Hesham Natl Author Remote Sensing & Space Sci Cairo Egypt Cairo Univ Fac Comp & Informat Comp Sci Dept Cairo Egypt

ISBN: (纸本)9781538651179

Airborne LiDAR scanning systems are one of the most advanced remote sensing systems. They are capable to rapidly cover large geographical areas to gather data from with very high precision and great density. As a result, obtained datasets can contain tens of millions of points which consume more than a gigabyte per square kilometers (GB/km2). In practice, significant problems had been issued such as expensive storage, difficult distribution to the users, and time-consuming exchange over the internet and data processing and display time. For these reasons, LiDAR data compression has become recently a critical issue. In this paper, we compared three LiDAR domain-specific compression algorithms (LASzip, LASComp, and LiDAR Compressor) against three general-purpose compression algorithms (7-Zip, WinZip, and WinRAR). We have used real Airborne LiDAR point clouds data for Washington, DC (District of Columbia) for doing the experiments to reflect real LiDAR data compression issues. In this work, the algorithms had been evaluated in terms of Compression Ratios, Compression Times, and Bits per Point. Also, we have evaluated effects of point cloud density and number of contained points on the compression efficiency. Experiment results indicated that LASzip algorithm outperforms other algorithms with average compression ratio achieved 16.63% and average compression time achieved 16.65 sec. on the other hand, the general-purpose compression algorithm (WinRAR) surpass the LiDAR domain-specific compression algorithm (LiDAR Compressor) with compression ratio achieved 20.24%.

关键词： Data Compression LiDAR LASzip LASComp LiDAR Compressor variable length coding

来源：评论

学校读者我要写书评

暂无评论

A 0.78 mW Low-Power 4.02 High-Compression Ratio Less than 10^-6 BER Error-Tolerant Lossless Image Compression Hardware for Wireless Capsule Endoscopy System

A 0.78 mW Low-Power 4.02 High-Compression Ratio Less than 10...

引用

IEEE International Symposium on Circuits and Systems (ISCAS)

作者： Lee, Jiwon Lee, Kyoung-Rog Yoo, Hoi-Jun Korea Adv Inst Sci & Technol Sch Elect Engn Daejeon South Korea

ISBN: (纸本)9781538648810

A 0.78mW low power error-tolerant lossless image compressor for a wireless capsule endoscopy system is proposed. In order to achieve high compression ratio of 4.02, this work proposes zero-skipping coding and mode switcher architecture that utilize high image sparsity on endoscopy systems. In addition, a Forward Error Correction (FEC) block is proposed to achieve low Bit-error Rate (BER) under 10(-6), the integration error from prediction-based and variable length coding. The proposed error-tolerant lossless image compression hardware is implemented using 1P6M 65nm CMOS process and consumes only 0.78mW power at 40MHz with 2 fps throughput on VGA resolution image, and it is evaluated with real capsule endoscope images.

关键词： Wireless capsule endoscopy image compression zero-skipping variable length coding forward error correction

来源：评论

学校读者我要写书评

暂无评论

Common-message broadcast channels with feedback in the nonasymptotic regime: Stop feedback

Common-message broadcast channels with feedback in the nonas...

引用

IEEE Transactions on Information Theory

作者： Trillingsgaard, Kasper Floe Yang, Wei Durisi, Giuseppe Popovski, Petar Department of Eletronic Systems Aalborg University Aalborg9220 Denmark Qualcomm Technologies Inc. San DiegoCA92121 United States Department of Electrical Engineering Chalmers University of Technology S-Gothenburg41296 Sweden

We investigate the maximum coding rate for a given average blocklength and error probability over a $K$-user discrete memoryless broadcast channel for the scenario where a common message is transmitted using variable-length stop-feedback codes. For the point-to-point case, Polyanskiy et al. (2011) demonstrated that variable-length coding combined with stop-feedback significantly increases the speed of convergence of the maximum coding rate to capacity. This speed-up manifests itself in the absence of a square-root penalty in the asymptotic expansion of the maximum coding rate for large blocklengths, i.e., zero dispersion. In this paper, we present nonasymptotic achievability and converse bounds on the maximum coding rate of the common-message $K$-user discrete memoryless broadcast channel, which strengthen and generalize the ones reported in Trillingsgaard et al. (2015) for the two-user case. An asymptotic analysis of these bounds reveals that zero dispersion cannot be achieved for certain common-message broadcast channels (e.g., the binary symmetric broadcast channel). Furthermore, we identify conditions under which our converse and achievability bounds are tight up to the second order. Through numerical evaluations, we illustrate that our second-order expansions approximate accurately the maximum coding rate and that the speed of convergence to capacity is indeed slower than for the point-to-point case. © 2018 IEEE.

关键词： Codes (symbols) Asymptotic analysis Broadcasting Dispersions Channel dispersion Common messages Decision feedback Finite blocklength regimes variable length coding

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：