• Title/Summary/Keyword: memory compression

Search Result 255, Processing Time 0.025 seconds

Design of CAVLC Decoder for H.264/AVC (H.264/AVC용 CAVLC 디코더의 설계)

  • Jung, Duck-Young;Sonh, Seung-Il
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.11 no.6
    • /
    • pp.1104-1114
    • /
    • 2007
  • Digital video compression technique has played an important role that enables efficient transmission and storage of multimedia data where bandwidth and storage space are limited. The new video coding standard, H.264/AVC, developed by Joint Video Team(JVT) significantly outperforms previous standards in compression performance. Especially, variable length code(VLC) plays a crucial pun in video and image compression applications. H.264/AVC standard adopted Context-based Adaptive Variable Length Coding(CAVLC) as the entropy coding method. CAVLC of H.264/AVC requires a large number of the memory accesses. This is a serious problem for applications such as DMB and video phone service because of the considerable amount of power that is consumed in accessing the memory. In order to overcome this problem in this paper, we propose a variable length technique that implements memory-free coeff_token, level, and run_before decoding based on arithmetic operations and using only 70% of the required memory at total_zero variable length decoding.

Zero-tree Packetization without Additional Memory using BFS (BFS를 이용한 추가 메모리를 요구하지 않는 제로트리 압축기법)

  • 김충길;정기동
    • Journal of KIISE:Computer Systems and Theory
    • /
    • v.31 no.5_6
    • /
    • pp.321-327
    • /
    • 2004
  • SPIHT algorithm is a wavelet based fast and effective technique for image compression. It uses a list structure to store status information which is generated during set-partitioning of toro-tree. Usually, this requires lots of additional memory depending on how high the bit-rate is. Therefore, in this paper, we propose a new technique called MZC-BFS, which needs no additional memory when running SPIHT algorithm. It explicitly performs a breadth first search of the spatial-tree using peano-code and eliminates additional memory as it uses pre-status significant test for encoding and LSB bits of some coefficients for decoding respectively. This method yields nearly the same performance as SPIHT. This may be desirable in fast and simple hardware implementation and reduces the cost of production because no lists and additional memory are required.

The Efficient Memory Mapping of FPGA Implemenation for Real-Time 2-D Discrete Wavelet Transform using Mallat tree algorithm (Mallat tree 방법을 이용한 실시간 2-D DWT의 FPGA 구현을 위한 효율적인 메모리 사상)

  • 김왕현;서영호;김종현;김동욱
    • Proceedings of the IEEK Conference
    • /
    • 2001.06d
    • /
    • pp.105-108
    • /
    • 2001
  • This paper proposed an efficient memory scheduling method (E$^2$M$^2$) by which the real-time image compression using 2-dimensional discrete wavelet transform(2-D DWT) is possible in an FPGA chip. In this paper, we assumed that the 2-D DWT was performed as the Mallat-tree. After the memory mapping method was proved in software, the memory controller was designed for an commercial SDRAM IC.

  • PDF

A full-Hardwired Low-Power MPEG4@SP Video Encoder for Mobile Applications (모바일 향 저전력 동영상 압축을 위한 고집적 MPEG4@SP 동영상 압축기)

  • Shin, Sun Young;Park, Hyun Sang
    • Journal of Broadcast Engineering
    • /
    • v.10 no.3
    • /
    • pp.392-400
    • /
    • 2005
  • Highly integrated MPEG-4@SP video compression engine, VideoCore, is proposed for mobile application. The primary components of video compression require the high memory bandwidth since they access the external memory frequently. They include motion estimation, motion compensation, quantization, discrete cosine transform, variable length coding, and so on. The motion estimation processor adopted in VideoCore utilizes the small-size local memories such that the video compression system accesses external memory as less frequently as possible. The entire video compression system is divided into two distinct sub-systems: the integer-unit motion estimation part and the others, and both operate concurrently in a pipelined architecture. Thus the VideoCore enables the real-time high-quality video compression with a relatively low operation frequency.

An Efficient Spatial Index Structure for Main Memory (메인 메모리를 위한 효율적인 공간 인덱스 구조)

  • Lee, Ki-Young;Lim, Myung-Jae;Kang, Jeong-Jin;Kim, Joung-Joon
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.9 no.2
    • /
    • pp.13-20
    • /
    • 2009
  • Recently there is growing interest in LBS requiring real-time services and the spatial main memory DBMS for efficient Telematics services. In order to optimize existing disk-based spatial indexes of the spatial main memory DBMS in the main memory, spatial index structures have been proposed, which minimize failures in cache access by reducing the entry size. However, because the reduction of entry size requires compression based on the MBR of the parent node or the removal of redundant MBR, the cost of MBR reconstruction increases in index update and the efficiency of search is lowered in index search. Thus, to reduce the cost of MBR reconstruction, this paper proposed the RSMB (relative-sized MBR)compression technique, which applies the base point of compression differently in case of broad distribution and narrow distribution. In case of broad distribution, compression is made based on the left-bottom point of the extended MBR of the parent node, and in case of narrow distribution, the whole MBR is divided into cells of the same size and compression is made based on the left-bottom point of each cell. In addition, MBR was compressed using a relative coordinate and size to reduce the cost of search in index search. Lastly, we evaluated the performance of the proposed RSMBR compression technique using real data, and proved its superiority.

  • PDF

