Optimal soft decision block decoders based on fast Hadamard transform

An approach for efficient utilization of fast Hadamard transform in decoding binary linear block codes is presented. Computational gain is obtained by employing various types of concurring codewords, and memory reduction is also achieved by appropriately selecting rows for the generator matrix. The availability of these codewords in general, and particularly in some of the most frequently encountered codes, is discussed.     

Extended Hamming and BCH soft decision decoders for mobile dataapplications

A methodology is presented for the design and development of efficient trellis-based soft decision decoders for extended Hamming and BCH codes. A new metric for noncoherent discriminator detection is proposed that substantially improves the performance of trellis-based decoders over additive white Gaussian noise (AWGN) channels. Minimal edge trellises are then presented for the class of extended Hamming codes and the (32, 21) extended BCH code. The latter is in extensive use in narrow-band wireless data systems. An automatic request (ARQ) protocol is described that allows the soft decision decoders to outperform their hard decision counterparts in both reliability and throughput     

联合均衡块迭代软判决反馈干扰抵消接收机

CDMA扩频通信系统在低扩频比时,路径间干扰(IPI, inter-path interference)变得非常严重。本文将块迭代干扰抵消同MMSE均衡器相结合,提出了一种适用于CDMA扩频通信系统低扩频比情况下的联合均衡块迭代软判决反馈干扰抵消(MMSE-BIIC)接收机结构。理论分析与计算机仿真表明,本文提出的MMSE-BIIC接收机同传统的Rake接收机、线性MMSE均衡器以及多级干扰抵消接收机相比在性能上有较大改善。     

Full-diversity, high-rate space-time block codes from division algebras

We present some general techniques for constructing full-rank, minimal-delay, rate at least one space-time block codes (STBCs) over a variety of signal sets for arbitrary number of transmit antennas using commutative division algebras (field extensions) as well as using noncommutative division algebras of the rational field /spl Qopf/ embedded in matrix rings. The first half of the paper deals with constructions using field extensions of /spl Qopf/. Working with cyclotomic field extensions, we construct several families of STBCs over a wide range of signal sets that are of full rank, minimal delay, and rate at least one appropriate for any number of transmit antennas. We study the coding gain and capacity of these codes. Using transcendental extensions we construct arbitrary rate codes that are full rank for arbitrary number of antennas. We also present a method of constructing STBCs using noncyclotomic field extensions. In the later half of the paper, we discuss two ways of embedding noncommutative division algebras into matrices: left regular representation, and representation over maximal cyclic subfields. The 4/spl times/4 real orthogonal design is obtained by the left regular representation of quaternions. Alamouti's (1998) code is just a special case of the construction using representation over maximal cyclic subfields and we observe certain algebraic uniqueness characteristics of it. Also, we discuss a general principle for constructing cyclic division algebras using the nth root of a transcendental element and study the capacity of the STBCs obtained from this construction. Another family of cyclic division algebras discovered by Brauer (1933) is discussed and several examples of STBCs derived from each of these constructions are presented.     

Art of constructing low-complexity encoders/decoders forconstrained block codes

A rate p : q block encoder is a dataword-to-codeword assignment from 2^p p-bit datawords to 2^p q-bit codewords, and the corresponding block decoder is the inverse of the encoder. When designing block encoders/decoders for constrained systems, often, more than 2^p codewords are available. In this paper, as our main contribution, we propose efficient heuristic computer algorithms to eliminate the excess codewords and to construct low hardware complexity block encoders/decoders. For (0,4/4) and (0,3/6) PRML constraints, block encoders/decoders generated using the proposed algorithms are comparable in complexity to human-generated encoders/decoders, but are significantly simpler than lexicographical encoders/decoders     

The EXIT-characteristic of softbit-source decoders

We outline a new technique to compute the EXIT-characteristic of softbit-source decoders analytically without extensive histogram measurements. Based on the analytic considerations it is straightforward to derive a compact determination rule for the maximum value of attainable extrinsic information. We also show that the area under the EXIT-characteristic grows almost logarithmically with the prediction gain which is utilizable due to the residual redundancy in the source data.     

A systematic design of high-rate complex orthogonal space-time block codes

In this letter, a systematic design method to generate high-rate space-time block codes from complex orthogonal designs for any number of transmit antennas is proposed. The resulting designs have the best known rates. Two constructions with rates 2/3 and 5/8 are further illustrated for 6 and 7 transmit antennas, respectively.     

A new approach to the construction of high-rate convolutional codes

This letter presents a new technique to construct high-rate convolutional codes using a structure formed by a high-rate block code and a simpler convolutional code. The goal is to obtain good convolutional codes in terms of free distance and number of nearest neighbors, with better performance than punctured codes. The obtained codes improve over the best known high-rate punctured codes with the same rate and memory in terms of both bit error probability and computational decoding complexity     

Turbo codes cascaded with high-rate block codes for (O,κ)-constrained channels

