Encoding Individual Source Sequences for the Wiretap Channel

We consider the problem of encoding a deterministic source sequence (i.e., individual sequence) for the degraded wiretap channel by means of an encoder and decoder that can both be implemented as finite-state machines. Our first main result is a necessary condition for both reliable and secure transmission in terms of the given source sequence, the bandwidth expansion factor, the secrecy capacity, the number of states of the encoder and the number of states of the decoder. Equivalently, this necessary condition can be presented as a converse bound (i.e., a lower bound) on the smallest achievable bandwidth expansion factor. The bound is asymptotically achievable by Lempel–Ziv compression followed by good channel coding for the wiretap channel. Given that the lower bound is saturated, we also derive a lower bound on the minimum necessary rate of purely random bits needed for local randomness at the encoder in order to meet the security constraint. This bound too is achieved by the same achievability scheme. Finally, we extend the main results to the case where the legitimate decoder has access to a side information sequence, which is another individual sequence that may be related to the source sequence, and a noisy version of the side information sequence leaks to the wiretapper.     

New Result on the Feedback Capacity of the Action-Dependent Dirty Paper Wiretap Channel

The Gaussian wiretap channel with noncausal state interference available at the transmitter, which is also called the dirty paper wiretap channel (DP-WTC), has been extensively studied in the literature. Recently, it has been shown that taking actions on the corrupted state interference of the DP-WTC (also called the action-dependent DP-WTC) helps to increase the secrecy capacity of the DP-WTC. Subsequently, it has been shown that channel feedback further increases the secrecy capacity of the action-dependent DP-WTC (AD-DP-WTC), and a sub-optimal feedback scheme is proposed for this feedback model. In this paper, a two-step hybrid scheme and a corresponding new lower bound on the secrecy capacity of the AD-DP-WTC with noiseless feedback are proposed. The proposed new lower bound is shown to be optimal (achieving the secrecy capacity) and tighter than the existing one in the literature for some cases, and the results of this paper are further explained via numerical examples.     

无相互作用费米量子信道直积态容量研究

用费米线性光学方法,提出无相互作用费米量子信道物理模型.用平稳量子高斯态协方差矩阵性质及Majorization不等式理论,推导出在平稳高斯输入态下费米量子信道最小输出熵的表达式.利用在n模费米系统添加一个额外模的方法,得到平稳高斯态和高斯态输出熵的关系|利用此关系式,借助在高斯输入态下费米信道最小输出熵值是可达的猜测,推导出无相互作用费米信道直积态容量的表达式.最后,用最小输出熵的迭代算法验证已推出的费米信道最小输出熵表达式正确性,数值计算结果表明:对于带噪声的无相互作用费米量子信道,已推出最小输出熵与数值计算结果的吻合度可以达到10e-9.     

Full-Duplex Relay with Delayed CSI Elevates the SDoF of the MIMO X Channel

In this article, the sum secure degrees-of-freedom (SDoF) of the multiple-input multiple-output (MIMO) X channel with confidential messages (XCCM) and arbitrary antenna configurations is studied, where there is no channel state information (CSI) at two transmitters and only delayed CSI at a multiple-antenna, full-duplex, and decode-and-forward relay. We aim at establishing the sum-SDoF lower and upper bounds. For the sum-SDoF lower bound, we design three relay-aided transmission schemes, namely, the relay-aided jamming scheme, the relay-aided jamming and one-receiver interference alignment scheme, and the relay-aided jamming and two-receiver interference alignment scheme, each corresponding to one case of antenna configurations. Moreover, the security and decoding of each scheme are analyzed. The sum-SDoF upper bound is proposed by means of the existing SDoF region of two-user MIMO broadcast channel with confidential messages (BCCM) and delayed channel state information at the transmitter (CSIT). As a result, the sum-SDoF lower and upper bounds are derived, and the sum-SDoF is characterized when the relay has sufficiently large antennas. Furthermore, even assuming no CSI at two transmitters, our results show that a multiple-antenna full-duplex relay with delayed CSI can elevate the sum-SDoF of the MIMO XCCM. This is corroborated by the fact that the derived sum-SDoF lower bound can be greater than the sum-SDoF of the MIMO XCCM with output feedback and delayed CSIT.     

基于虚拟通道技术的数字图像灰度水印算法

根据提出的虚拟通道技术,提出一种在载体中嵌入灰度图像作为水印的数字水印算法.通过修改载体频率域系数,载体通道可被看成一个虚拟的水印通道,它由若干个缺损的水印子通道构成,水印的提取不需要原始载体或原始水印的参与.实验结果表明提出的算法很好地保证了水印的不可见性和稳健性.     