BTC Algorithm Utilizing Compression Method of Bitmap and Quantization data for Image Compression (비트맵과 양자화 데이터 압축 기법을 사용한 BTC 영상 압축 알고리즘)

  • Cho, Moonki;Yoon, Yungsup
    • Journal of the Institute of Electronics and Information Engineers
    • /
    • v.49 no.10
    • /
    • pp.135-141
    • /
    • 2012
  • To reduce frame memory size usage in LCD overdrive, block truncation coding (BTC) image compression is commonly used. For maximization of compression ratio, BTC image compression is need to compress bitmap or quantization data. In this paper, for high compression ratio, we propose CMBQ-BTC (CMBQ : compression method bitmap data and quantization data) algorithm. Experimental results show that proposed algorithm is efficient as compared with PSNR and compression ratio of the conventional BTC method.

Performance Evaluation of Rcentering Smart Damper by Pre-Compression of Polyurethane (폴리우레탄 선압축량에 따른 자동복원 스마트 감쇠장치의 일축반복하중에 대한 성능 평가)

  • Jang, Heemyung
    • Journal of Urban Science
    • /
    • v.11 no.1
    • /
    • pp.1-8
    • /
    • 2022
  • As the magnitude and frequency of earthquakes increase in Korea, interest in earthquake damage reduction technology has increased. Therefore, research on vibration damping devices that directly respond to seismic loads is being actively researched. After an earthquake, damage or destruction of the device occurs due to the yield of materials, and thus it takes considerable cost and time for restoration and replacement. To supplement the problems of the existing earthquake damage reduction technology, a study was conducted on the recentering smart damper that can be used continuously after an earthquake. In this study, the recentering smart damper that can be restored to its original shape after load removal was developed using superelastic shape memory alloy, pre-compressed polyurethane. General steel was commonly applied to verify the seismic performance of the superelastic shape memory alloy, and the performance of the smart damper was verified according to the amount of polyurethane pre-compressed

Compression of 3D Mesh Geometry and Vertex Attributes for Mobile Graphics

  • Lee, Jong-Seok;Choe, Sung-Yul;Lee, Seung-Yong
    • Journal of Computing Science and Engineering
    • /
    • v.4 no.3
    • /
    • pp.207-224
    • /
    • 2010
  • This paper presents a compression scheme for mesh geometry, which is suitable for mobile graphics. The main focus is to enable real-time decoding of compressed vertex positions while providing reasonable compression ratios. Our scheme is based on local quantization of vertex positions with mesh partitioning. To prevent visual seams along the partitioning boundaries, we constrain the locally quantized cells of all mesh partitions to have the same size and aligned local axes. We propose a mesh partitioning algorithm to minimize the size of locally quantized cells, which relates to the distortion of a restored mesh. Vertex coordinates are stored in main memory and transmitted to graphics hardware for rendering in the quantized form, saving memory space and system bus bandwidth. Decoding operation is combined with model geometry transformation, and the only overhead to restore vertex positions is one matrix multiplication for each mesh partition. In our experiments, a 32-bit floating point vertex coordinate is quantized into an 8-bit integer, which is the smallest data size supported in a mobile graphics library. With this setting, the distortions of the restored meshes are comparable to 11-bit global quantization of vertex coordinates. We also apply the proposed approach to compression of vertex attributes, such as vertex normals and texture coordinates, and show that gains similar to vertex geometry can be obtained through local quantization with mesh partitioning.

Sparse Matrix Compression Technique and Hardware Design for Lightweight Deep Learning Accelerators (경량 딥러닝 가속기를 위한 희소 행렬 압축 기법 및 하드웨어 설계)

  • Kim, Sunhee;Shin, Dongyeob;Lim, Yong-Seok
    • Journal of Korea Society of Digital Industry and Information Management
    • /
    • v.17 no.4
    • /
    • pp.53-62
    • /
    • 2021
  • Deep learning models such as convolutional neural networks and recurrent neual networks process a huge amounts of data, so they require a lot of storage and consume a lot of time and power due to memory access. Recently, research is being conducted to reduce memory usage and access by compressing data using the feature that many of deep learning data are highly sparse and localized. In this paper, we propose a compression-decompression method of storing only the non-zero data and the location information of the non-zero data excluding zero data. In order to make the location information of non-zero data, the matrix data is divided into sections uniformly. And whether there is non-zero data in the corresponding section is indicated. In this case, section division is not executed only once, but repeatedly executed, and location information is stored in each step. Therefore, it can be properly compressed according to the ratio and distribution of zero data. In addition, we propose a hardware structure that enables compression and decompression without complex operations. It was designed and verified with Verilog, and it was confirmed that it can be used in hardware deep learning accelerators.

Radicular Pain due to Subsidence of the Nitinol Shape Memory Loop for Stabilization after Lumbar Decompressive Laminectomy

  • Son, Byung-Chul;Kim, Deog-Ryeong
    • Journal of Korean Neurosurgical Society
    • /
    • v.57 no.1
    • /
    • pp.61-64
    • /
    • 2015
  • A number of dynamic stabilization systems have been used to overcome the problems associated with spinal fusion with rigid fixation recently and the demand for an ideal dynamic stabilization system is greater for younger patients with multisegment disc degeneration. Nitinol, a shape memory alloy of nickel and titanium, is flexible at low temperatures and regains its original shape when heated, and the Nitinol shape memory loop (SML) implant has been used as a posterior tension band mostly in decompressive laminectomy cases because the Nitinol implant has various characteristics such as high elasticity and a tensile force, flexibility, and biological compatibility. The reported short-term outcomes of the application of SMLs as posterior column supporters in cervical and lumbar decompressive laminectomies seem to be positive, and complications are minimal except for the rare occurrence of pullout and fracture of the SML. However, there was no report of neurological complications related to neural compression in spite of the use of the loop of SML in the epidural space. The authors report a case of delayed development of radiating pain caused by subsidence of the SML resulting epidural compression.