• Title/Summary/Keyword: block schemes

Search Result 302, Processing Time 0.024 seconds

Development of Optimized Compact Finite Difference Schemes (최적화된 집적 유한 차분법을 위한 내재적 시간전진 기법의 개발)

  • Park N. S.;Kim J. W.;Lee D. J.
    • 한국전산유체공학회:학술대회논문집
    • /
    • 1998.11a
    • /
    • pp.7-12
    • /
    • 1998
  • Optimized high-order compact(OHOC) schemes were proposed, which have high spatial order of truncation and resolution to simulate the aeroacoustic problems due to unsteady compressible flows. Generally, numerical schemes are categorized explicit or implicit by time-marching method. In this research, OHOC differences which were developed with explicit time-marching method is used to have implicit formulation and the implicit OHOC differences result in block hepta-diagonal matrix. This paper presents the comparisons between the explicit and implicit OHOC schemes with a second order accuracy of time in the 1-d linear wave convection problem, and between the explicit OHOC scheme of 4th-order accuracy in time and the implicit OHOC scheme of 1st-order accuracy in tine for the 1-d nonlinear wave convection problem. With these comparisons, the characteristics of implicit OHOC scheme are shown in the point of CFL number.

  • PDF

A New Fast Motion Estimation Algorithm Based on Block Sum Pyramid Algorithm

  • Jung, Soo-Mok
    • Journal of the Korea Computer Industry Society
    • /
    • v.5 no.1
    • /
    • pp.147-156
    • /
    • 2004
  • In this paper, a new fast motion estimation algorithm which is based on the Block Sum Pyramid Algorithm(BSPA) is presented. The Spiral Diamond Mesh Search scheme and Partial Distortion Elimination scheme of Efficient Multi-level Successive Elimination Algorithm were improved and then the improved schemes were applied to the BSPA. The motion estimation accuracy of the proposed algorithm is nearly 100% and the cost of Block Sum Pyramid Algorithm was reduced in the proposed algorithm. The efficiency of the proposed algorithm was verified by experimental results.

  • PDF

Polyphase Representation of the Relationships Among Fullband, Subband, and Block Adaptive Filters

  • Tsai, Chimin
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 2005.06a
    • /
    • pp.1435-1438
    • /
    • 2005
  • In hands-free telephone systems, the received speech signal is fed back to the microphone and constitutes the so-called echo. To cancel the effect of this time-varying echo path, it is necessary to device an adaptive filter between the receiving and the transmitting ends. For a typical FIR realization, the length of the fullband adaptive filter results in high computational complexity and low convergence rate. Consequently, subband adaptive filtering schemes have been proposed to improve the performance. In this work, we use deterministic approach to analyze the relationship between fullband and subband adaptive filtering structures. With block adaptive filtering structure as an intermediate stage, the analysis is divided into two parts. First, to avoid aliasing, it is found that the matrix of block adaptive filters is in the form of pseudocirculant, and the elements of this matrix are the polyphase components of the fullband adaptive filter. Second, to transmit the near-end voice signal faithfully, the analysis and the synthesis filter banks in the subband adaptive filtering structure must form a perfect reconstruction pair. Using polyphase representation, the relationship between the block and the subband adaptive filters is derived.

  • PDF

A LOSSLESS CODING SCHEME FOR BAYER COLOR FILTER ARRAY IMAGES USING BLOCK-ADAPTIVE PREDICTION

  • Abe, Toshiyuki;Matsuday, Ichiro;Itohy, Susumu
    • Proceedings of the Korean Society of Broadcast Engineers Conference
    • /
    • 2009.01a
    • /
    • pp.838-841
    • /
    • 2009
  • This paper proposes a novel lossless coding scheme for Bayer color filter array (CFA) images which are generally used as internal data of color digital cameras having a single image sensor. The scheme employs a block-adaptive prediction method to exploit spatial and spectral correlations in local areas containing different color signals. In order to allow adaptive prediction suitable for the respective color signals, four kinds of linear predictors which correspond to 2 ${\times}$ 2 samples of Bayer CFA are simultaneously switched block-by-block. Experimental results show that the proposed scheme outperforms other state-of-the-art lossless coding schemes in terms of coding efficiency for Bayer CFA images.

  • PDF

Efficient Detection Scheme for Turbo Coded QO-STBC Schemes (터보 부호와 결합된 준직교 시공간 블록 부호의 효율적인 검출 기법)

  • Park, Un-Hee;Oh, Dae-Sub;Kim, Young-Min;Kim, Soo-Young
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.35 no.5A
    • /
    • pp.423-430
    • /
    • 2010
  • The performances of turbo-coded space-time block coding (STBC) schemes are subject to how soft decision detection (SDD) information are generated from the STBC decoder. For this reason, we have to pay particular attention to estimation of SDD. In this paper, we evaluate the performance of a turbo coded STBC scheme depending on the accuracy of the SDD. Recently, a new quasi orthogonal STBC (QO-STBC) scheme using a noise whitened filter was proposed in order to reduce noise enhancing effect of zero forcing detection process. This QO-STBC scheme was proven to be efficient in computational complexity compared to the other conventional QO-STBC schemes. In this paper, we first present detailed mathematical analysis on the noise whitened QO-STBC scheme, and by using the result we propose the optimum SDD method.

