메뉴 건너뛰기




Volumn 10, Issue 6, 1999, Pages 659-680

Decoding and equalization with analog non-linear networks

Author keywords

[No Author keywords available]

Indexed keywords


EID: 0001620326     PISSN: 1124318X     EISSN: None     Source Type: Journal    
DOI: 10.1002/ett.4460100610     Document Type: Article
Times cited : (39)

References (46)
  • 1
    • 0027297425 scopus 로고
    • Near Shannon limit error-correcting coding and decoding: Turbo-codes(1)
    • Geneva, Switzerland, May
    • C. Berrou, A. Glavieux, and P. Thitimajshima. Near Shannon limit error-correcting coding and decoding: Turbo-codes(1). In Proc., IEEE Int. Conf. Commun., Geneva, Switzerland, pages 1064-1070, May 1993.
    • (1993) Proc., IEEE Int. Conf. Commun. , pp. 1064-1070
    • Berrou, C.1    Glavieux, A.2    Thitimajshima, P.3
  • 2
    • 0027277237 scopus 로고
    • Separable MAP "filters" for the decoding of product and concatenated codes
    • Geneva, Switzerland, May
    • J. Lodge, R. Young, P. Hoeher, and J. Hagenauer, Separable MAP "filters" for the decoding of product and concatenated codes. In Proc., IEEE Int. Conf. Commun., Geneva, Switzerland, pages 1740-1745, May 1993.
    • (1993) Proc., IEEE Int. Conf. Commun. , pp. 1740-1745
    • Lodge, J.1    Young, R.2    Hoeher, P.3    Hagenauer, J.4
  • 3
    • 0008115256 scopus 로고
    • Linköping studies in science and technology, thesis no. 425, Linköping University, Department of Electrical Engineering
    • N. Wiberg. Approaches to neural-network decoding of error-correcting codes. Linköping studies in science and technology, thesis no. 425, Linköping University, Department of Electrical Engineering, 1994.
    • (1994) Approaches to Neural-network Decoding of Error-correcting Codes
    • Wiberg, N.1
  • 4
    • 0030082715 scopus 로고    scopus 로고
    • An artificial neural net Viterbi decoder
    • Feb.
    • X.-A. Wang and S. Wicker. An artificial neural net Viterbi decoder. IEEE Trans. Commun., Vol. 44, pages 165-170, Feb. 1996.
    • (1996) IEEE Trans. Commun. , vol.44 , pp. 165-170
    • Wang, X.-A.1    Wicker, S.2
  • 6
    • 0029342836 scopus 로고
    • An efficient neural decoder for convolutional codes
    • Jul./Aug.
    • G. Marcone and E. Zincolini and G. Orlandi. An efficient neural decoder for convolutional codes. ETT European Trans. Telecommun., Vol. 6, pages 439-445, Jul./Aug. 1995.
    • (1995) ETT European Trans. Telecommun. , vol.6 , pp. 439-445
    • Marcone, G.1    Zincolini, E.2    Orlandi, G.3
  • 7
    • 0021835689 scopus 로고
    • Neural computation of decisions in optimization problems
    • J. Hopfield and D. Tank, Neural computation of decisions in optimization problems. Biological Cybernetics, Vol. 52, pages 141-152, 1985.
    • (1985) Biological Cybernetics , vol.52 , pp. 141-152
    • Hopfield, J.1    Tank, D.2
  • 8
    • 0027629212 scopus 로고
    • A nonalgorithmic maximum likelihood decoder for trellis codes
    • July
    • R. Davis and H.-A. Loeliger. A nonalgorithmic maximum likelihood decoder for trellis codes. IEEE Trans. Inform. Theory, Vol. IT-39, pages 1450-1453, July 1993.
    • (1993) IEEE Trans. Inform. Theory , vol.IT-39 , pp. 1450-1453
    • Davis, R.1    Loeliger, H.-A.2
  • 11
    • 0031999054 scopus 로고    scopus 로고
    • On iterative soft decision decoding of linear binary block codes and product codes
    • Feb.
    • R. Lucas, M. Bossert, and M. Breitbach. On iterative soft decision decoding of linear binary block codes and product codes. IEEE Journal Selected Areas in Commun., Vol. 16, pages 276-296, Feb. 1998.
    • (1998) IEEE Journal Selected Areas in Commun. , vol.16 , pp. 276-296
    • Lucas, R.1    Bossert, M.2    Breitbach, M.3
  • 12
    • 84925405668 scopus 로고
    • Low-density parity-check codes
    • Jan.
    • R. Gallager. Low-density parity-check codes. IRE Trans. Inform. Theory, Vol. IT-8, pages 21-28, Jan. 1962.
    • (1962) IRE Trans. Inform. Theory , vol.IT-8 , pp. 21-28
    • Gallager, R.1
  • 13
    • 0019608335 scopus 로고
    • A recursive approach to low complexity codes
    • Sept.
    • R. Tanner. A recursive approach to low complexity codes. IEEE Trans. Inform. Theory, Vol. IT-27, pages 533-547, Sept. 1981.
    • (1981) IEEE Trans. Inform. Theory , vol.IT-27 , pp. 533-547
    • Tanner, R.1
  • 16
    • 0031996401 scopus 로고    scopus 로고
    • Iterative decoding of compound codes by probability propagation in graphical models
    • Jan.
    • F. Kschischang and B. Frey. Iterative decoding of compound codes by probability propagation in graphical models. IEEE Journal Selected Areas in Commun., Vol. 16, Jan. 1998.
    • (1998) IEEE Journal Selected Areas in Commun. , vol.16
    • Kschischang, F.1    Frey, B.2
  • 18
    • 0003242352 scopus 로고    scopus 로고
    • Factor graphs and the sum-product algorithm
    • Submitted July
    • F. Kschischang, B. Frey, and H.-A. Loeliger. Factor graphs and the sum-product algorithm. Submitted to IEEE Trans. Inform. Theory, July 1998. Available at http://www.comm.utoronto.ca/frank/factor/.
    • (1998) IEEE Trans. Inform. Theory
    • Kschischang, F.1    Frey, B.2    Loeliger, H.-A.3
  • 21
    • 67649119451 scopus 로고
    • A precise four-quadrant multiplier with sub-nanosecond response
    • Dec.
    • B. Gilbert. A precise four-quadrant multiplier with sub-nanosecond response. IEEE Journal of Solid-State Circuits, pages 365-373, Dec. 1968.
    • (1968) IEEE Journal of Solid-state Circuits , pp. 365-373
    • Gilbert, B.1
  • 23
    • 0030110651 scopus 로고    scopus 로고
    • Iterative decoding of binary block and convolutional codes
    • March
    • J. Hagenauer, E. Offer, and L. Papke. Iterative decoding of binary block and convolutional codes. IEEE Trans. Inform. Theory, Vol. IT-42, pages 429-445, March 1996.
    • (1996) IEEE Trans. Inform. Theory , vol.IT-42 , pp. 429-445
    • Hagenauer, J.1    Offer, E.2    Papke, L.3
  • 24
    • 0003846836 scopus 로고    scopus 로고
    • Linköping studies in science and technology, thesis no. 440, Linköping University, Department of Electrical Engineering
    • N. Wiberg. Codes and decoding on general graphs. Linköping studies in science and technology, thesis no. 440, Linköping University, Department of Electrical Engineering, 1996.
    • (1996) Codes and Decoding on General Graphs
    • Wiberg, N.1
  • 25
    • 0031096505 scopus 로고    scopus 로고
    • Near Shannon limit performance of low density parity check codes
    • March
    • D. MacKay and R. Neal. Near Shannon limit performance of low density parity check codes. Electronic Letters, Vol. 33, pages 457-458, March 1997. Reprinted from the first printing with errors: 1996, 32, (18), pages 1645-1646.
    • (1997) Electronic Letters , vol.33 , pp. 457-458
    • MacKay, D.1    Neal, R.2
  • 26
    • 0030219216 scopus 로고    scopus 로고
    • Reprinted from the first printing with errors
    • D. MacKay and R. Neal. Near Shannon limit performance of low density parity check codes. Electronic Letters, Vol. 33, pages 457-458, March 1997. Reprinted from the first printing with errors: 1996, 32, (18), pages 1645-1646.
    • (1996) Electronic Letters , vol.32 , Issue.18 , pp. 1645-1646
  • 27
    • 0042236900 scopus 로고    scopus 로고
    • Time-varying periodical convolutional codes with low-density parity-check matrix
    • Submitted Feb.
    • A. Jimenez and K. S. Zigangirov. Time-varying periodical convolutional codes with low-density parity-check matrix. Submitted to IEEE Trans. Inform. Theory, Feb. 1998.
    • (1998) IEEE Trans. Inform. Theory
    • Jimenez, A.1    Zigangirov, K.S.2
  • 29
    • 0004207749 scopus 로고    scopus 로고
    • The capacity of low-density parity check codes under message-passing decoding
    • Submitted Nov.
    • T. Richardson and R. Urbanke. The capacity of low-density parity check codes under message-passing decoding. Submitted to IEEE Trans. Inform. Theory, Nov. 1998.
    • (1998) IEEE Trans. Inform. Theory
    • Richardson, T.1    Urbanke, R.2
  • 31
    • 0005061157 scopus 로고    scopus 로고
    • Optimal and near-optimal for short and moderate-length tailbiting trellises
    • Accepted for publication
    • P. Stahl, J. Anderson, and R. Johannesson. Optimal and near-optimal for short and moderate-length tailbiting trellises. Accepted for publication, IEEE Trans. Inform. Theory, 1998.
    • (1998) IEEE Trans. Inform. Theory
    • Stahl, P.1    Anderson, J.2    Johannesson, R.3
  • 32
    • 0043239257 scopus 로고    scopus 로고
    • Properties and error performance of the tailbiting BCJR decoder
    • Lund University, Oct.
    • J. Anderson and K. Tepe. Properties and error performance of the tailbiting BCJR decoder. Techn. Report, Lund University, Oct. 1998.
    • (1998) Techn. Report
    • Anderson, J.1    Tepe, K.2
  • 33
    • 0033099611 scopus 로고    scopus 로고
    • Good error-correcting codes based on very spares matrices
    • Jan.
    • D. MacKay. Good error-correcting codes based on very spares matrices. IEEE Trans. Inform. Theory, Jan. 1999.
    • (1999) IEEE Trans. Inform. Theory
    • MacKay, D.1
  • 34
    • 25344456156 scopus 로고    scopus 로고
    • Master thesis, Munich University of Technology, Depart, of Commun. Engineering, Feb.
    • M. Mörz. Analog decoders and their implementation in VLSI. Master thesis, Munich University of Technology, Depart, of Commun. Engineering, Feb. 1999.
    • (1999) Analog Decoders and Their Implementation in VLSI
    • Mörz, M.1
  • 35
    • 0016037512 scopus 로고
    • Optimal decoding of linear codes for minimizing symbol error rate
    • March
    • L. R. Bahl, J. Cocke, F. Jelinek, and J. Raviv. Optimal decoding of linear codes for minimizing symbol error rate. IEEE Trans. Inform. Theory, Vol. IT-20, pages 284-287, March 1974.
    • (1974) IEEE Trans. Inform. Theory , vol.IT-20 , pp. 284-287
    • Bahl, L.R.1    Cocke, J.2    Jelinek, F.3    Raviv, J.4
  • 37
    • 0042737985 scopus 로고    scopus 로고
    • Master thesis, Munich University of Technology, Depart. of Commun. Engineering, Feb.
    • M. Winkelhofer. Analoge Decodierung von Block- und Faltungscodes. Master thesis, Munich University of Technology, Depart. of Commun. Engineering, Feb. 1998.
    • (1998) Analoge Decodierung von Block- und Faltungscodes
    • Winkelhofer, M.1
  • 38
    • 25344473973 scopus 로고    scopus 로고
    • Master thesis, Munich University of Technology. Depart. of Commun. Engineering, Feb.
    • C. Méasson. Analog decoding on graphs with cycles. Master thesis, Munich University of Technology. Depart. of Commun. Engineering, Feb. 1999.
    • (1999) Analog Decoding on Graphs with Cycles
    • Méasson, C.1
  • 39
    • 0042737986 scopus 로고
    • PhD thesis, Munich University of Technology, July published in Fortschritt-Berichte, VDI-Verlag, Series 10, No. 443
    • E. Offer. Decodierung mit Qualitätsinformation bei verketteten Codiersystemen. PhD thesis, Munich University of Technology, July 1995, published in Fortschritt-Berichte, VDI-Verlag, Series 10, No. 443.
    • (1995) Decodierung mit Qualitätsinformation bei Verketteten Codiersystemen
    • Offer, E.1
  • 44
    • 11144343315 scopus 로고
    • A new multilevel coding method using error correcting codes
    • H. Imai, S. Hirakawa. A new multilevel coding method using error correcting codes. IEEE Trans. Inform. Theory, Vol. IT-23, pages 371-377, 1977.
    • (1977) IEEE Trans. Inform. Theory , vol.IT-23 , pp. 371-377
    • Imai, H.1    Hirakawa, S.2
  • 45
    • 0031220216 scopus 로고    scopus 로고
    • Vom Analogwert zum Bit und zurück
    • Sept./Oct.
    • J. Hagenauer. Vom Analogwert zum Bit und zurück. Frequenz, Vol. 51, pages 221-227, Sept./Oct. 1997.
    • (1997) Frequenz , vol.51 , pp. 221-227
    • Hagenauer, J.1


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.