• Title/Summary/Keyword: (n,k) code

Search Result 618, Processing Time 0.028 seconds

Unstructured Moving-Mesh Hydrodynamic Simulation

  • Yun, Kiyun;Kim, Juhan;Yoon, Suk-Jin
    • The Bulletin of The Korean Astronomical Society
    • /
    • v.39 no.2
    • /
    • pp.65.2-65.2
    • /
    • 2014
  • We present a new hydrodynamic simulation code based on the Voronoi tessellation for estimating the density precisely. The code employs both of Lagrangian and Eulerian description by adopting the movable mesh scheme, which is superior to the conventional SPH (smoothed particle hydrodynamics) and AMR (adaptive mesh refinement) schemes. The code first generates unstructured meshes by the Voronoi tessellation at every time step, and then solves the Riemann problem for all surfaces of each Voronoi cell so as to update the hydrodynamic states as well as to move current meshes. Besides, the IEM (incremental expanding method) is devised to compute the Voronoi tessellation to desired degree of speed, thereby the CPU time is turned out to be just proportional to the number of particles, i.e., O(N). We discuss the applications of our code in the context of cosmological simulations as well as numerical experiments for galaxy formation.

  • PDF

The Design of Regenerating Codes with a Varying Number of Helper Nodes (다양한 도움 노드의 수를 가지는 재생 부호의 설계)

  • Lee, Hyuk;Lee, Jungwoo
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.41 no.12
    • /
    • pp.1684-1691
    • /
    • 2016
  • Erasure codes have recently been applied to distributed storage systems due to their high storage efficiency. Regenerating codes are a kind of erasure codes, which are optimal in terms of minimum repair bandwidth. An (n,k,d)-regenerating code consists of n storage nodes where a failed node can be recovered with the help of the exactly d numbers of surviving nodes. However, if node failures occur frequently or network connection is unstable, the number of helper nodes that a failed node can contact may be smaller than d. In such cases, regenerating codes cannot repair the failed nodes efficiently since the node repair process of the codes does not work when the number of helper nodes is less than d. In this paper, we propose an operating method of regenerating codes where a failed node can be repaired from ${\bar{d}}$ helper nodes where $$k{\leq_-}{\bar{d}}{\leq_-}d$$.

QR code as speckle pattern for reinforced concrete beams using digital image correlation

  • Krishna, B. Murali;Tezeswi, T.P.;Kumar, P. Rathish;Gopikrishna, K.;Sivakumar, M.V.N.;Shashi, M.
    • Structural Monitoring and Maintenance
    • /
    • v.6 no.1
    • /
    • pp.67-84
    • /
    • 2019
  • Digital Image Correlation technique (DIC) is a non-contact optical method for rapid structural health monitoring of critical infrastructure. An innovative approach to DIC is presented using QR (Quick Response) code based random speckle pattern. Reinforced Cement Concrete (RCC) beams of size $1800mm{\times}150mm{\times}200mm$ are tested in flexure. DIC is used to extract Moment (M) - Curvature (${\kappa}$) relationships using random speckle patterns and QR code based random speckle patterns. The QR code based random speckle pattern is evaluated for 2D DIC measurements and the QR code speckle pattern performs satisfactorily in comparison with random speckle pattern when considered in the context of serving a dual purpose. Characteristics of QR code based random speckle pattern are quantified and its applicability to DIC is explored. The ultimate moment-curvature values computed from the QR code based random speckled pattern are found to be in good agreement with conventional measurements. QR code encrypts the structural information which enables integration with building information modelling (BIM).

A NEW UPPER BOUND FOR SINGLE ERROR-CORRECTING CODES

  • Kim, Jun-Kyo
    • Bulletin of the Korean Mathematical Society
    • /
    • v.38 no.4
    • /
    • pp.797-801
    • /
    • 2001
  • The purpose of this paper is to give an upper bound for A[n,4], the maximum number of codewords in a binary code of word length n with minimum distance 4 between codewords. We have improved upper bound for A[12k+11,4]. In this correspondence we prove $A[23,4]\leq173716$.

  • PDF

A design of LDPC decoder supporting multiple block lengths and code rates of IEEE 802.11n (다중 블록길이와 부호율을 지원하는 IEEE 802.11n용 LDPC 복호기 설계)

  • Kim, Eun-Suk;Park, Hae-Won;Na, Young-Heon;Shin, Kyung-Wook
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2011.05a
    • /
    • pp.132-135
    • /
    • 2011
  • This paper describes a multi-mode LDPC decoder which supports three block lengths(648, 1296, 1944) and four code rates(1/2, 2/3, 3/4, 5/6) of IEEE 802.11n WLAN standard. To minimize hardware complexity, it adopts a block-serial (partially parallel) architecture based on the layered decoding scheme. A novel memory reduction technique devised using the min-sum decoding algorithm reduces the size of check-node memory by 47% as compared to conventional method. The designed LDPC decoder is verified by FPGA implementation, and synthesized with a $0.18-{\mu}m$ CMOS cell library. It has 219,100 gates and 45,036 bits RAM, and the estimated throughput is about 164~212 Mbps at 50 MHz@2.5v.

  • PDF

