• Title/Summary/Keyword: communication networks

Search Result 5,470, Processing Time 0.033 seconds

A Searching Algorithm for Shortest Path in RCR Network (RCR 네트워크에서 최단경로를 위한 탐색 알고리즘)

  • Kim, Seong-Yeol
    • The Journal of the Korea institute of electronic communication sciences
    • /
    • v.5 no.5
    • /
    • pp.444-448
    • /
    • 2010
  • RCR network[1] is a topology for interconnection networks having many desirable properties for building scalable parallel machines. This had been analyzed by Hu and Cao[2] to deal with problems of disconnected graph, bisection width and diameter. We analyze some properties of RCR again and revise the condition for connected graph and network diameter. And we present an efficient algorithm for finding next node on a shortest path.

The study of Authorized / Unauthorized Vehicle Recognition System using Image Recognition with Neural Network (신경망 영상인식을 이용한 인가/비인가 차량 인식 시스템 연구)

  • Yoon, Chan-Ho
    • The Journal of the Korea institute of electronic communication sciences
    • /
    • v.15 no.2
    • /
    • pp.299-306
    • /
    • 2020
  • Image recognition using neural networks is widely used in various fields. In this study, we investigated licensed / unlicensed vehicle recognition systems necessary for vehicle number recognition and control when entering and exiting a specific area. This system is equipped with the function of recognizing the image, so it checks all the information on the vehicle number and adds the function to accurately recognize the vehicle number plate. In addition, it is possible to check the vehicle number more quickly using a neural network.

A study on An Optimal Protection System for Power Distribution Networks by Applying Multi-Agent System (Multy-agent system을 애용한 배전계통 최적 보호시스템 연구)

  • Jung, K.H.;Min, B.W.;Lee, S.J.;Choi, M.S.;Kang, S.H.
    • Proceedings of the KIEE Conference
    • /
    • 2003.07a
    • /
    • pp.299-301
    • /
    • 2003
  • In this paper, a protection system using Multi-Agent concept for power distribution network is proposed. Multi agent system consist of Feeder agent, OCR(Over Current Relay) agent, Recloser agent and Switch agent. An agent calculates and corrects its parameter by itself through communication with neighboring agents and its own intelligence algorithm. Simulations in a simple distribution network show the effectiveness of the suggested protection system. Multi-Agent System, protection of distribution network, Communication.

  • PDF

Performance Analysis of Forward Error Correction for Low Data-Rate Wireless Personal Area Networks (저속 무선 개인 영역 네트워크를 위한 FEC의 성능 분석)

  • Kim, Min-Su;Kim, Jong-Tae
    • Proceedings of the KIEE Conference
    • /
    • 2007.10a
    • /
    • pp.387-388
    • /
    • 2007
  • IEEE 802.15.4a의 UWB(ultra-wide band) 방식에서 PHY(physical layer) 시스템에 사용되는 FEC(forward error correction)는 RS(Reed-Solomon) 조직적(systematic) 블록 부호와 1/2의 부호율을 가진 조직적 길쌈 부호의 연접 형태로 이루어져 있다.[1] UWB 신호를 이용한 시스템은 연속적이지 않은 임펄스(impulse) 기반의 신호를 사용하기 때문에 정밀도 면에서 뛰어난 장점을 가진다. 본 논문에서는 IEEE P802.15.4a 표준에 명시되어 있는 FEC를 구현하여 AWG(adaptive white gaussian noise) 채널에서의 SNR(signal to noise ratio)에 따른 BER(bit error rate)을 구함으로써 성능을 분석하였다. 실험에서의 정확한 결과를 얻기 위해 15.4a의 UWB에서의 변조 방식에 따라 신호를 변조한 후 잡음을 삽입하여 결과를 도출하였다.

  • PDF

Progressive Linear Precoder Design for Multiple Codewords MIMO ARQ Systems with ARQ Bundling Feedback

  • Zhang, Zhengyu;Qiu, Ling
    • Journal of Communications and Networks
    • /
    • v.14 no.2
    • /
    • pp.199-205
    • /
    • 2012
  • This work investigates the progressive linear precoder design for packet retransmissions in multi-input multi-output (MIMO) systems with multiple codewords and automatic repeat request (ARQ) bundling feedback. Assuming perfect channel state information, a novel progressive linear ARQ precoder is proposed in the perspective of minimizing the packet error rate. We devise the ARQ precoder by combining power loading and sub channel pairing between current retransmission and previous transmissions. Furthermore, we extend the design to the case that the channel estimation error exists. Numerical results show that the proposed scheme can improve the performance of MIMO ARQ systems significantly regardless of the channel estimation error.

