• 제목/요약/키워드: local iteration

검색결과 108건 처리시간 0.045초

802.11n 규격에서의 저복잡도 LDPC 복호 알고리즘 (Low Computational Complexity LDPC Decoding Algorithms for 802.11n Standard)

  • 김민혁;박태두;정지원;이성로;정민아
    • 한국통신학회논문지
    • /
    • 제35권2C호
    • /
    • pp.148-154
    • /
    • 2010
  • 본 연구에서는 무선 랜 표준안인 802.11n에서 채널 부호화 알고리즘으로 채택된 LDPC부호의 복호 알고리즘의 저복잡도에 대해 연구를 하였다. 샤논의 한계에 근접하기 위해서는 큰 블록 사이즈의 LDPC 부호어 길이와 많은 반복횟수를 요구한다. 이는 많은 계산량을 요구하며, 그리고 이에 따른 전력 소비량(power consumption)을 야기시키므로 본 논문에서는 세 가지 형태의 저복잡도 LDPC 복호 알고리즘을 제시한다. 첫째로 큰 블록 사이즈와 많은 반복 횟수는 많은 계산량과 전력 소모량을 요구하므로 성능 손실 없이 반복횟수를 줄일 수 있는 부분 병렬 방법을 이용한 복호 알고리즘, 둘째로 early stop 알고리즘에 대해 연구 하였고, 셋째로 비트 노드 계산과 체크 노드 계산 시 일정한 신뢰도 값보다 크면 다음 반복 시 계산을 하지 않는 early detection 알고리즘에 대해 연구 하였다.

Influence of lateral motion of cable stays on cable-stayed bridges

  • Wang, P.H.;Liu, M.Y.;Huang, Y.T.;Lin, L.C.
    • Structural Engineering and Mechanics
    • /
    • 제34권6호
    • /
    • pp.719-738
    • /
    • 2010
  • The aim of this paper concerns with the nonlinear analysis of cable-stayed bridges including the vibration effect of cable stays. Two models for the cable stay system are built up in the study. One is the OECS (one element cable system) model in which one single element per cable stay is used and the other is MECS (multi-elements cable system) model, where multi-elements per cable stay are used. A finite element computation procedure has been set up for the nonlinear analysis of such kind of structures. For shape finding of the cable-stayed bridge with MECS model, an efficient computation procedure is presented by using the two-loop iteration method (equilibrium iteration and shape iteration) with help of the catenary function method to discretize each single cable stay. After the convergent initial shape of the bridge is found, further analysis can then be performed. The structural behaviors of cable-stayed bridges influenced by the cable lateral motion will be examined here detailedly, such as the static deflection, the natural frequencies and modes, and the dynamic responses induced by seismic loading. The results show that the MECS model offers the real shape of cable stays in the initial shape, and all the natural frequencies and modes of the bridge including global modes and local modes. The global mode of the bridge consists of coupled girder, tower and cable stays motion and is a coupled mode, while the local mode exhibits only the motion of cable stays and is uncoupled with girder and tower. The OECS model can only offers global mode of tower and girder without any motion of cable stays, because each cable stay is represented by a single straight cable (or truss) element. In the nonlinear seismic analysis, only the MECS model can offer the lateral displacement response of cable stays and the axial force variation in cable stays. The responses of towers and girders of the bridge determined by both OECS- and MECS-models have no great difference.

Boundary-adaptive Despeckling : Simulation Study

  • Lee, Sang-Hoon
    • 대한원격탐사학회지
    • /
    • 제25권3호
    • /
    • pp.295-309
    • /
    • 2009
  • In this study, an iterative maximum a posteriori (MAP) approach using a Bayesian model of Markovrandom field (MRF) was proposed for despeckling images that contains speckle. Image process is assumed to combine the random fields associated with the observed intensity process and the image texture process respectively. The objective measure for determining the optimal restoration of this "double compound stochastic" image process is based on Bayes' theorem, and the MAP estimation employs the Point-Jacobian iteration to obtain the optimal solution. In the proposed algorithm, MRF is used to quantify the spatial interaction probabilistically, that is, to provide a type of prior information on the image texture and the neighbor window of any size is defined for contextual information on a local region. However, the window of a certain size would result in using wrong information for the estimation from adjacent regions with different characteristics at the pixels close to or on boundary. To overcome this problem, the new method is designed to use less information from more distant neighbors as the pixel is closer to boundary. It can reduce the possibility to involve the pixel values of adjacent region with different characteristics. The proximity to boundary is estimated using a non-uniformity measurement based on standard deviation of local region. The new scheme has been extensively evaluated using simulation data, and the experimental results show a considerable improvement in despeckling the images that contain speckle.

