Application of maximum rank distance codes in designing of STBC-OFDM system for next-generation wireless communications

Space-Time Block Coded(STBC)Orthogonal Frequency Division Multiplexing(OFDM)satisfies higher data-rate requirements while maintaining signal quality in a multipath fading channel.However,conventional STBCs,including Orthogonal STBCs(OSTBCs),Non-Orthogonal(NOSTBCs),and Quasi-Orthogonal STBCs(QOSTBCs),do not provide both maximal diversity order and unity code rate simultaneously for more than two transmit antennas.This paper targets this problem and applies Maximum Rank Distance(MRD)codes in designing STBCOFDM systems.By following the direct-matrix construction method,we can construct binary extended finite field MRD-STBCs for any number of transmitting antennas.Work uses MRD-STBCs built over Phase-Shift Keying(PSK)modulation to develop an MRD-based STBC-OFDM system.The MRD-based STBC-OFDM system sacrifices minor error performance compared to traditional OSTBC-OFDM but shows improved results against NOSTBC and QOSTBC-OFDM.It also provides 25%higher data-rates than OSTBC-OFDM in configurations that use more than two transmit antennas.The tradeoffs are minor increases in computational complexity and processing delays.

Efficient Soft-Decision Maximum-Likelihood Decoding of BCH Code in the GNSS

Soft-decision decoding of BCH code in the global navigation satellite system( GNSS) is investigated in order to improve the performance of traditional hard-decision decoding. Using the nice structural properties of BCH code,a soft-decision decoding scheme is proposed. It is theoretically shown that the proposed scheme exactly performs maximum-likelihood( ML) decoding,which means the decoding performance is optimal. Moreover,an efficient implementation method of the proposed scheme is designed based on Viterbi algorithm. Simulation results show that the performance of the proposed soft-decision ML decoding scheme is significantly improved compared with the traditional hard-decision decoding method at the expense of moderate complexity increase.

A proof of maximum contention-free property of interleavers for Turbo codes using permutation polynomials over integer rings

It is well known that interleavers play a critical role in Turbo coding/decoding schemes, and contention-free interleaver design has become a serious problem in the paraUelization of Turbo decoding, which is indispensable to meet the demands for high throughput and low latency in next generation mobile communication systems. This paper unveils the fact that interleavers based on permutation polynomials modulo N are contention-free for every window size W, a factor of the intedeaver length N, which, also called maximum contention-free interleavers.

基于常循环码的纠缠辅助量子Maximum-Distance-Separable码的构造

纠缠辅助量子纠错码可以看作是经典量子纠错码的引申,其与经典量子纠错码的差别在于,如果发送者和接收者双方提前共享纠缠态,在不满足对偶包含的的情况下也可以由任意经典线性码构造出来.本文通过研究分圆陪集的结构性质,利用常循环码构造出几类新的具有较小预先共享纠缠态的纠缠辅助量子Maximum-Distance-Separable(MDS)码.

Spatial channel pairing-based maximum ratio combining algorithm for cooperative relay networks

To improve the reliable performance of information transmission in cooperative relay networks, the scheme of the max-rate spatial channel pairing （SCP） based on maximum ratio combining （MRC） is proposed. The scheme includes three steps： channel phase cancellation, MRC, and SCP. Eventually, the solution of the scheme is modeled as convex optimization. The objective function of the optimization problem is to maximize the transmission rate and the optimization variable is the strategy of pairing between the uplink spatial sub-channels of each user and the corresponding downlink spatial ones. The theorem of the arrangement inequalities is adopted to obtain the approximate closed-form solution of the optimal pairing for this convex optimization. Simulation results demonstrate that compared to the existing distributed space-time block coding and coherent combined schemes without SCP, the proposed max-rate SCP plus MRC algorithm achieves appreciable improvements in symbol error rate in medium and high signal-to-noise ratio regimes. The achievable performance gain is due to the use of maxrate SCP.

Maximum two-dimensional (u×v,4,1,3)-OOCs

Let Ф（u ×v, k, Aa, Ac） be the largest possible number of codewords among all two- dimensional （u ×v, k, λa, λc） optical orthogonal codes. A 2-D （u× v, k, λa, λ）-OOC with Ф（u× v, k, λa, λc） codewords is said to be maximum. In this paper, the number of codewords of a maximum 2-D （u × v, 4, 1, 3）-OOC has been determined.

An Adaptive Joint Source/Channel Coding Using Error Correcting Arithmetic Codes