RECURSIVE TWO-LEVEL ILU PRECONDITIONER FOR NONSYMMETRIC M-MATRICES

  • Guessous, N.;Souhar, O.
    • Journal of applied mathematics & informatics
    • /
    • v.16 no.1_2
    • /
    • pp.19-35
    • /
    • 2004
  • We develop in this paper some preconditioners for sparse non-symmetric M-matrices, which combine a recursive two-level block I LU factorization with multigrid method, we compare these preconditioners on matrices arising from discretized convection-diffusion equations using up-wind finite difference schemes and multigrid orderings, some comparison theorems and experiment results are demonstrated.

Whale Optimization Algorithm and Blockchain Technology for Intelligent Networks

  • Sulthana, Shazia;Reddy, BN Manjunatha
    • International Journal of Computer Science & Network Security
    • /
    • v.22 no.7
    • /
    • pp.157-164
    • /
    • 2022
  • The proposed privacy preserving scheme has identified the drawbacks of existing schemes in Vehicular Networks. This prototype enhances the number of nodes by decreasing the cluster size. This algorithm is integrated with the whale optimization algorithm and Block Chain Technology. A set of results are done through the NS-2 simulator in the direction to check the effectiveness of proposed algorithm. The proposed method shows better results than with the existing techniques in terms of Delay, Drop, Delivery ratio, Overhead, throughout under the denial of attack.

Relay Selection Schemes Using STBC Technique in OFDM-Based Cooperative Wireless Communications (OFDM 기반의 무선 협력 통신에서 STBC 기술을 적용한 선택적 릴레이 통신 기법)

  • Lee, Je-Yeon;Yang, Mo-Chan;Yoo, Sung-Cheol;Shin, Yo-An
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.36 no.7A
    • /
    • pp.640-648
    • /
    • 2011
  • We propose relay selection schemes using STBC (Space Time Block Coding) technique in OFDM (Orthogonal Frequency Division Multiplexing)-based wireless systems. The proposed schemes select the optimum relay having the maximum instantaneous equivalent channel gain among multiple candidate relays. Also, in order to reduce the system overhead, a symbol grouping method which groups some amount of symbols before selecting the optimum relay is proposed. The simulation results show that the proposed relay selection schemes can obtain more selection diversity gain as the number of selectable relay candidates increases. Furthermore, the proposed scheme with the symbol grouping can reduce system overhead without any degradation of the performance in fading channels with low frequency selectivity.

A Comparative Performance Analysis of STBC-OFDM Systems Under Frequency-Selective Rayleigh Fading Environments (주파수 선택성 레일라이 페이딩 환경에서 STBC-OFDM 시스템의 성능 비교, 분석)

  • Lee, Sang-Ho;Jung, Ho-Chul;Park, Hyung-Rae;Kim, Jong-Ho
    • Journal of Advanced Navigation Technology
    • /
    • v.8 no.2
    • /
    • pp.144-154
    • /
    • 2004
  • In this paper we apply the space-time block codes (STBCs), the key technologies for the 4th generation mobile communication systems, to the OFDM system and analyze their performances. First, we derive the signal models for representative STBC schemes and demodulation procedures for each scheme. We also select the parameters for OFDM system considering mobile cellular environments and assign adequate modulation schemes to STBC-OFDM schemes according to the transmission rate from 2bps/Hz to 4bps/Hz. We finally compare and analyze the performances of STBC-OFDM schemes for the selected transmission rates through computer simulations, together with performance comparison when the same modulation scheme being adopted.

  • PDF

Information Coding Schemes for the Frequency Hopping Communication (주파수 도약 통신에 적합한 정보부호화 기법)

  • 박대철;김용선;한성우;전용억;전병민
    • Journal of Broadcast Engineering
    • /
    • v.4 no.1
    • /
    • pp.32-43
    • /
    • 1999
  • This paper addresses schemes which securely transmit voice and data information under the worst communication environment using the frequency hopping(FH) communication system to avoid monitoring or interference against enemy. In case of using the conventional FEC and bit interleaving scheme. the processing time for error control coding and bit interleaving due to system complexity is highly demanded. In this paper. the effective information coding scheme of maprity error correction and block interleaving compatible to the proposed FH communication system is proposed to transmit voice or data (I6Kbps. 4.8Kbps. 2.4Kbps. 1.2Kbps, O.6Kbps) under the worst FH communication channel. In transmitter. low rate data signals are configured to majority data blocks. and transmitted repeatedly to FH channel which are structured to 20Kbps hopping frame cells. In receiver. the received data are decoded block by block, and taken majority error correction. Consequently. burst or random errors are corrected at the block deinterleaver and the majority decoder. The proposed coder structure reduces the coding/decnding processing time as well as the jamming interferences, and further simplify the data processing complexity for FH communication. Improved performance of the proposed scheme was verified under simulated channel environments.

  • PDF