长脉冲相对论速调管放大器杂频振荡的分析与抑制

分析了S波段长脉冲相对论速调管放大器(RKA)输出微波杂频振荡和功率波形包络振荡的主要根源,采用粒子模拟程序对RKA电子束尺寸和阻抗、群聚距离、输出腔有载Q值、引导磁场、注入微波等参数的调节,有效抑制了杂频振荡.根据分析结果开展了相应的实验研究,得到了较好的实验结果,输出微波由300MW提高到540MW,脉宽由50ns提高到120ns,辐射微波重复频率20Hz,束波转换效率30%,杂频振荡得到了有效抑制.

关于电源中电磁杂频谐波对用电设备的干扰和危害——隆宇专利新产品AC宽带正弦波净化器魔块与魔术插座

当今信息社会,各种类型的用电设备越来越多,工作于不同频率的各种设备频繁地在开或关,使电网电压大幅度频繁的高、低波动变化,不断产生着各种杂频谐波,尤其是电动机、空调、热水器、数码设备、大功率舞台灯光调控、开关电源、变频器的调控、电台发射机的电磁辐射,这些设备在工作时,大量的强脉冲尖峰干扰杂谐波,通过供电电网相互调制,越来越厉害地劣化和污染着我们供电网中电能的波形相位、对称性和传输效率,严重地影响我们的音响、彩电、计算机、仪表、仪器、网络控制设备的正常运行,特别是对在一个供电变压器下线区域范围供电的各种通讯、电台、机场、网络办公场地、商场、宾馆、娱乐场所、影剧院、生活小区、学校、工矿造成的的相互危害性更大.

X波段长脉冲多注相对论速调管放大器杂模振荡抑制

为进一步提高相对论速调管放大器(RKA)的工作频率和输出功率,开展了X波段GW级长脉冲多注RKA实验研究,对实验中出现的杂模振荡现象进行了模拟和实验分析。结果表明,电子回流是导致实验中出现杂模振荡的主要因素,采取了相应措施减少电子回流从而抑制杂模振荡,实现多注RKA输出微波功率约为0.98GW,脉宽为95ns,频率为9.405GHz。

无光滤波六倍频微波信号产生的系统设计

基于两个级联偏振调制器,提出了一种高频谱纯度、稳定的六倍频微波信号产生方法。该方法通过适当调整偏振片的偏振方向、射频驱动信号电压和相位,实现无光滤波器条件下、任何波段六倍频微波信号的产生。利用Optisystem平台搭建的仿真系统,以S波段4GHz信号为例,验证了该设计系统产生的六倍频信号质量,并分析了非理想射频驱动电压和相位对六倍频信号质量的影响,结果表明:该设计系统能产生最大光边带抑制比、射频无杂散抑制比分别为21.3,15.2dB的六倍频微波信号;且非理想驱动电压和相位差的偏离应控制在理想值±5%的范围之内。

S波段四腔相对论速调管放大器的整管性能

在速调管放大器中,中间谐振腔一方面可以提高器件的放大增益,另一方面也容易产生杂频振荡,影响器件正常工作。针对这种杂频振荡的影响,在三腔相对论速调管的基础上发展了四腔相对论速调管。采用PIC粒子模拟软件从整管上对四腔强流相对论速调管放大器的冷腔结构、束波互作用、微波提取等方面进行研究。为得到输出功率和效率的最优值,结构上采用低互作用输入腔,设计了阶梯状结构漂移管,通过对输出腔作用间歇进行优化处理抑制电子回流。模拟结果表明整管微波模拟输出功率达了3.7 GW,效率22%,增益56 dB,1 dB带宽74 MHz,并实现了对杂频振荡的抑制。

CDMA和GSM网络无线干扰研究

该文介绍了中国移动GSM网络和中国联通CDMA网络网间无线干扰的分类,分析了干扰产生的机理,并初步提出了解决方案。

隆宇AC无电感宽带正弦波净化再生魔块实用方法介绍

传统电感式LC滤波器是将杂频干扰波对地进行旁路滤除,而本技术是将杂频干扰波与50Hz工频波一起调制成同步、同相的对称正弦的倍频波新能量,对杂频干扰波进行回收利用,变废为宝,实质上本产品已不是滤波器了,而应该叫AC净化再生器或AC调制器或转换器。自本专利魔块问世一年多来已受到各个领域读者的钟爱。 经实验测定与用户大量使用后的信息反馈证明:本产品除了以净化再生的性能全面提升音响的音质。

FREQUENCY ESTIMATION OF SINUSIODE FROM WIDEBAND USING SUB-NYQUIST SAMPLING