We consider several issues in the analysis and design of turbo coded systems for (O, κ) input-constrained channels. These constraints commonly arise in magnetic recording channels. This system is characterized by a high-rate turbo code driving a high-rate (n-1)/n, small-length (O, κ) block code. We discuss the properties of the (O, κ) code that affect its performance on both an additive white Gaussian noise (AWGN) and a precoded dicode channel. We address soft-in soft-out (SISO) decoding of linear and nonlinear (O, κ) codes and show that good (O, κ) codes exist even when d_min=1. For the (O, κ) constrained AWGN channel, we present several rate (n-1)/n block codes that optimally tradeoff bit-error-rate performance with κ. For the precoded dicode channel, we show that the systematic (O, n-1) modulation codes are superior to most other rate (n-1)/n block codes in terms of error-rate performance, and their attractiveness is increased by the fact that they do not contribute any significant complexity to the overall system     

CU encoding depth prediction,early CU splitting termination and fast mode decision for fast HEVC intra-coding

High Efficiency Video Coding (HEVC) is a new video coding standard achieving about a 50% bit rate reduction compared to the popular H.264/AVC High Profile with the same subjective reproduced video quality. Better coding efficiency is attained, however, at the cost of significantly increased encoding complexity. Therefore, fast encoding algorithms with little loss in coding efficiency is necessary for HEVC to be successfully adopted for real applications. In this paper we propose a fast encoding technique applicable to HEVC all intra encoding. The proposed fast encoding technique consists of coding unit (CU) search depth prediction, early CU splitting termination, and fast mode decision. In CU search depth prediction, the depth of encoded CU in the current coding tree unit (CTU) is limited to predicted range, which is mostly narrower than the full depth range. Early CU splitting skips mode search of its sub-CUs when rate distortion (RD) cost of current CU is below the estimated RD cost at the current CU depth. RD cost and encoded CU depth distribution of the collocated CTU of the previous frame are utilized both to predict the encoding CU depth search range and to estimate the RD cost for CU splitting termination. Fast mode decision reduces the number of candidate modes for full rate distortion optimized quantization on the basis of the low complexity costs computed in the preceding rough mode decision step. When all these three methods are applied, proposed fast HEVC intra encoding technique reduces the encoding time of the reference encoder by 57% on the average, with only 0.6% of coding efficiency loss in terms of Bjontegaard delta (BD) rate increase under the HEVC common test conditions.     

Performance of GMSK frequency detection with soft decision decoding of block codes using Chase's second algorithm in mobile radio channel

Investigates bit error rate (BER) performance of a GMSK frequency detection system. The channel measurement information (CMI) for a bit in the received block is calculated from samples of the received signal envelope (R/sub s/) and the demodulator output (eye level). The CMIs of eye level*R/sub s/ and of R/sub s//sup 2/ are investigated, and the decoding performances for the CMIs are compared using the Hamming (7, 4) code in nonfading (static) and fading channels in laboratory experiments.<>     

Markov characterization of channels with soft decision outputs

It is shown that a methodology based on hidden Markov models is applicable to the modeling of slowly varying Rayleigh fading channels with additive Gaussian noise and soft decision outputs. The fading is considered to be frequency nonselective, and ideal demodulation is considered throughout. To prove the validity of robustness of the modeling technique, various results that show good agreement between the simulated channels and the models found are presented. Two soft decision statistical distributions, namely, the soft burst and soft burst interval distributions, are defined and compared. To illustrate the accuracy of the models obtained, the simulation and model outputs are compared for a convolutional encoder with Viterbi decoding and various degrees of interleaving     

Design of block transceivers with decision feedback detection

This paper presents a method for jointly designing the transmitter-receiver pair in a block-by-block communication system that employs (intrablock) decision feedback detection. We provide closed-form expressions for transmitter-receiver pairs that simultaneously minimize the arithmetic mean squared error (MSE) at the decision point (assuming perfect feedback), the geometric MSE, and the bit error rate of a uniformly bit-loaded system at moderate-to-high signal-to-noise ratios. Separate expressions apply for the "zero-forcing" and "minimum MSE" (MMSE) decision feedback structures. In the MMSE case, the proposed design also maximizes the Gaussian mutual information and suggests that one can approach the capacity of the block transmission system using (independent instances of) the same (Gaussian) code for each element of the block. Our simulation studies indicate that the proposed transceivers perform significantly better than standard transceivers and that they retain their performance advantages in the presence of error propagation.     

Overlapping block transform: window design, fast algorithm, and animage coding experiment

A window design and fast algorithm for the overlapping block transform (OBT) of size N×L are presented. The presented algorithm for the OBT reduces the calculation complexity to an N×N transform with a fast algorithm and a simple preprocessing including windowing. A signal-independent window optimization strategy is introduced for image coding application. Results for a first-order Markov model and an image coding experiment show, that the coding gains of the optimized OBTs increase and blocking effects decrease with increasing window length L. A comparison with DCT-coding shows that the OBT, which has a slightly increased realization complexity, provides higher coding gain and a significant blocking effect reduction     

Hierarchical block matching method for fast rotation of binaryimages

