• Title/Summary/Keyword: compute-and-forward

Search Result 54, Processing Time 0.026 seconds

Interference Alignment in Two-way Relay Channel with Compute-and-Forward

  • Jiang, Xue;Zheng, Baoyu
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.10 no.2
    • /
    • pp.593-607
    • /
    • 2016
  • This paper analyzes interference alignment in the two-way relay network with compute-and-forward in both single relay and multiple relays networks. The advantages of compute-and-forward over other relaying strategies are that it can relay only linear combinations of the useful signals and remove the noise. The algorithm proposed in this paper adopts the criterion of maximum SINR to derive the pre-coding matrix. The experimental results show that the performance of interference alignment in two-way relay channel via compute-and-forward is better than that of amplify-and-forward, and the total sum rate in the two-way multiple relay networks is larger than that in the two-way single relay networks.

Interference Neutralization for Small-Cell Wireless Networks (스몰셀 무선망 간섭 상쇄 기법 연구)

  • Jeon, Sang-Woon;Jung, Bang Chul
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.38A no.12
    • /
    • pp.1117-1124
    • /
    • 2013
  • As the recently soaring wireless traffic, small-cell techniques have been actively studied in order to support such a wireless demand for cellular wireless networks. This paper focuses on the inter-cell interference neutralization to resolve the main barrier for implementing small-cell cellular networks. Assuming that each message is delivered to the final destination by the help of base stations or relays, ergodic interference neutralization is proposed, which exploits the time-varying nature of wireless channels. The previous approach based on amplify-and-forward (AF) suffers from severe performance degradation in the low signal-to-noise (SNR) regime due to noise amplification. On the other hand, the proposed interference neutralization based on recently developed compute-and-forward (CF) fixes such a problem and improves the performance in the low SNR regime.

A review of Chinese named entity recognition

  • Cheng, Jieren;Liu, Jingxin;Xu, Xinbin;Xia, Dongwan;Liu, Le;Sheng, Victor S.
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.15 no.6
    • /
    • pp.2012-2030
    • /
    • 2021
  • Named Entity Recognition (NER) is used to identify entity nouns in the corpus such as Location, Person and Organization, etc. NER is also an important basic of research in various natural language fields. The processing of Chinese NER has some unique difficulties, for example, there is no obvious segmentation boundary between each Chinese character in a Chinese sentence. The Chinese NER task is often combined with Chinese word segmentation, and so on. In response to these problems, we summarize the recognition methods of Chinese NER. In this review, we first introduce the sequence labeling system and evaluation metrics of NER. Then, we divide Chinese NER methods into rule-based methods, statistics-based machine learning methods and deep learning-based methods. Subsequently, we analyze in detail the model framework based on deep learning and the typical Chinese NER methods. Finally, we put forward the current challenges and future research directions of Chinese NER technology.

A Packet security mechanism for Improving QoS in Active Node (Active Node내에서의 QoS향상을 위한 패킷 보안 메커니즘)

  • 최정희;신미예;이동희;이상호
    • Proceedings of the Korean Information Science Society Conference
    • /
    • 2001.10a
    • /
    • pp.619-621
    • /
    • 2001
  • 현재 대부분의 액티브 네트워크에서 액티브 노드로 전송된 패킷은 프로그램 코드와 데이터를 동시에 가지고 있으며, 기존 네트웍 방식에서의 저장(store)-전송(forward) 형태와는 달리 저장(store)-연산(compute)-전송(forward) 방식으로 패킷 처리를 한다 이 과정에서 패킷에 악성 코드가 추가되거나 실제 데이터가 변경되는 경우에는 데이터의 무결성을 보장할 수 없다. 따라서 이 논문에서는 액티브 노드에 들어오는 패킷과 그 노드에서 처리가 이루어진 후 나가는 패킷을 비교하여 악의적이거나 악의 적이지는 않지만 실수로 인한 패킷의 오류를 방어함으로서 액티브 노드의 QoS를 향상시켜주는 방식을 제안한다.

  • PDF

Performance Bounds of an Amplify-and-Forward Relay System with Multiple Rayleigh-faded Co-channel Interferers (레일리 페이딩을 겪는 다중 간섭 채널 환경에서 증폭-후-전달 릴레이 시스템의 성능 한계)

  • Ryu, Hyun-Seok;Kang, Chung-G.
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.37 no.2B
    • /
    • pp.87-96
    • /
    • 2012
  • In this paper, we consider a 2-hop relay system where both the relay and destination nodes suffer from the arbitrary number of co-channel interferers. More specifically, assuming that the relay and access channels as well as interference channels are all subject to Rayleigh fading, we derive an exact closed-form expression for outage probability of the amplify-and-forward (AF) relay system, and furthermore compute its upper and lower bounds. Based on these bounds, we derive the upper and lower bounds on the average bit error rate (BER) of the AF relay system. We also confirm the accuracy of our derivation by investigating the performance gap between the performance bounds under consideration and simulation results.