A novel frequency estimation algorithm for wideband signal with sub-Nyquist sampling is proposed in this paper. With the aid of information provided by the auxiliary delayed sampling channel and the aliased frequency estimation for wideband signal with sub-Nyquist sampling, the frequency aliasing due to sub-Nyquist sampling can be solved. This method can reduce the complexity of the overall hardware at the cost of an auxiliary sampling channel. Furthermore, in order to alleviate the computation burden for its practicability, a more simplified algorithm is put forward and its validity is proved by our numerical simulation results. The Cramer-Rao Lower Bound (CRLB) of the frequency estimation is also derived at the end of this paper.

A Symbol Timing Recovery Algorithm of M-PSK Signals for Burst Modem Applications with Small Packet Size

Feedforward symbol timing recovery techniques are particularly important for initial acquisition in burst modems. However, these techniques either have large calculation burden or sensitive to frequency offsets. In this paper, we proposed an efficient symbol timing recovery algorithm of MPSK signals named OMQ(Ordered Maximum power using Quadratic approximation partially) algorithm which is based on the Quadratic Approximation(QA) algorithm. We used ordered statistic sorting method to reduce the computational complexity further, meanwhile maximum mean power principle was used to decrease frequency offset sensitivity. The proposed algorithm adopts estimation-down sampling structure which is suitable for small packet size transmission. The results show that, while comparing with the QA algorithm, the computational complexity is reduced by 75% at most when 8 samples per symbol are used. The proposed algorithm shows better performance in terms of the jitter variance and sensitivity to frequency offsets.

Efficient fast mode decision using mode complexity for multi-view video coding

The variable block-size motion estimation(ME) and disparity estimation(DE) are adopted in multi-view video coding(MVC) to achieve high coding efficiency. However, much higher computational complexity is also introduced in coding system, which hinders practical application of MVC. An efficient fast mode decision method using mode complexity is proposed to reduce the computational complexity. In the proposed method, mode complexity is firstly computed by using the spatial, temporal and inter-view correlation between the current macroblock(MB) and its neighboring MBs. Based on the observation that direct mode is highly possible to be the optimal mode, mode complexity is always checked in advance whether it is below a predefined threshold for providing an efficient early termination opportunity. If this early termination condition is not met, three mode types for the MBs are classified according to the value of mode complexity, i.e., simple mode, medium mode and complex mode, to speed up the encoding process by reducing the number of the variable block modes required to be checked. Furthermore, for simple and medium mode region, the rate distortion(RD) cost of mode 16×16 in the temporal prediction direction is compared with that of the disparity prediction direction, to determine in advance whether the optimal prediction direction is in the temporal prediction direction or not, for skipping unnecessary disparity estimation. Experimental results show that the proposed method is able to significantly reduce the computational load by 78.79% and the total bit rate by 0.07% on average, while only incurring a negligible loss of PSNR(about 0.04 d B on average), compared with the full mode decision(FMD) in the reference software of MVC.

Complexity scalable control algorithm for intra coding in H.264 under energy constraints

In this paper, the complexity of intra coding is first analyzed so as to achieve a weight of complexity measurement for each intra mode. Then, a new complexity scalable control algorithm for intra coding in H. 264 is proposed, based on the rearrangement of the order of candidate modes and an efficient complexity allocation and control （CAAC） scheme at the macroblock （MB） level. The candidate modes of each MB are rearranged according to the local-edge information. Experimental results show that our proposed algorithm can make an appropriate cut-off point of the candidate modes sequence adaptively according to the current energy condition of a mobile device, so as to adjust the complexity at any level while maximizing the video quality, which can prolong the operational lifetime of the battery with minimum degradation in video quality.

Joint Timing and Frequency Synchronization for OFDM based on Fractional Fourier Transform

In this paper a joint timing and frequency synchronization method based on Fractional Fourier Transform （FIFT） is proposed for Orthogonal Frequency-Division Multiplexing （OFDM） system. The combination of two chirp signals with opposite chirp rates are used as the training signal, the received training signal with timing and frequency offset is transformed by FrFT and the two peaks representing two chirps in FrFT domain are detected, then the position coordinates of the two peaks are precisely corrected and substituted into an equation group to calculate timing and frequency offset simultaneously. This method only needs one FrFT calculation to implement synchronization, the computational complexity is equal to that of FFT and less than that of correlation or maximum likelihood calculation of existing methods, and estimation range of frequency offset is Large, greater than half the signal bandwidth, while the simulation results show that even at low SNR it can accurately estimate timing and frequency offset and the estimation error is less than that of existing methods.

A Novel Two-step Frequency Offset Estimator for OFDM

