• Title/Summary/Keyword: code size

Search Result 1,095, Processing Time 0.027 seconds

Low-Complexity Multi-size Cyclic-Shifter for QC-LDPC Codes

  • Kang, Hyeong-Ju;Yang, Byung-Do
    • ETRI Journal
    • /
    • v.39 no.3
    • /
    • pp.319-325
    • /
    • 2017
  • The decoding process of a quasi-cyclic low-density parity check code requires a unique type of rotator. These rotators, called multi-size cyclic-shifters (MSCSs), rotate input data with various sizes, where the size is the amount of data to be rotated. This paper proposes a low-complexity MSCS structure for the case when the sizes have a nontrivial common divisor. By combining the strong points of two previous structures, the proposed structure achieves the smallest area. The experimental results show that the area reduction was more than 14.7% when the proposed structure was applied to IEEE 802.16e as an example.

Reduction of Grid Size Dependency in DME Spray Modeling with Gas-jet Model (가스 제트 모델을 이용한 DME 분무 해석의 격자 의존성 저감)

  • Oh, Yun-Jung;Kim, Sa-Yop;Lee, Chang-Sik;Park, Sung-Wook
    • Journal of ILASS-Korea
    • /
    • v.15 no.4
    • /
    • pp.170-176
    • /
    • 2010
  • This paper describes the grid-size dependency of the conventional Eulerian-Lagrangian method to spray characteristics such as spray penetration and SMD in modeling DME sprays. In addition, the reduction of the grid-size dependency of the present Gas-jet model was investigated. The calculations were performed using the KIVA code and the calculated results were compared to those of experimental result. The results showed that the conventional Eulerian-Laglangian model predicts shorter spray penetration for large cell because of inaccurate calculation of momentum exchange between liquid and gas phase. However, it was shown that the gas-jet model reduced grid-size dependency to spray penetration by calculating relative velocity between liquid and ambient gas based on gas jet velocity.

The High-Speed Extraction of Interest Region in the Parcel Image of Large Size (대용량 소포영상에서 관심영역 고속추출 방법에 관한 연구)

  • Park, Moon-Sung;Bak, Sang-Eun;Kim, In-Soo;Kim, Hye-Kyu;Jung, Hoe-Kyung
    • The KIPS Transactions:PartD
    • /
    • v.11D no.3
    • /
    • pp.691-702
    • /
    • 2004
  • In this paper, we propose a sequence of method which extrats ROIs(Region of Interests) rapidly from the parcel image of large size. In the proposed method, original image is spilt into the small masks, and the meaningful masks, the ROIs, are extracted by two criterions sequentially The first criterion is difference of pixel value between Inner points, and the second is deviation of it. After processing, some informational ROIs-the areas of bar code, characters, label and the outline of object-are acquired. Using diagonal axis of each ROI and the feature of various 2D bar code, the area of 2D bar code can be extracted from the ROIs. From an experiment using above methods, various ROIs are extracted less than 200msec from large-size parcel image, and 2D bar code region is selected by the accuracy of 100%.

Register Pressure Aware Code Selection Algorithm for Multi-Output Instructions (Register Pressure를 고려한 다중 출력 명령어를 위한 개선된 코드 생성 방법)

  • Youn, Jong-Hee M.;Paek, Yun-Heung;Ko, Kwang-Man
    • The KIPS Transactions:PartA
    • /
    • v.19A no.1
    • /
    • pp.45-50
    • /
    • 2012
  • The demand for faster execution time and lower energy consumption has compelled architects of embedded processors to customize it to the needs of their target applications. These processors consequently provide a rich set of specialized instructions in order to enable programmers to access these features. Such an instruction is typically a $multi$-$output$ $instruction$ (MOI), which outputs multiple results parallely in order to exploit inherent underlying hardware parallelism. Earlier study has exhibited that MOIs help to enhance performance in aspect of instruction counts and code size. However the earlier algorithm does not consider the register pressure. So, some selected MOIs introduce register spill/reload code that increases the code size and instruction count. To attack this problem, we introduce a novel iterated instruction selection algorithm based on the register pressure of each selected MOIs. The experimental results show the suggested algorithm achieves 3% code-size reduction and 2.7% speed-up on average.

Behaviour of ultra-high strength concrete encased steel columns subject to ISO-834 fire

  • Du, Yong;Zhou, Huikai;Jiang, Jian;Liew, J.Y. Richard
    • Steel and Composite Structures
    • /
    • v.38 no.2
    • /
    • pp.121-139
    • /
    • 2021
  • Ultra-high strength concrete (UHSC) encased steel columns are receiving growing interest in high-rise buildings owing to their economic and architectural advantages. However, UHSC encased steel columns are not covered by the modern fire safety design code. A total of 14 fire tests are conducted on UHSC (120 MPa) encased steel columns under constant axial loads and exposed to ISO-834 standard fire. The effect of load ratio, slenderness, stirrup spacing, cross-section size and concrete cover to core steel on the fire resistance and failure mode of the specimens are investigated. The applicability of the tabulated method in EC4 (EN 1994-1-2-2005) and regression formula in Chinese code (DBJ/T 15-81-2011) to fire resistance of UHSC encased steel columns are checked. Generally, the test results reveal that the vertical displacement-heating time curves can be divided into two phases, i.e. thermal expansion and shortening to failure. It is found that the fire resistance of column specimens increases with the increase of the cross-section size and concrete cover to core steel, but decreases with the increase of the load ratio and slenderness. The EC4 method overestimates the fire resistance up to 186% (220 min), while the Chinese code underestimates it down to 49%. The Chinese code has a better agreement than EC4 with the test results since the former considers the effect of the load ratio, slenderness, cross section size directly in its empirical formula. To estimate the fire resistance precisely can improve the economy of structural fire design of ultra-high strength concrete encased steel columns.

