基于MIMO的信号检测技术在宽带数据链中的应用

分析了多输入多输出系统中空分复用和空时分组码的解码算法，提出了一种空分复用和空时分组码相结合的方案，探讨了这种方案的解码算法并对该算法进行了仿真验证．结果表明，这种方案的BER性能在高信噪比时要好于其它方案，因而可以应用到需要高传输速率以及高链路可靠性的宽带数据链中．     

Blind turbo-detection in the presence of phase noise

Blind coherent detection of convolutional turbo codes is a hard problem in the presence of strong phase noise. Since the operating signal-to-noise ratio is usually very low, phase synchronisation algorithms suffer from phase ambiguities and cycle slips. A possible remedy is to perform joint phase estimation and decoding on a combined state-space model for the time-varying phase and the component convolutional codes. We demonstrate that joint phase estimation and decoding is in fact mandatory only for one component code, while ordinary BCJR decoding can be used for the second component code. Monte Carlo simulations for the turbo code used in the DVB-RCS standard show that the performances of the proposed scheme are close to decoding with perfect knowledge of the phase.     

Multichannel sampling schemes for optical imaging systems

We introduce a framework of focal-plane coding schemes for multichannel sampling in optical systems. A particular objective is to develop an ultrathin imager without compromising image resolution. We present a complete f/2.1 optical system with a thickness of 2.2 mm. The resolution is maintained in the thin optical system by an integrated design of the encoding scheme, the process of making the coding elements, and the decoding algorithms.     

Two new decoding algorithms for Reed-Solomon codes

The subject of decoding Reed-Solomon codes is considered. By reformulating the Berlekamp and Welch key equation and introducing new versions of this key equation, two new decoding algorithms for Reed-Solomon codes will be presented. The two new decoding algorithms are significant for three reasons. Firstly the new equations and algorithms represent a novel approach to the extensively researched problem of decoding Reed-Solomon codes. Secondly the algorithms have algorithmic and implementation complexity comparable to existing decoding algorithms, and as such present a viable solution for decoding Reed-Solomon codes. Thirdly the new ideas presented suggest a direction for future research. The first algorithm uses the extended Euclidean algorithm and is very efficient for a systolic VLSI implementation. The second decoding algorithm presented is similar in nature to the original decoding algorithm of Peterson except that the syndromes do not need to be computed and the remainders are used directly. It has a regular structure and will be efficient for implementation only for correcting a small number of errors. A systolic design for computing the Lagrange interpolation of a polynomial, which is needed for the first decoding algorithm, is also presented.This research was supported by a grant from the Canadian Institute for Telecommunications Research under the NCE program of the Government of Canada     

Comprehensive partial decoding approach for two-level relay networks

Partial decoding scheme is a scheme in which each relay decodes only part of the transmitted message. Obviously, the achievable rates proposed by the partial decoding scheme subsume the achievable rates proposed by the full decoding scheme. The other motivation of using partial decoding scheme is that there are some special classes of relay networks such as semi-deterministic and orthogonal relay networks such that their capacities are obtained via this scheme. The authors propose a comprehensive partial decoding scheme based on regular encoding/sliding window decoding analysis to propose a new achievable rate for two-level relay networks. In contrast with the previously proposed methods, here the authors consider all possible partial decoding states that can occur between the different parts of the messages of the source and the relays in a two-level relay network. In this way, the common and private parts of the message transmitted by the source are defined to be decoded by the appropriate relays. Moreover, in the proof, the authors take advantage of regular encoding/sliding window decoding scheme that has superiorities to regular encoding/backward decoding and irregular encoding/random partitioning, in having less delay and yielding higher rates, respectively.     

水声通信系统中分布式空时分组码的研究

