The Mutual Information for Bit-Linear Linear-Dispersion Codes 


Vol. 32,  No. 10, pp. 958-964, Oct.  2007


PDF Full-Text
  Abstract

In this paper, we derive the relationship between the bit error probability (BEP) of maximum a posteriori (MAP) bit detection and the bit minimum mean square error (MMSE), that is, the BEP is greater than a quarter of the bit MMSE and less than a half of the bit MMSE. By using this result, the lower and upper bounds of the derivative of the mutual information are derived from the BEP and the lower and upper bounds are easily obtained in the multiple-input multiple-output (MIMO) communication systems with the bit-linear linear-dispersion (BLLD) codes in the Gaussian channel.

  Statistics
Cumulative Counts from November, 2022
Multiple requests among the same browser session are counted as one view. If you mouse over a chart, the values of data points will be shown.


  Cite this article

[IEEE Style]

X. Jin, J. Yang, K. Song, J. No, D. Shin, "The Mutual Information for Bit-Linear Linear-Dispersion Codes," The Journal of Korean Institute of Communications and Information Sciences, vol. 32, no. 10, pp. 958-964, 2007. DOI: .

[ACM Style]

Xianglan Jin, Jae-Dong Yang, Kyoung-Young Song, Jong-Seon No, and Dong-Joon Shin. 2007. The Mutual Information for Bit-Linear Linear-Dispersion Codes. The Journal of Korean Institute of Communications and Information Sciences, 32, 10, (2007), 958-964. DOI: .

[KICS Style]

Xianglan Jin, Jae-Dong Yang, Kyoung-Young Song, Jong-Seon No, Dong-Joon Shin, "The Mutual Information for Bit-Linear Linear-Dispersion Codes," The Journal of Korean Institute of Communications and Information Sciences, vol. 32, no. 10, pp. 958-964, 10. 2007.

Search
(IN TITLE, AUTHOR, ABSTRACT,KEYWORDS)

Advanced Search ▼

POPULAR KEYWORDS
(TOP 10 KEYWORDS)

Recent Publications
(LAST 3 YEARS)






pISSN : 1226 - 4717
eISSN : 2287 - 3880