ZnS：Mn^2＋纳米晶与钠硼硅玻璃复合体中的g因子漂移

对ＺｎＳ：Ｍｎ＾２＋纳米晶钠硼硅玻璃复合体进行了ＥＰＲ实验研究,确定Ｍｎ＾２＋在ＺｎＳ基质晶格中有３种形态：替位态（Ｍｎ＾２＋）ｓｕｂ,间隙态（Ｍｎ＾２＋）ｉｎｔ和Ｍｎ团簇。观测到ｇ因子随纳米晶粒径的减小而增大。对ｇ值进行了理论拟合,结果与实验符合很好。分析和讨论了这种量子限域下ＺｎＳ的ｓｐ＾２和Ｍｎ的３ｄ＾５电子态杂化所引起的ｇ－漂移。     

从非奇异布尔函数对产生M序列

本文指出一种构造产生Ｍ序列的方法，它是基于圈的合并，给出一个计数公式，并给出一个简单的生成算法，不同的非奇异布尔函数生成不同的Ｍ序列，从而可以生成２＾２ｎ－１－１个ｎ＋１级Ｍ序列。     

Mn在SrTiO3功能陶瓷中的作用

从实验结果出发，通过微观分析研究了Ｍｎ在ＳｒＴｉＯ３双功能陶瓷中的作用以及它对电性能的影响。热重分析和Ｘ光衍射的结果说明了ＭｎＯ２在加热过程中物相和Ｍｎ离子价态的变化，得出Ｍｎ＾２＋，Ｍｎ＾３＋，Ｍｎ４＋共存的结论。     

La—Ca—Mn—O薄膜的巨磁效应

报道了Ｃａ掺杂量对Ｌａ－Ｃａ－Ｍｎ－Ｏ巨磁薄膜材料的巨磁效应影响，测量薄膜电阻（外磁场强度Ｈ＝０．５Ｔ）磁化强度，温度关系曲线，认为Ｌａ１－ｘＣａｘＭｎＯ３体系中Ｍｎ＾４＋的含量是由于掺杂量Ｃａ的调制Ｍｎ＾４＋的含量变化导致磁性结构转变，用双交换模型解释了该象现，对实验给出满意的解释。     

高选择和自终止多也氧化硅SOI技术研究

本研究了ｎ型硅阳极化的高选择和终止工艺，并将该工艺用于形成多孔氧化硅全隔离ＳＯＩ结构。采用这种ＰＩＰＯＳ（Ｆｕｌｌ Ｉｓｏｌａｔｉｏｎ ｂｙ Ｐｏｒｏｎｓ Ｏｘｉｄｉｚｄｅ Ｓｉｉｌｃｏｎ）技术在ｎ＾－／ｎ＾＋／ｎ＾－／衬底上形成的ＳＯＩ（Ｓｉｌｉｃｏｎ Ｏｎ Ｉｎｓｕｌａｔｏｒ）结构，其顶层硅岛厚度可控制在较广范围（从１００ｎｍ到数μｍ），且硅岛宽度可大于１００μｍ．ＸＴＥＭ结果显示顶层硅／氧     

添加剂对高频电源用MnZn铁氧体磁性的影响

研究了添加剂对用于高频电源的ＭｎＺｎ铁氧体磁性的影响。研究表明添加剂的不同组合可以改善晶粒边界电阻率和磁导率频谱，发现Ｓｎ＾４＋、Ｔｉ＾４＋和Ｔａ＾５＋组合能提高晶粒电阻率并显著降低高频功率损耗。     

Si(CH3)4的MPD与Si原子的双光子共振三光子电离

在４１０￣４０４ｎｍ的紫激光作业下,利用平行板电极装置研究了Ｓｉ（ＣＨ３）４的多光子解离（ＭＰＤ）及Ｓｉ原子的的双光子共振三光子电离。观察到了Ｓｉ（ＣＨ３）４分子经ＭＰＤ产生的、处于３＾３ＰＪ＾〃（Ｊ＾〃＝０,１,２）态的硅原子,依据４＾３ＰＪ＾〃←３＾３ＰＪ＾〃（Ｊ＾′、Ｊ〃＝０,１,２）跃迁谱线的强度,得到了Ｓｉ（ＣＨ３）４经ＭＰＤ产生的、处于３＾３ＰＪ＾〃（Ｊ＾〃＝０,１,２）态的硅原子的密     