协作传输可以获得无线信道内在的空间分集,有效改善通信系统的性能,增加通信系统的覆盖范围。对水声通信系统中两中继节点协作的译码转发方案进行了研究,提出了基于译码转发协议(DF)的分布式空时分组扩频编码(DSTBSC)方案,该方案可以克服多径衰落对分布式空时分组码(DSTBC)信号正交性的影响。给出了DSTBSC方案的系统模型,着重分析了在采用两中继译码转发时,中继节点的误码对水声通信系统性能的影响。在接收端不考虑信号冲突的情况进行仿真,结果表明,与直接传输方案相比,采用两中继节点、译码转发的DSTBSC方案,在两中继节点处均无误码和一个中继有误码时在相同的比特误码率(BER)条件下均可获得约4dB的分集增益,增加了传输距离。     

Gradient projection decoding of LDPC codes and algorithmic variations

The current study proposes decoding algorithms for low density parity check codes (LDPC), which offer competitive performance-complexity trade-offs relative to some of the most efficient existing decoding techniques. Unlike existing low-complexity algorithms, which are essentially reduced complexity variations of the classical belief propagation algorithm, starting point in the developed algorithms is the gradient projections (GP) decoding technique, proposed by Kasparis and Evans (2007). The first part of this paper is concerned with the GP algorithm itself, and specifically with determining bounds on the step-size parameter, over which convergence is guaranteed. Consequently, the GP algorithm is reformulated as a message passing routine on a Tanner graph and this new formulation allows development of new low-complexity decoding routines. Simulation evaluations, performed mainly for geometry-based LDPC constructions, show that the new variations achieve similar performances and complexities per iteration to the state-of-the-art algorithms. However, the developed algorithms offer the implementation advantages that the memory-storage requirement is significantly reduced, and also that the performance and convergence speed can be finely traded-off by tuning the step-size parameter.     

A cooperative turbo coding scheme for wireless fading channels

A coded cooperative transmission scheme based on turbo encoding/decoding, in which only newly generated parity bits of the partner are sent if the user successfully decodes its partner's information in order to improve bandwidth efficiency is proposed. The proposed encoding structure introduces correlation between users' data over multiple frames, which offers effectively longer codes and facilitates high-performance iterative multi-user decoding at the destination. Additionally, the iterative decoding over multiple frames can provide time diversity besides spatial diversity inherent in user cooperation even for flat block fading channels. Simulation results show that the proposed scheme significantly outperforms direct transmission for the same transmitted power and bandwidth efficiency.     

A new signal processing technique for d=1 channel codes

This paper presents a strategy for reducing nonlinearities at high-recording densities; new additional encoding scheme for DC-free d=1 channel codes, and, a partial response (1+D) system with 2-bit decoding. This encoding scheme, which to DC-free codes, reduces by one bit transition interval of d=1 codes, and ensures a wide margin of timing offset. In order to use erasures for the error correction code, the 2-bit decoding scheme is employed in-parallel to detect errors in the decoding procedure. An improvement in the error rate by using parallel decoding is shown     

A complete immunoglobulin-based artificial immune system algorithm for two-stage assembly flowshop scheduling problem with part splitting and distinct due windows

This paper considers a two-stage assembly flowshop scheduling problem with distinct due windows to minimise the sum of weighted earliness and tardiness. There are several identical parallel machines which produce parts in the first stage. When the required parts are available, a single assembly machine can group these parts into products in the second stage. It is assumed that a part can be split into sub-parts which can be processed independently on the parallel machines in the first stage. Setup is also considered. A mathematical model is established to describe and define the proposed problem. A new decoding method is developed by extending an existing decoding method. Two novel operators, named part splitting (PS) and optimal idle time insertion (ITI), are incorporated into the decoding procedure for improving the quality of the solution. A rule named Priority of Earliness and Tardiness (PET) and a Complete Immunoglobulin-based Artificial Immune System (C-IAIS) algorithm are proposed for solving the problem. To evaluate PET and C-IAIS algorithm, several existing algorithms are used in the experiments. Computational results show that C-IAIS algorithm performs better than other algorithms for solving the proposed problem.     

具有双极性的非相干OCDMA系统性能分析

