• Title/Summary/Keyword: 반복수

Search Result 8,540, Processing Time 0.048 seconds

Performance of Iterative Multiuser Detector and Turbo Decoder in WCDMA System (WCDMA 시스템에l서 반복 다중사용자 검출기 및 터보 복호기의 성능)

  • Kim, Jeong-Goo
    • Journal of Korea Society of Industrial Information Systems
    • /
    • v.11 no.4
    • /
    • pp.40-46
    • /
    • 2006
  • The performance of iterative multiuser detector and turbo decoder is presented to provide high quality multimedia services in WCDMA (wideband code division multiple access) system in this paper. Especially the relationship between the local iteration of turbo decoder and the global iteration of multiuser detector including the turbo decoder is analyzed. As a result, three local iterations and three global iterations are considered to be sufficient to provide satisfactory error performance with resonable complexity. The interference cancellation capability of global iteration is improved when the number of users is increased.

  • PDF

A Predicted Newton-Raphson Iterative Method utilizing Neural Network (신경회로망을 이용한 예측 뉴턴-랩손 반복계산기법)

  • Kim, Jong-Hoon;Kim, Yong-Hyup
    • Proceedings of the KSME Conference
    • /
    • 2000.04a
    • /
    • pp.339-344
    • /
    • 2000
  • Newton-Raphson 기법은 구조물의 비선형 해석에 널리 쓰이는 반복계산기법이다. 비선형 해석을 위한 반복계산기법은 컴퓨터의 발달을 감안해도 상당한 계산시간이 소요된다. 본 논문에서는 신경회로망 예측을 사용한 Predicted Newton-Raphson 반복계산기법을 제안하였다. 통상적인 Newton-Raphson 기법은 이전스텝에서 수렴된 점으로부터 현재 스텝의 반복계산을 시작하는 반면 제시된 방법은 현재 스텝 수렴해에 대한 예측점에서 반복계산을 시작한다. 수렴해에 대한 예측은 신경회로망을 사용하여 이전 스텝 수렴해의 과거경향을 파악한 후 구한다. 반복계산 시작점이 수렴점에 보다 근접하여 위치하므로 수렴속도가 빨라지게 되고 허용되는 하중스텝의 크기가 커지게 된다. 또한 반복계산의 시작점으로부터 이루어지는 계산과정은 통상적인 Newton-Raphson 기법과 동일하므로 기존의 Newton-Raphson 기법과 정확히 일치하는 수렴해를 구할 수 있다. 구조물의 정적 비선형 거동에 대한 수치해석을 통하여 modified Newton-Raphson 기법과 제시된 Predicted Newton=Raphson 기법의 정확성과 효율성을 비교하였다. 제시된 Predicted Newton-Raphson 기법은 modified Newton-Raphson 기법과 동일한 해를 산출하면서도 계산상의 효율성이 매우 큼을 확인할 수 있었다.

  • PDF

Efficient Iteration Control Method with low complexity and New Interleaver for Turbo Codes (터보 부호에서 낮은 복잡도를 갖는 효율적인 반복부호 제어기법과 새로운 인터리버)

  • 김순영;장진수;성락주;이문호
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.25 no.8A
    • /
    • pp.1254-1264
    • /
    • 2000
  • In this paper, we propose a new turbo interleaver and an efficient iteration control method with low complexity for turbo decoding. Turbo codes has better performance as the number of iteration and the interleaver size increases. However, as the interleaver size is increased, it require much delay and computation for decoding. Thus we propose a new efficient turbo magic interleaver using the Magic square matrix. Simulation results show that the proposed interleaver realizes a good performance like GF, Mother interleaver proposed to IMT-2000. And as the decoding approaches the performance limit, any further iteration results in very little improvement. Therefore, we propose an efficient algorithm of decoding that can reduce the delay and computation. Just like the conventional stop criterion, it effectively stop the iteration process with very little performance degradation.

  • PDF

