• Title/Summary/Keyword: encoding ratio

Search Result 181, Processing Time 0.021 seconds

The Minimum PAPR Code for OFDM Systems

  • Kang, Seog-Geun
    • ETRI Journal
    • /
    • v.28 no.2
    • /
    • pp.235-238
    • /
    • 2006
  • In this letter, a block code that minimizes the peak-to-average power ratio (PAPR) of orthogonal frequency division multiplexing (OFDM) signals is proposed. It is shown that peak envelope power is invariant to cyclic shift and codeword inversion. The systematic encoding rule for the proposed code is composed of searching for a seed codeword, shifting the register elements, and determining codeword inversion. This eliminates the look-up table for one-to-one correspondence between the source and the coded data. Computer simulation confirms that OFDM systems with the proposed code always have the minimum PAPR.

  • PDF

A Systematic Code Design for Reduction of the PAPR in OFDM (직교 주파수분할다중화에서 첨두전력 대 평균전력비 감소를 위한 체계적인 부호설계)

  • Kang Seog-Gen;Kim Jeong-Goo
    • Journal of Broadcast Engineering
    • /
    • v.11 no.3 s.32
    • /
    • pp.326-335
    • /
    • 2006
  • Design criteria far a block code which guarantees minimized PAPR of the OFDM signals are proposed in this paper. Encoding procedure of the minimum PAPR codes (MPC) is composed of searching a seed codeword, circular shifting the register elements, and determining codeword inversion. It is shown that the PEP is invariant to the circular shift of register elements and codeword inversion. Based on such properties, systematic encoding rule for MPC is proposed. In addition proposed encoding rule can reduced greatly the size of look up table for MPC.

Rate-User-Perceived-Quality Aware Replication Strategy for Video Streaming over Wireless Mesh Networks

  • Du, Xu;Vo, Nguyen-Son;Cheng, Wenqing;Duong, Trung Q.
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.5 no.11
    • /
    • pp.2103-2120
    • /
    • 2011
  • In this research, we consider the replication strategy for the applications of video streaming in wireless mesh networks (WMNs). In particular, we propose a closed-form of optimal replication densities for a set of frames of a video streaming by exploiting not only the skewed access probability of each frame but also the skewed loss probability and skewed encoding rate-distortion information. The simulation results demonstrate that our method improves the replication performance in terms of user-perceived quality (UPQ) which includes: 1) minimum average maximum reconstructed distortion for high peak signal-to-noise ratio (PSNR), 2) small reconstructed distortion fluctuation among frames for smooth playback, and 3) reasonable average maximum transmission distance for continuous playback. Furthermore, the proposed strategy consumes smaller storage capacity compared to other existing optimal replication strategies. More importantly, the effect of encoding rate is carefully investigated to show that high encoding rate does not always gain high performance of replication for video streaming.

Adaptive Coding Mode Decision Algorithm using Motion Vector Map in H.264/AVC Video Coding (H.264/AVC 부호기에서 움직임 벡터 맵을 이용한 적응적인 부호화 모드 결정 방법)

  • Kim, Tae-Jung;Ko, Man-Geun;Suh, Jae-Won
    • Journal of the Institute of Electronics Engineers of Korea SP
    • /
    • v.46 no.2
    • /
    • pp.48-56
    • /
    • 2009
  • We propose a fast intra mode skip decision algorithm for H.264/AVC video encoding. Although newly added MB encoding algorithms based on various prediction methods increase compression ratio, they require a significant increase in the computational complexity because we calculate rate-distortion(RD) cost for all possible MB coding modes and then choose the best one. In this paper, we propose a fast mode decision algorithm based on an adaptive motion vector map(AMVM) method for H.264/AVC video encoding to reduce the processing time for the inter frame. We verify that the proposed algorithm generates generally good performances in PSNR, bit rates, and processing time.

Optimizations of 3D MRI Techniques in Brain by Evaluating SENSE Factors (삼차원 자기공명영상법의 뇌 구조 영상을 위한 최적화 연구: 센스인자 변화에 따른 신호변화 평가)

  • Park, Myung-Hwan;Lee, Jin-Wan;Lee, Kang-Won;Ryu, Chang-Woo;Jahng, Geon-Ho
    • Investigative Magnetic Resonance Imaging
    • /
    • v.13 no.2
    • /
    • pp.161-170
    • /
    • 2009
  • Purpose : A parallel imaging method provides us to improve temporal resolution to obtain three-dimensional (3D) MR images. The objective of this study was to optimize three 3D MRI techniques by adjusting 2D SESNE factors of the parallel imaging method in phantom and human brain. Materials and Methods : With a 3 Tesla MRI system and an 8-channel phase-array sensitivity-encoding (SENSE) coil, three 3D MRI techniques of 3D T1-weighted imaging (3D T1WI), 3D T2-weighted imaging (3D T2WI) and 3D fluid attenuated inversion recovery (3D FLAIR) imaging were optimized with adjusting SESNE factors in a water phantom and three human brains. The 2D SENSE factor was applied on the phase-encoding and the slice-encoding directions. Signal-to-noise ratio(SNR), percent signal reduction rate(%R), and contrast-to-noise ratio(CNR) were calculated by using signal intensities obtained in specific regions-of-interest (ROI). Results : In the phantom study, SENSE factor = 3 was provided in 0.2% reduction of signals against without using SENSE with imaging within 5 minutes for 3D T1WI. SENSE factor = 2 was provided in 0.98% signal reduction against without using SENSE with imaging within 5 minutes for 3D T2WI. SENSE factor = 4 was provided in 0.2% signal reduction against without using SENSE with imaging around 6 minutes for 3D FLAIR. In the human brain study, SNR and CNR were higher with SENSE factors = 3 than 4 for all three imaging techniques. Conclusion : This study was performed to optimize 2D SENSE factors in the three 3D MRI techniques that can be scanned in clinical time limitations with minimizing SNR reductions. Without compromising SNR and CNR, the optimum 2D SENSE factors were 3 and 4, yielding the scan time of about 5 to 6 minutes. Further studies are necessary to optimize 3D MRI techniques in other areas in human body.

  • PDF

