• Title/Summary/Keyword: optimal codes

Search Result 182, Processing Time 0.026 seconds

A Cross-Layer Unequal Error Protection Scheme for Prioritized H.264 Video using RCPC Codes and Hierarchical QAM

  • Chung, Wei-Ho;Kumar, Sunil;Paluri, Seethal;Nagaraj, Santosh;Annamalai, Annamalai Jr.;Matyjas, John D.
    • Journal of Information Processing Systems
    • /
    • v.9 no.1
    • /
    • pp.53-68
    • /
    • 2013
  • We investigate the rate-compatible punctured convolutional (RCPC) codes concatenated with hierarchical QAM for designing a cross-layer unequal error protection scheme for H.264 coded sequences. We first divide the H.264 encoded video slices into three priority classes based on their relative importance. We investigate the system constraints and propose an optimization formulation to compute the optimal parameters of the proposed system for the given source significance information. An upper bound to the significance-weighted bit error rate in the proposed system is derived as a function of system parameters, including the code rate and geometry of the constellation. An example is given with design rules for H.264 video communications and 3.5-4 dB PSNR improvement over existing RCPC based techniques for AWGN wireless channels is shown through simulations.

Performance and Convergence Analysis of Tree-LDPC codes on the Min-Sum Iterative Decoding Algorithm (Min-Sum 반복 복호 알고리즘을 사용한 Tree-LDPC의 성능과 수렴 분석)

  • Noh Kwang-seok;Heo Jun;Chung Kyuhyuk
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.31 no.1C
    • /
    • pp.20-25
    • /
    • 2006
  • In this paper, the performance of Tree-LDPC code is presented based on the min-sum algorithm with scaling and the asymptotic performance in the water fall region is shown by density evolution. We presents that the Tree-LDPC code show a significant performance gain by scaling with the optimal scaling factor which is obtained by density evolution methods. We also show that the performance of min-sum with scaling is as good as the performance of sum-product while the decoding complexity of min-sum algorithm is much lower than that of sum-product algorithm. The Tree-LDPC decoder is implemented on a FPGA chip with a small interleaver size.

Design of Low-Density Parity-Check Codes for Multiple-Input Multiple-Output Systems (Multiple-Input Multiple-output system을 위한 Low-Density Parity-Check codes 설계)

  • Shin, Jeong-Hwan;Chae, Hyun-Do;Han, In-Duk;Heo, Jun
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.35 no.7C
    • /
    • pp.587-593
    • /
    • 2010
  • In this paper we design an irregular low-density parity-check (LDPC) code for multiple-input multiple-output (MIMO) system, using a simple extrinsic information transfer (EXIT) chart method. The MIMO systems considered are optimal maximum a posteriori probability (MAP) detector. The MIMO detector and the LDPC decoder exchange soft information and form a turbo iterative receiver. The EXIT charts are used to obtain the edge degree distribution of the irregular LDPC code which is optimized for the MIMO detector. It is shown that the performance of the designed LDPC code is better than that of conventional LDPC code which was optimized for either the Additive White Gaussian Noise (AWGN) channel or the MIMO channel.

New DC-suppression Method of Modulation Codes for High Density Optical Recording Systems (고밀도 광 기록 장치를 위한 변조 코드의 새로운 직류 성분 제거 방법)

  • Lee, Joo-Hyun;Lee, Jae-Jin
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.27 no.1A
    • /
    • pp.13-17
    • /
    • 2002
  • For elimination DC component, the optical recording systems generally exploit WRDS (word-end running digital sum) criterion. However, its performance is degraded if the lengths of the control bits and codewords are increased. Another criterion is MSW (mean-square weight) method. Whereas MSW criterion has the complexity, this hs optimal performance. In this paper, we have proposed a new dc-component suppression method (MPRDS, minimum peak RDS) of the modulation codes for high density optical recording system. This method requires less complexity than MSW's, and the performance is near to MSW's even if the lengths of the control bits and codewords are increased.

Construction of Symmetrical Reversible Variable-Length Codes from the Huffman Code (Huffman 부호에 기초한 대칭적 양방향 가변길이 부호의 설계 방법)

  • Jeong Wook-Hyun;Ho Yo-Sung
    • Journal of the Institute of Electronics Engineers of Korea SP
    • /
    • v.41 no.1
    • /
    • pp.57-68
    • /
    • 2004
  • Although variable-length codes (VLCs) increase coding efficiency using the statistical characteristics of the source data, they have catastrophic effects from bit errors in noisy transmission environments. In order to overcome this problem with VLCs, reversible variable-length codes (RVLCS) have recently been proposed owing to their data recovering capability. RVLCS can be divided into two categories: symmetrical and asymmetrical RVLCs. Although the symmetrical RVLC has generally more overheads than the asymmetrical RVLC, it has some advantages of simpler design and more efficient memory usage. However, existing symmetrical RVLCs still have high complexity in their code design and some room for improvement in coding efficiency. In this paper, we propose a new algorithm for constructing a symmetrical RVLC from the optimal Huffman code table. The proposed algorithm has a simpler design process and also demonstrates improved performance in terms of the average codeword length relative to the existing symmetrical RVLC algorithms.

Locally Repairable Codes with Two Different Locality Requirements (두 개의 다른 부분접속수 요건을 가진 부분접속 복구 부호)

  • Kim, Geonu;Lee, Jungwoo
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.41 no.12
    • /
    • pp.1671-1683
    • /
    • 2016
  • Locally repairable codes (LRCs) constitute an important class of codes for distributed storage, where repair efficiency is a key metric of system performance. In LRCs, efficient repair is achieved by small locality-number of nodes participating in the repair process. In this paper, we focus on situations where different locality is required for different nodes. We present a non-trivial extension of the recent results on multiple (or unequal) localities to the $r,{\delta}$-locality case. A new Singleton-type minimum distance upper bound is derived and an optimal code construction is provided. While the result is limited to the case of only two different localities, it should be noted that it can be directly applied to the more general case where the localities are specified not exactly but by upper limits.

