• Title/Summary/Keyword: code complexity

Search Result 590, Processing Time 0.027 seconds

Low Computational Algorithm for Estimating LLR in MIMO Channel (MIMO 채널에서 LLR 추정을 위한 저 계산량 알고리즘)

  • Park, Tae-Doo;Kim, Min-Hyuk;Kim, Chul-Sung;Jung, Ji-Won
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.14 no.12
    • /
    • pp.2791-2797
    • /
    • 2010
  • In recent years, the goal of providing high speed wireless data services has generated a great amount of interest among the research community. Several researchers have shown that the capacity of the system, in the presence of flat Rayleigh fading, improves significantly with the use of combined MIMO and LDPC. To feed the soft values to LDPC decoder, the soft values must be calculated from multiple transmitter and receiver antennas in Rayleigh fading channel. It requires high computational complexity to get the soft symbols by increasing number of transmitter and receiver antennas. Therefore, this thesis proposed on effective algorithm for calculation of soft values from multiple antennas based on LLR. As result, This thesis shows that maximum 61% of computational complexity is reduced with a little loss of performance.

A Study on the Efficient LT Decoding Scheme using GE Triangularization (GE 삼각화를 이용한 효율적인 LT 복호 기법 연구)

  • Cheong, Ho-Young
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.11 no.6
    • /
    • pp.57-62
    • /
    • 2011
  • In this paper an efficient LT decoding scheme using GE triangularization is proposed. The proposed algorithm has the desirable performance in terms of both overhead and computational complexity. Belief propagation algorithm is a fast and simple decoding scheme for LT codes. However, for a small code block length k, it requires a large overhead to decode, and OFG which has a small overhead has a large computational complexity. Simulation results show that the proposed algorithm noticeably reduces the computational complexity by more than 1/5 with respect to that of OFG and also its overhead has a small value about 1~5%.

Low Computational Algorithm of Soft-Decision Extended BCH Decoding Algorithm for Next Generation DVB-RCS Systems (차세대 DVB-RCS 시스템을 위한 저 계산량 연판정 e-BCH 복호 알고리즘)

  • Park, Tae-Doo;Kim, Min-Hyuk;Lim, Byeong-Su;Jung, Ji-Won
    • The Journal of Korean Institute of Electromagnetic Engineering and Science
    • /
    • v.22 no.7
    • /
    • pp.705-710
    • /
    • 2011
  • In this paper, we proposed the low computational complexity soft-decision e-BCH decoding algorithm based on the Chase algorithm. In order to make the test patterns, it is necessary to re-order the least reliable received symbols. In the process of ordering and finding optimal decoding symbols, high computational complexity is required. Therefore, this paper proposes the method of low computational complexity algorithm for soft-decision e-BCH decoding process.

A New Family of Nonbinary Sequences Having large Complexity For CDMA (코드분할 다중통신용 새로운 다진법 코드의 개발)

  • Chulki Kim;Dongchan Shin;Sooryong Lee
    • Proceedings of the Korea Institutes of Information Security and Cryptology Conference
    • /
    • 1991.11a
    • /
    • pp.134-143
    • /
    • 1991
  • 코드분할 다중통신(Code Division Multiple Access Communication)은 Spread Spectrum 통신의 발전된 형태로서 군사목적상 이동 무선통신(Combat Multiple Communication)을 위해서 최근들어 급속도로 중요시 되고있다. 잘 알려진 바와 같이 두 가지 가장 일반적인 다중통신 방식은 주파수 분할 다중통신방식과 시분할 다중 통신 방식이다. 주파수 분할 다중통신 방식에서는 모든 사용자가 각각 다른 주파수를 사용하여 동시에 신호를 보내고 시분할 다중통신에서는 같은 주파수를 사용하되 시간대를 달리하고 있다. 이 두가지 방식을 결합하여 모든 사용자가 같은 시각과 같은 주파수를 공유하여 통신을 가능케 할 수 있는 방식이 코드분할 다중통신이다. 여기에서 사용자는 각각 고유한 코드를 부여받는다. 이때 각 코드간에는 낮은 상관계수(Cross-correlation )를 가져야 하며, 이러한 성질을 만족하는 코드 집합을 구하기 위한 노력이 경주되었으며 현재까지 2진법 코드 집합으로서 Gold, Kasami, No 코드가 알려져 있으며, 복잡성(Complexity)을 증가시키기 위한 노력으로서 (군사목적에 중요) 다진법 코드에 대한 연구가 활발해지고 있으나 공개된 것은 없었다. 최근에 (1990), 다진법 코드로서 Kumar 코드가 발표되었다. 그러나 이러한 코드들은 복잡성(Complexity or Linear Span)을 증가시키지는 못하였다. 본 논문은 복잡성(Complexity)이 증가한 새로운 다진법 코드의 집합을 제안하였다. 각 집합은 $P^{n}$ 개의 코드로 구성되며, 최대 상관계수 값은 $f^{m}$ (p-1)-1 이다. (n=2m)

  • PDF

Complexity Reduction of Block-Layered QOSTC with Less Transmission Time (복잡도 감소와 전송시간이 덜 소요되는 블록 층의 준 직교 시공간코드 설계)

  • Abu Hanif, Mohammad;Lee, Moon-Ho;Hai, Han
    • Journal of the Institute of Electronics Engineers of Korea TC
    • /
    • v.49 no.7
    • /
    • pp.48-55
    • /
    • 2012
  • Because of increasing complexity in maximum-likelihood (ML) decoding of four of higher antenna scenario, Partial Interference Cancellation (PIC) group decoding could be the perfect solution to reduce the decoding complexity occurs in ML decoding. In this paper, we separate the symbols the users in the layered basis and find the equivalent channel matrix. Based on the equivalent channel matrix we provide the grouping scheme. In our paper, we construct a block wise transmission technique which will achieve the desired code rate and reduce the complexity and provide less transmission time. Finally we show the different grouping performance.