提出了一种可减少多址干扰的非相干OCDMA编解码方案，该方案利用光开关控制2个单极性编码器和1个具有平衡互补结构的解码器，在1个光学信道上实现了双极性OCDMA信号传输；分析了电光编码、传输、解码、光电转换等环节的信号变化，推导出系统的噪声和误码率公式；与其它CDMA方案比较表明本方案在误码率方面可达到电域双极性CDMA系统的水平。     

Pattern时延差编码水声通信抗多普勒的差分解码研究

研究了 Pattern时延差编码（Pattern Time Delay Shift Coding,PTDS）水声通信的差分解码技术。在移动水声通信中,多普勒频偏会对信号产生时间上的压缩或展宽。差分解码通过测量相邻Pattern的时间差进行时延估计完成译码,克服了多普勒频偏在时间上的累加效应,具有更强的抵抗多普勒能力,为移动水声通信技术的研究打下了基础。仿真实验证明所提出的解码方案简单易行、性能优良。     

SISO algorithms based on Max-Log-MAP and Log-MAP turbo decoding

Novel soft-input soft-output (SISO) decoding algorithms suitable for turbo codes are proposed with good compromise between complexity and bit error rate (BER) performance. The algorithms are based on the application of the max/max* (i.e. Jacobian logarithm) operations at different levels when computing the decoder soft-output value. It is observed that some decoding schemes from the authors' previously published work fall into the family of methods described here. The effect is to provide a range of possibilities allowing system designers to make their own choices for turbo code BER performance against complexity     

Bit error performance of diffuse indoor optical wireless channel pulse position modulation system employing artificial neural networks for channel equalisation

The bit-error rate (BER) performance of a pulse position modulation (PPM) scheme for non-line-of-sight indoor optical links employing channel equalisation based on the artificial neural network (ANN) is reported. Channel equalisation is achieved by training a multilayer perceptrons ANN. A comparative study of the unequalised dasiasoftdasia decision decoding and the dasiaharddasia decision decoding along with the neural equalised dasiasoftdasia decision decoding is presented for different bit resolutions for optical channels with different delay spread. We show that the unequalised dasiaharddasia decision decoding performs the worst for all values of normalised delayed spread, becoming impractical beyond a normalised delayed spread of 0.6. However, dasiasoftdasia decision decoding with/without equalisation displays relatively improved performance for all values of the delay spread. The study shows that for a highly diffuse channel, the signal-to-noise ratio requirement to achieve a BER of 10^-5 for the ANN-based equaliser is ~10~dB lower compared with the unequalised-soft-decoding for 16-PPM at a data rate of 155 Mbps. Our results indicate that for all range of delay spread, neural network equalisation is an effective tool of mitigating the inter-symbol interference.     

Indirect decoding edges for one-shot shape acquisition

Determining the correspondence in coded structured light is challenging, but it is very important in one-shot techniques for 3D shape reconstruction. The problem of decoding stripe patterns can be modeled as matching two code sequences. We propose decoding edges indirectly based on the property of the stripe pattern, which can be represented as edge code, color code, or mixed code sequences. While traditional methods match two edge code sequences, indirect decoding matches two color sequences or mixed code sequences. The advantages of the proposed method, including a higher Hamming distance, enforced local coherence, and more code information, make indirect decoding excellent in performance. Previously, the lack of ground truth has prevented direct comparisons of different decoding algorithms. Here we obtain six benchmark datasets using the robust space-time analysis. Five decoding methods are quantitatively evaluated using the ground truth. The comparison results show that our method is robust for complex code situations and that it outperforms the state-of-the-art technique in this area.     

Minimising total tardiness for the identical parallel machine scheduling problem with splitting jobs and sequence-dependent setup times