Effective Iterative Control Method to Reduce the Decoding Delay for Turbo TCM Decoder (터보 TCM 디코더의 복호 지연을 감소시키기 위한 효율적인 반복복호 제어기법)

  • 김순영;김정수;장진수;이문호
    • The Journal of Korean Institute of Electromagnetic Engineering and Science
    • /
    • v.14 no.8
    • /
    • pp.816-822
    • /
    • 2003
  • In this paper, we propose an efficient iteration control method with low complexity for Turbo TCM(Turbo Trellis Coded Modulation) decoding which will be used fur power-limited environment. As the decoding approaches the performance limit of a given turbo code, any further iteration results in very little improvement. Therefore, it is important to devise an efficient criterion to stop the iteration process and prevent unnecessary computations and decoding delay. This paper presents an efficient algorithm for turbo TCM decoding that can greatly reduce the delay and iteration number. The proposed method use adaptive iteration number according to the criterion using the extrinsic information variance parameter in turbo TCM decoding process. The simulation results show that the proposed technique effectively can reduce the decoding delay and computation with very little performance degradation.

Image Registration Using Repetitive Patterns (반복 패턴을 이용한 영상 정합)

  • Ha, Seong Jong;Cho, Nam Ik
    • Proceedings of the Korean Society of Broadcast Engineers Conference
    • /
    • 2012.07a
    • /
    • pp.306-308
    • /
    • 2012
  • 본 논문은 특징 클러스터에 대한 묘사에 기반한 새로운 특징 기반 영상 정합을 제안한다. 추출되는 특징들을 모두 동등하게 처리하는 기존 방법은 반복 패턴이 존재하는 영상에서는 매칭이 종종 실패하거나 적은 일치점만을 제공한다. 그 이유는 서로 닮아 있는 반복 패턴들로 인해 기하학적으로 일관되지 않은 매칭점들이 발생하거나 거리 비율 테스트를 통과하지 못하기 때문이다. 이에 반해 제안하는 방법은 더 많은 수의 일치점들을 발견할 수 있다. 이를 위해 제안하는 방법은 먼저 추출된 특징들을 반복 패턴으로부터 온 것들과 그렇지 않은 두드러진 특징들로 분리한다. 그런 후 support vector data description을 이용하여 각 반복 패턴들을 묘사한다. 동일하지 않은 영상이 매칭되는 경우를 제거하고 기하학적으로 일관된 일치점들을 제공하기 위해 매칭된 쌍에 대한 기하학적인 단서가 추가된다. 실험을 통해 제안하는 방법은 반복 패턴으로부터 추출된 특징들에 대해 일치점을 제공함으로써 더 많은 수의 일치점을 제공하게 되어 더 정확한 영상 정합을 수행한다는 것을 증명하였다.

  • PDF

Locally Repairable Fractional Repetition Codes (부분접속 복구 가능한 반복분할 부호)

  • Nam, Mi-Young;Kim, Jung-Hyun;Song, Hong-Yeop
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.40 no.9
    • /
    • pp.1741-1753
    • /
    • 2015
  • In this paper, we introduce new locally repairable codes based on a Fractional repetition codes which is one of the MBR codes. We introduce two different constructions for different system parameters and compare these codes in terms of several performance metrics. There is some tradeoffs between the locality and other performance metrics. The newly introduced codes having the good locality should pay the price such as lower capacity or more storage nodes. And the proposed codes are more reliable than other locally repairable codes and have lower repair complexity since they can be repaired without any operations.

Efficient stop criterion algorithm of the turbo code using the maximum sign change of the LLR (LLR 최대부호변화를 적용한 터보부호의 효율적인 반복중단 알고리즘)

  • Shim Byoung-Sup;Jeong Dae-Ho;Lim Soon-Ja;Kim Tae-Hyung;Kim Hwan-Yong
    • Journal of the Institute of Electronics Engineers of Korea TC
    • /
    • v.43 no.5 s.347
    • /
    • pp.121-127
    • /
    • 2006
  • It is well known the fact that turbo codes has better performance as the number of iteration and the interleaver size increases in the AWGN channel environment. However, as the number of iteration and the interleaver size are increased, it is required much delay and computation for iterative decoding. Therefore, it is important to devise an efficient criterion to stop the iteration process and prevent unnecessary computations and decoding delay. In this paper, it proposes the efficient stop criterion algorithm for turbo codes using the maximum sign change of LLR. It is verifying that the proposal variable iterative decoding controller can be reduced the average iterative decoding number compared to conventional schemes with a negligible degradation of the error performance.