Fast Quadtree Based Normalized Cross Correlation Method for Fractal Video Compression using FFT

  • Chaudhari, R.E.;Dhok, S.B.
    • Journal of Electrical Engineering and Technology
    • /
    • v.11 no.2
    • /
    • pp.519-528
    • /
    • 2016
  • In order to achieve fast computational speed with good visual quality of output video, we propose a frequency domain based new fractal video compression scheme. Normalized cross correlation is used to find the structural self similar domain block for the input range block. To increase the searching speed, cross correlation is implemented in the frequency domain using FFT with one computational operation for all the domain blocks instead of individual block wise calculations. The encoding time is further minimized by applying rotation and reflection DFT properties to the IFFT of zero padded range blocks. The energy of overlap small size domain blocks is pre-computed for the entire reference frame and retaining the energies of the overlapped search window portion of previous adjacent block. Quadtree decompositions are obtained by using domain block motion compensated prediction error as a threshold to control the further partitions of the block. It provides a better level of adaption to the scene contents than fixed block size approach. The result shows that, on average, the proposed method can raise the encoding speed by 48.8 % and 90 % higher than NHEXS and CPM/NCIM algorithms respectively. The compression ratio and PSNR of the proposed method is increased by 15.41 and 0.89 dB higher than that of NHEXS on average. For low bit rate videos, the proposed algorithm achieve the high compression ratio above 120 with more than 31 dB PSNR.

A Differential Index Assignment Scheme for Tree-Structured Vector Quantization (나무구조 벡터양자화 기반의 차분 인덱스 할당기법)

  • 한종기;정인철
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.28 no.2C
    • /
    • pp.100-109
    • /
    • 2003
  • A differential index assignment scheme is proposed for the image encoding system in which a variable-length tree-structured vector quantizer is adopted. Each source vector is quantized into a terminal node of VLTSVQ and each terminal node is represented as a unique binary vector. The proposed index assignment scheme utilizes the correlation between interblocks of the image to increase the compression ratio with the image quality maintained. Simulation results show that the proposed scheme achieves a much higher compression ratio than the conventional one does and that the amount of the bit rate reduction of the proposed scheme becomes large as the correlation of the image becomes large. The proposed encoding scheme can be effectively used to encode R images whose pixel values we, in general, highly correlated with those of the neighbor pixels.

Optimum Design of Multi-Stage Gear Drive Using Genetic Algorithm Mixed Binary and Real Encoding (이진코딩과 실수코딩이 조합된 유전 알고리즘을 이용한 다단 기어장치의 최적설계)

  • 정태형;홍현기;이정상
    • Proceedings of the Korean Society of Machine Tool Engineers Conference
    • /
    • 2004.04a
    • /
    • pp.118-123
    • /
    • 2004
  • In this study, genetic algorithm mixed binary and real encoding is proposed to deal with design variables of various types. And that is applied to optimum design of Multi-stage gear drive. Design of pressure vessel which is mixed discrete and continuous variables is applied to verify reasonableness of proposed genetic algorithm. The proposed genetic algorithm is applied for the gear ratio optimization and the volume minimization of geared motor which is used in field. In result, it shows that the volume has decreased about 8% compared with the existing geared motor.

  • PDF

ECG Data Coding Using Piecewise Fractal Interpolation

  • Jun, Young-Il;Jung, Hyun-Meen;Yoon, Young-Ro;Yoon, Hyung-Ro
    • Proceedings of the KOSOMBE Conference
    • /
    • v.1994 no.12
    • /
    • pp.134-137
    • /
    • 1994
  • In this paper, we describe an approach to ECG data coding based on a fractal theory of iterated contractive transformations defined piecewise. The main characteristic of this approach is that it relies on the assumption that signal redundancy can be efficiently captured and exploited through piecewise self-transformability on a block-wise basis. The variable range size technique is employed to reduce the reconstruction error. Large ranges are used for encoding the smooth waveform to yield high compression efficiency, and the smaller ranges are used for encoding rapidly varying parts of the signal to preserve the signal quality. The suggested algorithm was evaluated using MIT/BIH arrhythmia database. A high compression ratio is achieved with a relatively low reconstruction error.

  • PDF

Fast CU Decision Algorithm using the Initial CU Size Estimation and PU modes' RD Cost (초기 CU 크기 예측과 PU 모드 예측 비용을 이용한 고속 CU 결정 알고리즘)

  • Yoo, Hyang-Mi;Shin, Soo-Yeon;Suh, Jae-Won
    • Journal of Broadcast Engineering
    • /
    • v.19 no.3
    • /
    • pp.405-414
    • /
    • 2014
  • High Efficiency Video Coding(HEVC) obtains high compression ratio by applying recursive quad-tree structured coding unit(CU). However, this recursive quad-tree structure brings very high computational complexity to HEVC encoder. In this paper, we present fast CU decision algorithm in recursive quad-tree structure. The proposed algorithm estimates initial CU size before CTU encoding and checks the proposed condition using Coded Block Flag(CBF) and Rate-distortion cost to achieve the fast encoding time saving. And, intra mode estimation is also possible to be skipped using the CBF values acquired during the inter PU mode estimations. Experiment results shows that the proposed algorithm saved about 49.91% and 37.97% of encoding time according to the weighting condition.