• Title/Summary/Keyword: 병렬 통신

Search Result 1,127, Processing Time 0.023 seconds

Fixed-complexity Sphere Encoder for Multi-user MIMO Systems (다중 사용자 MIMO 시스템을 위한 고정 복잡도를 갖는 스피어 인코더)

  • Mohaisen, Manar;Han, Dong-Keol;Chang, Kyung-Hi
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.35 no.7A
    • /
    • pp.632-638
    • /
    • 2010
  • In this paper, we propose a fixed-complexity sphere encoder (FSE) for multi-user MIMO (MU-MIMO) systems. The Proposed FSE accomplishes a scalable tradeoff between performance and complexity. Also, because it has a parallel tree-search structure, the proposed encoder can be easily pipelined, leading to a tremendous reduction in the precoding latency. The complexity of the proposed encoder is also analyzed, and we propose two techniques that reduce it. Simulation and analytical results demonstrate that in a $4\times4$ MU-MIMO system, the complexity of the proposed FSE is 16% that of the conventional QRD-M encoder (QRDM-E). Also, the encoding throughput of the proposed endoder is 7.5 times that of the QRDM-E with tolerable degradation in the BER performance, while achieving the optimum diversity order.

A Memory-Efficient Two-Stage String Matching Engine Using both Content-Addressable Memory and Bit-split String Matchers for Deep Packet Inspection (CAM과 비트 분리 문자열 매처를 이용한 DPI를 위한 2단의 문자열 매칭 엔진의 개발)

  • Kim, HyunJin;Choi, Kang-Il
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.39B no.7
    • /
    • pp.433-439
    • /
    • 2014
  • This paper proposes an architecture of two-stage string matching engine with content-addressable memory(CAM) and parallel bit-split string matchers for deep packet inspection(DPI). Each long signature is divided into subpatterns with the same length, where subpatterns are mapped onto the CAM in the first stage. The long pattern is matched in the second stage using the sequence of the matching indexes from the CAM. By adopting CAM and bit-split string matchers, the memory requirements can be greatly reduced in the heterogeneous string matching environments.

The study on Reduction of Demand Power in Urban Railway using OLTC (OLTC를 활용한 도시철도 최대전력 감축에 관한 연구)

  • Kim, Han-Soo
    • The Journal of the Korea institute of electronic communication sciences
    • /
    • v.11 no.10
    • /
    • pp.963-968
    • /
    • 2016
  • This paper proposes a new method reducing the maximum demand power of substations at urban railway by using transformer with OLTC(:On Load Tap Changer). Most of the domestic urban railway is rectified by a diode scheme, and supplies the electric vehicles in dc 1500[v]. Because the substations are connected in parallel, if an input voltage of a substation is increased, then the voltage of rectifiers is also increased, and which leads to an increase in the maximum demand of the substation. Simulation results show that increment of maximum demand power can significantly be limited using the method proposed in this paper.

An Efficient Algorithm for finding Optimal Spans to determine R=1/2 Rate Systematic Convolutional Self-Doubly Orthogonal Codes (R=1/2 Self-Doubly 조직 직교 길쌈부호를 찾는 효율적인 최적 스팬 알고리듬)

  • Doniyor, Atabaev;Suh, Hee-Jong
    • The Journal of the Korea institute of electronic communication sciences
    • /
    • v.10 no.11
    • /
    • pp.1239-1244
    • /
    • 2015
  • In this paper, a new method for finding optimal and short span in Convolutional Self-Doubly Orthogonal(CDO) codes are proposed. This new algorithm based on Parallel Implicitly-Exhaustive search, where we applied dynamic search space reduction methods in order to reduce computational time for finding Optimal Span for R=1/2 rate CDO codes. The simulation results shows that speedup and error correction performance of the new algorithm is better.

Noise Removal of Images Using the Median Rule Cellular Automata (미디안 규칙을 갖는 셀룰러 오토마타를 이용한 화상의 잡음제거)

  • 김석태
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2001.05a
    • /
    • pp.638-642
    • /
    • 2001
  • In this paper we propose a noise reduction algorithm which based on cellular automata with the local median rule. It is supposed that there is no information about the features of the image that must be improved. The proposed method behavior is to locally increase or decrease the gray level differences of the image without loss of the main characteristics of the image. The dynamical behavior of these automata is completely determined by Lyapunov operators for sequential and parallel update. We have found that the automata present very fast convergence to fixed points, stability in front of random noisy images. Based on the experimental results we discuss the advantage and efficiency.

  • PDF

