基于1D-Concatenate的信道估计DNN模型优化方法

为提高DNN模型在无线通信中信道估计精度,提出一种基于1D-Concatenate的信道估计DNN模型优化方法。该方法将Concatenate进行一维(1D)数据转换,以跳跃连接的方式引入DNN模型,抑制梯度消失问题,运用1D-Concatenate恢复网络训练过程中丢失的数据特征,提高DNN信道估计精度。为验证优化方法的有效性,选取较典型的基于DNN的无线通信信道估计模型进行对比仿真实验。实验结果表明,本文提出的优化方法对已有DNN模型的估计增益提升可达77.10%,在高信噪比下信道增益提升可达3 dB。该优化方法能有效提高DNN模型在无线通信中的信道估计精度,特别是高信噪比下提升效果显著。

Improved Design and SOVA Algorithm for Serial Concatenated Convolutional Code

To improve the performance of the short interleaved serial concatenated convolutional code(SCCC) with low decoding iterative times, the structure of Log MAP algorithm is introduced into the conventional SOVA decoder to improve its performance at short interleaving delay. The combination of Log MAP and SOVA avoids updating the matrices of the maximum path, and also makes a contribution to the requirement of short delay. The simulation results of several SCCCs show that the improved decoder can obtain satisfied performance with short frame interleaver and it is suitable to the high bit rate low delay communication systems.

Concatenated Trellis Coding and CPM for DS/SSMA Communications in Rayleigh Fading Channel

In this paper, direct sequence spread spectrum multiple access (DS/SSMA) communication system employing serially concatenated trellis coded modulation (TCM) and continuous phase modulation (CPM) over flat Rayleigh fading channel are presented. The performance of this concatenated TCM/CPM DS/SSMA system is exploited by the theoretical analysis and numerical simulations. The results demonstrate that significant improvements in error probability of this DS/SSMA system over the system with single TCM or CPM of different modulation indices can be achieved under the same conditions.

SERIALLY CONCATENATED CONTINUOUS PHASE MODULATION WITH REDUCED ITERATIVE DEMODULATION AND DETECTION

A reduced state Soft Input Soft Output (SISO) a posteriori probability algorithm for Seri-ally Concatenated Continuous Phase Modulation (SCCPM) is proposed in this paper. Based on the Reduced State Sequence Detection (RSSD),it has more general form compared with other reduced state SISO algorithms. The proposed algorithm can greatly reduce the state number,thus leads to the computation complexity reduction. It also minimizes the degradation in Euclidean distance with decision feedback in the reduced state trellis. Analysis and simulation results show that the perform-ance degradation is little with proper reduction scheme.

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.

Improved FEC Code Based on Concatenated Code for Optical Transmission Systems

The improved three novel schemes of the super forward error correction （super-FEC） concatenated codes are proposed after the development trend of long-haul optical transmission systems and the defects of the existing FEC codes have been analyzed. The performance simulation of the Reed-Solomon（RS）＋ Bose-Chaudhuri-Hocguenghem（BCH） inner-outer serial concatenated code is implemented and the conceptions of encoding/decoding the parallel-concatenated code are presented. Furthermore, the simulation results for the RS（255,239） ＋RS（255,239） code and the RS（255,239） ＋RS（255,223） code show that the two consecutive concatenated codes are a superior coding scheme with such advantages as the better error correction, moderate redundancy and easy realization compared to the classic RS（255,239） code and other codes, and their signal to noise ratio gains are respectively 2-3 dB more than that of the RS（255,239）code at the bit error rate of 1 × 10^-13. Finally, the frame structure of the novel consecutive concatenated code is arranged to lay a firm foundation in designing its hardware.

Chemical Synthesis and Cloning of Overlapping Concatenated Human Atrial Natriuretic Factor Gene with Gene Engineering

Eight oligonucleotide fragments were designed with the aid of a computer and synthesizedaccording to the amino add sequcnce of human atrial natriuretic factor(ANF).By means of an-nealing and ligation,these fragments were assembled into an overlapping concatenator consisting oftwo ANF genes ligated by TGATG for termination and initiation of translation.Theconcatenator was omserted into plasmid pRC23 and the recobinant DNA was transformed into E.coli strain TAP106.Analysis by restriction enzyme mapping,hybridization and DNA sequenongshowed that the orientation and reading frame of the gene were correct.

Degenerate asymmetric quantum concatenated codes for correcting biased quantum errors

