Abstract: Example embodiments of the present disclosure relate to a device, method, apparatus and computer readable storage medium for reusing control resources for data transmission. In example embodiments, if downlink data is to be transmitted to a terminal device, a network device determines a control resource set associated with the terminal device in a control resource region. The network device selects, from the control resource set, localized control resources for control information associated with the downlink data, and selects data resources for the downlink data in the control resource region and a data resource region. The network device transmits the control information to the terminal device by using the localized control resources, and transmits the downlink data to the terminal device by using the data resources.

Abstract: An ultrasonic blood flow imaging display method and an ultrasonic imaging system. The system comprises: a probe (1); a transmitting circuit (2), configured to excite the probe (1) to transmit an ultrasonic beam to a scanning target; a receiving circuit (4) and a beam forming module (5), configured to receive an echo of the ultrasonic beam to obtain an ultrasonic echo signal; a data processing module (9), configured to obtain, according to the ultrasonic echo signal, blood flow velocity vector information and Doppler blood flow velocity information about a target point in the scanning target and at least part of ultrasonic images of the scanning target, and superposing the ultrasonic images and the Doppler blood flow velocity information to form a Doppler color blood flow graph; and a display (8), configured to contrastively display the blood flow velocity vector information and the Doppler color blood flow graph.

Abstract: The present invention relates to burst mode digital communication systems where data transmission is preceded by a preamble for acquisition of carrier and clock synchronization using maximum likelihood (ML) principle. The preamble is sampled and the set of samples obtained is processed using the optimization algorithms of the present invention to provide the ML timing estimate. The optimization algorithms in the present invention consist of three parts. The first part deals with isolating the desired optimal estimate from non-optimal extremes satisfying the same necessary condition, and provides the initial conditions for activating the binary search schemes. The second part performs the binary search for the optimal timing estimate that guarantees the convergence. On the basis of the obtained iterative sequence, the last part constructs a more rapidly convergent sequence to obtain the ML symbol timing estimate.

Abstract: The present invention provides a method to achieve frame synchronization from a received data sequence before the carrier phase and frequency offset recovery for any MPSK modulated signals on the basis of maximum likelihood theory. Two overhead configurations are considered in developing the frame synchronization algorithms. One overhead configuration consists of a unique word followed by a preamble, and the other consists of unique word only. For the first overhead, the frame synchronization can be decoupled from carrier recovery because the preamble following the unique word is a known sequence pattern. In this case, the maximum-likelihood frame synchronization rule is simply a complex correlation. In second overhead, the unique word is immediately followed by random traffic data and thus the coupling effects are generated between frame synchronization and carrier recovery. These coupling effects are not dominant, however, and may be neglected in actual practice.

Abstract: The present invention relates to burst mode digital communication systems where data transmission is preceded by a preamble for acquisition of carrier and clock synchronization using maximum likelihood (ML) principle. The preamble is sampled and the set of samples obtained is processed using the optimization algorithms of the present invention to provide the ML timing estimate. The optimization algorithms in the present invention consist of three parts. The first part deals with isolating the desired optimal estimate from non-optimal extremes satisfying the same necessary condition, and provides the initial conditions for activating the binary search schemes. The second part performs the binary search for the optimal timing estimate that guarantees the convergence. On the basis of the obtained iterative sequence, the last part constructs a more rapidly convergent sequence to obtain the ML symbol timing estimate.