Although full waveform inversion in the frequency domain can overcome the local minima problem in the time direction, such problem still exists in the space direction because of the media subsurface complexity. Based ...Although full waveform inversion in the frequency domain can overcome the local minima problem in the time direction, such problem still exists in the space direction because of the media subsurface complexity. Based on the optimal steep descent methods, we present an algorithm which combines the preconditioned bi-conjugated gradient stable method and the multi-grid method to compute the wave propagation and the gradient space. The multiple scale prosperity of the waveform inversion and the multi-grid method can overcome the inverse problems local minima defect and accelerate convergence. The local inhomogeneous three-hole model simulated results and the Marmousi model certify the algorithm effectiveness.展开更多
Factor graph, so named because it graphically represents function factorization, with which and its sum-product algorithm the iterative algorithm can be derived clearly. An iterative multiuser receiver based on factor...Factor graph, so named because it graphically represents function factorization, with which and its sum-product algorithm the iterative algorithm can be derived clearly. An iterative multiuser receiver based on factor graph for asynchronous coded CDMA system is proposed. In this paper, the a posteriori probability of users information bits conditioned on the noise-whitening filters output is represented by factor graphs, after numbers of iterations with the sum-product algorithm the information bits are estimated. The authors also propose a reduced complexity algorithm. Simulation results show that with this proposed receiver, near-single-user performance can be achieved, and small performance degradation for the reduced complexity algorithm with significant complexity reduction.展开更多
It is known that Block Turbo Codes （BTC） can be nearly optimally decoded by Chase-II algorithm, in which the Least Reliable Bits （LRBs） are chosen empirically to keep the size of the test patterns （sequences） re...It is known that Block Turbo Codes （BTC） can be nearly optimally decoded by Chase-II algorithm, in which the Least Reliable Bits （LRBs） are chosen empirically to keep the size of the test patterns （sequences） relatively small and to reduce the decoding complexity. While there are also other adaptive techniques, where the decoder＇s LRBs adapt to the external parameter of the decoder like SNR （Signal Noise Ratio） level, a novel adaptive algorithm for BTC based on the statistics of an internal variable of the decoder itself is proposed in this paper. Different from the previous reported results, it collects the statistics of the multiplicity of the candidate sequences, i.e., the number of the same candidate sequences with the same minimum squared Euclidean distance resulted from the decoding of test sequences. It is shown by Monte Carlo simulations that the proposed adaptive algorithm has only about 0.02dB coding loss but the average complexity of the proposed algorithm is about 42% less compared with Pyndiah＇s iterative decoding algorithm using the fixed LRBs parameter.展开更多
基金supported by the China State Key Science and Technology Project on Marine Carbonate Reservoir Characterization (No. 2011ZX05004-003)the Basic Research Programs of CNPC during the 12th Five-Year Plan Period (NO.2011A-3603)+1 种基金the Natural Science Foundation of China (No.41104066)the RIPED Young Professional Innovation Fund (NO.2010-13-16-02, 2010-A-26-02)
文摘Although full waveform inversion in the frequency domain can overcome the local minima problem in the time direction, such problem still exists in the space direction because of the media subsurface complexity. Based on the optimal steep descent methods, we present an algorithm which combines the preconditioned bi-conjugated gradient stable method and the multi-grid method to compute the wave propagation and the gradient space. The multiple scale prosperity of the waveform inversion and the multi-grid method can overcome the inverse problems local minima defect and accelerate convergence. The local inhomogeneous three-hole model simulated results and the Marmousi model certify the algorithm effectiveness.
基金the National Science Foundation of China and Key Subject Project of the Ministry of Education.
文摘Factor graph, so named because it graphically represents function factorization, with which and its sum-product algorithm the iterative algorithm can be derived clearly. An iterative multiuser receiver based on factor graph for asynchronous coded CDMA system is proposed. In this paper, the a posteriori probability of users information bits conditioned on the noise-whitening filters output is represented by factor graphs, after numbers of iterations with the sum-product algorithm the information bits are estimated. The authors also propose a reduced complexity algorithm. Simulation results show that with this proposed receiver, near-single-user performance can be achieved, and small performance degradation for the reduced complexity algorithm with significant complexity reduction.
基金the National Natural Science Foundation of China under grants，NUAA research funding
文摘It is known that Block Turbo Codes （BTC） can be nearly optimally decoded by Chase-II algorithm, in which the Least Reliable Bits （LRBs） are chosen empirically to keep the size of the test patterns （sequences） relatively small and to reduce the decoding complexity. While there are also other adaptive techniques, where the decoder＇s LRBs adapt to the external parameter of the decoder like SNR （Signal Noise Ratio） level, a novel adaptive algorithm for BTC based on the statistics of an internal variable of the decoder itself is proposed in this paper. Different from the previous reported results, it collects the statistics of the multiplicity of the candidate sequences, i.e., the number of the same candidate sequences with the same minimum squared Euclidean distance resulted from the decoding of test sequences. It is shown by Monte Carlo simulations that the proposed adaptive algorithm has only about 0.02dB coding loss but the average complexity of the proposed algorithm is about 42% less compared with Pyndiah＇s iterative decoding algorithm using the fixed LRBs parameter.
