• Title/Summary/Keyword: 복호-후-전달

Search Result 29, Processing Time 0.025 seconds

Outage Probability Analysis of Full Duplex Relay with Decode and Forward Protocol (복호 후 전달 방식을 사용하는 전이중 통신 릴레이 시스템에서의 오수신 확률 성능 분석)

  • Kwon, Tae-Hoon;Lim, Sung-Mook;Park, Sung-Soo;Hong, Dae-Sik
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.35 no.6A
    • /
    • pp.568-576
    • /
    • 2010
  • In this paper, we analyze the outage probability of full duplex relay (FDR) with decode-and-forward (DF) protocol is derived under fading channels. The fading channel for source-relay link is assumed to be Rician fading to consider the infrastructured fixed relay with line of sight (LOS) propagation, and the other fading channels are assumed to be Rayleigh fading. Based on this analytical result, we provide the criterion that FDR shows a lower outage probability than HDR to consider the interference problem and the resource efficiency improvement by full duplex (FD) operation. The accuracy of the analysis is confirmed throughout the simulation results.

LLR Based Generalization of Soft Decision Iterative Decoding Algorithms for Block Turbo Codes (LLR 기반 블록 터보 부호의 연판정 복호 알고리즘 일반화)

  • Im, Hyun-Ho;Kwon, Kyung-Hoon;Heo, Jun
    • Journal of Broadcast Engineering
    • /
    • v.16 no.6
    • /
    • pp.1026-1035
    • /
    • 2011
  • This paper presents generalization and application for the conventional SISO decoding algorithm of Block Turbo Codes. R. M. Pyndiah suggested an iterative SISO decoding algorithm for Product Codes, two-dimensionally combined linear block codes, on AWGN channel. It wascalled Block Turbo Codes. Based on decision of Chase algorithm which is SIHO decoding method, SISO decoder for BTC computes soft decision information and transfers the information to next decoder for iterative decoding. Block Turbo Codes show Shannon limit approaching performance with a little iteration at high code rate on AWGN channel. In this paper we generalize the conventional decoding algorithm of Block Turbo Codes, under BPSK modulation and AWGN channel transmission assumption, to the LLR value based algorithm and suggest an application example such as concatenated structure of LDPC codes and Block Turbo Codes.

A Novel Cooperative Communication to Achieve Secondary Spectrum Access Using Adaptive Incremental Decode-and-Forward(AIDF) Protocol (적응 증분 복호 후 전달 프로토콜을 이용하여 2차 스펙트럼 접근이 가능한 협력 통신 기법)

  • Kim, Lyum;Kong, Hyung-Yun
    • The Journal of Korean Institute of Electromagnetic Engineering and Science
    • /
    • v.22 no.3
    • /
    • pp.354-361
    • /
    • 2011
  • In this paper, we propose a spectrum sharing system that enable secondary user's spectrum access in cooperative communication scheme. At phase 1, a transmitter in primary system broadcasts signals to the rest nodes. And then, at phase 2, a transmitter in secondary system combines the decoded signals after received from a transmitter in primary system and its own signal. And then transmitter of secondary system broadcasts the combined signals to receivers of primary and secondary systems. At this time, due to the process of combining signals, receivers of primary and secondary systems experiences a performance degradation. Therefore, we propose a novel adaptive incremental decode-andforward(AIDF) protocol to overcome this problem. By using AIDF protocol, we show performance improvement of total system through various simulations.

Performance Analysis of Adaptive Cooperation Scheme with Decode-and-Forward (적응형 복호 후 전달 협력 통신의 성능 분석)

  • Vu, Ha Nguyen;Kong, Hyung-Yun
    • Journal of the Institute of Electronics Engineers of Korea TC
    • /
    • v.46 no.12
    • /
    • pp.82-88
    • /
    • 2009
  • An adaptive cooperation system is considered with the cooperation decision strategy based on the differences between instantaneous signal-to-noise ratio (SNR) S-D and R-D channels. Specifically, if the quality of the direct link (S-D) is better than that of the link from the relay to the destination (R-D), the source will transmit to destination directly with all scheme's transmitted power. Otherwise, the source broadcasts the signal with a lower power in the first time slot. Then, in the second time slot, if the relay decodes its received signal correctly, it re-transmits the re-encoded signal to the destination else the source will transmit again with the remaining power. Firstly, the spectral efficiency is derived by calculating the probabilities of direct transmission and cooperation mode. Subsequently, the BER performance for the adaptive cooperation schemes is analyzed by considering the BER routine of each mode. Finally, the Monte-Carlo simulation results are presented to confirm the performance enhancement offered by the proposed schemes.

