메뉴 건너뛰기




Volumn 6, Issue , 2004, Pages 4048-4053

A novel broadcast scheduling strategy using factor graphs and sum-product algorithm

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; CODES (SYMBOLS); COMPUTER SIMULATION; CONSTRAINT THEORY; GRAPH THEORY; OPTIMIZATION; SCHEDULING;

EID: 18144419341     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper
Times cited : (13)

References (9)
  • 1
  • 2
    • 0031075342 scopus 로고    scopus 로고
    • Optimal broadcast scheduling in packet radio networks using mean field annealing
    • Feb.
    • G. Wang and N. Ansari, "Optimal broadcast scheduling in packet radio networks using mean field annealing," IEEE Journal on Selected Arreas in Communications, vol. 15, pp. 250-259. Feb. 1997.
    • (1997) IEEE Journal on Selected Arreas in Communications , vol.15 , pp. 250-259
    • Wang, G.1    Ansari, N.2
  • 6
    • 0030219216 scopus 로고    scopus 로고
    • Near Shannon limit performance of low density parity check codes
    • Aug.
    • D. J. C. MacKay and R. M. Neal, "Near Shannon limit performance of low density parity check codes," Electronics Letters, vol. 32, pp. 1645-1646, Aug. 1996.
    • (1996) Electronics Letters , vol.32 , pp. 1645-1646
    • MacKay, D.J.C.1    Neal, R.M.2
  • 7
    • 0035246123 scopus 로고    scopus 로고
    • Codes on graphs: Normal realizations
    • Feb.
    • G. D. Forney, "Codes on graphs: normal realizations," IEEE Transactions on Information Theory, vol. 47, pp. 520-548, Feb. 2001.
    • (2001) IEEE Transactions on Information Theory , vol.47 , pp. 520-548
    • Forney, G.D.1


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