Packet acquisition in upstream transmission of the DOCSIS standard

In upstream transmission of the DOCSIS (data over cable service interface specification) 1.0/1.1 and the TDMA mode of DOCSIS 2.0 standard, a packet begins with a preamble, the length and value of which are programmable by the headend. The acquisition process includes packet detection, symbol timing estimation, carrier frequency offset estimation and carrier phase estimation by means of the preamble so that the following information packet can be correctly demodulated. Methods to solve these tasks are not subject to standardization and are left to the system designer. However, they have a great impact on the system performance and thus are key elements for implementation. We present dedicated algorithms. A specific preamble is created and the corresponding scheme for packet acquisition is described in some detail. The packet detecting algorithm is independent of the carrier and symbol timing. The symbol timing estimate is obtained by using the minimum mean square algorithm regardless of the carrier frequency deviation and carrier phase. Algorithms for estimating the carrier frequency offset and carrier phase are proposed. Computer simulation results are given for all algorithms presented.     

Breakdown probabilities for thin heterostructure avalanche photodiodes

The recurrence theory for the breakdown probability in avalanche photodiodes (APDs) is generalized to heterostructure APDs that may have multiple multiplication layers. The generalization addresses layer-boundary effects such as the initial energy of injected carriers as well as the layer-dependent profile of the dead space in the multiplication region. Reducing the width of the multiplication layer serves to both downshift and sharpen the breakdown probability curve as a function of the applied reverse-bias voltage. In structures where the injected carriers have an initial energy that is comparable to the ionization threshold energy, the transition from linear mode to Geiger-mode is more abrupt than in structures in which such initial energy is negligible. The theory is applied to two recently fabricated Al/sub 0.6/Ga/sub 0.4/As-GaAs heterostructure APDs and to other homostructure thin GaAs APDs and the predictions of the breakdown-voltage thresholds are verified.     

An extended cyclic MUSIC algorithm

Many modulated communication signals exhibit a cyclostationarity (or periodic correlation) property, corresponding to the underlying periodicity arising from carrier frequencies or baud rates. In this paper, we propose a new MUSIC-like direction-finding algorithm that exploits cyclostationarity in order to improve the direction-of-arrival (DOA) estimation. Both cyclic and conjugate cyclic correlation matrices are used in the proposed method so that it can be considered as an extension of the cyclic MUSIC algorithm . The proposed cyclic method allows an increase in resolution power and noise robustness. Depending on the modulation type of incoming signals, the proposed method is also able to handle more sources than the number of sensors.     

Minimization of switching activities of partial products for designing low-power multipliers

This work presents low-power 2's complement multipliers by minimizing the switching activities of partial products using the radix-4 Booth algorithm. Before computation for two input data, the one with a smaller effective dynamic range is processed to generate Booth codes, thereby increasing the probability that the partial products become zero. By employing the dynamic-range determination unit to control input data paths, the multiplier with a column-based adder tree of compressors or counters is designed. To further reduce power consumption, the two multipliers based on row-based and hybrid-based adder trees are realized with operations on effective dynamic ranges of input data. Functional blocks of these two multipliers can preserve their previous input states for noneffective dynamic data ranges and thus, reduce the number of their switching operations. To illustrate the proposed multipliers exhibiting low-power dissipation, the theoretical analyzes of switching activities of partial products are derived. The proposed 16 /spl times/ 16-bit multiplier with the column-based adder tree conserves more than 31.2%, 19.1%, and 33.0% of power consumed by the conventional multiplier, in applications of the ADPCM audio, G.723.1 speech, and wavelet-based image coders, respectively. Furthermore, the proposed multipliers with row-based, hybrid-based adder trees reduce power consumption by over 35.3%, 25.3% and 39.6%, and 33.4%, 24.9% and 36.9%, respectively. When considering product factors of hardware areas, critical delays and power consumption, the proposed multipliers can outperform the conventional multipliers. Consequently, the multipliers proposed herein can be broadly used in various media processing to yield low-power consumption at limited hardware cost or little slowing of speed.     

乙苯/苯乙烯塔分离效率问题的技术分析及整改措施

分析了齐鲁分公司200kt/a乙苯/苯乙烯装置乙苯/苯乙烯塔(T-401)分离效率低的原因,即降液管设计偏小,液体在降液管内流速过快,引起液体飞溅;安装分布器使用的石棉垫片溶胀而粉碎后堵塞了分布槽;分布器上使用的垫片脱落形成缝隙而漏液;填料装得不密实,留有缝隙;二级分布槽变形等.针对存在问题提出了相应的整改措施,并考察了整改措施实施效果.结果表明,整改后该塔的分离能力满足了工艺要求,并有一定的操作弹性.     

IMAGE仪器MRX站A/D板电路分析及故障排除

通过对IMAGE仪器MRX站A／D板的电路分析，利用综合测试和分析诊断程序，并借助示波器和万用表，针对不同的故障，找出A／D板产生故障的根源，切实有效地排除故障。     

适于复杂信息融合系统的近似联合概率数据关联算法

文中在B.Zhou提出的直接概率计算(DC)和近似概率计算(AC)算法基础上提出了一种新的近似多传感器多目标联合概率数据关联算法。近似概率法是以一个目标为中心的近似聚为构造互联事件的起点，并在计算中将DC和AC结合得到的一种全邻的点迹—航迹关联算法，它能有效地提高目标点迹—航迹的关联正确率，在计算时耗上较完全联合概率法快得多，能满足工程中实时性的要求。将其在杂波下目标密集、航迹复杂的数据融合系统中进行实验，对关联正确率，关联耗时等与最近邻法进行了比较，效果较好。     

三维表层有限差分层析成像

利用三维地震资料中的大炮初至 ,对三维复杂地表模型给出了一种表层层析成像方法。正演采用快速的有限差分求解程函方程的方法求取旅行时 ,利用旅行时的负梯度方向求取射线路径。考虑到三维模型反演具有计算量大 ,需要巨大内存的特点 ,反演采用一种拟梯度法 ,可以节省内存及计算量。数值模拟结果验证了方法的有效性。     

Joint coding-precoding with low-complexity turbo-decoding

We combine error-control coding with linear precoding (LP) for flat-fading channels, as well as for wireless orthogonal frequency-division multiplexing transmissions through frequency-selective fading channels. The performance is analyzed and compared with the corresponding error-control-coded system without precoding. By wedding LP with conventional error-control coding, the diversity order becomes equal to the error-control code's minimum Hamming distance times the precoder size. We also derive a low-complexity turbo-decoding algorithm for joint coded-precoded transmissions. We analyze the decoding complexity and compare it with an error-control-coded system without LP. Extensive simulations with convolutional and turbo codes for HiperLan/2 channels support the analysis and demonstrate superior performance of the proposed system.