CONVERGENCE AND ALMOST STABILITY OF ISHIKAWA ITERATION METHOD WITH ERRORS FOR STRICTLY HEMI-CONTRACTIVE OPERATORS IN BANACH SPACES

  • Liu, Zeqing;Ume, Jeong-Sheok;Kang, Shin-Min
    • 한국수학교육학회지시리즈B:순수및응용수학
    • /
    • 제11권4호
    • /
    • pp.293-308
    • /
    • 2004
  • Let K be a nonempty convex subset of an arbitrary Banach space X and $T\;:\;K\;{\rightarrow}\;K$ be a uniformly continuous strictly hemi-contractive operator with bounded range. We prove that certain Ishikawa iteration scheme with errors both converges strongly to a unique fixed point of T and is almost T-stable on K. We also establish similar convergence and almost stability results for strictly hemi-contractive operator $T\;:\;K\;{\rightarrow}\;K$, where K is a nonempty convex subset of arbitrary uniformly smooth Banach space X. The convergence results presented in this paper extend, improve and unify the corresponding results in Chang [1], Chang, Cho, Lee & Kang [2], Chidume [3, 4, 5, 6, 7, 8], Chidume & Osilike [9, 10, 11, 12], Liu [19], Schu [25], Tan & Xu [26], Xu [28], Zhou [29], Zhou & Jia [30] and others.

  • PDF

공간 영역 제약 정보를 이용한 적응 Gradient-Projection 영상 복원 방식 (An Adaptive Gradient-Projection Image Restoration Algorithm with Spatial Local Constraints)

  • 송원선;홍민철
    • 한국통신학회논문지
    • /
    • 제28권3C호
    • /
    • pp.232-238
    • /
    • 2003
  • 본 논문에서는 공간 영역의 제약 정보를 이용한 적응 영상 복원 방식을 제안한다. 공간 영역의 제약정보로는 국부 정보의 평균, 분산 및 최대 값을 이용하였으며, 반복 기법을 이용하여 매 반복 해에서 얻어진 복원 영상으로부터 상기 제약 정보를 설정하게 되고, 위의 제약 정보는 임의의 입력 값에 의해 정의되는 매개 변수와 더불어 복원 영상의 국부 완화 정도를 결정하게 된다. 제안된 방식을 이용하여 복원영상을 얻기 위해 비 적응 복원 방식보다 빠른 수렴속도를 갖게 됨을 알 수 있으며, 국부적으로 제어된 완화 정도를 지닌 복윈 영상을 얻을 수 있었다. 제안된 방식의 성능은 실험을 통해서 확인할 수 있었다.

Preliminary design of control software for SDSS-V Local Volume Mapper Instrument

  • Kim, Changgon;Ji, Tae-geun;Ahn, Hojae;Yang, Mingyeong;Lee, Sumin;Kim, Taeeun;Pak, Soojong;Konidaris, Nicholas P.;Drory, Niv;Froning, Cynthia S.;Hebert, Anthony;Bilgi, Pavan;Blanc, Guillermo A.;Lanz, Alicia E.;Hull, Charles L;Kollmeier, Juna A.;Ramirez, Solange;Wachter, Stefanie;Kreckel, Kathryn;Pellegrini, Eric;Almeida, Andr'es;Case, Scott;Zhelem, Ross;Feger, Tobias;Lawrence, Jon;Lesser, Michael;Herbst, Tom;Sanchez-Gallego, Jose;Bershady, Matthew A;Chattopadhyay, Sabyasachi;Hauser, Andrew;Smith, Michael;Wolf, Marsha J;Yan, Renbin
    • 천문학회보
    • /
    • 제46권1호
    • /
    • pp.39.1-39.1
    • /
    • 2021
  • The Local Volume Mapper(LVM) project in the fifth iteration of the Sloan Digital Sky Survey (SDSS-V) will produce large integral-field spectroscopic survey data to understand the physical conditions of the interstellar medium in the Milky Way, the Magellanic Clouds, and other local-volume galaxies. We are developing the LVM Instrument control software. The architecture design of the software follows a hierarchical structure in which the high-level software packages interact with the low-level and mid-level software and hardware components. We adopt the spiral software development model in which the software evolves by iteration of sequential processes, i.e., software requirement analysis, design, code generation, and testing. This spiral model ensures that even after being commissioned, the software can be revised according to new operational requirements. We designed the software by using the Unified Modeling Language, which can visualize functional interactions in structure diagrams. We plan to use the SDSS software framework CLU for the interaction between components, based on the RabbitMQ that implemented the Advanced Message Queuing Protocol (AMQP).

  • PDF

