• Title/Summary/Keyword: semi-random

Search Result 173, Processing Time 0.021 seconds

Efficient Prediction in the Semi-parametric Non-linear Mixed effect Model

  • So, Beong-Soo
    • Journal of the Korean Statistical Society
    • /
    • v.28 no.2
    • /
    • pp.225-234
    • /
    • 1999
  • We consider the following semi-parametric non-linear mixed effect regression model : y\ulcorner=f($\chi$\ulcorner;$\beta$)+$\sigma$$\mu$($\chi$\ulcorner)+$\sigma$$\varepsilon$\ulcorner,i=1,…,n,y*=f($\chi$;$\beta$)+$\sigma$$\mu$($\chi$) where y'=(y\ulcorner,…,y\ulcorner) is a vector of n observations, y* is an unobserved new random variable of interest, f($\chi$;$\beta$) represents fixed effect of known functional form containing unknown parameter vector $\beta$\ulcorner=($\beta$$_1$,…,$\beta$\ulcorner), $\mu$($\chi$) is a random function of mean zero and the known covariance function r(.,.), $\varepsilon$'=($\varepsilon$$_1$,…,$\varepsilon$\ulcorner) is the set of uncorrelated measurement errors with zero mean and unit variance and $\sigma$ is an unknown dispersion(scale) parameter. On the basis of finite-sample, small-dispersion asymptotic framework, we derive an absolute lower bound for the asymptotic mean squared errors of prediction(AMSEP) of the regular-consistent non-linear predictors of the new random variable of interest y*. Then we construct an optimal predictor of y* which attains the lower bound irrespective of types of distributions of random effect $\mu$(.) and measurement errors $\varepsilon$.

  • PDF

The Presentation of Semi-Random Interleaver Algorithm for Turbo Code (터보코드에 적용을 위한 세미 랜덤 인터리버 알고리즘의 제안)

  • Hong, Sung-Won;Park, Jin-Soo
    • The Transactions of the Korea Information Processing Society
    • /
    • v.7 no.2
    • /
    • pp.536-541
    • /
    • 2000
  • Turbo code has excellent decoding performance but had limitations for real time communications because of the system complexity and time delay in decoding procedure. To overcome this problem, a new SRI(Semi-Random Interleaver) algorithm which realize the reduction of the interleaver size is proposed for reducing the time delay during the decoding prodedure. SRI compose the interleaver 0.5 size from the input data sequence. In writing the interleaver, data is recorded by row such as block interleaver. But, in reading, data is read by randomly and the text data is located by the just address simultaneously. Therefore, the processing time of with the preexisting method such as block, helical random interleaver.

  • PDF

A Robust Image Watermarking Algorithm and System Architecture for Semi-fingerprinting (Semi-fingerprinting을 위한 강인한 이미지 워터마킹 알고리즘 및 시스템 구조)

  • Joung, Gil-Ho;Lee, Han-Ho;Eom, Young-Ik
    • The KIPS Transactions:PartD
    • /
    • v.10D no.2
    • /
    • pp.309-316
    • /
    • 2003
  • In this paper, we propose a new watermarking method based on spread spectrum and a semi-fingerprinting system architecture that can be built using our robust watermarking method. Especially, we describe a method that extends the application area of watermarking technology to more practical application domains by applying the watermarking technology that has been focused mainly on copyright protection to fingerprinting area. Our proposed watermarking scheme uses the method that inserts more data by using random number shifting method. We improved the reliability of acquired data with 20-bits CRC code and 60-bits inserted information. In addition, we designed the system architecture based on the recommendation of cIDf (content ID forum) in order to apply the system on the semi-fingerprinting area.

Design of an Efficient LDPC Codec for Hardware Implementation (하드웨어 구현에 적합한 효율적인 LDPC 코덱의 설계)

  • Lee Chan-Ho;Park Jae-Geun
    • Journal of the Institute of Electronics Engineers of Korea SD
    • /
    • v.43 no.7 s.349
    • /
    • pp.50-57
    • /
    • 2006
  • Low-density parity-check (LDPC) codes are recently emerged due to its excellent performance. However, the parity check (H) matrices of the previous works are not adequate for hardware implementation of encoders or decoders. This paper proposes a hybrid parity check matrix which is efficient in hardware implementation of both decoders and encoders. The hybrid H-matrices are constructed so that both the semi-random technique and the partly parallel structure can be applied to design encoders and decoders. Using the proposed methods, the implementation of encoders can become practical while keeping the hardware complexity of the partly parallel decoder structures. An encoder and a decoder are designed using Verilog-HDL and compared with the previous results.

Semi-fingerprinting System using The Digital Watermark (디지털 워터마크를 이용한 Semi-fingerprinting)

  • 이한호;이정수;김종원
    • Proceedings of the Korean Information Science Society Conference
    • /
    • 2003.04a
    • /
    • pp.437-439
    • /
    • 2003
  • 본 논문에서는 대역확산방식을 응용한 새로운 워터마킹 방법에 대해서 설명하고, 이를 이용하여 semi-fingerprinting을 구현할 수 있는 데이터 구조에 대해서 기술하였다. 본 논문은 저작권 보호에 주초점이 맞추어져 있는 워터마크 기술을 실질적으로 필요한 fingerprinting분야에 적용함으로써, 그 동안 학문연구에 그치고 있었던 워터마크 기술을 산업적 응용에까지 확대시키는데 큰 기여를 할 것으로 기대된다. 본 논문에서 제안한 워터마킹 방법은 난수이동(random number shift)방법을 이용하여 데이터 삽입량을 증가시켰다. 또한, semi-fingerprinting에 적용하기 위해 일본 내에서 진행중인 cIDf의 지침에 기반 하여 워터마크를 구성하였다.

  • PDF

