Reducing the complexity of distance measurement methods for circular turbo codes that use structured interleavers

The knowledge of turbo code's minimum Hamming distance (d_min) and its corresponding codeword multiplicity (A_min) is of a great importance because the error correction capability of a code is strongly tied to the values of d_min and A_min. Unfortunately, the computational complexity associated with the search for d_min and A_min can be very high, especially for a turbo code that has high d_min value. This paper introduces some useful properties of turbo codes that use structured interleavers together with circular encoding. These properties allow for a significant reduction of search space and thus reduce significantly the computational complexity associated with the determination of d_min and A_min values. © 2014 The Authors. International Journal of Communication Systems published by John Wiley & Sons, Ltd.     

Improving performance of high-power indium gallium nitride/gallium nitride-based vertical light-emitting diodes by employing simple n-type electrode pattern

In this work, simple n-type electrode structures were used to enhance the electrical and optical performances of fully packaged commercially mass-produced vertical-geometry light-emitting diodes (VLEDs). The forward bias voltage of the VLED with a Y-pattern electrode increased less rapidly than that of VLEDs with a reference electrode. The VLEDs with the reference and Y-pattern electrodes exhibited forward voltages of 2.93±0.015 and 2.89±0.015 V at 350 mA and 3.77±0.015 and 3.53±0.015 V at 2000 mA, respectively. The VLEDs with the Y-pattern electrode resulted in a higher light output than the VLEDs with the reference electrode with increase in the drive current to 2000 mA. The emission images showed that the VLEDs with the Y-pattern electrode exhibited better current spreading behavior and lower junction temperatures than the VLEDs with the reference electrode. With increase in the current from 350 to 2000 mA, the VLEDs with the Y-pattern electrode experienced a 39.4% reduction in the wall plug efficiency, whereas the VLEDs with the reference electrode suffered from a 43.3% reduction.     

基于Internet的远程教育系统模型研究

随着计算机网络技术的发展，远程教学系统的结构发生了重大的变化，逐步由原来的客户机／服务器(C／S)结构转变为基于Internet的浏览器／服务器(B／S)结构。本文提出了基于CORBA技术的B／S结构系统模型。分析了其运行过程，并与传统的结构进行了比较，指明了其优越性。在本文的结尾。指出了使用这种技术的一个具体例子。     

以一种新的距离度量作为反馈的相关跟踪方法

基于相关的模板匹配方法在图像跟踪中得到了广泛的应用,但是这种方法的主要缺点是对图像噪声非常敏感,而且由这种方法得出的相关曲面比较平坦。为了有效抑制噪声和局部遮挡对图像的影响,提出用鲁棒统计中的一个值代替相关值作为距离度量。它不是计算两幅图像的对应像素差值,而是计算两幅图像中差别不大的对应像素对的个数。实验证明这样得到的曲面相对　　收稿日期:2003 08 31;　修订日期:2003 10 28作者简介:张桂林(1944 ),男,天津人,教授,博士生导师,主要研究方向为自动识别、人体生物统计特征识别、图像处理算法与系统性能评估等。　　　　　　　要尖锐得多。当上述的距离度量应用于跟踪过程中时,模板的合理更新对跟踪非常重要。基于上述的距离度量方法,提出了一种新的模板更新策略。利用两幅图像中近似像素在整修匹配模板像素中所占的比例大小决定加权系数。这种加权策略可以自适应地根据图像序列的变化选择更新相关模板,同时在一定程度上减小模板漂移的危险。     

新结构MOSFET

和传统平面结构MOSFET相比，新结构MOSFET具有更好的性能(如改善的沟道效应(SCE)，理想的漏诱生势垒降低效应(DIBL)和亚阈值特性)和更大的驱动电流等。文章主要介绍了五种典型的新结构MOSFET，包括平面双栅MOSFET、FinFET、三栅MOSFET、环形栅MOSFET和竖直结构MOSFET。随着MOSFET向亚50nm等比例缩小，这些新结构器件将大有前途。     

3-D vertical ray shooting and 2-D point enclosure, range searching, and arc shooting amidst convex fat objects

We present a new data structure for a set of n convex simply-shaped fat objects in the plane, and use it to obtain efficient and rather simple solutions to several problems including (i) vertical ray shooting—preprocess a set of n non-intersecting convex simply-shaped flat objects in 3-space, whose xy-projections are fat, for efficient vertical ray shooting queries, (ii) point enclosure—preprocess a set C of n convex simply-shaped fat objects in the plane, so that the k objects containing a query point p can be reported efficiently, (iii) bounded-size range searching— preprocess a set C of n convex fat polygons, so that the k objects intersecting a “not-too-large” query polygon can be reported efficiently, and (iv) bounded-size segment shooting—preprocess a set C as in (iii), so that the first object (if exists) hit by a “not-too-long” oriented query segment can be found efficiently. For the first three problems we construct data structures of size O(λ_s(n)log³n), where s is the maximum number of intersections between the boundaries of the (xy-projections) of any pair of objects, and λ_s(n) is the maximum length of (n, s) Davenport-Schinzel sequences. The data structure for the fourth problem is of size O(λ_s(n)log²n). The query time in the first problem is O(log⁴n), the query time in the second and third problems is O(log³n + klog²n), and the query time in the fourth problem is O(log³n).

We also present a simple algorithm for computing a depth order for a set as in (i), that is based on the solution to the vertical ray shooting problem. (A depth order for , if exists, is a linear order of , such that, if K₁, K₂ and K₁ lies vertically above K₂, then K₁ precedes K₂.) Unlike the algorithm of Agarwal et al. (1995) that might output a false order when a depth order does not exist, the new algorithm is able to determine whether such an order exists, and it is often more efficient in practical situations than the former algorithm.     

Optic Fiber Interferometer for Absolute Distance Measurement

1.IntroductionAbsolutedistancemeasurementisfarfromanewtopic.However,itisstillafieldstimulatinggreatinterestsnowadaysduetoitSimportantroleinmanufacturingandassembly['J.SincethegreatsuccessachievedbyMichelsonandBenoitwhentheyfirstdevelopedaninterferometertodeterminethestandardmeterintermsofthemonochromaticredcadmiumline,theopticinterferometerhasbeenprovedtobeoneofthemostpreciseandefficientwayindisplacementmeasurementbecauseofitshighdiscriminationandsimplestructure.However,thetraditionalinterfe…     

Necessary Conditions for Differentiability of Distance Functions

Necessary conditions for the Gâteaux differentiability of the distance function to a set are considered. A series of characterizing results is obtained.     

FFT-based algorithms for the string matching with mismatches problem

The string matching with mismatches problem requires finding the Hamming distance between a pattern P of length m and every length m substring of text T with length n. Fischer and Paterson's FFT-based algorithm solves the problem without error in O(σnlogm), where σ is the size of the alphabet Σ [SIAM–AMS Proc. 7 (1973) 113–125]. However, this in the worst case reduces to O(nmlogm). Atallah, Chyzak and Dumas used the idea of randomly mapping the letters of the alphabet to complex roots of unity to estimate the score vector in time O(nlogm) [Algorithmica 29 (2001) 468–486]. We show that the algorithm's score variance can be substantially lowered by using a bijective mapping, and specifically to zero in the case of binary and ternary alphabets. This result is extended via alphabet remappings to deterministically solve the string matching with mismatches problem with a constant factor of 2 improvement over Fischer–Paterson's method.