Design of DRM Toolkit to Protect ASF Files (ASF 파일 보호를 위한 DRM 툴킷 설계)

  • Park, Ji-Hyun;Kim, Jung-Hyun;Yoon, Ki-Song
    • Annual Conference of KIPS
    • /
    • 2004.05a
    • /
    • pp.1241-1244
    • /
    • 2004
  • 디지털 정보의 생성과 배포의 용이성은 디지털화된 동영상의 제작을 증가시키고 있다. 그러나 디지털 콘텐츠는 복제가 쉽고 누구나 접근이 가능한 인터넷을 통해 전달될 수 있으므로 저작권 침해가 중요한 문제로 대두되고 있다. 이러한 문제점은 특히 사용자의 PC에 저장되어 재생되는 동영상에 주로 발생하였으며, 종래에는 사용자의 PC에 저장된 동영상 파일의 보호를 위해 동영상 파일의 전체를 암호화한 후 적법한 사용자에게만 암호화된 동영상 파일을 복호화 할 수 있는 정보를 제공하는 방법을 사용하였다. 사용자의 PC에 저장되어 재생되는 동영상에 비하여 스트리밍 서비스를 통하여 재생되는 동영상은 사용자의 PC에 저장되지 않도록 함으로써 불법 복제등의 문제를 해결하였다. 하지만 근래 스트리밍을 통하여 서비스되는 동영상을 저장할 수 있는 프로그램이 속속 등장하면서 스트리밍을 통하여 서비스되는 동영상에 대한 보호 방안도 필요하게 되었다. 본 논문에서는 스트리밍 컨텐츠로 가장 널리 사용되고 있는 마이크로소프트의 멀티미디어 파일 포맷인 ASF를 기반으로한 스트리밍 시스템에 DRM을 적용하는 방안에 대하여 설명한다.

  • PDF

Adaptive Combination of Intra/Inter Predictions in JM KTA Software (JM KTA 소프트웨어에서 인트라 및 인터 예측블록이 혼합된 코딩 방법)

  • Kim, Min-Jae;Seo, Chan-Won;Jang, Myung-Hun;Han, Jong-Ki
    • Journal of Broadcast Engineering
    • /
    • v.16 no.2
    • /
    • pp.190-206
    • /
    • 2011
  • We propose an adaptive combination scheme of intra and inter prediction modes, where uni-directional intra prediction, bi-directional intra prediction, and inter prediction method are adaptively selected in an EMB (extended macro block). For each EMB, after all inter blocks have been encoded and decoded, the reconstructed blocks are used as reference data for bi-directional intra prediction of other blocks. Whereas conventional intra coding scheme does not use the right and below side pixels of the current block as reference data, the proposed method uses those for bi-directional intra prediction mode. In this paper, we propose three advanced techniques; (a) filter design for bi-directional prediction, (b) adaptive coding order scheme which increases the chance to use the bi-directional intra prediction mode, (c) modification of syntax to represent coding order. The information for the coding order is informed to the decoder by using the modified syntax structure without adding any additional flag. The simulation results show that the proposed scheme reduces the BD-Rate by 0.5%, on average, compared to KTA.