Performance Improvement of ACL Packet using Turbo Code in Bluetooth System (블루투스 시스템에서 터보 코드를 이용한 ACL 패킷의 성능 개선)

  • Moon Il-Young;Cho Sung-Joon
    • Proceedings of the IEEK Conference
    • /
    • 2004.06a
    • /
    • pp.317-320
    • /
    • 2004
  • In this paper, it is analyzed a performance improvement of ACL Packet using turbo code scheme in bluetooth system. In order for segment to improve the transfer capability, the transmission of messages have been simulated using a fragmentation that begins with the total package and incremental fragmentation for each layer using the TCP to define the resultant packet size and the level of fragmentation for each proceeding layer. This turbo code scheme decreases transmission time of L2CAP baseband packets by sending packets. From the results, we were able to obtain packet transmission time, optimal TCP packet size, ACL(DM packet) in AWGN.

  • PDF

Performance of Turbo Code Using Multi-Stage Interleaver in W-CDMA System (MIL인터리버를 이용한 W-CDMA시스템에서 터보부호의 성능)

  • Kim, Kyung-Sun;Ahn, Do-Rang;Lee, Dong-Wook
    • Proceedings of the KIEE Conference
    • /
    • 2000.11d
    • /
    • pp.718-720
    • /
    • 2000
  • Turbo Code is one of the most useful and powerful channel coding technique. It is adopted in radio transmission of IMT-2000, both CDMA2000 and W-CDMA system. The performance of this code depends on many parameters such as encoder memory size, free distance of codewords, interleaver size, number of decoding iteration, and so on. This paper describes a Multi-Stage Interleaver which is used in Turbo Codes for W-CDMA channel coding. We compare the performance of a Multi-Stage Interleaver with that of Mother Interleaver. The simulation results show that Multi-Stage Interleaver performs better than Mother Interleaver in bit error rate from $10^{-3}$ to $10^{-6}$.

  • PDF

Propose of New Ultrasonic Nondestructive Code Considering Discontinuity Position (불연속부의 위치를 고려한 초음파 비파괴 검사 규격의 개선안)

  • Jeong, Hwa-Young;Shin, Byoung-Chul;Jung, Beom-Seok;Lee, Chang-Moo
    • Journal of the Korea institute for structural maintenance and inspection
    • /
    • v.3 no.4
    • /
    • pp.173-178
    • /
    • 1999
  • KS-code(KS B 0896) for nondestructive ultrasonic testing classifies the quality level by ratio of flaw size to plate thickness only. But stress distributions using verification(3 point bending test) show that location of the flaws is more important than the flaw size. So. KS-code should take the effect of flaw location for classifying the quality level of welded steel structures.

  • PDF

Complement of Ultrasonic Nondestructive Testing Code using Finite Element Method (유한요소법을 이용한 초음파 비파괴검사 규격의 보완)

  • Jeong, Hwa-Young;You, Seung-Youp;Shin, Byoung-Churl;Jung, Beom-Seok;Yi, Chang-Moo
    • Journal of the Korea institute for structural maintenance and inspection
    • /
    • v.3 no.1
    • /
    • pp.157-162
    • /
    • 1999
  • KS-code(KS B 0896) for nondestructive ultrasonic testing judge the quality level by ratio of flaw size to plate thickness only. But stress distributions using finite element analysis show that location of the flaws are more important than the flaw size. So, KS-code should take into account of flaw location for judging the quality level of welded steel structures.

  • PDF

McEliece Type PKC Based on Algebraic Geometry Code over Hyperelliptic Curve (초타원 곡선위에서 생성된 대수기하 부호를 이용한McEliece유형의 공개키 암호시스템)

  • 강보경;한상근
    • Journal of the Korea Institute of Information Security & Cryptology
    • /
    • v.12 no.1
    • /
    • pp.43-54
    • /
    • 2002
  • McEliece introduced a public-key cryptosystem based on Algebraic codes, specially binary classical Goppa which have a good decoding algorithm and vast number of inequivalent codes with given parameters. And the advantage of this system low cost of their encryption and decryption procedures compared with other public-key systems specially RSA, ECC based on DLP(discrete logarithm problem). But in [1], they resent new attack based on probabilistic algorithm to find minimum weight codeword, so for a sufficient security level, much larger parameter size [2048, 1608,81]is required. Then the big size of public key make McEliece PKC more inefficient. So in this paper, we will propose New Type PKC using q-ary Hyperelliptic code so that with smaller parameter(1 over 3) but still work factor as hi인 as McEliece PKC and faster encryption, decryption can be maintained.