• Title/Summary/Keyword: length optimal code

Search Result 59, Processing Time 0.032 seconds

Design of Adaptive Reed-Solomon Encoder for Multi QoS Services or Time-Varying Channels (다중 QoS 서비스와 시변 채널을 위한 적응형 RS 부호기의 설계)

  • 공민한;송문규;김응배;정찬복
    • Proceedings of the IEEK Conference
    • /
    • 2001.06a
    • /
    • pp.113-116
    • /
    • 2001
  • Reed-Solomon(RS) code is the most powerful burst error correcting code. In Ois paper, the architecture for the adaptive RS encoder adaptable for multi QoS requirements or time-varying channel environments has been designed. In the adaptive RS code, the message length k and the error correction capability t are allowed to be variable so that the block length n is also variable. We proposed the architecture of the adaptive RS encoder by designing the optimal structure of Galois fields multiplier with comparison of fixed multiplier and variable multiplier. The proposed architecture is implemented in VHDL and verified with the simulation tool

  • PDF

Polar Code Design for Nakagami-m Channel

  • Guo, Rui;Wu, Yingjie
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.14 no.7
    • /
    • pp.3156-3167
    • /
    • 2020
  • One drawback of polar codes is that they are not universal, that is, to achieve optimal performance, different polar codes are required for different kinds of channel. This paper proposes a polar code construction scheme for Nakagami-m fading channel. The scheme fully considers the characteristics of Nakagami-m fading channel, and uses the optimized Bhattacharyya parameter bounds. The constructed code is applied to an orthogonal frequency division multiplexing (OFDM) system over Nakagami-m fading channel to prove the performance of polar code. Simulation result shows the proposed codes can get excellent bit error rate (BER) performance with successive cancellation list (SCL) decoding. For example, the designed polar code with cyclic redundancy check (CRC) aided SCL (L = 8) decoding achieves 1.1dB of gain over LDPC at average BER about 10-5 under 4-quadrature amplitude modulation (4QAM) while the code length is 1024, rate is 0.5.

A study on the image transmission through CDMA (CDMA 채널을 통한 영상 전송에 대한 연구)

  • 허도근;김용욱
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.22 no.11
    • /
    • pp.2543-2551
    • /
    • 1997
  • This paper proposes a compression technique of image data, a variable length PN code and channel models which are required in CDMA communication system. It also analyzes their performances. Original images is compressed by 2-D DCT and its coefficients are quantized by optimal quantizer at compression rate 0.84bit/pel. Channel model 1 and 2 which are composed of 5 and 4 channels respectively are employed to be used in CDMA. Such a situation forces us to empoly variable length PN code, such as Chebyshev map for spread spectrum system. When average PN code length of model 1 and 2 is 44.4 and 26.7 chips respectively, the received image through these models under Gaussian noise with variance 1.75 is visually of the same quality as the transmitting image. Thus, the model 2 appears to be better in channel efficiency, comparing with channel model 1 and channel model which uses fixed length PN code.

  • PDF

박판 연소관의 내경 축소 공정 해석

  • 리승훈;조대연;홍성인;윤수진
    • Proceedings of the Korean Society of Propulsion Engineers Conference
    • /
    • 1997.04a
    • /
    • pp.133-143
    • /
    • 1997
  • In this paper, some of the critical factors in Necking-In process are investigated using a numerical analysis. The optimal processing parameters are established and applied to the actual processes. FEM analysis is carried out based on elastic-plastic work hardening model using ABAQUS/Standard. The results obtained from the commercially available code ABAQUS/Standard are compared with the experimental data and shows a good agreement with experimental data. The purpose of this paper is to search for the relations among the roller angle, feed length, and working force. Stress, strain distribution, displacement and increase in the length of the workpiece are also investigated.

  • PDF

유한요소법을 이용한 박판 연소관의 내경 축소 공정 해석

  • 리승훈;홍성인;윤수진
    • Proceedings of the Korean Society of Precision Engineering Conference
    • /
    • 1997.04a
    • /
    • pp.910-920
    • /
    • 1997
  • In this paper, some of the critical factors in Necking-In process are investigated using a numerical analysis. The optimal processing parameters are established and applied to the actual processes. FEM analysis is carried out based on elastic-plastic work hardening model using ABAQUS / Standard. The results obtained form the commercially available code ABAQUS / standard are compared with the experimental data and shows a good agreement with experimental data. The purpose of this paper is to search for the relations among the roller angel, feed length, and working force. Stress, strain distribution, displacement and increase in the length of the workpiece are also investigated.

  • PDF

Prediction and analysis of optimal frequency of layered composite structure using higher-order FEM and soft computing techniques

  • Das, Arijit;Hirwani, Chetan K.;Panda, Subrata K.;Topal, Umut;Dede, Tayfun
    • Steel and Composite Structures
    • /
    • v.29 no.6
    • /
    • pp.749-758
    • /
    • 2018
  • This article derived a hybrid coupling technique using the higher-order displacement polynomial and three soft computing techniques (teaching learning-based optimization, particle swarm optimization, and artificial bee colony) to predict the optimal stacking sequence of the layered structure and the corresponding frequency values. The higher-order displacement kinematics is adopted for the mathematical model derivation considering the necessary stress and stain continuity and the elimination of shear correction factor. A nine noded isoparametric Lagrangian element (eighty-one degrees of freedom at each node) is engaged for the discretisation and the desired model equation derived via the classical Hamilton's principle. Subsequently, three soft computing techniques are employed to predict the maximum natural frequency values corresponding to their optimum layer sequences via a suitable home-made computer code. The finite element convergence rate including the optimal solution stability is established through the iterative solutions. Further, the predicted optimal stacking sequence including the accuracy of the frequency values are verified with adequate comparison studies. Lastly, the derived hybrid models are explored further to by solving different numerical examples for the combined structural parameters (length to width ratio, length to thickness ratio and orthotropicity on frequency and layer-sequence) and the implicit behavior discuss in details.