Gaussian Multiuser Wiretap Channels in the Presence of a Jammer-Aided Eavesdropper

This paper considers secure communication in the presence of an eavesdropper and a malicious jammer. The jammer is assumed to be oblivious of the communication signals emitted by the legitimate transmitter(s) but can employ any jamming strategy subject to a given power constraint and shares her jamming signal with the eavesdropper. Four such models are considered: (i) the Gaussian point-to-point wiretap channel; (ii) the Gaussian multiple-access wiretap channel; (iii) the Gaussian broadcast wiretap channel; and (iv) the Gaussian symmetric interference wiretap channel. The use of pre-shared randomness between the legitimate users is not allowed in our models. Inner and outer bounds are derived for these four models. For (i), the secrecy capacity is obtained. For (ii) and (iv) under a degraded setup, the optimal secrecy sum-rate is characterized. Finally, for (iii), ranges of model parameter values for which the inner and outer bounds coincide are identified.     

Premixed flame oscillations in obstructed channels with both ends open

An initially laminar premixed flame front accelerates extremely fast and may even trigger a detonation when propagating in a semi-open obstructed channel (one end of the channel is closed; the flame is ignited at the closed end and moves towards the open one). However, industrial and laboratory conduits oftentimes have both ends open, or vented, with a flame ignited at one of these ends. The latter constitutes the focus of the present work. Specifically, premixed flame propagation through a comb-shaped array of obstacles, in-built in a channel with both ends open, is studied by means of computational simulation of the reacting flow equations with fully-compressible hydrodynamics and an Arrhenius chemical kinetics. The parametric study includes various blockage ratios and spacing as well as the thermal expansion ratios, with oscillations of the burning rate observed in the majority of the cases, which conceptually differs from fast flame acceleration in semi-open channels. Such a difference is devoted to the fact that while the entire flame-generated jet-flow is pushed towards a single exit in a semi-open channel, in a channel with two ends open, this jet-flow is distributed between the upstream and downstream flows, thereby moderating flame propagation. The flame oscillations are nonlinear in all cases where they are observed. The oscillation period grows with the blockage ratio but decreases with the thermal expansion. The present results also support the recent experiments, modeling and theory of flames in obstructed channels with both ends open, which all yielded steady or quasi-steady flame propagation prior to the onset of flame acceleration. Indeed, the present oscillations can be treated as the fluctuations around a quasi-steady solution.     

OFDM水声通信CS限幅失真补偿与LS信道估计优化算法

正交频分复用技术应用于水声通信系统时,会引起较高的峰均比,当采用限幅法对峰均比进行抑制时,会产生非线性失真.另外,系统采用最小二乘法进行信道估计受噪声的影响较大.针对以上问题,提出了一种基于压缩感知技术的补偿限幅非线性失真与最小二乘信道估计相组合的新算法,在接收端利用导频数据采用压缩感知算法对限幅失真进行补偿,同时对最...     

无相互作用费米量子信道直积态容量研究

用费米线性光学方法,提出无相互作用费米量子信道物理模型.用平稳量子高斯态协方差矩阵性质及Majorization不等式理论,推导出在平稳高斯输入态下费米量子信道最小输出熵的表达式.利用在n模费米系统添加一个额外模的方法,得到平稳高斯态和高斯态输出熵的关系;利用此关系式,借助在高斯输入态下费米信道最小输出熵值是可达的猜测...     

量子多址高斯信道的信息容量研究

与经典通信相类似,量子高斯噪声是一种重要的量子噪声模型.这里,"经典"是相对于"量子"而言的.讨论量子高斯信道传送经典信息时的信息容量,也称量子信道的经典容量,是量子通信的热点问题之一.文中在量子高斯态、高斯熵性质和Holevo界基础上,给出单用户量子高斯信道的经典容量,借助多址量子信道的经典容量区域定理,通过坐标系变换方法,从理论上推导得到多用户量子高斯信道的经典容量区域.为了计算简便且不失一般性,计算过程将采用两输入、单输出的量子多址信道模型进行说明,结论可类推到n个输入、单输出的多址信道.     

基于压缩感知理论的大规模MIMO系统下行信道估计中的导频优化理论分析与算法设计