An approximately optimal adaptive arithmetic coding (AC) system using a forbidden symbol (FS) over noisy channels was proposed which allows one to jointly and adaptively design the source decoding and channel correcting in a single process, with superior performance compared with traditional separated techniques. The concept of adaptiveness is applied not only to the source model but also to the amount of coding redundancy. In addition, an improved branch metric computing algorithm and a faster sequential searching algorithm compared with the system proposed by Grangetto were proposed. The proposed system is tested in the case of image transmission over the AWGN channel, and compared with traditional separated system in terms of packet error rate and complexity. Both hard and soft decoding were taken into account.

A Method for Improving Power Distribution Characteristics of Space Time Block Codes

Improving power distribution characteristics of space time block codes(STBCs),namely peak to average power ratio(PAPR),average to minimum power ratio(Ave/min),and probability of transmitting"zero"by antenna,makes easier their practical implementation.To this end,this study proposes to multiply full diversity STB C with a non-singular matrix in multiple input multiple output(MIMO)or multiple input single output(MISO)systems with linear or maximum likelihood(ML)receivers.It is proved that the obtained code achieves full diversity and the order of detection complexity does not change.The proposed method is applied to different types of STBCs.The bit error rate(BER)and power distribution characteristics of the new codes demonstrate the superiority of the introduced method.Further,lower and upper bounds on the BER of the obtained STBCs are derived for all receivers.The proposed method provides trade-off among PAPR,spectral efficiency,energy efficiency,and BER.

Integrated Joint Source-Channel Symbol-by-Symbol Decoding of Variable-Length Codes Using 3-D MAP Sequence Estimation

Most of multimedia schemes employ variable-length codes （VLCs） like Huffman code as core components in obtaining high compression rates. However VLC methods are very sensitive to channel noise. The goal of this paper is to salvage as many data from the damaged packets as possible for higher audiovisual quality. This paper proposes an integrated joint source-channel decoder （I-JSCD） at a symbol-level using three-dimensional （3-D） trellis representation for first-order Markov sources encoded with VLC source code and convolutional channel code. This method combines source code and channel code state-spaces and bit-lengths to construct a two-dimensional （2-D） state-space, and then develops a 3-D trellis and a maximum a-posterior （MAP） algorithm to estimate the source sequence symbol by symbol. Experiment results demonstrate that our method results in significant improvement in decoding performance, it can salvage at least half of （50%） data in any channel error rate, and can provide additional error resilience to VLC stream like image, audio, video stream over high error rate links.

Iterative Decoding of Parallel Concatenated Block Codes and Coset Based MAP Decoding Algorithm for F24 Code

A multi dimensional concatenation scheme for block codes is introduced, in which information symbols are interleaved and re encoded for more than once. It provides a convenient platform to design high performance codes with flexible interleaver size. Coset based MAP soft in/soft out decoding algorithms are presented for the F24 code. Simulation results show that the proposed coding scheme can achieve high coding gain with flexible interleaver length and very low decoding complexity.

Ensemble of High Performance Structured Binary Convolutional LDPC Codes with Moderate Rates

An algebraic construction methodology is proposed to design binary time-invariant convolutional low-density parity-check(LDPC)codes.Assisted by a proposed partial search algorithm,the polynomialform parity-check matrix of the time-invariant convolutional LDPC code is derived by combining some special codewords of an(n,2,n−1)code.The achieved convolutional LDPC codes possess the characteristics of comparatively large girth and given syndrome former memory.The objective of our design is to enable the time-invariant convolutional LDPC codes the advantages of excellent error performance and fast encoding.In particular,the error performance of the proposed convolutional LDPC code with small constraint length is superior to most existing convolutional LDPC codes.

基于深度学习的HS Code产品归类方法研究

国际贸易通关业务使用的HS Code编码专业又复杂,使其在归类、查询和确认过程中需要大量人工处理,而且很容易出错,已成为影响当前国际贸易货物通关效率的重要因素,如何进行HS Code产品自动归类是个非常值得研究的问题。HS Code产品归类本质上是一种文本分类问题,但由于其数据的特殊性,使用传统的经典文本分类方法并不能取得很好的效果,近年来深度学习在自然语言处理领域取得质的突破,所以基于深度学习的HS Code产品归类方法值得研究,对该方法涉及的算法进行详细设计和分析,通过实验对方法实现进行验证和分析,并且与基于最大熵模型的方法进行比较,结果表明基于深度学习的归类准确率高于基于最大熵模型的方法,是一种有意义可行的HS Code产品自动归类方法。

A NEW DESIGN METHOD OF CDMA SPREADING CODES BASED ON MULTI-RATE UNITARY FILTER BANK

