• Title/Summary/Keyword: 다단계복호

Search Result 4, Processing Time 0.016 seconds

Serially Concatenated Multilevel Coded Modulation (직렬연접 다중레벨 부호변조)

  • Bae, Sang-Jae;Lee, Sang-Hoon;Joo Eon-Kyeong
    • Journal of the Institute of Electronics Engineers of Korea TC
    • /
    • v.39 no.11
    • /
    • pp.12-20
    • /
    • 2002
  • Serially concatenated multilevel coded modulation (SCMCM) is proposed in this paper. It is a combined scheme of the outer convolutional code and inner multilevel coded modulation (MCM) which is bandwidth-efficient coded modulation. And the performance of three schemes for decoding of the proposed SCMCM is compared and analyzed. As results of simulations, global iterative decoding with inner and outer code should be performed to improve the error performance as the number of iterations is increased. And the scheme which uses both local iterative multistage decoding in MCM and global iterative decoding with inner and outer code, called Scheme 3 in this paper, shows the best error performance among the three schemes considered in this paper. In addition, performance difference between this scheme and the others is increased as the signal to noise ratio (SNR) is increased. Therefore, Scheme 3 is considered to be the proper decoding scheme of SCMCM.

Multilevel Coded Modulation with Serial Concatenated Convolutional Code (직렬연접 길쌈부호를 사용한 다중레벨 부호변조방식)

  • 이상훈;여운동;주언경
    • Journal of the Institute of Electronics Engineers of Korea TC
    • /
    • v.40 no.9
    • /
    • pp.366-372
    • /
    • 2003
  • Multilevel coded modulation (MCM) with serial concatenated convolutional code (SCCC) is proposed and the performance is analyzed in this paper. Both high coding gain and bandwidth efficiency can be obtained if SCCC is adopted as a component code at the first level of MCM. Simulation results show that the performance of MCM with Ambroze's SCCC is saturated like that of MCM with PCCC. But MCM with Benedetto's SCCC shows no performance saturation and better performance than MCM with PCCC or Ambroze's SCCC. Thus MCM with Benedetto's SCCC may be a good choice for high quality system with limited bandwidth.

A hierarchical property-based multi-level approach method for improves user access control in a cloud environment (클라우드 환경에서 사용자 접근제어를 향상시킨 계층적 속성 기반의 다단계 접근 방법)

  • Jeong, Yoon-Su;Kim, Yong-Tae;Park, Gil-Choel
    • Journal of the Korea Convergence Society
    • /
    • v.8 no.11
    • /
    • pp.7-13
    • /
    • 2017
  • In recent years, cloud computing technology has been socially emerged that provides services remotely as various devices are used. However, there are increasing attempts by some users to provide cloud computing services with malicious intent. In this paper, we propose a property - based multi - level hierarchical approach to facilitate authentication access for users accessing servers in cloud environment. The proposed method improves the security efficiency as well as the server efficiency by hierarchically distributing a set of attribute values by replacing the order of the user 's attribute values in the form of bits according to a certain rule. In the performance evaluation, the proposed method shows that the accuracy of authentication according to the number of attributes is higher than that of the existing method by an average of 15.8% or more, and the authentication delay time of the server is decreased by 10.7% on average. As the number of attributes increases, the average overhead change is 8.5% lower than that of the conventional method.

Fine Granular Scalable Coding using Matching Pursuit with Multi-Step Search (다단계 탐색 기반 Matching Pursuit을 이용한 미세 계층적 부호화 기법)

  • 최웅일
    • Journal of Broadcast Engineering
    • /
    • v.6 no.3
    • /
    • pp.225-233
    • /
    • 2001
  • Real-time video communication applications over Internet should be able to support such functionality as scalability because of the unpredictable and varying channel bandwidth between server and client. To accommodatethe wide variety of channel bitrates, a new scalable coding tool, namely the Fine Granular Scalability (FGS) coding tool has been reduce the adopted In the MPEG-4 video standard. This paper presentsa new FGS algorithm with matching Pursuit that can reduce the computational complexity of ordinal matching pursuit-based algorithm. The Proposed coding algorithm can make trade-off between Picture Quality and computationalcomplexity. Our simulation result shows that the proposed algorithm can reduce the computational cumplexity up to 1/5 compared to the conventional FGS method while retaining a similar picture quality.

  • PDF