Harmonic-Mean-Based Dual-Antenna Selection with Distributed Concatenated Alamouti Codes in Two-Way Relaying Networks

  • Li, Guo;Gong, Feng-Kui;Chen, Xiang
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.13 no.4
    • /
    • pp.1961-1974
    • /
    • 2019
  • In this letter, a harmonic-mean-based dual-antenna selection scheme at relay node is proposed in two-way relaying networks (TWRNs). With well-designed distributed orthogonal concatenated Alamouti space-time block code (STBC), a dual-antenna selection problem based on the instantaneous achievable sum-rate criterion is formulated. We propose a low-complexity selection algorithm based on the harmonic-mean criterion with linearly complexity $O(N_R)$ rather than the directly exhaustive search with complexity $O(N^2_R)$. From the analysis of network outage performance, we show that the asymptotic diversity gain function of the proposed scheme achieves as $1/{\rho}{^{N_R-1}}$, which demonstrates one degree loss of diversity order compared with the full diversity. This slight performance gap is mainly caused by sacrificing some dual-antenna selection freedom to reduce the algorithm complexity. In addition, our proposed scheme can obtain an extra coding gain because of the combination of the well-designed orthogonal concatenated Alamouti STBC and the corresponding dual-antenna selection algorithm. Compared with the common-used selection algorithms in the state of the art, the proposed scheme can achieve the best performance, which is validated by numerical simulations.

Consideration of Performance in Synchronization of Frequency Hopping / Code Division Multiple Access System (FH/CDMA를 위한 동기화 기술의 성능 고찰)

  • 이승대;방성일;진년강
    • The Proceeding of the Korean Institute of Electromagnetic Engineering and Science
    • /
    • v.5 no.4
    • /
    • pp.18-29
    • /
    • 1994
  • In this paper, the performance of stepped serial search scheme and matched filter scheme for code acqusition in FH / CDMA are evaluated under land mobile radio communication channel environments. And delay lock loop scheme is used as code tracking system. As the results for code acquisition system, it is shown that the performance of stepped searial scheme is superior to matched filter scheme, because system complexity is reduced and system performance is improved by increasing the hopping frequency not to substitute for special hardware. Also, it is shown that its performance is improved under Rayleigh/ Rician fading environments. As the results for code tracking system, it is found that mean hold time is increased due to the increase of the number of lock state and hopping frequency, M.

  • PDF

Optimized Channel Coding of Control Channels for Mobile Packet Communication

  • Song, Young-Joon
    • Journal of electromagnetic engineering and science
    • /
    • v.3 no.1
    • /
    • pp.50-56
    • /
    • 2003
  • This paper proposes a coding scheme of control channel for mobile packet communication to maximize the minimum Hamming distance, which is based on shifting of basis vectors of Reed Muller code with optimized dynamic puncturing and/or(partial) sequence repetition. Since the maximum likelihood decoding can be performed using the extremely simple FHT(Fast Hadamard Transformation), it is suitable for real time optimum decoding of control channel information with very little complexity. We show applications of the proposed coding method to TFCI(Transport Format Combination Indicator) code in split and normal modes of 3GPP W-CDMA system. We also discuss how this method can reduce rate indication error over AWGN(Additive White Gaussian Noise) as well as fading channels when the proposed coding scheme is applied to 1xEV-DV system of $3^{rd}$TEX> generation partnership project 2(3GPP2) to indicate the data rate transmitted on the reverse traffic channel by a Mobile Station(MS).

Analysis on Software Static Testing Results of Railway Signaling System (열차제어시스템 소프트웨어 정적 테스팅 적용시험 결과 분석)

  • Hwang, Jong-Gyu;Jo, Hyun-Jeong;Jeong, Rak-Gyo
    • The Transactions of the Korean Institute of Electrical Engineers P
    • /
    • v.62 no.1
    • /
    • pp.30-35
    • /
    • 2013
  • Many function of railway signalling system which is in charge of most core function in a railway system are being operated by the software according to the development of computer technology. Accordingly, the source code testing to verify the safety of the railway signalling system software becomes to be more important, and related international standards highly recommend verifications on the source code also. For this reason, several related studies on vital source code verification were executed from several years ago in Korea. This paper performed tests through the application to railway signalling system being applied to the existing actual domestic railway sites through automated testing tools for coding rules of signalling system software and another signaling system software under development in Korea recently, and analyzed their results.

A Study on Code Channels Division for Multi-code CDMA (다중코드 CDMA를 위한 코드채널 분리에 관한 연구)

  • 김종엽;이선근;김환용
    • Proceedings of the IEEK Conference
    • /
    • 1999.06a
    • /
    • pp.134-137
    • /
    • 1999
  • The MC-CDMA(Multi-Code CDMA) systems for handling various data transmission rate which is demanded in the IMT-2000 systems are effective transmission technology, which can provide the higher data service than the conventional IS-95 CDMA systems because a user takes advantage of a number of channels. The receiver of MC-CDMA systems to be provided these data service have to be structured of demodulating simultaneously a number of traffic channels. This paper is designed the merged rake receiver demodulating simultaneously a number of traffic channels in the MC-CDMA systems. The merged rake receiver is to reduce the complexity of receiver resulting a number of channels.

  • PDF