宽带相干源波达方向估计的新方法

相干信号子空间处理方法（ＣＳＭ）是一种通过构造聚焦（ｆｏｃｕｓｉｎｇ）矩阵来估计宽带相干源波达方向（ＤＯＡ）的有效方法。本文基于一致聚焦的概念，给出了一种可用于任意阵列的完全聚焦方法，从而极大地改善了ＤＯＡ的估计分辨率、估计精度等性能，大大降低了估计方法的信噪比阈值。文中在最后通过计算机仿真，与ＣＳＭ方法进行了比较，验证了本方法的优良性能。     

Mn对一次烧成钛酸锶陶瓷复合功能的影响

采用一次烧成工艺制备了Ｍｎ掺杂的ＳｒＴｉＯ３电容－压敏复合功能陶瓷,采用ＳＥＭ观察了ＳｒＴｉＯ３复合功能陶瓷的微观结构,测量了不同氧化热处理温度下ＳｒＴｉＯ３陶瓷的电学特性,采用ＸＰＳ研究了ＳｒＴｉＯ３复合功能陶瓷中Ｍｎ主要以Ｍｎ＾２＋的化学状态,并分析了Ｍｎ的掺杂行为。研究结果表明：一次烧成ＳｒＴｉＯ３陶瓷达到较高的烧成致密度,Ｍｎ主要以Ｍｎ＾２＋的形式存在于晶界,氧化热处理过程Ｍｎ低价粒表面的     

自对准GaAsMESFET的二维数值分析

本文对源漏ｎ＾＋浅结注入的自对准ＧａＡｓＭＥＳＦＥＴ内部的电位，电场及载流子浓度的稳态分布进行了二维数值分析，分析表明，不同ｎ＾＋注入深度对器件的特性有一定的影响。当ｎ＾＋注入深度为有源层厚度的１／４时，畴的体积最小。适当选取ｎ＾＋区边缘与栅之间的距离可提高器件的击穿电压。     

New array codes for multiple phased burst correction

An optimal family of array codes over GF(q) for correcting multiple phased burst errors and erasures, where each phased burst corresponds to an erroneous or erased column in a code array, is introduced. As for erasures, these array codes have an efficient decoding algorithm which avoids multiplications (or divisions) over extension fields, replacing these operations with cyclic shifts of vectors over GF(q). The erasure decoding algorithm can be adapted easily to handle single column errors as well. The codes are characterized geometrically by means of parity constraints along certain diagonal lines in each code array, thus generalizing a previously known construction for the special case of two erasures. Algebraically, they can be interpreted as Reed-Solomon codes. When q is primitive in GF(q), the resulting codes become (conventional) Reed-Solomon codes of length P over GF(q^p-1), in which case the new erasure decoding technique can be incorporated into the Berlekamp-Massey algorithm, yielding a faster way to compute the values of any prescribed number of errors     

Iterative construction of reversible variable-length codes and variable-length error-correcting codes

We propose a generic algorithm for the construction of efficient reversible variable-length codes (RVLCs) and variable-length error-correcting (VLEC) codes, which optimizes the codeword length distribution. The algorithm may be applied to any existing codeword selection mechanism, and it is capable of generating codes of higher efficiency in comparison to the algorithms disseminated in the literature.     

On Construction of the$(24, 12, 8)$Golay Codes

Two product array codes are used to construct the (24,12,8) binary Golay code through the direct sum operation. This construction provides a systematic way to find proper (8,4,4) linear block component codes for generating the Golay code, and it generates and extends previously existing methods that use a similar construction framework. The code constructed is simple to decode     

高维大码距Hamilton阵列编码理论与综合算法

该文定义了高维大码距Hamilton阵列编码理论的基本概念,分析了d=2k-1(k3)类型和d=2k(k3)类型阵列编码的Hamilton逻辑拓扑结构模型和一般Hamilton阵列编码的存在拓扑条件,并给出d=2k-1(k3)与d=2k(k3)高阶高维Hamilton阵列编码的构造原理和综合算法。文中还讨论了两类模型的区别,以及实例设计,这为新型阵列密码研究提供一个新方向。     

