“微电子工艺与实践”课程群建设与教改实践

围绕电子信息类专业核心课“微电子工艺”、“微电子器件基础”以及实践课“微电子生产实习”和“微电子器件与工艺实验”等课程教学改革为核心,围绕学生教学主体进行课程群的内容及教学模式调整;运用现代教育MOOC平台和混合式“翻转课堂”教学方法及校企合作实践资源共享等几个环节进行了“微电子工艺与实践”课程群建设,完善教学环节设计,强化实践实习的实效性。     

LDPC码加权比特翻转译码算法的低复杂度提前停止准则

近年来,针对LDPC码置信传播(BP)译码算法的提前停止准则的研究已经有了很多,但设计适合加权比特翻转(WBF)译码算法的提前停止准则却研究甚少。依据对WBF算法的全新理解方式,该文提出一种实现简单、适用性强的WBF算法提前停止准则,它能在译码的初始阶段检测绝大多数不可纠错的帧。仿真结果表明,基于提前停止准则的WBF算法在性能损失可以忽略的条件下,极大地降低迭代次数,在实现复杂度和性能之间达到了很好的折中。     

Incremental topological flipping works for regular triangulations

A set ofn weighted points in general position in ^d defines a unique regular triangulation. This paper proves that if the points are added one by one, then flipping in a topological order will succeed in constructing this triangulation. If, in addition, the points are added in a random sequence and the history of the flips is used for locating the next point, then the algorithm takes expected time at mostO(nlogn+n ^[d/2]). Under the assumption that the points and weights are independently and identically distributed, the expected running time is between proportional to and a factor logn more than the expected size of the regular triangulation. The expectation is over choosing the points and over independent coin-flips performed by the algorithm.The research of both authors was supported by the National Science Foundation under Grant CCR-8921421 and the research by the first author was also supported under the Alan T. Waterman award, Grant CCR-9118874. Any opinions, findings, conclusions, or recommendations expressed in this publication are those of the authors and do not necessarily reflect the view of the National Science Foundation.     

Rotation and flipping robust region binary patterns for video copy detection

Many video fingerprints have been proposed to handle the video transformations problems when the original contents are copied and redistributed. However, most of them did not take into account flipping and rotation transformations. In this paper, we propose a novel video fingerprint based on region binary patterns, aiming to realize robust and fast video copy detection against video transformations including rotation and flipping. We extract two complementary region binary patterns from several rings in keyframes. These two kinds of binary patterns are converted into a new type of patterns for the proposed video fingerprint which is robust against rotation and flipping. The experimental results demonstrated that the proposed video fingerprint is effective for video copy detection particularly in the case of rotation and flipping. Furthermore, our experimental results proved that the proposed method allows for high storage efficiency and low computation complexity, which is suitable for practical video copy system.     

Transforming spanning trees and pseudo-triangulations

Let TS be the set of all crossing-free straight line spanning trees of a planar n-point set S. Consider the graph TS where two members T and T^′ of TS are adjacent if T intersects T^′ only in points of S or in common edges. We prove that the diameter of TS is O(logk), where k denotes the number of convex layers of S. Based on this result, we show that the flip graph PS of pseudo-triangulations of S (where two pseudo-triangulations are adjacent if they differ in exactly one edge—either by replacement or by removal) has a diameter of O(nlogk). This sharpens a known O(nlogn) bound. Let be the induced subgraph of pointed pseudo-triangulations of PS. We present an example showing that the distance between two nodes in is strictly larger than the distance between the corresponding nodes in PS.     

LDPC码加权比特翻转译码算法研究

近年来,基于置信传播(BP),最小和(MS)和归一化最小和(NMS)算法,已经提出3种相对应的LDPC码加权比特翻转(WBF)译码算法。但这3种WBF算法所代表的物理意义和内在的紧密联系问题目前仍未有所研究。该文依据一种全新的理解方式,对3种WBF算法进行理论推导,并阐述3种算法内在的紧密联系,最后通过仿真验证所得结论的合理性和正确性。这对于设计新的改进型WBF算法具有一定的指导意义。     

基于平均幅度的LDPC码加权比特翻转译码算法

针对LDPC码的加权比特翻转(WBF)和改进型加权比特翻转(MWBF)算法,该文提出一种改进型算法。该方法以信息节点的平均幅度作为校验方程的可靠度信息,可以提高比特翻转效率。仿真结果表明,在AWGN信道下,误比特率为10-5时,相比于WBF和MWBF算法,该文提出的算法可分别获得约1.65 dB和1.36 dB的增益。同时,平均迭代次数分别降低18.20%~39.91%和17.54%~34.78%。     

翻转翻译课堂的探索与实践

文章针对传统翻译教学存在的一些问题, 提出翻转翻译课堂的必要性和意义, 阐述了翻转翻译课堂的原则 并探讨了基于翻转课堂的翻译教学模式, 以期为提高翻译教学质量提供参考。     

简单高效的低密度奇偶校验码比特翻转译码算法

为了提高比特翻转(BF)效率,提出一种基于平均幅度的低密度奇偶校验(LDPC)码加权梯度下降比特翻转译码算法。该方法首先以信息节点的平均幅度作为校验方程的可靠度,再用其对双极性校验子进行加权,从而构造出更加高效的比特翻转函数。在加性高斯白噪声(AWGN)信道下,误比特率(BER)为10-5时进行仿真实验,相比传统的梯度下降和基于可靠度比率的加权梯度下降比特翻转算法,所提出的算法可分别获得0.08dB和0.29dB的增益;同时,平均迭代次数可分别降低72.6%和9.3%。实验结果表明,所提算法在获得一定编码增益的同时,平均迭代次数也有所降低,可见该算法在纠错性能、实现复杂度和时延之间达到了更好的平衡匹配,能适用于实时性要求较高的高速通信系统。     

On shape Delaunay tessellations

Shape Delaunay tessellations are a generalization of the classical Delaunay triangulation of a finite set of points in the plane, where the empty circle condition is replaced by emptiness of an arbitrary convex compact shape. We present some new and basic properties of shape Delaunay tessellations, concerning flipping, subgraph structures, and recognition.