Fountain codes are considered to be a promising coding technique in underwater acoustic communication（UAC） which is challenged with the unique propagation features of the underwater acoustic channel and the harsh ma...Fountain codes are considered to be a promising coding technique in underwater acoustic communication（UAC） which is challenged with the unique propagation features of the underwater acoustic channel and the harsh marine environment. And Luby transform（LT） codes are the first codes fully realizing the digital fountain concept. However, in conventional LT encoding/decoding algorithms, due to the imperfect coverage（IC） of input symbols and short cycles in the generator matrix, stopping sets would occur and terminate the decoding. Thus, the recovery probability is reduced,high coding overhead is required and decoding delay is increased.These issues would be disadvantages while applying LT codes in underwater acoustic communication. Aimed at solving those issues, novel encoding/decoding algorithms are proposed. First,a doping and non-uniform selecting（DNS） encoding algorithm is proposed to solve the IC and the generation of short cycles problems. And this can reduce the probability of stopping sets occur during decoding. Second, a hybrid on the fly Gaussian elimination and belief propagation（OFG-BP） decoding algorithm is designed to reduce the decoding delay and efficiently utilize the information of stopping sets. Comparisons via Monte Carlo simulation confirm that the proposed schemes could achieve better overall decoding performances in comparison with conventional schemes.展开更多
To improve the error correction performance, an innovative encoding structure with tail-biting for spinal codes is designed. Furthermore, an adaptive forward stack decoding(A-FSD) algorithm with lower complexity for s...To improve the error correction performance, an innovative encoding structure with tail-biting for spinal codes is designed. Furthermore, an adaptive forward stack decoding(A-FSD) algorithm with lower complexity for spinal codes is proposed. In the A-FSD algorithm, a flexible threshold parameter is set by a variable channel state to narrow the scale of nodes accessed. On this basis, a new decoding method of AFSD with early termination(AFSD-ET) is further proposed. The AFSD-ET decoder not only has the ability of dynamically modifying the number of stored nodes, but also adopts the early termination criterion to curtail complexity. The complexity and related parameters are verified through a series of simulations. The simulation results show that the proposed spinal codes with tail-biting and the AFSD-ET decoding algorithms can reduce the complexity and improve the decoding rate without sacrificing correct decoding performance.展开更多
To solve the problem of identification and measurement of two projectiles hitting the target at the same time,this paper proposes a projectile coordinate test method combining three photoelectric encoder detection scr...To solve the problem of identification and measurement of two projectiles hitting the target at the same time,this paper proposes a projectile coordinate test method combining three photoelectric encoder detection screens,and establishes a coordinate calculation model for two projectiles to reach the same detection screen at the same time.The design method of three photoelectric encoder detection screens and the position coordinate recognition algorithm of the blocked array photoelectric detector when projectile passing through the photoelectric encoder detection screen are studied.Using the screen projection method,the intersected linear equation of the projectile and the line laser with the main detection screen as the core coordinate plane is established,and the projectile coordinate data set formed by any two photoelectric encoder detection screens is constructed.The principle of minimum error of coordinate data set is used to determine the coordinates of two projectiles hitting the target at the same time.The rationality and feasibility of the proposed test method are verified by experiments and comparative tests.展开更多
Polar codes represent one of the major breakthroughs in 5G standard,and have been proven to be able to achieve the symmetric capacity of binary-input discrete memoryless channels using the successive cancellation list...Polar codes represent one of the major breakthroughs in 5G standard,and have been proven to be able to achieve the symmetric capacity of binary-input discrete memoryless channels using the successive cancellation list(SCL)decoding algorithm.However,the SCL algorithm suffers from a large amount of memory overhead.This paper proposes an adaptive simplified decoding algorithm for multiple cyclic redundancy check(CRC)polar codes.Simulation results show that the proposed method can reduce the decoding complexity and memory space.It can also acquire the performance gain in the low signal to noise ratio region.展开更多
A novel low-complexity weighted symbol-flipping algorithm with flipping patterns to decode nonbinary low-density parity-check codes is proposed. The proposed decoding procedure updates the hard-decision received symbo...A novel low-complexity weighted symbol-flipping algorithm with flipping patterns to decode nonbinary low-density parity-check codes is proposed. The proposed decoding procedure updates the hard-decision received symbol vector iteratively in search of a valid codeword in the symbol vector space. Only one symbol is flipped in each iteration, and symbol flipping function, which is employed as the symbol flipping metric, combines the number of failed checks and the reliabilities of the received bits and calculated symbols. A scheme to avoid infinite loops and select one symbol to flip in high order Galois field search is also proposed. The design of flipping pattern＇s order and depth, which is dependent of the computational requirement and error performance, is also proposed and exemplified. Simulation results show that the algorithm achieves an appealing tradeoff between performance and computational requirement over relatively low Galois field for short to medium code length.展开更多
A fast encoding algorithm based on the mean square error （MSE） distortion for vector quantization is introduced. The vector, which is effectively constructed with wavelet transform （WT） coefficients of images, can...A fast encoding algorithm based on the mean square error （MSE） distortion for vector quantization is introduced. The vector, which is effectively constructed with wavelet transform （WT） coefficients of images, can simplify the realization of the non-linear interpolated vector quantization （NLIVQ） technique and make the partial distance search （PDS） algorithm more efficient. Utilizing the relationship of vector L2-norm and its Euclidean distance, some conditions of eliminating unnecessary codewords are obtained. Further, using inequality constructed by the subvector L2-norm, more unnecessary codewords are eliminated. During the search process for code, mostly unlikely codewords can be rejected by the proposed algorithm combined with the non-linear interpolated vector quantization technique and the partial distance search technique. The experimental results show that the reduction of computation is outstanding in the encoding time and complexity against the full search method.展开更多
In order to optionally regulate embedding capacity and embedding transparency according to user's requirements in voice-over-IP(VoIP) steganography,a dynamic matrix encoding strategy(DMES) was presented.Differing ...In order to optionally regulate embedding capacity and embedding transparency according to user's requirements in voice-over-IP(VoIP) steganography,a dynamic matrix encoding strategy(DMES) was presented.Differing from the traditional matrix encoding strategy,DMES dynamically chose the size of each message group in a given set of adoptable message sizes.The appearance possibilities of all adoptable sizes were set in accordance with the desired embedding performance(embedding rate or bit-change rate).Accordingly,a searching algorithm that could provide an optimal combination of appearance possibilities was proposed.Furthermore,the roulette wheel algorithm was employed to determine the size of each message group according to the optimal combination of appearance possibilities.The effectiveness of DMES was evaluated in StegVoIP,which is a typical covert communication system based on VoIP.The experimental results demonstrate that DMES can adjust embedding capacity and embedding transparency effectively and flexibly,and achieve the desired embedding performance in any case.For the desired embedding rate,the average errors are not more than 0.000 8,and the standard deviations are not more than 0.002 0;for the desired bit-change rate,the average errors are not more than 0.001 4,and the standard deviations are not more than 0.002 6.展开更多
Oncolysate, a debris of tumor cells, has been provento be effective in tumor active immunotherapy, it wasreported that the vaccinia virus, especially recombinantvaccinia viruses encoding human IL-2 (rVV-IL-2 ),enhance...Oncolysate, a debris of tumor cells, has been provento be effective in tumor active immunotherapy, it wasreported that the vaccinia virus, especially recombinantvaccinia viruses encoding human IL-2 (rVV-IL-2 ),enhanced the immunogenicity of transfected tumor cells.In this experiment, the murine melanoma cell B16-F10oncolysates trans fected by rVV-IL-2 (IL-2VBO) wereused as vaccine. The IL-2VBO or TK-VBO was preparedby incubating B16-F10 cells with rVV-IL-2 or rVV-TK展开更多
It is well known that turbo decoding always begins from the first component decoder and supposes that the apriori information is '0' at the first iterative decoding. To alternatively start decoding at two comp...It is well known that turbo decoding always begins from the first component decoder and supposes that the apriori information is '0' at the first iterative decoding. To alternatively start decoding at two component decoders, we can gain two soft output values for the received observation of an input bit. It is obvious that two soft output values comprise more sufficient extrinsic information than only one output value obtained in the conventional scheme since different start points of decoding result in different combinations of the a priori information and the input codewords with different symbol orders due to the permutation of an interleaver. Summarizing two soft output values for erery bit before making hard decisions, we can correct more errors due to their complement. Consequently, turbo codes can achieve better error correcting performance than before in this way. Simulation results show that the performance of turbo codes using the novel proposed decoding scheme can get a growing improvement with the increment of SNR in general compared to the conventional scheme. When the bit error probability is 10-5 , the proposed scheme can achieve 0.5 dB asymptotic coding gain or so under the given simulation conditions.展开更多
基金supported by the National Natural Science Foundation of China(61371099)the Fundamental Research Funds for the Central Universities of China(HEUCF150812/150810)
文摘Fountain codes are considered to be a promising coding technique in underwater acoustic communication（UAC） which is challenged with the unique propagation features of the underwater acoustic channel and the harsh marine environment. And Luby transform（LT） codes are the first codes fully realizing the digital fountain concept. However, in conventional LT encoding/decoding algorithms, due to the imperfect coverage（IC） of input symbols and short cycles in the generator matrix, stopping sets would occur and terminate the decoding. Thus, the recovery probability is reduced,high coding overhead is required and decoding delay is increased.These issues would be disadvantages while applying LT codes in underwater acoustic communication. Aimed at solving those issues, novel encoding/decoding algorithms are proposed. First,a doping and non-uniform selecting（DNS） encoding algorithm is proposed to solve the IC and the generation of short cycles problems. And this can reduce the probability of stopping sets occur during decoding. Second, a hybrid on the fly Gaussian elimination and belief propagation（OFG-BP） decoding algorithm is designed to reduce the decoding delay and efficiently utilize the information of stopping sets. Comparisons via Monte Carlo simulation confirm that the proposed schemes could achieve better overall decoding performances in comparison with conventional schemes.
基金supported by the National Natural Science Foundation of China (61701020)the Scientific and Technological Innovation Foundation of Shunde Graduate School,USTB (BK19BF009)。
文摘To improve the error correction performance, an innovative encoding structure with tail-biting for spinal codes is designed. Furthermore, an adaptive forward stack decoding(A-FSD) algorithm with lower complexity for spinal codes is proposed. In the A-FSD algorithm, a flexible threshold parameter is set by a variable channel state to narrow the scale of nodes accessed. On this basis, a new decoding method of AFSD with early termination(AFSD-ET) is further proposed. The AFSD-ET decoder not only has the ability of dynamically modifying the number of stored nodes, but also adopts the early termination criterion to curtail complexity. The complexity and related parameters are verified through a series of simulations. The simulation results show that the proposed spinal codes with tail-biting and the AFSD-ET decoding algorithms can reduce the complexity and improve the decoding rate without sacrificing correct decoding performance.
基金supported by National Natural Science Foundation of China(Grant No.62073256)Shaanxi Provincial Science and Technology Department(Grant No.2023-YBGY-342)。
文摘To solve the problem of identification and measurement of two projectiles hitting the target at the same time,this paper proposes a projectile coordinate test method combining three photoelectric encoder detection screens,and establishes a coordinate calculation model for two projectiles to reach the same detection screen at the same time.The design method of three photoelectric encoder detection screens and the position coordinate recognition algorithm of the blocked array photoelectric detector when projectile passing through the photoelectric encoder detection screen are studied.Using the screen projection method,the intersected linear equation of the projectile and the line laser with the main detection screen as the core coordinate plane is established,and the projectile coordinate data set formed by any two photoelectric encoder detection screens is constructed.The principle of minimum error of coordinate data set is used to determine the coordinates of two projectiles hitting the target at the same time.The rationality and feasibility of the proposed test method are verified by experiments and comparative tests.
基金supported by the National Key R&D Program of China(2018YFB2101300)the National Science Foundation of China(61973056)
文摘Polar codes represent one of the major breakthroughs in 5G standard,and have been proven to be able to achieve the symmetric capacity of binary-input discrete memoryless channels using the successive cancellation list(SCL)decoding algorithm.However,the SCL algorithm suffers from a large amount of memory overhead.This paper proposes an adaptive simplified decoding algorithm for multiple cyclic redundancy check(CRC)polar codes.Simulation results show that the proposed method can reduce the decoding complexity and memory space.It can also acquire the performance gain in the low signal to noise ratio region.
文摘A novel low-complexity weighted symbol-flipping algorithm with flipping patterns to decode nonbinary low-density parity-check codes is proposed. The proposed decoding procedure updates the hard-decision received symbol vector iteratively in search of a valid codeword in the symbol vector space. Only one symbol is flipped in each iteration, and symbol flipping function, which is employed as the symbol flipping metric, combines the number of failed checks and the reliabilities of the received bits and calculated symbols. A scheme to avoid infinite loops and select one symbol to flip in high order Galois field search is also proposed. The design of flipping pattern＇s order and depth, which is dependent of the computational requirement and error performance, is also proposed and exemplified. Simulation results show that the algorithm achieves an appealing tradeoff between performance and computational requirement over relatively low Galois field for short to medium code length.
基金the National Natural Science Foundation of China (60602057)the NaturalScience Foundation of Chongqing Science and Technology Commission (2006BB2373).
文摘A fast encoding algorithm based on the mean square error （MSE） distortion for vector quantization is introduced. The vector, which is effectively constructed with wavelet transform （WT） coefficients of images, can simplify the realization of the non-linear interpolated vector quantization （NLIVQ） technique and make the partial distance search （PDS） algorithm more efficient. Utilizing the relationship of vector L2-norm and its Euclidean distance, some conditions of eliminating unnecessary codewords are obtained. Further, using inequality constructed by the subvector L2-norm, more unnecessary codewords are eliminated. During the search process for code, mostly unlikely codewords can be rejected by the proposed algorithm combined with the non-linear interpolated vector quantization technique and the partial distance search technique. The experimental results show that the reduction of computation is outstanding in the encoding time and complexity against the full search method.
基金Project(2009AA01A402) supported by the National High-Tech Research and Development Program of ChinaProject(NCET-06-0650) supported by Program for New Century Excellent Talents in University Project(IRT-0725) supported by Program for Changjiang Scholars and Innovative Research Team in Chinese University
文摘In order to optionally regulate embedding capacity and embedding transparency according to user's requirements in voice-over-IP(VoIP) steganography,a dynamic matrix encoding strategy(DMES) was presented.Differing from the traditional matrix encoding strategy,DMES dynamically chose the size of each message group in a given set of adoptable message sizes.The appearance possibilities of all adoptable sizes were set in accordance with the desired embedding performance(embedding rate or bit-change rate).Accordingly,a searching algorithm that could provide an optimal combination of appearance possibilities was proposed.Furthermore,the roulette wheel algorithm was employed to determine the size of each message group according to the optimal combination of appearance possibilities.The effectiveness of DMES was evaluated in StegVoIP,which is a typical covert communication system based on VoIP.The experimental results demonstrate that DMES can adjust embedding capacity and embedding transparency effectively and flexibly,and achieve the desired embedding performance in any case.For the desired embedding rate,the average errors are not more than 0.000 8,and the standard deviations are not more than 0.002 0;for the desired bit-change rate,the average errors are not more than 0.001 4,and the standard deviations are not more than 0.002 6.
文摘Oncolysate, a debris of tumor cells, has been provento be effective in tumor active immunotherapy, it wasreported that the vaccinia virus, especially recombinantvaccinia viruses encoding human IL-2 (rVV-IL-2 ),enhanced the immunogenicity of transfected tumor cells.In this experiment, the murine melanoma cell B16-F10oncolysates trans fected by rVV-IL-2 (IL-2VBO) wereused as vaccine. The IL-2VBO or TK-VBO was preparedby incubating B16-F10 cells with rVV-IL-2 or rVV-TK
文摘It is well known that turbo decoding always begins from the first component decoder and supposes that the apriori information is '0' at the first iterative decoding. To alternatively start decoding at two component decoders, we can gain two soft output values for the received observation of an input bit. It is obvious that two soft output values comprise more sufficient extrinsic information than only one output value obtained in the conventional scheme since different start points of decoding result in different combinations of the a priori information and the input codewords with different symbol orders due to the permutation of an interleaver. Summarizing two soft output values for erery bit before making hard decisions, we can correct more errors due to their complement. Consequently, turbo codes can achieve better error correcting performance than before in this way. Simulation results show that the performance of turbo codes using the novel proposed decoding scheme can get a growing improvement with the increment of SNR in general compared to the conventional scheme. When the bit error probability is 10-5 , the proposed scheme can achieve 0.5 dB asymptotic coding gain or so under the given simulation conditions.
