共查询到20条相似文献,搜索用时 156 毫秒
1.
Ruey-yi Wei Yen-ming Chen 《Communications, IEEE Transactions on》2008,56(10):1616-1625
A novel noncoherent block coding scheme, called noncoherent block-coded MPSK (NBC-MPSK), was proposed recently. In this paper, we present further research results on NBC-MPSK. We first focus on the rotational invariance (RI) of NBC-MPSK. Based on the RI property of NBC-MPSK with multistage decoding, a noncoherent near-optimal linear complexity multistage decoder for NBC-MPSK is proposed. Then we investigate a tree-search ML decoding algorithm for NBCMPSK. The derived algorithm is shown to have low complexity and excellent error performance. In this paper, we also utilize the idea of the NBC-MPSK to design noncoherent space-time block codes, called noncoherent space-time block-coded MPSK (NSTBC-MPSK). For two transmit antennas, we propose a signal set with set partitioning and derive the minimum noncohent distance of NSTBC-MPSK with this signal set. For the decoding of NSTBC-MPSK, we modify the ML decoding algorithm of NBC-MPSK and propose an iterative hard-decision decoding algorithm. Compared with training codes and unitary space-time modulation, NBC-MPSK and NSTBC-MPSK have larger minimum noncoherent distance and thus better error performance for the noncoherent ML decoder. 相似文献
2.
The first part of this paper presents a simple and systematic technique for constructing multidimensional M-ary phase shift keying (MPSK) trellis coded modulation (TCM) codes. The construction is based on a multilevel concatenation approach. In which binary convolutional codes with good free branch distances are used as the outer codes and block MPSK modulation codes are used as the inner codes (or the signal spaces). Conditions on phase invariance of these codes are derived and a multistage decoding scheme for these codes is proposed. The proposed technique can be used to construct good codes for both the additive white Gaussian noise (AWGN) and fading channels as is shown in the second part of this paper 相似文献
3.
Ruey-Yi Wei Chang-Chih Huang 《Communications, IEEE Transactions on》2009,57(10):2853-2856
In this letter, we propose a novel bandwidth-efficient noncoherent trellis-coded MPSK scheme, in which a particularly designed differential encoder is added in front of the trellis encoder. With this differential encoder, trellis-coded MPSK proposed by Ungerboeck is no longer noncoherently catastrophic and thus achieves better error performance. Moreover, new trellis codes which, for the proposed scheme, have better bit error rates than Ungerboeck's codes are found by computer searches. 相似文献
4.
Ruey-Yi Wei Shi-Shan Gu Tzu-Ching Sue 《Communications, IEEE Transactions on》2009,57(11):3195-3198
In this letter, we propose three noncoherent blockcoded twisted amplitude and phase shift keying (NBC-TAPSK) schemes which are derived from noncoherent block-coded MPSK. We also propose a new noncoherent detector and a corresponding noncoherent distance for nonconstant-energy signals over the additive white Gaussian noise (AWGN) channel. At high data rates, NBC-8TAPSK has the best bit error performance among all noncoherent schemes. 相似文献
5.
Previously, noncoherent sequence detection schemes for coded linear and continuous phase modulations have been proposed, which deliver hard decisions by means of a Viterbi algorithm. The current trend in digital transmission systems toward iterative decoding algorithms motivates an extension of these schemes. In this paper, we propose two noncoherent soft-output decoding algorithms. The first solution has a structure similar to that of the well-known algorithm by Bahl et al. (1974), whereas the second is based on noncoherent sequence detection and a reduced-state soft-output Viterbi algorithm. Applications to the combined detection and decoding of differential or convolutional codes are considered. Further applications to noncoherent iterative decoding of turbo codes and serially concatenated interleaved codes are also considered. The proposed noncoherent detection schemes exhibit moderate performance loss with respect to corresponding coherent schemes and are very robust to phase and frequency instabilities 相似文献
6.
Takata T. Ujita S. Kasami T. Lin S. 《IEEE transactions on information theory / Professional Technical Group on Information Theory》1993,39(4):1204-1218
Multistage decoding of multilevel block multilevel phase-shift keying (M -PSK) modulation codes for the additive white Gaussian noise (AWGN) channel is investigated. Several types of multistage decoding, including a suboptimum soft-decision decoding scheme, are devised and analyzed. Upper bounds on the probability of an incorrect decoding of a code are derived for the proposed multistage decoding schemes. Error probabilities of some specific multilevel block 8-PSK modulation codes are evaluated and simulated. The computation and simulation results for these codes show that with multistage decoding, significant coding gains can be achieved with large reduction in decoding complexity. In one example, it is shown that the difference in performance between the proposed suboptimum multistage soft-decision decoding and the single-stage optimum decoding is small, only a fraction of a dB loss in SNR at the block error probability of 10-6 相似文献
7.
The multilevel coding technique is used for constructing multilevel trellis M -ary phase-shift-keying (MPSK) modulation codes for the Rayleigh fading channel. In the construction of a code, all the factors which affect the code performance and its decoding complexity are considered. The error performance of some of these codes based on both one-stage optimum decoding and multistage suboptimum decoding has been simulated. The simulation results show that these codes achieve good error performance with small decoding complexity 相似文献
8.
Wei Ruey-Yi Wu Yu-Lung 《Wireless Communications, IEEE Transactions on》2007,6(7):2432-2437
Unitary space-time modulation (USTM) is well-tailored for noncoherent space-time modulation. Trellis coded USTM (TC-USTM) can obtain significant coding gains over uncoded USTM for the noncoherent block fading channel. Conventional TC-USTM schemes expand the signal set of uncoded USTM by a factor of two. In this letter, we propose a new TC-USTM scheme in which the size of USTM set is not limited to be just double for uncoded USTM. However, in TC-USTM schemes, because signals of the same trellis branch are transmitted over the same fading coefficients, one trellis branch can only obtain one temporal diversity. In this letter, we also propose a new trellis coded noncoherent space-time modulation scheme by interleaving space-time signals. The proposed scheme can enlarge temporal diversity at the price of increased complexity and delay. Simulation results demonstrate the excellent error performances of codes found by computer searches for both schemes. 相似文献
9.
Knopp R. Leib H. 《IEEE transactions on information theory / Professional Technical Group on Information Theory》1994,40(6):1968-1984
This work considers coded M-ary phase-shift keying (MPSK) schemes with noncoherent detection. A class of block codes called module-phase codes is described. The algebraic framework used for describing these codes relies on elements from module theory which are discussed along with a method for constructing such codes for noncoherent detection. It is shown that differential encoding may be viewed as a specific code from a particular class of module-phase codes. Two classes of codes that achieve significant coding gain with respect to coherent detection of uncoded MPSK are presented. In the first class of module-phase codes, the coding gain is achieved at the expense of bandwidth expansion. In the second class, however, the coding gain is achieved at the expense of signal constellation expansion without expanding bandwidth. Finally, an integrated demodulation/decoding technique based on a modification of information set decoding is presented. It Is shown that this reduced-complexity, suboptimal decoding strategy performs nearly as well as maximum-likelihood decoding 相似文献
10.
Dong Wang Haiquan Wang Xiang-Gen Xia 《Communications, IEEE Transactions on》2007,55(8):1441-1447
In this letter, we propose a new family of space-time trellis codes, which are constructed by combining a super set of quasi-orthogonal space-time block codes with minimum decoding complexity with an outer multiple trellis coded modulation encoder. A systematic set-partitioning method for quadratic amplitude modulation constellations is given. The proposed scheme can be used for systems with four or more than four transmit antennas. Furthermore, its decoding complexity is low because its branch metric calculation can be implemented in a symbolwise way. Simulation results demonstrate that the proposed scheme has a comparable performance as super quasi-orthogonal space-time trellis codes proposed by Jafarkhani and Hassanpour while providing a lower decoding complexity. 相似文献
11.
Morelos-Zaragoza R.H. Fossorier M.P.C. Shu Lin Imai H. 《Communications, IEEE Transactions on》2000,48(2):204-213
In this paper, theoretical upper bounds and computer simulation results on the error performance of multilevel block coded modulations for unequal error protection (UEP) and multistage decoding are presented. It is shown that nonstandard signal set partitionings and multistage decoding provide excellent UEP capabilities beyond those achievable with conventional coded modulation. The coding scheme is designed in such a way that the most important information bits have a lower error rate than other information bits. The large effective error coefficients, normally associated with standard mapping by set partitioning, are reduced by considering nonstandard partitionings of the underlying signal set. The bits-to-signal mappings induced by these partitionings allow the use of soft-decision decoding of binary block codes. Moreover, parallel operation of some of the staged decoders is possible, to achieve high data rate transmission, so that there is no error propagation between these decoders. Hybrid partitionings are also considered that trade off increased intraset distances in the last partition levels with larger effective error coefficients in the middle partition levels. The error performance of specific examples of multilevel codes over 8-PSK and 64-QAM signal sets are simulated and compared with theoretical upper bounds on the error performance 相似文献
12.
This paper considers noncoherent cooperative decode-and-forward(DF) halfduplex multi-branch relay systems.Each relay branch is modeled as a probabilistic transition system at the last hop,and thus it can be considered as a relaying chain comprising multi-hop relays.An approximation to the generalized maximum likelihood(ML) noncoherent block detection is derived for uncoded M-ary modulation in a faded noisy environment.In particular,the derived noncoherent block detection in a noiseless case is equivalent to a multichannel reception with full diversity.Furthermore,the generalized detection is extended specifically to block coded M-ary phase shift keying(MPSK) modulation.For a DF three node relay system using block coded quadrature phase shift keying(QPSK),simulation results are provided to examine the end-to-end error performance of the noncoherent detection with considering the effects of network geometry and power allocation,respectively.It is shown that under a fixed power allocation,a proper relay placement can yield near full diversity for large signal-to-noise ratio. 相似文献
13.
Corneliu Eugen D. Sterian Yuanyuan Ma Matthias Pätzold Ion Bǎnicǎ Huaqiang He 《电信纪事》2011,66(3-4):257-273
In this paper, we develop super-orthogonal space-time trellis codes (SOSTTCs) using differential binary phase-shift keying, quadriphase-shift keying and eight-phase shift keying for noncoherent communication systems with two transmit antennas without channel state information at the receiver. Based on a differential encoding scheme proposed by Tarokh and Jafarkhani, we propose a new decoding algorithm with reduced decoding complexity. To evaluate the performance of the SOSTTCs by way of computer simulations, a geometric two-ring channel model is employed throughout. The simulation results show that the new decoding algorithm has the same decoding performance compared with the traditional decoding strategy, while it reduces significantly the overall computing complexity. As expected the system performance depends greatly on the antenna spacing and on the angular spread of the incoming waves. For fair comparison, we also design SOSTTCs for coherent detection of the same complexity as those demonstrated for the noncoherent case. As in the case of classical single antenna transmission systems, the coherent scheme outperforms the differential one by approximately 3 dB for SOSTTCs as well. 相似文献
14.
《Communications, IEEE Transactions on》2008,56(10):1569-1574
In this paper two symbol-level soft-decision decoding algorithms for Reed-Solomon codes, derived form the ordered statistics (OS) and from the generalized minimum-distance (GMD) decoding methods, are presented and analyzed. Both the OS and the GMD algorithms are based on the idea of producing a list of candidate code words, among which the one having the larger likelihood is selected as output. We propose variants of the mentioned algorithms that allow to finely tune the size of the list in order to obtain the desired decoding complexity. The method proposed by Agrawal and Vardy for computing the error probability of the GMD algorithm is extended to our decoding methods. Examples are presented where these algorithms are applied to singly-extended Reed-Solomon codes over GF(16) used as outer codes in a 128-dimensional coded modulation scheme that attains good performance, with manageable decoding complexity. 相似文献
15.
On the iterative decoding of multilevel codes 总被引:3,自引:0,他引:3
Iterative decoding of multilevel coded modulation is discussed. Despite its asymptotic optimality with proper design, the error correcting capability of multilevel codes may not be fully exploited for finite block length with conventional multistage decoding. This fact stems from the suboptimality of multistage decoding giving rise to increased error multiplicity at lower index stages and the associated error propagation to higher stages. Such problems can be overcome in many situations by introducing iterative decoding which often significantly compensates the suboptimality of a staged decoder. The class of multilevel codes achieving practically important bit-error performance near the Shannon limit becomes far wider with iterative decoding 相似文献
16.
Parallel concatenated coding schemes employing convolutional codes as constituent codes linked by an interleaver have been proposed in the literature as `turbo codes'. They yield very good performance in connection with simple suboptimum decoding algorithms. The authors propose an alternative scheme consisting in the serial concatenation of block or convolutional codes and evaluate its average performance in terms of bit error probability 相似文献
17.
《Selected Areas in Communications, IEEE Journal on》2006,24(8):1603-1613
We consider the decoding problem for low-density parity-check codes, and apply nonlinear programming methods. This extends previous work using linear programming (LP) to decode linear block codes. First, a multistage LP decoder based on the branch-and-bound method is proposed. This decoder makes use of the maximum-likelihood-certificate property of the LP decoder to refine the results when an error is reported. Second, we transform the original LP decoding formulation into a box-constrained quadratic programming form. Efficient linear-time parallel and serial decoding algorithms are proposed and their convergence properties are investigated. Extensive simulation studies are performed to assess the performance of the proposed decoders. It is seen that the proposed multistage LP decoder outperforms the conventional sum-product (SP) decoder considerably for low-density parity-check (LDPC) codes with short to medium block length. The proposed box-constrained quadratic programming decoder has less complexity than the SP decoder and yields much better performance for LDPC codes with regular structure. 相似文献
18.
19.
A tight upper bound on the decoding error probability is derived for block-coded modulation structures where an M-ary phase shift keying (M-PSK) signal constellation is employed. This bound, called a tangential sphere bound, is tight for very low (as well as for high) signal-to-noise ratios (SNRs). Berlekamp's tangential union bound, previously derived for binary codes, can be derived for an M-PSK block coded modulation structure as well. However, it is proven that our tangential sphere bound is tighter than Berlekamp's (1980) tangential bound. For particular schemes, it is shown that for low SNRs our bound is considerably tighter than the tangential bound. As one of the examples, a multistage decoder is considered 相似文献
20.
Duk Gun Choi Min‐Hyuk Kim Jin Hee Jeong Ji Won Jung Jong‐Tae Bae Seok‐Soon Choi Young Yun 《ETRI Journal》2007,29(3):363-370
In this paper, we propose a flexible turbo decoding algorithm for a high order modulation scheme that uses a standard half‐rate turbo decoder designed for binary quadrature phase‐shift keying (B/QPSK) modulation. A transformation applied to the incoming I‐channel and Q‐channel symbols allows the use of an off‐the‐shelf B/QPSK turbo decoder without any modifications. Iterative codes such as turbo codes process the received symbols recursively to improve performance. As the number of iterations increases, the execution time and power consumption also increase. The proposed algorithm reduces the latency and power consumption by combination of the radix‐4, dual‐path processing, parallel decoding, and early‐stop algorithms. We implement the proposed scheme on a field‐programmable gate array and compare its decoding speed with that of a conventional decoder. The results show that the proposed flexible decoding algorithm is 6.4 times faster than the conventional scheme. 相似文献