Performance Analysis of Reed Solomon/Convolutional Concatenated Codes and Turbo code using Semi Random Interleaver over the Radio Communication Channel (무선통신 채널에서 RS/길쌈 연쇄부호와 세미 랜덤 인터리버를 이용한 터보코드의 성능 분석)

  • 홍성원
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.5 no.5
    • /
    • pp.861-868
    • /
    • 2001
  • In this paper, the performance of Reed Solomon(RS)/convolution리 concatenated codes and turbo code using semi random interleaver over the radio communication channel was analyzed. In the result, we proved that the performance of decoder was excellent as increase the interleaver size, constraint length, and iteration number. When turbo code using semi random interleaver and Hsiconvolutional concatenated codes was constant constraint length L=5, BER=10-4 , each value of $E_b/N_o$ was 4.5〔dB〕 and 2.95〔dB〕. Therefore, when the constraint length was constant, we proved that the performance of turbo code is superior to RS/Convolutional concatenated codes about 1.55〔dB〕 in the case of BER=10-4.

  • PDF

Statistical Inference of Some Semi-Markov Reliability Models

  • Alwasel, I.A.
    • International Journal of Reliability and Applications
    • /
    • v.9 no.2
    • /
    • pp.167-182
    • /
    • 2008
  • The objective of this paper is to discuss the stochastic analysis and the statistical inference of a three-states semi-Markov reliability model. Using the maximum likelihood procedure, the parameters included in this model are estimated. Based on the assumption that the lifetime and repair time of the system are gener-alized Weibull random variables, the reliability function of this system is obtained. Then, the distribution of the first passage time of this system is derived. Many important special cases are discussed. Finally, the obtained results are compared with those available in the literature.

  • PDF

Estimation of Parameters in a Generalized Exponential Semi-Markov Reliability Models

  • El-Gohary Awad
    • International Journal of Reliability and Applications
    • /
    • v.6 no.1
    • /
    • pp.13-29
    • /
    • 2005
  • This paper deals with the stochastic analysis of a three-states semi-Markov reliability model. Using both the maximum likelihood and Bayes procedures, the parameters included in this model are estimated. Next, assuming that the lifetime and repair time are generalized exponential random variables, the reliability function of this system is obtained. Then, the distribution of the first passage time of this system is discussed. Finally, some of the obtained results are compared with those available in the literature.

  • PDF

Improved Weighted Integral Method and Application to Analysis of Semi-infinite Domain (개선된 가중적분법과 반무한 영역의 해석)

  • 노혁천;최창근
    • Proceedings of the Computational Structural Engineering Institute Conference
    • /
    • 2002.04a
    • /
    • pp.369-376
    • /
    • 2002
  • The stochastic analysis of semi-infinite domain is presented using the weighted integral method, which is improved to include the higher order terms in expanding the displacement vector. To improve the weighted integral method, the Lagrangian remainder is taken into account in the expansion of the status variable with respect to the mean value of the random variables. In the resulting formulae only the 'proportionality coefficients' are introduced in the resulting equation, therefore no additional computation time and memory requirement is needed. The equations are applied in analyzing the semi-infinite domain. The results obtained by the improved weighted integral method are reasonable and are in good agreement with those of the Monte Carlo simulation. To model the semi-infinite domain, the Bettess's infinite element is adopted, where the theoretical decomposition of the strain-displacement matrix to calculate the deviatoric stiffness of the semi-infinite domains is introduced. The calculated value of mean and the covariance of the displacement are revealed to be larger than those given by the finite domain assumptions which is thought to be rational and should be considered in the design of structures on semi-infinite domains.

  • PDF

A New Semi-Random Imterleaver Algorithm for the Noise Removal in Image Communication (영상통신에서 잡음 제거를 위한 새로운 세미 랜덤 인터리버 알고리즘)

  • Hong, Sung-Won;Park, Jin-Soo
    • The Transactions of the Korea Information Processing Society
    • /
    • v.7 no.8
    • /
    • pp.2473-2483
    • /
    • 2000
  • In this paper, The turbo code is used to effectively remove noise which is generated on the image communication channel. Turbo code had excellent decoding performance. However, it had limitations for real time communication because of the system complexity and time delay in decoding procedure. To overcome this problem, this paper proposed a new SRI(Semi Random Interleaved algorithm, which decrease the time delay, when the image data, which reduced the interleaver size of turbo code encoder and decoder, transmitted. The SRI algorithm was composed of 0.5 interleaver size from input frame sequence. When the data inputs in interleaver, the data recorded by row such as block interleaver. But, When the data read in interleaver, the data was read by randomly and the next data located by the just address simultaneously. Therefore, the SRI reduced half-complexity when it was compared with pre-existing method such as block, helical, random interleaver. The image data could be the real time processing when the SRI applied to turbo code.

  • PDF