It is well-known that the multi-valued CDMA spreading codes can be designed by means of a pair of mirror multi-rate filter banks based on some optimizing criterion. This paper indicates that there exists a theoretical bound in the performance of its circulating correlation property, which is given by an explicit expression. Based on this analysis, a criterion of maximizing entropy is proposed to design such codes. Computer simulation result suggests that the resulted codes outperform the conventional binary balanced Gold codes for an asynchronous CDMA system.

Non-Vanishing Space Time Block Code for Three Time Slots and Two Transmit Antennas

Recently, space time block codes (STBCs) are proposed for multi-input and multi-output (MIMO) antenna systems. Designing an STBC with both low decoding complexity and non-vanishing property for the Long Term Evolution Advanced (LTE-A) remains an open issue. In this paper, first our previously proposed STBC’s non-vanishing property will be completely described. The proposed STBC scheme has some interesting properties: 1) the scheme can achieve full rate and full diversity;2) its maximum likelihood (ML) decoding requires a joint detection of three real symbols;3) the minimum determinant values (MDVs) do not vanish by increasing signal constellation sizes;4) compatible with the single antenna transmission mode. The sentence has been dropped. Second, in order to improve BER performance, we propose a variant of proposed STBC. This scheme further decreases the detection complexity with a rate reduction of 33%;moreover, non-vanishing MDVs property is preserved. The simulation results show the second proposed STBC has better BER performance compared with other schemes.

Modeling and Simulation of CDMA Codes in Scilab

Prior to hardware implementation, simulation is an important step in the study of systems such as Direct Sequence Code Division Multiple Access (DS-CDMA). A useful technique is presented, allowing to model and simulate Linear Feedback Shift Register (LFSR) for CDMA. It uses the Scilab package and its modeling tool for dynamical systems Xcos. PN-Generators are designed for the quadrature-phase modulation and the Gold Code Generator for Global Positioning System (GPS). This study gives a great flexibility in the conception of LFSR and the analysis of Maximum Length Sequences (MLS) used by spread spectrum systems. Interesting results have been obtained, which allow the verification of generated sequences and their exploitation by signal processing tools.

An improved deconvolution method for X-ray coded imaging in inertial confinement fusion

In inertial confinement fusion （ICF）, X-ray coded imaging is considered as the most potential means to diagnose the compressed core. The traditional Richardson-Lucy （RL） method has a strong ability to deblur the image where the noise follows the Poisson distribution. However, it always suffers from over-fitting and noise amplification, especially when the signal-to-noise ratio of image is relatively low. In this paper, we propose an improved deconvolution method for X-ray coded imaging. We model the image data as a set of independent Gaussian distributions and derive the iterative solution with a maximum-likelihood scheme. The experimental results on X-ray coded imaging data demonstrate that this method is superior to the RL method in terms of anti-overfitting and noise suppression.

多接收子阵下特征波束的角度空间调制方法

基于波束赋形的波束切换空间调制算法,不仅可以提高频谱效率,还可以利用天线阵列增益提高能量效率。该文利用信道响应构造统计平均的协方差矩阵,构造正交特征向量作为阵列的加权矢量,形成相互独立的多个等效传输信道,利用波束赋形增益和分集增益提高无线通信的传输可靠性和传输能力。进一步采用天线子阵分组方法,克服信道相关性带来的不利影响。性能分析和仿真结果表明,特征波束角度空间调制方案可获得更多的波束组合数目,会明显改善译码性能和频谱效率。

语义通信的数学理论