Bit Split Algorithm for Applying the Multilevel Modulation of Iterative codes (반복부호의 멀티레벨 변조방식 적용을 위한 비트분리 알고리즘)

  • Park, Tae-Doo;Kim, Min-Hyuk;Kim, Nam-Soo;Jung, Ji-Won
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.12 no.9
    • /
    • pp.1654-1665
    • /
    • 2008
  • This paper presents bit splitting methods to apply multilevel modulation to iterative codes such as turbo code, low density parity check code and turbo product code. Log-likelihood ratio method splits multilevel symbols to soft decision symbols using the received in-phase and quadrature component based on Gaussian approximation. However it is too complicate to calculate and to implement hardware due to exponential and logarithm calculation. Therefore this paper presents Euclidean, MAX, sector and center focusing method to reduce the high complexity of LLR method. Also, this paper proposes optimal soft symbol split method for three kind of iterative codes. Futhermore, 16-APSK modulator method with double ring structure for applying DVB-S2 system and 16-QAM modulator method with lattice structure for T-DMB system are also analyzed.

Design and comparative study of various Two-Dimensional Grain Configurations based on Optimization Method

  • Nisar, Khurram;Liang, Guozhu
    • Proceedings of the Korean Society of Propulsion Engineers Conference
    • /
    • 2008.03a
    • /
    • pp.226-234
    • /
    • 2008
  • Grain design has always been a vital and integral part of Solid Rocket Motor(SRM) design. Basing on the design objectives set by the system designer, the SRM designer has many options available for selecting the Grain configuration. Many of the available configurations may fulfill the required parameters of volumetric loading fraction, web fraction & Length to diameter ratios and produce internal ballistic results that may be in accordance to the design objectives. However, for any given set of design objectives, it is deemed necessary that best possible configuration be selected, designed and optimized. Hence optimal results of all applicable configurations are vital to be attained in order to compare and finalize the design that will produce most efficient performance. Generally the engineers pay attention and have skills on a specific grain configuration. The designing methodologies and computer codes available usually focus on single grain configuration may it be Star, Wagon Wheel or slotted tube. Hardly one can find a software or a design methodology where all such configurations can be worked on jointly and not only adequate designs be found but optimal solutions reached by applying an optimization method to find final design best suited for any design objective. In the present work design requirements have been set, grain configurations have been selected and their designing has been conducted. The internal ballistic parameters have been calculated and after finding the preliminary design solutions, the optimal solutions have been found. In doing so, software has been developed comprising of computer programs for designing the 2D grains including Star, Wagon Wheel and Slotted Tube configurations. The optimization toolbox of Matlab Fmincon has been used for getting optimal solutions. The affects of all the independent geometric design variables on the optimized solutions have been analyzed. Based on results attained from Optimization Method, an in depth comparison of Grain Configurations and analysis of performance prediction outputs have been conducted to come to conclusion as to which grain configuration is ideal for the current design requirement under study.

  • PDF

Study on Optimal Welding Processes of Half Nozzle Repair on Small Bore Piping Welds in Reactor Coolant System (원자로냉각재계통 소구경 관통관 용접부 부분노즐교체 예방정비를 위한 최적 용접공정에 관한 연구)

  • Kim, Young Zoo;Jung, Kwang Woon;Choi, Kwang Min;Choi, Dong Chul;Cho, Sang Beum;Cho, Hong Seok
    • Transactions of the Korean Society of Pressure Vessels and Piping
    • /
    • v.14 no.1
    • /
    • pp.58-65
    • /
    • 2018
  • The purpose of this study is to develop a Half Nozzle Repair(HNR) process to prevent the leakage from welds on small bore piping in Reactor Coolant System. The Codes & Standards of tempered bead and design requirements of J-Groove welds are reviewed. Automatic machine GTAW welding and machining equipments are developed to perform HNR process. Single pass welding and overlay welding equipments are conducted in order to obtain the optimal temper bead welding process parameters with Alloy 52M filler wire. Coarse grain heat affected zone(CGHAZ) is formed by rapid cooling rate in heat affected zone after welding. Accordingly, a proper temper bead technique is required to reduce CGHAZ in 1-Layer of welds by 2- and 3-Layers. Mock-up tests show that the developed HNR process is possible to meet ASME Code & Standard requirements without any defect.

Huffman Code Design and PSIP Structure of Hangul Data for Digital Broadcasting (디지털 방송용 한글 허프만 부호 설계 및 PSIP 구조)

  • 황재정;진경식;한학수;최준영;이진환
    • Journal of Broadcast Engineering
    • /
    • v.6 no.1
    • /
    • pp.98-107
    • /
    • 2001
  • In this paper we derive an optimal Huffman code set with escape coding that miximizes coding efficiency for the Hangul text data. The Hangul code can be represented in the standard Wansung or Unicode format, and we can generate a set of Huffamn codes for both. The current Korean DT standard has not defined a Hangul compression algorithm which may be confronted with a serious data rate for the digital data broadcasting system Generation of the optimal Huffman code set is to solve the data transmission problem. A relevant PSIP structure for the DTB standard is also proposed As a result characters which have the probability of less than 0.0043 are escape coded, showing the optimum compression efficiency of 46%.

  • PDF