• Title/Summary/Keyword: 병렬 통신

Search Result 1,128, Processing Time 0.026 seconds

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

Object-oriented real-time system modeling considering predicatable timing constraints (시간 제약 분석이 가능한 객체 지향 실시간 시스템 모델링)

  • 김영란;권영희;홍성백;박용문;구연설
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.21 no.8
    • /
    • pp.1937-1947
    • /
    • 1996
  • In the case of developing the real-time system using object-oriented method, k the problem of the timing constraints is certainly considered. we propose the method of modeling the object-oriented real-time system using the OMT methodology and the SDL. And we also present the predictable time table that reflects the constraints of real-time system into dynamic model of OMTs and the predicatable time formula of the sequence, repeat, and parallel routine. The proposed method is applied to the estimate of the maximum process time of the ATMs(Automatic teller machines) and is used to specifying the functional specification for the user interface of the ATMs using the SDL syntax and the object interaction graph.

  • PDF

A Study on the Synchronization Techniques for 5GHz High-speed WLANs (5GHz대역 고속 무선 LAN 시스템을 위한 동기화 기법 연구)

  • 김인겸
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.28 no.6C
    • /
    • pp.594-601
    • /
    • 2003
  • High-speed WLAN(Wireless Local Area Network) systems operating in 5GHz band use OFDM transmission technique. OFDM technique transmits data in parallel and has many advantage compared with the serial transmission system-for example, robustness to time variance of channel. OFDM technique use the orthogonal multicarriers. The ICI(InterChannel Interference) caused by the orthogonality destruction between subcarriers. hamper the BER performance. In this paper, we propose the synchronization techniques for high-speed WLAN system designed to support user data rates up to 54Mbps at 5GHz. The proposed synchronization techniques are the reduced complexity structure having the similar performance compared with the conventional synchronization techniques.

Analysis of Large-Scale Network using a new Network Tearing Method (새로운 분할법에 의한 회로망해석)

  • 김준현;송현선
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.12 no.3
    • /
    • pp.267-275
    • /
    • 1987
  • This paper concerns a study on the theory of tearing which analyzes a large scale network by partitioning it into a number of small subnetworks by cutting through some of the existing nodes and branches in the network. By considering of the relationship its voltage and current of node cutting before and after, the consititutive equations of tearing method is equvalent to renumbering the nodes of untorn network equations. Therefore the analysis of network is conveniently applied as same algorithm that is used in untorn network. Also the proposed nodal admittnace matrix is put in block diagonal form, therefore this method permit parallel processing analysis of subnetworks. 30 nodes network was tested and the effectiveness of the proposed algorithm was proved.

  • PDF

A Rake receiver for CCK wireless LAN modem based on Channel Matched Filter (CCK 무선랜 모뎀을 위한 Channel Matched Filter 기반의 RAKE 수신기)

  • Lee Yusung;Park Hyuncheol
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.30 no.5C
    • /
    • pp.329-337
    • /
    • 2005
  • In this paper, we propose a new type of RAKE receiver for complementary code keying (CCK) codes, which is suitable for the multipath channel with large delay spread. Our proposed system is based on channel matched filter (CMF) with decision feedback equalizer (DFE) and contains codeword DFE structure. In our system, inter chip interference (ICI) and inter symbol interference (ISI) generated due to multipath environments are calculated by using detected CCK codeword. Also it uses the error correcting capability of CCK codes, and it can remove ISI and ICI at the same time.

A Path Restoration Method Independent of Failure Location in All-Optical Networks (전광 통신망에서 장애 위치에 독립적인 경로 복구 방법)

  • 이명문;유진태;김용범;박진우
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.26 no.11C
    • /
    • pp.85-93
    • /
    • 2001
  • In this paper, a path restoration method independent of failure location in all-optical networks is proposed and its wavelength requirements are calculated. In the proposed method, since a single backup wavelength is used for any link failure, a node can consist of only fixed wavelength transmitters, resulting in the levels node cost. Hence, restoration process can be triggered just after the failure detection, if combined with edge-disjoint path restoration method. This feature and the parallel cross-connection message transfer technique proposed in this paper make the restoration process faster. Also, it is shown the wavelength requirements in the proposed method are similar to the ones in the method using tunable backup wavelength, resulting in little increment for transmission cost.

  • PDF