This paper focuses on an identical parallel machine scheduling problem with minimising total tardiness of jobs. There are two major issues involved in this scheduling problem; (1) jobs which can be split into multiple sub-jobs for being processed on parallel machines independently and (2) sequence-dependent setup times between the jobs with different part types. We present a novel mathematical model with meta-heuristic approaches to solve the problem. We propose two encoding schemes for meta-heuristic solutions and three decoding methods for obtaining a schedule from the meta-heuristic solutions. Six different simulated annealing algorithms and genetic algorithms, respectively, are developed with six combinations of two encoding schemes and three decoding methods. Computational experiments are performed to find the best combination from those encoding schemes and decoding methods. Our findings show that the suggested algorithm provides not only better solution quality, but also less computation time required than the commercial optimisation solvers.     

Polynomial root finding over local rings and application to error correcting codes

This article is devoted to algorithms for computing all the roots of a univariate polynomial with coefficients in a complete commutative Noetherian unramified regular local domain, which are given to a fixed common finite precision. We study the cost of our algorithms, discuss their practical performances, and apply our results to the Guruswami and Sudan list decoding algorithm over Galois rings.     

Code-based Sequential Aggregate Signature Scheme

This paper proposes the first code-based quantum immune sequential aggregate signature (SAS) scheme and proves the security of the proposed scheme in the random oracle model. Aggregate signature (AS) schemes and sequential aggregate signature schemes allow a group of potential signers to sign different messages respectively, and all the signatures of those users on those messages can be aggregated into a single signature such that the size of the aggregate signature is much smaller than the total size of all individual signatures. Because of the aggregation of many signatures into a single short signature, AS and SAS schemes can reduce bandwidth and save storage; moreover, when a SAS is verified, not only the valid but also the order in which each signer signed can be verified. AS and SAS schemes can be applied to traffic control, banking transaction and military applications. Most of the existing AS and SAS schemes are based either on pairing or Rivest–Shamir–Adleman (RSA), and hence, can be broken by Shor’s quantum algorithm for Integer Factoring Problem (IFP) and Discrete Logarithm Problem (DLP). There are no quantum algorithms to solve syndrome decoding problems. Hence, code-based cryptography is seen as one of the promising candidates for post-quantum cryptography. This paper shows how to construct quantum immune sequential aggregate signatures based on coding theory. Specifically, we construct our scheme with the first code based signature scheme proposed by Courtois, Finiasz and Sendrier (CFS). Compared to the CFS signature scheme without aggregation, the proposed sequential aggregate signature scheme can save about 90% storage when the number of signers is asymptotically large.     

Application of MTR soft-decision decoding in multiple-head magnetic recording systems

Application of a simple approach for the soft-decision decoding of Maximum-Transition-Run (MTR) codes has been presented in this paper. A lowdemanded hardware realization have been proposed for soft-decision decoding in MTR basic AND, OR and XOR logic circuits. The suggested approach is explored over the two-track, two-head E²PR4 partial response magnetic recording system. The overall two-track channel detection complexity reduction of 41·9% is offered in simulation scheme, encoded by Low-Density Parity-Check (LDPC) code, serially concatenated with inner MTR. The 1·9 dB coding gain has been obtained, comparing to uncoded channel and assuming the AWGN noise presence.     

Performance of differential pulse-position modulation (DPPM) with concatenated coding over optical wireless communications [optical wireless communications]

The concatenation of marker and Reed-Solomon codes in order to correct insertion/ deletion errors in differential pulse-position modulation (DPPM) over optical wireless communications is presented. The concatenated code decoding algorithms with hard-decision and soft-decision detection are presented. The performance of the hard-decision coded DPPM system is evaluated over both nondispersive and dispersive channels via analysis and simulation. It is shown that the coding gain provided by the concatenated code is approximately 4 dB when the code rate is about 0.7 and the channel is nondispersive. Over a dispersive channel, the coded system performs better than the uncoded system when the ratio of delay spread to bit duration is not high. A soft-decision detector is employed to combat intersymbol interference. The soft- decision decoding algorithm, which has low complexity and can be practically implemented, is described. The performance over nondispersive and dispersive channels is evaluated by analysis and simulation. It is shown that the soft-decision system requires approximately 2 dB less transmit power than the hard-decision system for additive white Gaussian noise and low-dispersive channels. Soft decoding also provides a performance improvement in high-dispersive channels.