New stop criterion using the absolute mean value of LLR difference for Turbo Codes (LLR 차의 절대 평균값을 이용한 터보부호의 새로운 반복중단 알고리즘)

  • Shim ByoungSup;Lee Wanbum;Jeong DaeHo;Lim SoonJa;Kim TaeHyung;Kim HwanYong
    • Journal of the Institute of Electronics Engineers of Korea TC
    • /
    • v.42 no.5 s.335
    • /
    • pp.39-46
    • /
    • 2005
  • It is well known the fact that turbo codes has better performance as the number of iteration and the interleaver size increases in the AWGN channel environment. However, as the number of iteration and the interleaver size are increased, it is required much delay and computation for iterative decoding. Therefore, it is important to devise an efficient criterion to stop the iteration process and prevent unnecessary computations and decoding delay. In this paper, it proposes the efficient iterative decoding stop criterion using the absolute mean value of LLR difference. It is verifying that the proposal iterative decoding stop criterion can be reduced the average iterative decoding number compared to conventional schemes with a negligible degradation of the error performance.

Effect of Cold Cyclic Compaction on Densification of $Al_2O_3$ Powder/SiC Whisker Composite ($Al_2O_3$분말과 SiC 휘스커 복합체의 치밀화에 미치는 상온 반복 압축의 영향)

  • 최승완;김기태
    • Journal of the Korean Ceramic Society
    • /
    • v.34 no.3
    • /
    • pp.296-302
    • /
    • 1997
  • The effect of cold cyclic compaction on densification of SiC whisker/Al2O3 composite was investigated. Re-lative density of the compact increased as the number of cycle and the compaction pressure increased and the bias pressure decreased. The rate of loading and unloading and the frequency of cold cyclic compaction did not affect much on sliding and rearrangement of the particles. Fracture of SiC whisker was hardly ob-served during cold cyclic compaction and the direction of whisker was randomly oriented throughout the compact regardless of the direction of compaction. Thus, cold cyclic compaction may be an efficient method to densify SiC whisker/Al2O3 composite.

  • PDF

Analysis of Microsatellite Patterns in the Genome of Red Sea Cucumber (홍해삼 유전체 분석에 의한 microsatellite의 분포도 연구)

  • Lee, Tae Wook;Kim, Sam Woong;Kim, Jung Sun;Chi, Won-Jae;Bang, Woo Young;Kim, Jang Hyeon;Yang, Chul Woong;Bang, Kyu Ho;Gal, Sang Wan
    • Journal of Life Science
    • /
    • v.32 no.9
    • /
    • pp.690-697
    • /
    • 2022
  • This study was conducted to analyze genome of red sea cucumber and to use it as basic data for the development of genetic markers for red sea cucumber. Microsatellite marker analysis of Ulleungdo_normal and Ulleungdo_native red sea cucumbers revealed that dinucleotide simple sequence repeats (SSRs) had the highest ratio, at 81.3~81.4%, and the number of the detected SSRs tended to decrease as the number of repeating sequence units in SSRs increased. In general, microsatellites with between 5 and 10 iterations were most common. As the size of the SSR repeating sequence units increased, the SSR iterations gradually decreased. The di-, tri-, and tetra-nucleotides in SSRs were detected in the highest numbers as (AT)5, (AAT)5, and (AAAT)5, respectively. (CG) and (CCG) had very low frequencies compared to the numbers of other repeating SSR units. The numbers of di-and tri-nucleotide repeats were up to 35 and 32, respectively, and then increased discontinuously up to 44 and 43 repeats, respectively. Tetra-, penta-, and hexa-nucleotides in SSRs occurred in numbers up to 25, 21 and 14, respectively. This analysis of red sea cucumber indicated that it maintains its own repetition sequence and repetition number; therefore, we suggest that using it as basic data for molecular marker will be possible in future research.