An Improvement on Multicode CDMA Systems Using a Convolutional Code and a Bi-Orthogonal Code (길쌈 부호와 이원 직교 부호에 의한 다중부호 부호분할 다원접속 시스템의 개선)

  • 김기범;신요안
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.23 no.7
    • /
    • pp.1659-1666
    • /
    • 1998
  • The multicode CDMA systems that are widely studied as an effective transmission methodology in the IMT-2000 systems, employ orthogonal codes to transform high rate data into parallel, low rate data for simultaneous transmission. In this paper, we propose a new multicode CDMA system which achieves the same data rate and processing gain of the conventional systems, while significantly improves bit error rate performance by exploiting a convolutional code with code rate r=1/2 and a bi-orthogonal code. The simulation results for synchronous systems using maximal ratio combining Rake receivers under additive white Gaussian noise and multi-path fading channels, show significant improviements by the proposed system.

  • PDF

M/B-MC/CDMA performance analysis for high speed data transmission in IS-95 evolution (IS-95 진화방안에서 고속 데이터 전송을 위한 M/B-MC/CDMA 전송방식의 성능분석)

  • 임명섭
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.24 no.10A
    • /
    • pp.1494-1500
    • /
    • 1999
  • In order to provide high speed multimedia data rate service, Multi-Code CDMA has been proposed which converts high speed serial data stream into N parallel low speed data streams with orthogonal PN codes for spreading. However this signal has multi level and causes interferences to be increased at the neighboring cell boundary in the reverse link. Therefore in order to solve the above mentioned problem, M/B-MC/CDMA, in which multi level signal is converted to binary level signal using M/B conversion, is proposed and the performance is compared with MC-CDMA.

  • PDF

An Algorithm for Computing the Weight Enumerating Function of Concatenated Convolutional Codes (연쇄 컨볼루션 부호의 가중치 열거함수 계산 알고리듬)

  • 강성진;권성락;이영조;강창언
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.24 no.7A
    • /
    • pp.1080-1089
    • /
    • 1999
  • The union upper bounds to the bit error probability of maximum likelihood(ML) soft-decoding of parallel concatenated convolutional codes(PCCC) and serially concatenated convolutional codes(SCCC) can be evaluated through the weight enumerating function(WEF). This union upper bounds become the lower bounds of the BER achievable when iterative decoding is used. In this paper, to compute the WEF, an efficient error event search algorithm which is a combination of stack algorithm and bidirectional search algorithm is proposed. By computor simulation, it is shown that the union boounds obtained by using the proposed algorithm become the lower bounds to BER of concatenated convolutional codes with iterative decoding.

  • PDF

An Analytical Evaluation of 2D Mesh-connected SIMD Architecture for Parallel Matrix Multiplication (2D Mesh SIMD 구조에서의 병렬 행렬 곱셈의 수치적 성능 분석)

  • Kim, Cheong-Ghil
    • Journal of The Institute of Information and Telecommunication Facilities Engineering
    • /
    • v.10 no.1
    • /
    • pp.7-13
    • /
    • 2011
  • Matrix multiplication is a fundamental operation of linear algebra and arises in many areas of science and engineering. This paper introduces an efficient parallel matrix multiplication scheme on N ${\times}$ N mesh-connected SIMD array processor, called multiple hierarchical SIMD architecture (HMSA). The architectural characteristic of HMSA is the hierarchically structured control units which consist of a global control unit, N local control units configured diagonally, and $N^2$ processing elements (PEs) arranged in an N ${\times}$ N array. PEs are communicating through local buses connecting four adjacent neighbor PEs in mesh-torus networks and global buses running across the rows and columns called horizontal buses and vertical buses, respectively. This architecture enables HMSA to have the features of diagonally indexed concurrent broadcast and the accessibility to either rows (row control mode) or columns (column control mode) of 2D array PEs alternately. An algorithmic mapping method is used for performance evaluation by mapping matrix multiplication on the proposed architecture. The asymptotic time complexities of them are evaluated and the result shows that paralle matrix multiplication on HMSA can provide significant performance improvement.

  • PDF