针对大规模多输入多输出(multiple input multiple output, MIMO)系统信道估计中的导频设计问题,在压缩感知理论框架下,提出了一种基于信道重构错误率最小化的自适应自相关矩阵缩减参数导频优化算法.首先以信道重构错误率最小化为目标,推导了正交匹配追踪(orthogonal matching pursuit, OMP)算法下信道重构错误率与导频矩阵列相关性之间的关系,并得出优化导频矩阵的两点准则,即导频矩阵列相关性期望和方差最小化;然后研究了优化导频矩阵的方法,并提出相应的自适应自相关矩阵缩减参数导频矩阵优化算法,即在每次迭代过程中,以待优化矩阵平均列相关程度是否减小作为判断条件,调整自相关矩阵缩减参数值,使参数不断趋近于理论最优.仿真结果表明,与采用Gaussian矩阵、Elad方法、低幂平均列相关方法得到的导频矩阵相比,本文所提方法具有更好的列相关性,且具有更低的信道重构错误率.     

Architectures and techniques for all-optical networks

Some recent results on all-optical packet-switching and broadcasting networks are presented. The performance evaluation problem of packet-switching transparent optical networks with deflection routing is addressed. Transmission error arguments show how, for a given optical bit rate, the size of an all-optical nonregenerative multishop network is limited by the accumulation of noise and distortion in the optical fiber channel. Time-domain multiple access techniques are exploited in novel architectures based on recently proposed all-optical sampling gates to realize the matching of the ultrahigh optical speed allowed by the large bandwidth of the fiber with the lower speed of the electronic components needed at the user ends. These architectures allow great simplification of the node structure in the considered all-optical multihop and broadcast networks.     

Architectures and techniques for all-optical networks

Abstract

Some recent results on all-optical packet-switching and broadcasting networks are presented. The performance evaluation problem of packet-switching transparent optical networks with deflection routing is addressed. Transmission error arguments show how, for a given optical bit rate, the size of an all-optical nonregenerative multishop network is limited by the accumulation of noise and distortion in the optical fiber channel. Time-domain multiple access techniques are exploited in novel architectures based on recently proposed all-optical sampling gates to realize the matching of the ultrahigh optical speed allowed by the large bandwidth of the fiber with the lower speed of the electronic components needed at the user ends. These architectures allow great simplification of the node structure in the considered all-optical multihop and broadcast networks.     

分块稀疏信号1-bit压缩感知重建方法

1-bit压缩感知理论指出:对稀疏信号进行少量线性投影并对投影信号进行1-bit量化,该1-bit信号包含足够的信息,从而能对原始信号进行高精度重建.然而,当信号难以进行稀疏表达时,传统1-bit压缩感知算法无法精确重建原始信号.前期研究表明,分块稀疏模型作为一种特殊的结构型稀疏模型,对于难以用传统稀疏模型进行表达的信号具有较好的表达作用.本文提出了一种针对分块稀疏信号的1-bit压缩感知重建方法,该方法利用分块稀疏的统计特性对信号进行数学建模,通过变分贝叶斯推断方法进行信号重建并在光电容积脉搏波(photoplethysmography)信号上进行了实验验证.实验结果表明,与现有1-bit压缩感知重建方法相比,本文方法重建精度更高,且收敛速度更快.     

Variational Sparse Bayesian Learning for Estimation of Gaussian Mixture Distributed Wireless Channels

In this paper, variational sparse Bayesian learning is utilized to estimate the multipath parameters for wireless channels. Due to its flexibility to fit any probability density function (PDF), the Gaussian mixture model (GMM) is introduced to represent the complicated fading phenomena in various communication scenarios. First, the expectation-maximization (EM) algorithm is applied to the parameter initialization. Then, the variational update scheme is proposed and implemented for the channel parameters’ posterior PDF approximation. Finally, in order to prevent the derived channel model from overfitting, an effective pruning criterion is designed to eliminate the virtual multipath components. The numerical results show that the proposed method outperforms the variational Bayesian scheme with Gaussian prior in terms of root mean squared error (RMSE) and selection accuracy of model order.     

一种用于塑料光纤接入网的多优先级控制协议设计

提出一种基于光码分多址(OCDMA)技术的塑料光纤接入网的多优先级控制协议.由于受传输误码率的限制,常规的光码分多址系统只允许有限个用户传输数据或接入网络,为了解决用有限的码字来实现多于码字数目的多媒体工作站间的信息通信,这种多优先级的控制协议通过使用预约和随机分配算法可以有效地解决信道冲突和目的地址的冲突问题, 该协议可以支持多媒体信息传输中各类信息不同的时间延迟要求.另外,在该接入网中,每个光网络单元均设有两套光编码器和光解码器,一套用于控制信道,另一套用于各个数据信道.利用本文提出的协议对塑料光纤接入网的网络吞吐量和平均延时时间进行了数值分析和仿真实验,结果证明了这种多优先级控制协议的有效性和高效性.     

The effect of plasma channel on the self-distortion of laser pulse propagating through the collisional plasma channel