自从1948年经典信息论诞生以来,在其指导下,现代通信技术已经逼近了理论性能极限,例如信息熵H(U)、信道容量C=max_(p(x))I(X;Y)以及率失真函数R(D)=min_(p(x|x):Ed(x,x)≤D)I(X;X)。长期以来,由于经典信息论只研究语法信息,限制了通信科学的进一步发展。近年来,研究语义信息处理与传输的通信技术获得了学术界的普遍关注,语义通信开辟了未来通信技术发展的新方向,但还缺乏一般性的数学指导理论。为了解决这一难题,构建了语义信息论的理论框架,对语义信息的度量体系与语义通信的理论极限进行了系统性阐述。首先,通过深入分析各类信源的数据特征,以及各种下游任务的需求,总结归纳出语义信息的普遍属性——同义性。由此指出语义信息是语法信息的上级概念,是许多等效或相似语法信息的抽象特征,表征隐藏在数据或消息背后的含义或内容。将语义信息与语法信息之间的关系命名为同义映射,这是一种“一对多”映射,即一个语义符号可以由许多不同的语法符号表示。基于同义映射f这一核心概念,引入语义熵H_(s)(U)作为语义信息的基本度量指标,表示为信源概率分布与同义映射的泛函。在此基础上,引入上/下语义互信息I^(s)(X;Y)(I_(s)(X;Y)),语义信道容量C_(s)=max_(f_(xy))max_(p_((x)))I^(s)(X;Y)以及语义率失真函数R_(s)(D)=min_({f_(x),f_(x)})min_(p(x|x):Ed_(s)(x,x)≤D)I_(s)(X;X),从而构建了完整的语义信息度量体系。这些语义信息度量是经典信息度量的自然延伸,都由同义映射约束,如果采用“一对一”映射,则可以退化为传统的信息度量。由此可见,语义信息度量体系包含语法信息度量,前者与后者具有兼容性。其次,证明了3个重要的语义编码定理,以揭示语义通信的性能优势。基于同义映射,引入新的数学工具——语义渐近均分(AEP),详细探讨了同义典型序列的数学性质,并应用随机编码和同义典型序列译码/编码,证明了语义无失真信源编码定理、语义信道编码定理和语义限失真信源编码定理。类似于经典信息论,这些基本编码定理也都是存在性定理,但它们指出了语义通信系统的性能极限,在语义信息论中起着关键作用。由同义映射和这些基本编码定理可以推断,语义通信系统的性能优于经典通信系统,即语义熵小于信息熵H_(s)(U)≤H(U),语义信道容量大于经典信道容量C_(s)≥C,以及语义率失真函数小于经典率失真函数R_(s)(D)≤R(D)。最后,讨论了连续条件下的语义信息度量。此时,同义映射转换为连续随机变量分布区间的划分方式。相应地,划分后的子区间被命名为同义区间,其平均长度定义为同义长度S。特别是对于限带高斯信道,得到了一个新的信道容量公式C_(s)=B log[S^(4)(1+P/N_(0)B)],其中,平均同义长度S表征了信息的辨识能力。这一容量公式是经典信道容量的重要扩展,当S=1时,该公式退化为著名的香农信道容量公式。综上所述,语义信息论依据同义映射这一语义信息的本质特征,构建了语义信息的度量体系,引入新的数学工具,证明了语义编码的基本定理,论证了语义通信系统的性能极限,揭示了未来语义通信的巨大性能潜力。

带有动态到达工件的分布式柔性作业车间调度问题研究

分布式柔性作业车间调度是生产调度的1个重要分支,工件的动态到达作为实际生产中的1种常见扰动情况,进一步增加了作业车间调度问题的复杂性和不确定性。针对带有工件动态到达的分布式柔性作业车间调度问题(DA-DFJSP),提出1种分批调度策略,将原本的动态调度问题转化成一系列连续调度区间上的静态调度问题,构建以最大完工时间为优化目标的混合整数规划模型;在此基础上,结合问题特征采用批次、工厂、工序、机器的4层染色体编码及快速贪婪搜索插入的解码方式改进遗传算法,同时引入多种交叉、变异算子来增强染色体的多样性;最后,基于FJSP标准算例构建DA-DFJSP测试算例进行仿真对比实验,验证所提策略和改进算法的求解优势。结果表明:相较于传统的重调度策略和改进前的遗传算法,采用分批调度策略和改进的遗传算法(IGA)所求调度方案具有更短的完工周期、更均匀的工厂加工负荷及更高的设备工作效率,IGA与分批调度策略之间有高度的契合性,能够有效提升生产效率。

基于最大后验估计的编码孔图像重建算法

图像重建算法对编码孔伽马相机的成像性能有重要的影响,然而广泛使用的最大似然期望最大化(MLEM)算法无法在较强干扰背景下有效抑制图像中的噪声,当超过一定迭代次数后,图像信噪比会逐渐降低。针对MLEM算法的这一“病态性”问题开展了研究。首先将最大后验估计(MAP)算法应用于编码孔图像重建,接着分析了算法中Gibbs先验函数的邻域大小和权值系数等关键参数的选取方法。然后使用编码孔相机开展了成像实验,对比了MLEM算法与MAP算法对22Na点源的图像重建结果。结果表明,在300~1 200次迭代下,MLEM重建图像中出现了明显的噪点,且随着迭代深入图像质量逐渐变差;而MAP重建图像没有出现明显噪点,重建图像的平均梯度相较于MLEM降低了26.45%~49.16%,对比度噪声比(CNR)提升了42.32%~351.07%。另外,对比了3×3和5×5邻域大小时的多点源图像重建结果,结果显示,邻域过小会导致重建图像的热点亮度降低,与理论分析结果一致。最后,分别对比了MLEM与MAP算法在较远距离和较强干扰两种场景下的成像结果,MAP算法均表现出更好的信噪比性能。