In most practical quantum mechanical systems,quantum noise due to decoherence is highly biased towards dephasing.The quantum state suffers from phase flip noise much more seriously than from the bit flip noise.In this work,we construct new families of asymmetric quantum concatenated codes(AQCCs)to deal with such biased quantum noise.Our construction is based on a novel concatenation scheme for constructing AQCCs with large asymmetries,in which classical tensor product codes and concatenated codes are utilized to correct phase flip noise and bit flip noise,respectively.We generalize the original concatenation scheme to a more general case for better correcting degenerate errors.Moreover,we focus on constructing nonbinary AQCCs that are highly degenerate.Compared to previous literatures,AQCCs constructed in this paper show much better parameter performance than existed ones.Furthermore,we design the specific encoding circuit of the AQCCs.It is shown that our codes can be encoded more efficiently than standard quantum codes.

Decoding Technique of Concatenated HadamardCodes and Its Performance

The decoding technique of concatenated Hadamard codes and its performance are studied. Efficient soft in soft out decoding algorithms based on the fast Hadamard transform are developed. Performance required by CDMA mobile or PCS speech services, e.g. , BER=10 -3 , can be achieved at Eb/No =0.9 dB using short interleaving length of 192 bits.

Design of concatenated turbo-SPC coded space-time systems

Multiple antenna wireless systems can provide larger channel capacity and enable spatial diversity to combat fading. In this paper we conduct an investigation into the design of coded space-time system obtained by serially concatenating channel code module and space-time code module with an interleaver in between. As an example, the system is constructed by employing low decoding complexity turbo-SPC （single parity check） code as outer module and linear complex field space-time code as inner module, which achieves full diversity and lossless equivalent channel capacity. Simulation results prove that our designed system performs well and it only loses 0.8 dB from multiple-input multiple-output （MIMO） capacity at BER = 10^-5 in the case of information bit length 6048. Compared with turbo code-based systems, it also has lower error floor.

A Novel Concatenated Chaotic Communication System

A strategy for a novel concatenated chaotic communication system is presented. The transmitter system comprises chaotic turbo encoder and logistic CSK block in a serially concatenated form. Chaotic turbo code is capable of reducing bit error rate (BER) of the chaotic system in the AWGN channel. Through the chaotic turbo encoder, the coded sequence, which has quasi-chaotic properties, will be transmitted into the logistic CSK block. Having a very sensitive dependence on initial conditions of the map, the logistic CSK block can also be taken as the chaotic authentication method. The receiver, which has logistic demodulation block and chaotic decoder, is a linear asymptotic approximation to the inverse of the transmitter system. A chaotic iterative soft-decision decoding algorithm is also developed based on conventional maximum A posteriori decoding algorithm. At last, a two-step authentication method of this chaotic system is also presented.

Study on New Concatenated Code in WDM Optical Transmission Systems

A new concatenated code of RS（255,239）＋BCH（2 040,1 930） code to he suitable for WDM optical transmission systems is proposed. The simulation resuhs show that this new concatenated code. compared with the RS（255,239）4-CSOC（k0/n0=6/7, J= 8） code in ITU-TG. 75.1, has a lower redundancy and better error-correction performance, furthermore, its net coding gain（NCG） is respectively 0. 46 dB, 0.43 dB morethanthatofRS（255,239）＋CSOC（k0/n0= 6/7, J= 8） code and BCH（3860,3824）＋BCH （2 040,1 930） code in ITU TG. 75. 1 at the third iteration for the bit error rate（BER） of 10^-12. Therefore, the new super forward error correction（Super-FEC） concatenated code can be better used in ultra long-haul, ultra large-capacity and ultra high-speed WDM optical communication systems.

Performance Evaluation of OFDM Coding System Using Concatenated BCH and LDPC Codes

This paper establishes a resilient concatenated coding platform for Orthogonal Frequency Division Multiplexing (OFDM) with Quadrature Amplitude Modulation (QAM) over Additive White Gaussian Noise (AWGN) channel. At the Forward Error Correction (FEC) coding unit, our proposed concatenated coding scheme utilizes standard type of BCH as external coding and LDPC as inner coding. In this scheme, Interleaver inclusion is seen as a catalyst to enhance the systems performance.

Concatenated deleting machines and their characteristics

In this work,we study the performance of one shot and concatenated deleting machines(DMs).We show that the output state of one shot DMs are mixed inseparable,and do not violate Bell's inequality but can be used as a teleportation channel for all values of the input state parameters.On the other hand,we observe in the concatenation of different DMs that the output states are mixed inseparable and do not violate Bell's inequality,and cannot be used as a teleportation channel.Further,some important attributes such as inseparability,violation of Bell's inequality,and teleportation fidelity of the DMs remain unchanged under the order of concatenation.In this context of a teleportation channel,one shot DMs are useful when compared to concatenated DMs.

Improved Belief Propagation Decoder for LDPC-CRC-Polar Codes with Bit-Freezing

