一种联合信源信道匹配的视频传输方法

介绍了一种实现联合信源-信道编码的通用的新方法—联合信源-信道匹配。该方法思想巧妙,通过将有限的通信系统资源在信源和信道编码器之间进行巧妙合理的分配,从而获得最优的系统整体传输性能。并且,该方法并不仅局限于特定的信源-信道编码器对,可适用于任何一种信源-信道编码器对共享有限系统资源的情况,具有很好的通用性。仿真实验证明了JSCM通用视频传输系统能获得比传统的固定码率分配系统更高的整体性能增益。     

On the average complexity of 3D-Voronoi diagrams of random points on convex polytopes

It is well known that the complexity, i.e. the number of vertices, edges and faces, of the 3-dimensional Voronoi diagram of n points can be as bad as Θ(n²). It is also known that if the points are chosen Independently Identically Distributed uniformly from a 3-dimensional region such as a cube or sphere, then the expected complexity falls to O(n). In this paper we introduce the problem of analyzing what occurs if the points are chosen from a 2-dimensional region in 3-dimensional space. As an example, we examine the situation when the points are drawn from a Poisson distribution with rate n on the surface of a convex polytope. We prove that, in this case, the expected complexity of the resulting Voronoi diagram is O(n).     

VLSI Implementation of Forward Error Control Technique for ATM Networks

In asynchronous transfer mode (ATM) networks, fixed length cells of 53 bytes are transmitted. A cell may be discarded during transmission due to buffer overflow or a detection of errors. Cell discarding seriously degrades transmission quality. The quality degradation can be reduced by employing efficient forward error control (FEC) to recover discarded cells. In this paper, we present the design and implementation of decoding equipment for FEC in ATM networks based on a single parity check (SPC) product code using very‐large‐scale integration (VLSI) technology. FEC allows the destination to reconstruct missing data cells by using redundant parity cells that the source adds to each block of data cells. The functionality of the design has been tested using the Model Sim 5.7cXE Simulation Package. The design has been implemented for a 5 ° 5 matrix of data cells in a Virtex‐E XCV 3200E FG1156 device. The simulation and synthesis results show that the decoding function can be completed in 81 clock cycles with an optimum clock of 56.8 MHz. A test bench was written to study the performance of the decoder, and the results are presented.     

The semi‐iterative method applied to the hyper‐power iteration

The semi‐iterative method (SIM) is applied to the hyper‐power (HP) iteration, and necessary and sufficient conditions are given for the convergence of the semi‐iterative–hyper‐power (SIM–HP) iteration. The root convergence rate is computed for both the HP and SIM–HP methods, and the quotient convergence rate is given for the HP iteration. Copyright © 2005 John Wiley & Sons, Ltd.     

群发短消息对PHS网呼入成功率的影响分析

介绍了PHS网呼入成功率和短消息流程，依据短消息模型和性能统计结果分析了群发短信对PHS网呼入成功率的影响，并建议选择合理的时间进行短消息群发以减少对网络负荷的影响。     

软件无线电中采样率转换技术的实现及在3G中的应用

目前移动通信标准繁多,且新旧体制混杂,很难做到统一.为了实现互连互通,目前比较可行的方法是采用软件无线电.采样率转换技术是实现互连互通的关键.文中针对第三代移动通信系统(3G)中不同通信体制的带宽、速率要求,根据分级变换的思想,对3G中的CDMA2000和TDSCDMA的采样率转换方案进行了设计,并对3G中的5种制式的采样率转换方案进行了分析比较.实验表明,这一方案可以在采样率变换的高效网络结构基础上进一步降低滤波运算量和存储量.     

电子束驱动的回旋激射不稳定性

对弱相对论性电子束驱动的回旋激射(maser)不稳定性的一般理论作了详细讨论.对在获得增长率实用表达式过程中若干解析表达式的推导与细节做了仔细的补充讨论和说明，还增加了增长率的近似表达式，并由此得到了回旋激射不稳定性主要特征的解析分析以及与精确计算的比较，使整个理论有一个完整的描述.侧重解析讨论，也提供了部分一般性的数值计算结果. 关键词： 回旋激射不稳定性 弱相对论性电子束 增长率     

A novel tridentate nitrogen donor as ligand in copper catalyzed ATRP of methyl methacrylate

A tridentate ligand, BPIEP: 2,6‐bis[1‐(2,6‐diisopropyl phenylimino) ethyl] pyridine, having central pyridine unit and two peripheral imine coordination sites was effectively employed in controlled/“living” radical polymerization of MMA at 90°C in toluene as solvent, Cu^IBr as catalyst, and ethyl‐2‐bromoisobutyrate (EBiB) as initiator resulting in well‐defined polymers with polydispersities M_w/M_n ≤ 1.23. The rate of polymerization follows first‐order kinetics, k_app = 3.4 × 10^?5 s^?1, indicating the presence of low radical concentration ([P*] ≤ 10^?8) throughout the reaction. The polymerization rate attains a maximum at a ligand‐to‐metal ratio of 2:1 in toluene at 90°C. The solvent concentration (v/v, with respect to monomer) has a significant effect on the polymerization kinetics. The polymerization is faster in polar solvents like, diphenylether, and anisole, as compared to toluene. Increasing the monomer concentration in toluene resulted in a better control of polymerization. The molecular weights (M_n,SEC) increased linearly with conversion and were found to be higher than predicted molecular (M_n,Cal). However, the polydispersity remained narrow, i.e., ≤1.23. The initiator efficiency at lower monomer concentration approaches a value of 0.7 in 110 min as compared to 0.5 in 330 min at higher monomer concentration. The aging of the copper salt complexed with BPIEP had a beneficial effect and resulted in polymers with narrow polydispersitities and higher conversion. PMMA obtained at room temperature in toluene (33%, v/v) gave PDI of 1.22 (M_n = 8500) in 48 h whereas, at 50°C the PDI is 1.18 (M_n = 10,300), which is achieved in 23 h. The plot of lnk_app versus 1/T gave an apparent activation energy of polymerization as (ΔE^≠_app) 58.29 KJ/mol and enthalpy of equilibrium (ΔH⁰_eq) to 28.8 KJ/mol. Reverse ATRP of MMA was successfully performed using AIBN in bulk as well as solution. The controlled nature of the polymerization reaction was established through kinetic studies and chain extension experiments. © 2005 Wiley Periodicals, Inc. J Polym Sci Part A: Polym Chem 43: 4996–5008, 2005     

A model study for the steady state error of numerical approximations of inviscid flow equations on Cartesian grid

The widely used locally adaptive Cartesian grid methods involve a series of abruptly refined interfaces. In this paper we consider the influence of the refined interfaces on the steady state errors for second‐order three‐point difference approximations of flow equations. Since the various characteristic components of the Euler equations should behave similarly on such grids with regard to refinement‐induced errors, it is sufficient enough to conduct the analysis on a scalar model problem. The error we consider is a global error, different to local truncation error, and reflects the interaction between multiple interfaces. The steady state error will be compared to the errors on smooth refinement grids and on uniform grids. The conclusion seems to support the numerical findings of Yamaleev and Carpenter (J. Comput. Phys. 2002; 181: 280–316) that refinement does not necessarily reduce the numerical error. Copyright © 2005 John Wiley & Sons, Ltd.