A generalized super AKNS hierarchy associated with orthosymplectic Lie superalgebra OSP(2,2) and its super bi-Hamiltonian structures

For the orthosymplectic Lie superalgebra $\text{◂⋅▸}OSP(2,2)$, we choose a set of basis matrices. A linear combination of those basis matrices presents a spatial spectral matrix. The compatible condition of the spatial part and the corresponding temporal parts of the spectral problem leads to a generalized super AKNS (GSAKNS) hierarchy. By making use of the supertrace identity, the obtained GSAKNS hierarchy can be written as the super bi-Hamiltonian structures.     

On the capacity of the state‐dependent interference relay channel

This paper considers the state‐dependent interference relay channel (SIRC) in which one of the two users may operate as a secondary user and the relay has a noncausal access to the signals from both users. For discrete memoryless SIRC, we first establish the achievable rate region by carefully merging Han‐Kobayashi rate splitting encoding technique, superposition encoding, and Gelfand‐Pinsker encoding technique. Then, based on the achievable rate region that we derive, the capacity of the SIRC is established in many different scenarios including (a) the weak interference regime, (b) the strong interference regime, and (c) the very strong interference regime. This means that our capacity results contain all available known results in the literature. Next, the achievable rate region and the associated capacity results are also evaluated in the case of additive Gaussian noise. Additionally, many numerical examples are investigated to show the value of our theoretical derivations.     

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.     

无线通信中的空时分组码

空时分组码技术结合信道编码、调制和天线分集技术,当发送天线一定时,他的解码复杂度正比于发送速率,在3G标准中,该技术有着重要的地位。对空时分组码及相关知识进行了介绍,并对可变速率的空时分组码设计进行了探讨,最后展望了空时分组码技术的应用前景。     

微杯电子纸及其后加工制程

SiPix利用独特的微杯(Microcup)结构和顶部灌注封装技术，通过连续整卷高速涂布的制程成功地制造出高性能的双稳性、装填电泳微粒的电子纸。SiPix可提供下列两种规格形式任意的EPD卷式成品：(A)用于有源矩阵EPD和直接驱动产品的可剥离保护膜／已灌装及密封的Microcup／无图案导体膜夹层卷；及（P）用于无源矩阵的行导体膜／已灌装及密封的Microcup／列导体膜夹层卷。已经开发出将EPD卷制成不同的显示模块或产品的简单的后续加工制程。