Performance improvement of XCP-OFDM system using cross-handed circular polarization in frequency offset environments (주파수 오프셋 환경에서의 역선회 원편파를 이용한 XCP-OFDM 시스템의 성능 개선)

  • 김병옥
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.8 no.1
    • /
    • pp.49-56
    • /
    • 2004
  • An OFDM system using cross-handed circular Polarization(XCP-OFDM) is newly proposed in his paper. The proposed XCP-OFDM system divides the subchannels into a right-handed circular polarization(RHP channel and a left-handed circular polarization(LHCP) channel that alternate each other. Therefore, the overlaps between subcarriers in XCP-OFDM system can be reduced to a great extend compared to the conventional OFDM system. By this reason, it can improve the orthogonality and reduce the inter-channel interference due to frequency offset. In this paper, it can be seen that the proposed XCP-OFDM system shows robust against frequency offset.

Miniaturized Microstrip Dual Band-Stop Filter Using Stepped Impedance Resonators (계단형 임피던스 공진기를 이용한 소형화된 마이크로스트립 이중 대역 저지 필터)

  • Kim, Gi-Rae;Park, Young-Bae
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.15 no.8
    • /
    • pp.1653-1658
    • /
    • 2011
  • A novel circuit structure of dual-band bandstop filters is proposed in this paper. This structure comprises two shunt-connected tri-section stepped impedance resonators with a transmission line in between. Theoretical analysis from the equivalent circuit and design procedures are described. We represented graphs for filter design from the derived synthesis equations by resonance condition of circuits. Notably, advantages of the proposed filter structure are compact size in design, wide range of realizable resonance frequency ratio, and more realizable impedances.

A design of CAVLC(Context-Adaptive Variable Length Coding) for H.264 (H.264 CAVLC(Context-Adaptive Variable Length Coding)설계)

  • Lee, Yong-Ju;Suh, Ki-Bum
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2008.10a
    • /
    • pp.108-111
    • /
    • 2008
  • In this paper, we propose an advanced hardware architecture for the CAVLC entropy encoder engine for real time Full HD video compression. Since there are 384 data coefficients which are sum of 376 AC coefficient and 8 DC coefficient per one macroblock, 384 coefficient have to be processed per one macroblock in worst case for real time processing. We propose an novel architecture which includes parallel architecture and pipeline processing, and reduction "0" in AC/DC coefficient table. To verify the proposed architecture, we develop the reference C for CAVLC and verified the designed circuit with the test vector from reference C code.

  • PDF

An Efficient Hardware Implementation of Whirlpool Hash Function (Whirlpool 해쉬 함수의 효율적인 하드웨어 구현)

  • Park, Jin-Chul;Shin, Kyung-Wook
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2012.10a
    • /
    • pp.263-266
    • /
    • 2012
  • This paper describes an efficient hardware implementation of Whirlpool hash function as ISO/IEC 10118-3 standard. Optimized timing is achieved by using pipelined small LUTs, and Whirlpool block cipher and key schedule have been implemented in parallel for improving throughput. In key schedule, key addition is area-optimized by using inverters and muxes instead of using rom and xor gates. This hardware has been implemented on Virtex5-XC5VSX50T FPGA device. Its maximum operating frequency is about 151MHz, and throughput is about 950Mbps.

  • PDF

A Study on Pyramid of Binary Image Using Mathematical Morphology (수학적 형태학을 이용한 이진 영상의 피라미드에 관한 연구)

  • 엄경배;김준철;이준환
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.18 no.9
    • /
    • pp.1239-1247
    • /
    • 1993
  • Mathematical morphology based on the set theory has been applied to various areas in image processing. In this study, we propose a new pyramid structure for binary images based on the morphological operations. We use a specific class of structuring elements to shrink or expand images, and prove that the whole operations are separable to construct the pyramid. Through a simulation study, we show that the pyramid can be used as a progressive image coding.

  • PDF