To achieve sparse sampling on a coded ultrasonic signal,the finite rate of innovation(FRI)sparse sampling technique is proposed on a binary frequency-coded(BFC)ultrasonic signal.A framework of FRI-based sparse samplin...To achieve sparse sampling on a coded ultrasonic signal,the finite rate of innovation(FRI)sparse sampling technique is proposed on a binary frequency-coded(BFC)ultrasonic signal.A framework of FRI-based sparse sampling for an ultrasonic signal pulse is presented.Differences between the pulse and the coded ultrasonic signal are analyzed,and a response mathematical model of the coded ultrasonic signal is established.A time-domain transform algorithm,called the high-order moment method,is applied to obtain a pulse stream signal to assist BFC ultrasonic signal sparse sampling.A sampling of the output signal with a uniform interval is then performed after modulating the pulse stream signal by a sampling kernel.FRI-based sparse sampling is performed using a self-made circuit on an aluminum alloy sample.Experimental results show that the sampling rate reduces to 0.5 MHz,which is at least 12.8 MHz in the Nyquist sampling mode.The echo peak amplitude and the time of flight are estimated from the sparse sampling data with maximum errors of 9.324%and 0.031%,respectively.This research can provide a theoretical basis and practical application reference for reducing the sampling rate and data volume in coded ultrasonic testing.展开更多
This paper consider Hexagonal-metric codes over certain class of finite fields. The Hexagonal metric as defined by Huber is a non-trivial metric over certain classes of finite fields. Hexagonal-metric codes are applie...This paper consider Hexagonal-metric codes over certain class of finite fields. The Hexagonal metric as defined by Huber is a non-trivial metric over certain classes of finite fields. Hexagonal-metric codes are applied in coded modulation scheme based on hexagonal-like signal constellations. Since the development of tight bounds for error correcting codes using new distance is a research problem, the purpose of this note is to generalize the Plotkin bound for linear codes over finite fields equipped with the Hexagonal metric. By means of a two-step method, the author presents a geometric method to construct finite signal constellations from quotient lattices associated to the rings of Eisenstein-Jacobi （E J） integers and their prime ideals and thus naturally label the constellation points by elements of a finite field. The Plotkin bound is derived from simple computing on the geometric figure of a finite field.展开更多
基金The National Natural Science Foundation of China (No.51375217)。
文摘To achieve sparse sampling on a coded ultrasonic signal,the finite rate of innovation(FRI)sparse sampling technique is proposed on a binary frequency-coded(BFC)ultrasonic signal.A framework of FRI-based sparse sampling for an ultrasonic signal pulse is presented.Differences between the pulse and the coded ultrasonic signal are analyzed,and a response mathematical model of the coded ultrasonic signal is established.A time-domain transform algorithm,called the high-order moment method,is applied to obtain a pulse stream signal to assist BFC ultrasonic signal sparse sampling.A sampling of the output signal with a uniform interval is then performed after modulating the pulse stream signal by a sampling kernel.FRI-based sparse sampling is performed using a self-made circuit on an aluminum alloy sample.Experimental results show that the sampling rate reduces to 0.5 MHz,which is at least 12.8 MHz in the Nyquist sampling mode.The echo peak amplitude and the time of flight are estimated from the sparse sampling data with maximum errors of 9.324%and 0.031%,respectively.This research can provide a theoretical basis and practical application reference for reducing the sampling rate and data volume in coded ultrasonic testing.
基金supported by 973 project under Grant No.2007CB807901the Fundamental Research Funds for the Central Universities under Grant Nos.YWFF-10-02-072 and YWF-10-01-A28
文摘This paper consider Hexagonal-metric codes over certain class of finite fields. The Hexagonal metric as defined by Huber is a non-trivial metric over certain classes of finite fields. Hexagonal-metric codes are applied in coded modulation scheme based on hexagonal-like signal constellations. Since the development of tight bounds for error correcting codes using new distance is a research problem, the purpose of this note is to generalize the Plotkin bound for linear codes over finite fields equipped with the Hexagonal metric. By means of a two-step method, the author presents a geometric method to construct finite signal constellations from quotient lattices associated to the rings of Eisenstein-Jacobi （E J） integers and their prime ideals and thus naturally label the constellation points by elements of a finite field. The Plotkin bound is derived from simple computing on the geometric figure of a finite field.