In this paper, we develop a block matching method for fast rotation of binary images. We define coarse and fine blocks to extract bit patterns of an original image and calculate their predrawn mapping patterns (PMPs) using the given rotation angle. The traditional calculation for rotation of images can be thus replaced with simple matching of bit patterns of blocks and drawing of their two dimensional (2-D) PMPs at the output plane. A scheme of overlapping blocks is also used to solve problems of hole generation and topology variation usually occurring in rotation. Experimental results demonstrate that our proposed method performs best in terms of rotation speed compared to other algorithms.     

The capacity of binary channels that use linear codes and decoders

This paper analyzes the performance of concatenated coding systems operating over the binary-symmetric channel (BSC) by examining the loss of capacity resulting from each of the processing steps. The techniques described in this paper allow the separate evaluation of codes and decoders and thus the identification of where loss of capacity occurs. They are, moreover, very useful for the overall design of a communications system, e.g., for evaluating the benefits of inner decoders that produce side information. The first two sections of this paper provide a general technique (based on the coset weight distribution of a binary linear code) for calculating the composite capacity of the code and a BSC in isolation. The later sections examine the composite capacities of binary linear codes, the BSC, and various decoders. The composite capacities of the (8,4) extended Hamming, (24, 12) extended Golay, and (48, 24) quadratic residue codes appear as examples throughout the paper. The calculations in these examples show that, in a concatenated coding system, having an inner decoder provide more information than the maximum-likelihood (ML) estimate to an outer decoder is not a computationally efficient technique, unless generalized minimum-distance decoding of an outer code is extremely easy. Specifically, for the (8,4) extended Hamming and (24, 12) extended Golay inner codes, the gains from using any inner decoder providing side information, instead of a strictly ML inner decoder, are shown to be no greater than 0.77 and 0.34 dB, respectively, for a BSC crossover probability of 0.1 or less, However, if computationally efficient generalized minimum distance decoders for powerful outer codes, e.g., Reed-Solomon codes, become available, they will allow the use of simple inner codes, since both simple and complex inner codes have very similar capacity losses     

On the construction of group block codes

We consider the construction of group block codes, i.e., subgroups of Gⁿ, the n-fold direct product of a group G. Two concepts are introduced that make this construction similar to that of codes over gf(2). The first concept is that of an indecomposable code. The second is that of a parity-check matrix. As a result, group block codes over a decomposable Abelian group of exponent d_m can be seen as block codes over the ring of residues modulo d_m, and their minimum Hamming distance can be easily determined. We also prove that, under certain technical conditions, (n, k) systematic group block codes over non-Abelian groups are asymptotically bad, in the sense that their minimum Hamming distance cannot exceed [n/k].     

Downlink transmission of broadband OFCDM systems-part IV: soft decision

In this paper, the performance of turbo-coded orthogonal frequency and code-division multiplexing (OFCDM) systems is investigated with soft multicode interference (MCI) cancellation and minimum mean-square error (MMSE) detection for downlink transmission in future high-speed wireless communications. To regenerate the soft interference signal, the conventional turbo decoding algorithm must be modified to provide log-likelihood ratio (LLR) values for all coded bits. Based on the LLR outputs of turbo decoder, two soft-decision functions are proposed, called LLR-soft-decision and Gaussian-soft-decision functions. The Gaussian assumptions used for deriving these two soft functions are verified by simulation results, and simple methods are proposed to estimate parameters used in the soft functions in practical systems. By means of computer simulations, the performance of soft MCI cancellation is studied extensively and compared with that of hard ones. It is shown that in a highly frequency-selective channel, soft MCI cancellation and MMSE detection can significantly improve the performance of turbo-coded OFCDM systems. Two iterations in turbo decoding are sufficient for both hard and soft-decision functions. The proposed soft-decision functions outperform the hard-decision function with various channel conditions and system parameters, such as the channel correlation, the quality of channel estimation, the number of iterations in turbo decoding and the frequency-domain spreading factor (N/sub F/). Furthermore, the Gaussian-soft-decision function provides better performance than the LLR-soft-decision function. Finally, although frequency diversity gain is saturated for large channel correlation when N/sub F/ is large as in , the gain increases further with increasing N/sub F/ for small channel correlation even when N/sub F/ is large.     

长码DS/CDMA系统中的预优软判决多用户干扰消除

在长码DS/CDMA通信系统中,多级线性软判决并行多用户干扰消除(LSD-PIC)检测器的收敛性能受限于用户数,该文提出用矩阵计算的预优方法改进LSD-PIC检测器的收敛性能,克服由于系统高负载造成的LSD-PIC检测器的性能崩溃,并提出了低代价多项式预优子的概念,对零阶和一阶多项式预优子分别给出了最优系数。     

Multilevel construction of block and trellis group codes

The theory of group codes has been shown to be a useful starting point for the construction of good geometrically uniform codes. In this paper we study the problem of building multilevel group codes, i.e., codes obtained combining separate coding at different levels in such a way that the resulting code is a group code. A construction leading to multilevel group codes for semi-direct and direct products is illustrated. The codes that can be obtained in this way are identified. New geometrically uniform Euclidean-space codes obtained from multilevel codes over abelian and nonabelian groups are presented