멀티모달 함수의 최적화를 위한 먼델 연산 유전자 알고리즘 (A Genetic Algorithm with a Mendel Operator for Multimodal Function Optimization)

  • 송인수;심재완;탁민제
    • 제어로봇시스템학회논문지
    • /
    • 제6권12호
    • /
    • pp.1061-1069
    • /
    • 2000
  • In this paper, a new genetic algorithm is proposed for solving multimodal function optimization problems that are not easily solved by conventional genetic algorithm(GA)s. This algorithm finds one of local optima first and another optima at the next iteration. By repeating this process, we can locate all the local solutions instead of one local solution as in conventional GAs. To avoid converging to the same optimum again, we devise a new genetic operator, called a Mendel operator which simulates the Mendels genetic law. The proposed algorithm remembers the optima obtained so far, compels individuals to move away from them, and finds a new optimum.

  • PDF

LOCAL CONVERGENCE OF FUNCTIONAL ITERATIONS FOR SOLVING A QUADRATIC MATRIX EQUATION

  • Kim, Hyun-Min;Kim, Young-Jin;Seo, Jong-Hyeon
    • 대한수학회보
    • /
    • 제54권1호
    • /
    • pp.199-214
    • /
    • 2017
  • We consider fixed-point iterations constructed by simple transforming from a quadratic matrix equation to equivalent fixed-point equations and assume that the iterations are well-defined at some solutions. In that case, we suggest real valued functions. These functions provide radii at the solution, which guarantee the local convergence and the uniqueness of the solutions. Moreover, these radii obtained by simple calculations of some constants. We get the constants by arbitrary matrix norm for coefficient matrices and solution. In numerical experiments, the examples show that the functions give suitable boundaries which guarantee the local convergence and the uniqueness of the solutions for the given equations.

화상의 반복 복원 처리 (An Iterative Image Restoration)

  • 이태홍
    • 한국통신학회논문지
    • /
    • 제17권8호
    • /
    • pp.891-897
    • /
    • 1992
  • 본 논문은 일반반복 화상 처리가 화상 전체에 화사의 정보와 상관없이 일률적인 방법으로 적용함으로서 생기는 비 효율성을 고려하여 처리하는 화소의 주변 화상 정보를 이용하여 평면 부분과 윤곽 부부느이 처리회수를 달리하여 주므로서 시각적인 효과와 동시에 처리 시간을 단축하는 국부 반복 복원 방법을 제안하였다. 국부 반복 복원 방법은 일반 반복, 복원 알고리즘을 적용하여 윤곽 부분을 집중 복원하고 평면 부분은 복원없이 통과하는 방법으로, 여기에 사용된 일반 반복 알고리즘이 수렴하면 국분 반복 복원도 수렴하게 됨을 이용하였다. 각각 처리된 화상,MSE, 처리 시간등을 비교하여 그 효율성을 확인하였다.

  • PDF

국부 통계 특성을 이용한 적응 MAP 방식의 고해상도 영상 복원 방식 (Adaptive MAP High-Resolution Image Reconstruction Algorithm Using Local Statistics)

  • 김경호;송원선;홍민철
    • 한국통신학회논문지
    • /
    • 제31권12C호
    • /
    • pp.1194-1200
    • /
    • 2006
  • 본 논문에서는 국부 통계 특성을 이용한 적응 MAP 방식의 고해상도 영상 복원 알고리즘에 대해 제안한다. 고해상도 원 영상의 윤곽선을 보존하기 위해 저해상도 영상의 국부 특성을 이용하여 시각함수를 정의하였고, MAP(Maximum A Posteriori) 추정 방식을 이용하여 국부적인 열화 정도(smoothness)를 조절하였다. 또한 가중치가 부여된 함수를 이용하여 원 고해상도 영상에 가능한 가까운 최적의 해를 찾기 위하여 반복기법을 사용하였으며, 열화 요소는 매 반복 단계마다 부분적으로 복원된 고해상도 영상으로부터 이용하였다. 제안된 방식의 성능을 실험 결과를 통해 확인할 수 있었다.