NC Milling Productivity Incensement by Short Milling Tool Setting Method (NC 밀링에서 짧은 공구설치 방법으로 생산성 향상)

  • Kim, Su-Jin
    • Journal of the Korean Society for Precision Engineering
    • /
    • v.25 no.5
    • /
    • pp.60-68
    • /
    • 2008
  • The tool overhang length affects tool deflection and chatter that should be reduced for machined surface quality, productivity and long tool lift. The shortest tool setting algorithm that uses a safe space is proposed and applied with simulation software in NC machining. The safe space in the coordinate fixed in the tool is computed by the virtual machining system that simulates NC machining by stock model, tool model and NC code. The optimal tool assembly that has largest diameter and shortest length is possible using the safe space. This algorithm has been applied over fifty companies for safe and rigid tool setting. The collision accident between holder and stock was reduced from 3 to 0 a year and the productivity was incensed about 15% by using faster feed rate acceptable for shorten tool length.

Hardware implementation of a SOVA decoder for the 3GPP complied Turbo code (3GPP 규격의 터보 복호기 구현을 위한 SOVA 복호기의 하드웨어 구현)

  • 김주민;고태환;이원철;정덕진
    • Proceedings of the IEEK Conference
    • /
    • 2001.06a
    • /
    • pp.205-208
    • /
    • 2001
  • According to the IMT-2000 specification of 3GPP(3rd Generation Partnership Project) and 3GPP2, Turbo codes is selected as a FEC(forward error correction) code for even higher reliable data communication. In 3GPP complied IMT-2000 system, channel coding under consideration is the selective use of convolutional coding and Turbo codes of 1/3 code rate with 4 constraint length. Suggesting a new path metric normalization method, we achieved a low complexity and high performance SOVA decoder for Turbo Codes, Further more, we analyze the decoding performance with respect to update depth and find out the optimal value of it by using computer simulation. Based on the simulation result, we designed a SOVA decoder using VHDL and implemented it into the Altera EPF10K100GC503FPGA.

  • PDF

The beam property simulation for the fabrication of a MLA(Micro Lens Array) (MLA(Micro Lens Array) 제작을 위한 광학 시뮬레이션)

  • Oh, Hae-Kwan;Seo, Hyun-Woo;Kim, Geun-Young;Wei, Chang-Hyun;Song, Yo-Tak;Lee, Kee-Keun;Yang, Sang-Sik
    • Proceedings of the KIEE Conference
    • /
    • 2009.07a
    • /
    • pp.1497_1498
    • /
    • 2009
  • This paper presents the simulation of micro-lens arrays based on dry and wet etching technique. Code V (Optical Research Associates Ltd) simulation was performed to extract optimal design parameters of a Micro-Lens Array(MLA). Thickness of UV adhesive, wavelength of laser source, curvature, and shape of lens surface were chosen for the design parameters. The simulation results showed that focal length of a MLA decreased with the increase of UV adhesive thickness. And the focal length depended on shape of lens surface and length of laser source.

  • PDF

CONSTRUCTION OF TWO- OR THREE-WEIGHT BINARY LINEAR CODES FROM VASIL'EV CODES

  • Hyun, Jong Yoon;Kim, Jaeseon
    • Journal of the Korean Mathematical Society
    • /
    • v.58 no.1
    • /
    • pp.29-44
    • /
    • 2021
  • The set D of column vectors of a generator matrix of a linear code is called a defining set of the linear code. In this paper we consider the problem of constructing few-weight (mainly two- or three-weight) linear codes from defining sets. It can be easily seen that we obtain an one-weight code when we take a defining set to be the nonzero codewords of a linear code. Therefore we have to choose a defining set from a non-linear code to obtain two- or three-weight codes, and we face the problem that the constructed code contains many weights. To overcome this difficulty, we employ the linear codes of the following form: Let D be a subset of ��2n, and W (resp. V ) be a subspace of ��2 (resp. ��2n). We define the linear code ��D(W; V ) with defining set D and restricted to W, V by $${\mathcal{C}}_D(W;V )=\{(s+u{\cdot}x)_{x{\in}D^{\ast}}|s{\in}W,u{\in}V\}$$. We obtain two- or three-weight codes by taking D to be a Vasil'ev code of length n = 2m - 1(m ≥ 3) and a suitable choices of W. We do the same job for D being the complement of a Vasil'ev code. The constructed few-weight codes share some nice properties. Some of them are optimal in the sense that they attain either the Griesmer bound or the Grey-Rankin bound. Most of them are minimal codes which, in turn, have an application in secret sharing schemes. Finally we obtain an infinite family of minimal codes for which the sufficient condition of Ashikhmin and Barg does not hold.