In the present paper, laser pulse distortion/breakup and the effect of the plasma channel on the laser propagation through the collisional plasma have been studied by using moment theory approach. Second order nonlinear differential equations of the beam width parameter have been derived for the propagation of the laser through uniform homogenous plasma and preformed plasma channel having parabolic density profile. Differential equations of beam width parameter have been solved numerically using Runge Kutta method. It has been observed from analysis that when the laser pulse propagates through the homogenous plasma, the low intensity front and rear parts of the laser get defocused/diffracted and the high intensity central/main portion of the laser pulse gets self-guided. As a result of this, the laser pulse gets distorted. This distortion of the laser has not been observed when the laser pulse is propagated through the plasma channel having density minimum at the axis and maximum at the edges. The laser pulse is guided as a whole, even the low intensity front and rear parts of the laser are also guided. Therefore, the plasma channel is useful to prevent the distortion/breakup of the laser.     

结合卷积神经网络的浅海有源探测信道匹配

信道匹配方法在有源探测领域是一种重要的提升检测信噪比的方法。针对非确知海底参数环境下的有源探测信道匹配问题,提出一种结合卷积神经网络进行信道匹配的算法。该算法基于海底参数扰动开展声场仿真生成卷积网络训练数据;首先通过分类网络将信号按照海底底质类型分类,在每个分类区间内采用单独的卷积网络反演海底参数;然后结合声场模型估计信道传递函数,进行信道匹配,从而在非确知环境下抑制多途影响,提升回波检测能力。仿真与实验结果表明,该算法能够在不确知海底环境条件下,有效估计信道传递函数,实现信道最优化匹配,在实验条件下可提高回波检测信噪比4 dB左右。相比传统方法,该算法可以在海底参数不确知条件下对低接收信噪比的信号实现信道匹配,同时不需要高信噪比的实验参考信号,有效提高了信道匹配方法的环境宽容性。     

Low-Complexity Chase Decoding of Reed–Solomon Codes Using Channel Evaluation

A novel time-varying channel adaptive low-complexity chase (LCC) algorithm with low redundancy is proposed, where only the necessary number of test vectors (TVs) are generated and key equations are calculated according to the channel evaluation to reduce the decoding complexity. The algorithm evaluates the error symbol numbers by counting the number of unreliable bits of the received code sequence and dynamically adjusts the decoding parameters, which can reduce a large number of redundant calculations in the decoding process. We provide a simplified multiplicity assignment (MA) scheme and its architecture. Moreover, a multi-functional block that can implement polynomial selection, Chien search and the Forney algorithm (PCF) is provided. On this basis, a high-efficiency LCC decoder with adaptive error-correcting capability is proposed. Compared with the state-of-the-art LCC (TV = 16) decoding, the number of TVs of our decoder was reduced by 50.4% without loss of the frame error rate (FER) performance. The hardware implementation results show that the proposed decoder achieved 81.6% reduced average latency and 150% increased throughput compared to the state-of-the-art LCC decoder.     

Discrete Fourier Transform with Denoise Model Based Least Square Wiener Channel Estimator for Channel Estimation in MIMO-OFDM

Multiple-input Multiple-Output (MIMO) systems require orthogonal frequency division multiplexing to operate efficiently in multipath communication (OFDM). Channel estimation (C.E.) is used in channel conditions where time-varying features are required. The existing channel estimation techniques are highly complicated. A channel estimation algorithm is needed to estimate the received signal’s correctness. In order to resolve this complexity in C.E. methodologies, this paper developed an Improved Channel Estimation Algorithm integrated with DFT-LS-WIENER (ICEA-DA). The Least Square (L.S.) and Minimum Mean Square Error (MMSE) algorithms also use the Discrete Fourier Transform (DFT)-based channel estimation method. The DFT-LS-WIENER channel estimation approach is recommended for better BER performance. The input signal is modulated in the transmitter module using the Quadrature Phase Shift Keying (QPSK) technique, pulse modeling, and least squares concepts. The L.S. Estimation technique needs the channel consistent throughout the estimation period. DFT joined with L.S. gives higher estimation precision and limits M.S.E. and BER. Experimental analysis of the proposed state-of-the-art method shows that DFT-LS-WIENER provides superior performance in terms of symbol error rate (S.E.R.), bit error rate (BER), channel capacity (CC), and peak signal-to-noise (PSNR). At 15 dB SNR, the proposed DFT-LS-WIENER techniques reduce the BER of 48.19%, 38.19%, 14.8%, and 14.03% compared to L.S., LS-DFT, MMSE, and MMSE-DFT. Compared to the conventional algorithm, the proposed DFT-LS-WIENER outperform them.