ATM Cell Encipherment Method using Rijndael Algorithm in Physical Layer (Rijndael 알고리즘을 이용한 물리 계층 ATM 셀 보안 기법)

  • Im Sung-Yeal;Chung Ki-Dong
    • The KIPS Transactions:PartC
    • /
    • v.13C no.1 s.104
    • /
    • pp.83-94
    • /
    • 2006
  • This paper describes ATM cell encipherment method using Rijndael Algorithm adopted as an AES(Advanced Encryption Standard) by NIST in 2001. ISO 9160 describes the requirement of physical layer data processing in encryption/decryption. For the description of ATM cell encipherment method, we implemented ATM data encipherment equipment which satisfies the requirements of ISO 9160, and verified the encipherment/decipherment processing at ATM STM-1 rate(155.52Mbps). The DES algorithm can process data in the block size of 64 bits and its key length is 64 bits, but the Rijndael algorithm can process data in the block size of 128 bits and the key length of 128, 192, or 256 bits selectively. So it is more flexible in high bit rate data processing and stronger in encription strength than DES. For tile real time encryption of high bit rate data stream. Rijndael algorithm was implemented in FPGA in this experiment. The boundary of serial UNI cell was detected by the CRC method, and in the case of user data cell the payload of 48 octets (384 bits) is converted in parallel and transferred to 3 Rijndael encipherment module in the block size of 128 bits individually. After completion of encryption, the header stored in buffer is attached to the enciphered payload and retransmitted in the format of cell. At the receiving end, the boundary of ceil is detected by the CRC method and the payload type is decided. n the payload type is the user data cell, the payload of the cell is transferred to the 3-Rijndael decryption module in the block sire of 128 bits for decryption of data. And in the case of maintenance cell, the payload is extracted without decryption processing.

Design of Multicast Group Key Management Protocol for Information Security in PIM_SM (PIM-SM 정보 보안을 위한 멀티캐스트 그룹 키 관리 프로토콜 설계)

  • 홍종준
    • Journal of Internet Computing and Services
    • /
    • v.3 no.5
    • /
    • pp.87-94
    • /
    • 2002
  • This paper proposes a group key management protocol for a secure of all the multcast user in PIM-SM multicast group communication. Each subgroup manager gives a secure key to it's own transmitter and the transmitter compress the data with it's own secure key from the subgroup manager, Before the transmitter send the data to receiver, the transmitter prepares to encrypt a user's service by sending a encryption key to the receiver though the secure channel. after checking the user's validity through the secure channel, As the transmitter sending a data after then, the architecture is designed that the receiver will decode the received data with the transmitter's group key, Therefore, transmission time is shortened because there is no need to data translation by the group key on data sending and the data transmition is possible without new key distribution at path change to shortest path of the router characteristic.

  • PDF

Institutionalization for the Real Estate Electronic Commerce System and Security System of Real Estate Contents (부동산전자상거래시스템 제도화 방안과 부동산컨텐츠 보안에 관한 연구)

  • Kim, Dong-Hyun;Kang, Byung-Gi
    • The Journal of the Korea institute of electronic communication sciences
    • /
    • v.3 no.2
    • /
    • pp.118-128
    • /
    • 2008
  • Currently analyzed the various real estate electronic transaction relation service present condition which is enforced from the government offices. And applied a real estate electronic transaction and enforces and the representative instance which selected analyzed. Analysis leads, groped the constituent unit by construction plan of real estate electronic transaction system of governmental leading and unit system construction investigated a priority. And delivered Real Estate Contents Information in DRM Serever for authentication, decoding, and license downloading for cases of charged contents. This can retain the merits of P2P technology to its full extent while solving the biggest issue addressed: copyright problems.

  • PDF

Design and Implementation of Dynamic Multicast Group Key Management Protocol for Multicast Information Security (멀티캐스트 정보 보안을 위한 동적 그룹 키 관리 프로토콜 설계 및 구현)

  • 홍종준;김태우
    • Convergence Security Journal
    • /
    • v.2 no.2
    • /
    • pp.19-27
    • /
    • 2002
  • This paper proposes a group key management protocol for a secure of all the multicast user in PIM-SM multicast group communication. Each subgroup manager gives a secure key to it's own transmitter and the transmitter compress the data with it's own secure key from the subgroup manager. Before the transmitter send the data to receiver, the transmitter prepares to encrypt a user's service by sending a encryption key to the receiver though the secure channel, after checking the user's validity through the secure channel. As the transmitter sending a data after then, the architecture is designed that the receiver will decode the received data with the transmitter's group key. Therefore, transmission time is shortened because there is no need to data translation by the group key on data sending and the data transmition is possible without new key distribution at path change to shortest path of the router characteristic.

  • PDF