Serially Correlated Process Monitoring Using Forward and Backward Prediction Errors from Linear Prediction Lattice Filter

  • Choi, Sungwoon;Lee, Sanghoon
    • Journal of Korean Society for Quality Management
    • /
    • v.26 no.4
    • /
    • pp.143-150
    • /
    • 1998
  • We propose an adaptive monitoring a, pp.oach for serially correlated data. This algorithm uses the adaptive linear prediction lattice filter (ALPLF) which makes it compute process parameters in real time and recursively update their estimates. It involves computation of the forward and backward prediction errors. CUSUM control charts are a, pp.ied to prediction errors simulaneously in both directions as an omnibus method for detecting changes in process parameters. Results of computer simulations demonstrate that the proposed adaptive monitoring a, pp.oach has great potentials for real-time industrial a, pp.ications, which vary frequently in their control environment.

  • PDF

Performance Analysis of Physical Layer Security based on Decode-and-Forward using Jammer (재머를 사용하는 복호 후 재전송 기반 물리 계층 보안의 성능 분석)

  • Park, Sol;Kong, Hyung-Yun
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.18 no.3
    • /
    • pp.71-75
    • /
    • 2018
  • In this paper, we study the secrecy outage probability when using jammer in a relay system based on decode-and-forward. The jammer may be selected among the relays not selected to increase the security capacity in the physical layer so as to generate intentional noise. Jammer noise can equally interfere with the receiver and eavesdropper but can enhance the physical layer security by selecting an optimal jammer that makes the channel quality between the sender-eavesdropper links worse than the channel of the sender-receiver link. In this paper, we compute the theoretical formula of the secrecy outage probability with and without jammers, and compare the theoretical value with the simulation value to prove that the equation is valid.

Performance Analysis of Hybrid Decode-and-Forward Schemes for 2-hop Wireless Network (2-홉 무선 네트워크를 위한 하이브리드 복호 후 전달 기법의 성능 분석)

  • Kong, Hyung-Yun
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.34 no.12A
    • /
    • pp.949-961
    • /
    • 2009
  • This paper analyses BER (Bit Error Rate) performance of 2-hop wireless communications networks with hybrid decode-and-forward (HDF) relays. The conventional HDF method is usually based on the receive signal-to-noise ratio (SNR) for the relay to decide whether to forward the decoded data in order to obviate the erroneous detection at the relay. In contrast, we propose a new solution of using log-likelihood ratio (LLR) as an efficient alternative to SNR. The approximate BER expressions of different HDF schemes are also derived and verified by Monte-Carlo simulations. In addition, we compute the optimum thresholds for HDF schemes. A variety of numerical results demonstrate that the new LLR-based HDF significantly outperforms the SNR-based HDF for any threshold level and relay location under flat Rayleigh fading channel plus AWGN (Additive White Gaussian Noise).

Aerodynamic Design of Helicopter Rotor Airfoil in Forward Flight Using Response Surface Method (반응표면법을 이용한 전진비행하는 헬리콥터 로터 에어포일의 공력설계)

  • Sun, Hyo-Sung;Lee, Soo-Gab
    • Journal of the Korean Society for Aeronautical & Space Sciences
    • /
    • v.32 no.7
    • /
    • pp.13-18
    • /
    • 2004
  • This paper describes an efficient and robust optimization method for helicopter rotor airfoil design in forward flight. Navier-Stokes analysis was employed to compute the dynamic response of an airfoil, which simulates the unsteady rotor flow-field in forward flight. The optimization system consists of two categories; Response Surface Method to construct the response surface model based on D-optimal 3-level factorial design, and Genetic Algorithm to obtain the optimum solution of a defined objective function including penalty terms of constraints. The influence of design variables and their interactions on the aerodynamic performance was examined through the optimization process.

Outage Analysis and Optimal Power allocation for Network-coding-based Hybrid AF and DF (네트워크 코딩 기반의 협력통신에서 Hybrid AF and DF 방식의 아웃티지 성능 분석 및 최적 파워 할당 기법)

  • Bek, Joo-Ha;Lee, Dong-Hoon;Lee, Jae-Young;Heo, Jun
    • Journal of Broadcast Engineering
    • /
    • v.17 no.1
    • /
    • pp.95-107
    • /
    • 2012
  • Network coding was proposed to increase the achievable throughput of multicast in a network. Recently, combining network coding into user cooperation has attracted research attention. For cooperative transmission schemes with network coding, users combine their own and their partners messages by network coding. In previous works, it was shown that adaptive DF with network coding can achieve diversity gain and additional throughput gain. In this paper, to improve performance of conventional protocols and maximize advantage of using network coding, we propose a new network coding based user cooperation scheme which uses adaptively amplify-and-forward and decode-and-forward according to interuser channel status. We derive outage probability bound of proposed scheme and prove that it has full diversity order in the high SNR regime. Moreover, based on the outage bound, we compute optimal power allocation for the proposed scheme.