Though belief propagation bit-flip(BPBF)decoding improves the error correction performance of polar codes,it uses the exhaustive flips method to achieve the error correction performance of CA-SCL decoding,thus resulting in high decoding complexity and latency.To alleviate this issue,we incorporate the LDPC-CRC-Polar coding scheme with BPBF and propose an improved belief propagation decoder for LDPC-CRC-Polar codes with bit-freezing(LDPCCRC-Polar codes BPBFz).The proposed LDPCCRC-Polar codes BPBFz employs the LDPC code to ensure the reliability of the flipping set,i.e.,critical set(CS),and dynamically update it.The modified CS is further utilized for the identification of error-prone bits.The proposed LDPC-CRC-Polar codes BPBFz obtains remarkable error correction performance and is comparable to that of the CA-SCL(L=16)decoder under medium-to-high signal-to-noise ratio(SNR)regions.It gains up to 1.2dB and 0.9dB at a fixed BLER=10-4compared with BP and BPBF(CS-1),respectively.In addition,the proposed LDPC-CRC-Polar codes BPBFz has lower decoding latency compared with CA-SCL and BPBF,i.e.,it is 15 times faster than CA-SCL(L=16)at high SNR regions.

A Theoretical Method for Estimating Performance of Reed-Solomon Codes Concatenated with Orthogonal Space-Time Block Codes

Based on the studies of Reed-Solomon codes and orthogonalspace-time block codes over Rayleigh fading channel, a theoreticalmethod for estimating performance of Reed-Solomon codes concatenatedwith orthogonal space- time block codes is presented in this paper.And an upper bound of the bit error rate is also obtained. It isshown through computer simulations that the signal-to-noise ratioreduces about 15 dB or more after orthogonal space-time block codesare concatenate with Reed-Solomon(15,6)codes over Rayleigh fadingchannel, when the bit error rate is 10^-4.

Multiple accumulated-crossover parallel concatenated SPC codes

By constructing an accumulated-crossover relationship in multiple parallel concatenated single parity check （M-PC-SPC） codes, a class of error-correcting codes, termed multiple accumulated-crossover parallel concatenated single parity check （M-ACPC-SPC） codes, is proposed. M-ACPC-SPC codes possess linear encoding complexity and can be decoded iteratively with low complexity by the sum-product algorithm （SPA）. Simulation results show that M-ACPC-SPC codes have lower error floors than M-PCSPC codes with the same dimension, and when the dimension is 5, M-ACPC-SPC codes achieve bit error rate （BER） better than （3, 6） regular low density parity check （LDPC） codes.

A reduced state SISO iterative decoding algorithm for serially concatenated continuous phase modulation

In this paper, serially concatenated continuous phase modulation （SCCPM） system is analyzed and a reduced state soft input soft output （SlSO） a posteriori probability algorithm is proposed. Based on the reduced state sequence detection （RSSD）, it has the more general form compared with other reduced state SISO algorithms. The proposed algorithm can greatly reduce the state number, thus leads to the computation complexity reduction. It also minimizes the degradation in Euclidean distance with decision feedback in the reduced state trellis. Analysis and simulation results show that the performance degradation is little with proper reduction scheme.

On Some Properties of Graph of Prefix Code

We investigate decomposition of codes and finite languages. A prime decomposition is a decomposition of a code or languages into a concatenation of nontrivial prime codes or languages. A code is prime if it cannot be decomposed into at least two nontrivial codes as the same for the languages. In the paper, a linear time algorithm is designed, which finds the prime decomposition. If codes or finite languages are presented as given by its minimal deterministic automaton, then from the point of view of abstract algebra and graph theory, this automaton has special properties. The study was conducted using system for computational Discrete Algebra GAP. .

Nannochloropsis artificial chromosomes(Nanno ACs)loom on the horizon

Species in genus Nannochloropsis,especially N.oceanica and N.gaditana,have been evolving as the model microalgae for both application and theory studies.The position effect of genome integration,the carrying capability limitation of integrative vectors and the instability of non-integrative vectors have hindered Nannochloropsis genetic modification with concatenate genes and extremely long DNA fragments.The molecular tools including genetic transformation,homologous recombination,gene edition,gene stacking and episome vectors for transient gene expression and diverse reporters and selection markers have been rapidly developing in Nannochloropsis species.The construction of animal and plant artificial chromosomes with“top down”strategy has set fine examples for the construction of Nannochloropsis artificial chromosomes(NannoACs).It seems that the methods and materials to set the foundation for constructing NannoACs are at hands.In this review,we outlined the current status of transgenes in Nannochloropsis species,summarized the limitations of both integrative and non-integrative vectors,and proposed a tentative approach to construct NannoACs by doubling and stabilizing the genome first,and then truncating the natural chromosomes.NannoACs once constructed will facilitate transferring the desired traits and concatenate genes into Nannochloropsis genetic backgrounds,thus contributing towards its genetic improvement and synthetic biological studies.