Construction of Structured q-ary LDPC Codes over Small Fields Using Sliding-Window Method

  • Chen, Haiqiang;Liu, Yunyi;Qin, Tuanfa;Yao, Haitao;Tang, Qiuling
    • Journal of Communications and Networks
    • /
    • v.16 no.5
    • /
    • pp.479-484
    • /
    • 2014
  • In this paper, we consider the construction of cyclic and quasi-cyclic structured q-ary low-density parity-check (LDPC) codes over a designated small field. The construction is performed with a pre-defined sliding-window, which actually executes the regular mapping from original field to the targeted field under certain parameters. Compared to the original codes, the new constructed codes can provide better flexibility in choice of code rate, code length and size of field. The constructed codes over small fields with code length from tenths to hundreds perform well with q-ary sum-product decoding algorithm (QSPA) over the additive white Gaussian noise channel and are comparable to the improved spherepacking bound. These codes may found applications in wireless sensor networks (WSN), where the delay and energy are extremely constrained.

Error Rate Performance of DS-CDMA/DQPSK Signal in Indoor Radio Channel Adopting ARQ Scheme (실내 무선 채널에서 ARQ 기법을 채용하는 DS-CDMA/DQPSK 신호의 오율특성)

  • 오창헌;고봉진;조성준
    • Journal of the Korean Institute of Telematics and Electronics A
    • /
    • v.31A no.4
    • /
    • pp.11-20
    • /
    • 1994
  • The error rate equation of DS-CDMA/DQPSK skgnal adopting ARQ scheme has been derived in indoor radio channel which is characterized by AWGN, multi-user interference (MUI) and Rician fading, Using the derived equation the error performance has been evaluated and shown in figures as a function of direct to diffuse signal power ratio(KS1rT), the number of active users (K), PN code sequence length (N), the number of parity bit of linear code (b), forward channel BER, and ES1bT/NS1OT. From the results it is known that in severe fading environments (KS1rT=6) the performance of DS-CDMA/DQPSK system is not reliable so it is needed to adopt techniques for improvement. When an ARQ scheme is adopted, as a method for improving error performance, the performance improves compared with that of non-ARQ scheme and the degree of improvement is proportional to the number of parity bits of linear code. As increasing the number of parity bits, system performance is improved vut system throughput efficiency must be considered. In severe fading channel Hybrid ARQ scheme is more effective than ARQ scheme. As a result, ARQ scheme is appropriate for the high-reliability data communication systems over the radio channel in which the real time processing is not required.

  • PDF

Butt-fusing Procedures and Qualifications of High Density Polyethylene Pipe for Nuclear Power Plant Application (원자력발전소 적용 고밀도 폴리에틸렌 배관의 맞대기 융착절차 및 검증절차 분석)

  • Oh, Young-Jin;Park, Heung-Bae;Shin, Ho-Sang
    • Journal of Welding and Joining
    • /
    • v.31 no.6
    • /
    • pp.1-7
    • /
    • 2013
  • In nuclear power plants, lined carbon steel pipes or PCCPs (pre-stressed concrete cylinder pipes) have been widely used for sea water transport systems. However, de-bonding of linings and oxidation of PCCP could make problems in aged NPPs (nuclear power plants). Recently at several NPPs in the United States, the PCCPs or lined carbon steel pipes of the sea water or raw water system have been replaced with HDPE (high density polyethylene) pipes, which have outstanding resistance to oxidation and seismic loading. ASME B&PV Code committee developed Code Case N-755, which describes rules for the construction of buried Safety Class 3 polyethylene pressure piping systems. Although US NRC permitted HDPE materials for Class 3 buried piping, their permission was limited to only 10-year operation because of several concerns including the quality of fusion zone of HDPE. In this study, various requirements for fusion qualification test of HDPE and some regulatory issues raised during HDPE application review in foreign NPPs are introduced.

A Study of PLC System using Complementary code (Complementary code를 이용한 전력선 통신 시스템에 관한 연구)

  • Hur N. Y.;Shin M. C.;Seo H. S.;Choi I. H.;Choi S. Y.;Lee J. J.;Park G. H.;Cha J. S.
    • Proceedings of the KIEE Conference
    • /
    • summer
    • /
    • pp.322-324
    • /
    • 2004
  • 최근의 전력선통신은 대용량 정보를 고속으로 전송하기 위한 개발이 활발히 진행되어지고 있으며, 이러한 통신시스템 기술의 구현을 위해서는 새로운 통신방식을 제안하여야 한다 본 논문에서는 직교특성이 탁월한 Complementary Code를 기반으로, 저간섭 특성 및 고속 정보전송이 가능한 전력선 통신시스템을 제시하고 BER(Bit Error Rate)성능분석을 통하여 제안 시스템의 유용성을 확인하였다.

  • PDF