Quasi-Orthogonal Space-Time Block Codes Designs Based on Jacket Transform

  • Song, Wei;Lee, Moon-Ho;Matalgah, Mustafa M.;Guo, Ying
    • Journal of Communications and Networks
    • /
    • v.12 no.3
    • /
    • pp.240-245
    • /
    • 2010
  • Jacket matrices, motivated by the complex Hadamard matrix, have played important roles in signal processing, communications, image compression, cryptography, etc. In this paper, we suggest a novel approach to design a simple class of space-time block codes (STBCs) to reduce its peak-to-average power ratio. The proposed code provides coding gain due to the characteristics of the complex Hadamard matrix, which is a special case of Jacket matrices. Also, it can achieve full rate and full diversity with the simple decoding. Simulations show the good performance of the proposed codes in terms of symbol error rate. For generality, a kind of quasi-orthogonal STBC may be similarly designed with the improved performance.

Performance Optimization of Parallel Algorithms

  • Hudik, Martin;Hodon, Michal
    • Journal of Communications and Networks
    • /
    • v.16 no.4
    • /
    • pp.436-446
    • /
    • 2014
  • The high intensity of research and modeling in fields of mathematics, physics, biology and chemistry requires new computing resources. For the big computational complexity of such tasks computing time is large and costly. The most efficient way to increase efficiency is to adopt parallel principles. Purpose of this paper is to present the issue of parallel computing with emphasis on the analysis of parallel systems, the impact of communication delays on their efficiency and on overall execution time. Paper focuses is on finite algorithms for solving systems of linear equations, namely the matrix manipulation (Gauss elimination method, GEM). Algorithms are designed for architectures with shared memory (open multiprocessing, openMP), distributed-memory (message passing interface, MPI) and for their combination (MPI + openMP). The properties of the algorithms were analytically determined and they were experimentally verified. The conclusions are drawn for theory and practice.

Effects of Channel Aging in Massive MIMO Systems

  • Truong, Kien T.;Heath, Robert W. Jr.
    • Journal of Communications and Networks
    • /
    • v.15 no.4
    • /
    • pp.338-351
    • /
    • 2013
  • Multiple-input multiple-output (MIMO) communication may provide high spectral efficiency through the deployment of a very large number of antenna elements at the base stations. The gains from massive MIMO communication come from the use of multi-user MIMO on the uplink and downlink, but with a large excess of antennas at the base station compared to the number of served users. Initial work on massive MIMO did not fully address several practical issues associated with its deployment. This paper considers the impact of channel aging on the performance of massive MIMO systems. The effects of channel variation are characterized as a function of different system parameters assuming a simple model for the channel time variations at the transmitter. Channel prediction is proposed to overcome channel aging effects. The analytical results on aging show how capacity is lost due to time variation in the channel. Numerical results in a multicell network show that massive MIMO works even with some channel variation and that channel prediction could partially overcome channel aging effects.

A Study on the Queueing with Dynamic Priority in Communication Network (통신망에서의 동적우선도큐잉에 관한 연구)

  • 이재호;송영재
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.12 no.2
    • /
    • pp.92-101
    • /
    • 1987
  • Messages which are entered into communication networks are processed according to the priorities manipulated by serveral queueing disciplines. This study is concerned with one of those disciplines, dynamic priority. We analyzed the everage waiting time for the messages be processed by dynamic priority in queue. The priority is variated by the message's waiting time in queue. The dynamic priority discipline can be classified according as messaged have initial priority or not. Difference of above two discriplines were considered.

  • PDF

Past, Present, and Future of IoT (IoT의 과거, 현재 그리고 미래)

  • Kim, H.;Hwang, S.K.
    • Electronics and Telecommunications Trends
    • /
    • v.33 no.2
    • /
    • pp.1-9
    • /
    • 2018
  • In the past, the Internet connected people together; recently, however it has been extended to the Internet of Things (IoT), allowing all things in the physical world to be connected. We call a new society in which everything is connected through IoT a 'hyper-connected society'. IoT for a hyper-connected society is more than just connecting things to the Internet, it is an infrastructure providing intelligent services without human intervention by connecting things to the Internet using sensors and communication functions, collecting data from connected things, and analyzing and predicting information. Therefore, IoT is a convergence technology that includes not only sensors and communication networks but also big data and AI. This paper examines the short history of IoT, reviews its current trends, and finally, discusses its future direction.