Based on an orthogonal frequency division multiplexing(OFDM) training symbol with L identical parts, a novel carrier frequency offset (CFO) estimator is proposed for OFDM systems. The CFO is estimated in two steps, fine estimate and coarse estimate. In the first step, the fine estimation is performed based on the principle of minimum variance. However, the fine estimation has ambiguity since its estimate range is limited. In the second step, the coarse estimation is obtained, which results in a larger estimate range but less precision. Using the coarse estimation, the ambiguity of fine estimation is resolved. To fully use the correlation among L identical parts, the fine estimation resolved the ambiguity and the coarse estimation are optimally combined to obtain the final estimation. Furthermore, the estimation variance of the proposed method is derived. Simulation results demonstrate that the novel two-step estimator outperforms the conventional two-step estimator in terms of estimate performance and computational complexity.

Real-Time Implementation for Reduced-Complexity LDPC Decoder in Satellite Communication

In this paper,it has proposed a realtime implementation of low-density paritycheck(LDPC) decoder with less complexity used for satellite communication on FPGA platform.By adopting a(2048.4096)irregular quasi-cyclic(QC) LDPC code,the proposed partly parallel decoding structure balances the complexity between the check node unit(CNU) and the variable node unit(VNU) based on min-sum(MS) algorithm,thereby achieving less Slice resources and superior clock performance.Moreover,as a lookup table(LUT) is utilized in this paper to search the node message stored in timeshare memory unit,it is simple to reuse and save large amount of storage resources.The implementation results on Xilinx FPGA chip illustrate that,compared with conventional structure,the proposed scheme can achieve at last 28.6%and 8%cost reduction in RAM and Slice respectively.The clock frequency is also increased to 280 MHz without decoding performance deterioration and convergence speed reduction.

Frequency Effect of Formulaic Sequences on CAF in Academic Writing:Examples from L2 Master’s Theses

This study was conducted to explore the individual uses of formulaic sequence(FS)frequency and their effects on complexity,accuracy,and fluency(CAF)in academic writing.Data was collected from the conclusion sections of a self-compiled corpus of 30 L2 master’s theses.Statistical analysis revealed several notable conclusions.1)Student writers tend to make repetitive use of particular FSs in single texts.2)FS use has a significant frequency effect on fluency,and the high-frequency group slightly outperforms the low-frequency group.3)FS use has a certain frequency effect on accuracy,and the high-frequency group demonstrates the strongest correlation between FS frequency and accuracy.4)FS use has a significant frequency effect on lexical complexity,and the low-frequency group slightly outperforms the high-frequency group.In the low-frequency group,FS use has a significant frequency effect on syntactic complexity as well.Finally,5)The results support Skehan’s trade-off effect,a competition between CAF,which,to a certain degree,is affected by individual uses of FS frequency.The low-frequency group displays a greater trade-off effect than the high-frequency group.

A new phase comparison pilot protection based on wavelet transform

Current phase comparison based pilot protection had been generally utilized as primary protection of the transmission lines in China from the 1950＇s to the 1980＇ s, Comentional phase comparison pilot protection has a long phase comparison time, which results in a longer fault-clearing time. This paper proposes a new current phase comparison, pilot protection scheme that is based on non-power frequency fauh eun＇ent component. The phase of the fourth harmonic eun＇ent of each end of the protected line has heen abstracted hy utilizing complex wavelet transformation and then compared in order to determine whether the inner fauh occurs or not. This way can greatly deerease fauh-elearing time and improve performances of this pilot protection when fault occurs under the heavy-load current and asymmetrical operation eonditions, Many EMTP simulations have verified the proposed scheme＇s correctness and effectiveness.

Fast Motion Estimation Algorithm with Edge Alignment for H.264 Encoder

Image sequences processing and video encoding are extremely time consuming problems. The time complexity of them depends on image contents. This paper presents an estimation of a block motion method for video coding with edge alignment. This method uses blocks of size 4 × 4 and its basic idea is to find motion vector using the edge position in each video coding block. The method finds the motion vectors more accurately and faster than any known classical method that calculates all the possibilities. Our presented algorithm is compared with known classical algorithms using the evaluation function of the peak signal-to-noise ratio. For comparison of the methods we are using parameters such as time, CPU usage, and size of compressed data. The comparison is made on benchmark data in color format YUV. Results of our proposed method are comparable and in some cases better than results of standard classical algorithms.

AN IMPROVED ALL ZERO BLOCK FINDING METHOD BASED ON THE STATISTIC CHARACTERISTICS OF DCT TRANSFORM COEFFICIENTS

In the H.263 video codec related systems, motion estimation and Discrete Cosine Transform (DCT) have the most computational requirements. In order to reduce complexity of the encoder to dedicate more resources to other functions, according to the study of existing methods, an Improved All Zero Block Finding (IAZBF) method based on the statistic characteristics of DCT coefficients is proposed. Compared with existing methods, IAZBF improves the detecting efficiency by about 50% without importing too much extra computation requirement. Being computed with additions and shifts instead of complicated multiplications, IAZBF is of low computation complexity, especially for low-end processors. In addition, IAZBF upholds picture fidelity and remains compatible with the H.263 bitstream standard.