Architecture and Implementation of an Interpolation Processor for Soft-Decision Reed–Solomon Decoding

Reed-Solomon codes are powerful error-correcting codes that can be found in many digital communications standards. Recently, there has been an interest in soft-decision decoding of Reed-Solomon codes, incorporating reliability information from the channel into the decoding process. The Koetter-Vardy algorithm is a soft-decision decoding algorithm for Reed-Solomon codes which can provide several dB of gain over traditional hard-decision decoders. The algorithm consists of a soft-decision front end to the interpolation-based Guruswami-Sudan list decoder. The main computational task in the algorithm is a weighted interpolation of a bivariate polynomial. We propose a parallel architecture for the hardware implementation of bivariate interpolation for soft-decision decoding. The key feature is the embedding of both a binary tree and a linear array into a 2-D array processor, enabling fast polynomial evaluation operations. An field-programmable gate array interpolation processor was implemented and demonstrated at a clock frequency of 23 MHz, corresponding to decoding rates of 10-15 Mb/s     

一种多人多出DS/CDMA系统中的半盲多用户检测算法

多用户检测技术是DS/CDMA中的一项关键技术,而天线阵的广泛应用也促使对多入多出系统的研究。该文将两种技术结合在一起,考虑到基站在一般情况下总是知道本小区的多个用户的扩频码,在此半盲意义下研究了将子空间方法应用于多用户检测的技术。这种技术可适用于低速移动台在慢衰落信道下的盲检测。仿真结果表明这种算法相对于只利用一个用户的扩频码的盲检测算法性能有相当大的提高。     

A family of efficient burst-correcting array codes

A family of binary burst correcting array codes that are defined as follows is discussed: consider an n₁×n n₂ array with n₁=4u+ν+2 and n₂=6u+2ν+5, u⩾1, ν⩾0, ν≠1 where each row and column has even parity. The bits are read diagonally starting from the upper-left corner. The columns are viewed cyclically, i.e. the array is a cylinder. If one diagonal has been read out, one proceeds with the second diagonal preceding it. It is proven that the codes of this type can correct any burst of length up to n₁. The burst-correcting efficiency of this family tends to 4/5 as u→∞. As a comparison, the burst-correcting efficiency of other families of array codes tends to 2/3; the same is true for Fire codes. A simple decoding algorithm for the codes is also presented     

PRACTICAL ALGORITHMS FOR TORNADO CODES

Tornado codes have been used in the error control of data transmission in IP network. The efficiency of this erasure codes is critically affected by the short cycles in its bipartite graph. To remove this effect, two algorithms are introduced： （1） while generating the graph, the cycle eliminating algorithm is used to reduce the number of the short cycles in it; （2） in the decoding algorithm, cycles that are inevitably in the graph are used to remove decoding efficiency degradation. The simulation results show that they have a better performance than that of general tornado codes.     

Outer-product matrix representation of optical orthogonal codes

In this letter, we introduce a whole new approach in defining and representing optical orthogonal codes (OOCs), namely, outer-product matrix representation. Instead of applying commonly used approaches based on inner product to construct OOC codes, we use the newly defined approach to obtain a more efficient algorithm in constructing and generating OOC codes. The outer-product matrix approach can obtain a family of OOC codes with a cardinality closer to the Johnson upper bound, when compared with the previously defined accelerated greedy algorithm using the inner-product approach. We believe the new look introduced in this letter on OOCs could help to devise new approaches in designing and generating OOC codes, using the rich literature in matrix algebra.     

基于差集矩阵的部分重复码构造

针对最小带宽再生码的有效修复问题，该文提出一种基于差集矩阵的部分重复(FR)码的构造算法。利用差集矩阵和克罗内克(Kronecker)和来构造正交排列，根据正交排列每一列取相同元素所在行作为节点的编码块，得到相应的FR码。构造的FR码可以划分成多个平行类，同时还能调整数据块的重复度和节点的存储容量。仿真结果表明，与传统的里德-所罗门(RS)码和简单再生码(SRC)相比，构造的FR码在修复复杂度、修复带宽开销和修复局部性方面具有更好的性能，修复选择度上虽然是基于表格的修复方案，但选择度依旧可以达到很高。