Results 221 to 230 of about 76,758 (254)
Some of the next articles are maybe not open access.
On the pairwise error probability bounds of STTC over Nakagami-m fading channels
IEEE International Conference on Communications, 2005. ICC 2005. 2005, 2005We investigate the pairwise error probability (PEP) bounds for space-time trellis codes (STTC) in Nakagami-m fading channels with the arbitrary fading severity parameter, m. We derive an analytical expression for PEP upper bound in the case of two transmit antennas in terms of the higher transcendental functions, such as the Appell hypergeometric ...
K. D. Prathapasinghe Dharmawansa +1 more
openaire +1 more source
New Bounds of Pairwise Error Probability for Space-Time Codes in Rayleigh Fading Channels
IEEE Transactions on Communications, 2003In this paper, we present new upper and lower bounds of the pairwise error probabilities (PEP) for space-time codes over Rayleigh channels with independent fading. In support of this, we derive a new expression of the PEP using alternative form of the Gaussian tail function, which is very simple and descriptive.
Myung-Kwang Byun, Byeong Gi Lee
openaire +1 more source
IEEE Transactions on Information Theory, 2008
Unitary space-time constellation design is considered for noncoherent multiple-antenna communications, where neither the transmitter nor the receiver knows the fading coefficients of the channel. By employing the Clarke's subdifferential theorem of the sum of the kappa largest singular values of a unitary matrix, we present a numerical optimization ...
Juntti Markku, Ruotsalainen Keijo, Wu Yi
openaire +1 more source
Unitary space-time constellation design is considered for noncoherent multiple-antenna communications, where neither the transmitter nor the receiver knows the fading coefficients of the channel. By employing the Clarke's subdifferential theorem of the sum of the kappa largest singular values of a unitary matrix, we present a numerical optimization ...
Juntti Markku, Ruotsalainen Keijo, Wu Yi
openaire +1 more source
Pairwise error probability on the Gilbert-Elliott channel with application to turbo codes
2004 IEEE Africon. 7th Africon Conference in Africa (IEEE Cat. No.04CH37590), 2005The Gilbert-Elliott (GE) channel is one of the simplest and practical models for a channel with memory. In this paper, the performance of a binary linear code in a slowly varying Rayleigh fading channel modeled by the GE channel model is considered. An analytical expression for the pairwise error probability of maximum likelihood decoding of a binary ...
T.M.N. Ngatched, F. Takawira
openaire +1 more source
Pairwise codeword error probability for coded atmospheric optical communication systems
Optoelectronics Letters, 2006To study the performance of various error-control coding schemes, exact expressions and upper bounds on the pariwise codeword error probability (PEP) for several modulation schemes (OOK, SC-BPSK, BP-PM) used in atmospheric optical communication systems are derived.
Jia-jia Han, Jian Rong, Xiao-chun Zhong
openaire +1 more source
IEEE Transactions on Signal Processing, 2007
In this paper, an exact asymptotic pairwise error probability (PEP) is derived for a half-duplex cooperative system employing an amplify-and-forward (AF) protocol. When compared with the PEP of a traditional multiple-input multiple-output (MIMO) system, the "diversity gain" for the cooperative system is no longer just a simple exponential function of ...
Yanwu Ding +2 more
openaire +1 more source
In this paper, an exact asymptotic pairwise error probability (PEP) is derived for a half-duplex cooperative system employing an amplify-and-forward (AF) protocol. When compared with the PEP of a traditional multiple-input multiple-output (MIMO) system, the "diversity gain" for the cooperative system is no longer just a simple exponential function of ...
Yanwu Ding +2 more
openaire +1 more source
Comment on "Pairwise error probability of space-time codes in frequency selective Rician channels"
IEEE Communications Letters, 2006A simpler explicit expression is derived for pairwise error probability (PEP) considered by Dharmawansa and Rajatheva (IEEE Commun. Lett., vol.9, p.894-6, October 2005). The computational efficiency of this expression is established.
Saralees Nadarajah, Samuel Kotz
openaire +1 more source
Pairwise error probability of turbo codes over joint fading and two-path shadowing channels
2014 IEEE Global Communications Conference, 2014The performance of Turbo coded Binary Phase Shift Keying (BPSK) over the Joint Fading and Two-path Shadowing (JFTS) environment is analyzed. Exact analytical expression for the Pairwise Error Probability (PEP) of Turbo codes over fully interleaved JFTS channels is presented using the probability distribution of the squared independent and identically ...
Indrakshi Dey +2 more
openaire +1 more source
Proceedings of ICUPC 97 - 6th International Conference on Universal Personal Communications, 1998
An arbitrarily tight upper bound (UB) and a lower bound (LB) on the pairwise error probability (PEP) of a trellis-coded or convolutional-coded direct-sequence spread-spectrum multiple-access (DS/SSMA) communication system over a Rayleigh fading channel are derived. A new set of probability density functions (PDFs) and cumulative distribution functions (
Tsao-Tsen Chen, James S. Lehnert
openaire +1 more source
An arbitrarily tight upper bound (UB) and a lower bound (LB) on the pairwise error probability (PEP) of a trellis-coded or convolutional-coded direct-sequence spread-spectrum multiple-access (DS/SSMA) communication system over a Rayleigh fading channel are derived. A new set of probability density functions (PDFs) and cumulative distribution functions (
Tsao-Tsen Chen, James S. Lehnert
openaire +1 more source
The pairwise error probability for decoding a convolutionally encoded sequence using integer metrics
European Transactions on Telecommunications, 1995AbstractThe performance of a communication system that operates over a binary‐input, output‐symmetric memoryless channel and employs a convolutional error correcting code is usually evaluated by applying the union bound to the node error and the bit error probabilities.
openaire +1 more source

