shannon limit 中文意思是什麼

shannon limit 解釋
shannon極限
  • shannon : 莎儂
  • limit : n. 1. 界限,界線;邊界。2. 極限,限度;限制。3. 〈pl. 〉范圍,范域。4. 限價;限額;賭注限額;獵物限額。vt. 1. 限制,限定。2. 減少。adj. -able
  1. The study of ldpc codes was resurrected in the mid - 1990 ’ s with the work of mackay, luby, and others. ldpc codes are one of the hottest topics in coding theory today. indeed, the performance is almost as close to the shannon limit as that of turbo codes

    Ldpc碼由gallager於1960年首次提出,只是限於當時的技術發展水平難于實現而未能引起足夠重視,直到上世紀九十年代中期, mackay , luby等人重新發現ldpc碼與turbo碼一樣也是一種能夠逼近香農限的非常好碼,從而使ldpc碼成為新的研究熱點。
  2. This paper discusses the results in ricean channel in addition. the analysis of rayleigh and ricean channel are based on two cases, state information ( si ), and no state information ( nsi ). while the code rate approaching to zero, the shannon limit of bsc channel model is 0. 37db, the result of awgn ’ s is - 1. 59db, of rayleigh si is - 2. 31db, of rayleigh nsi is - 1. 45db, of riceansi is - 2. 31db, and of ricean nsi is - 1. 44db

    當碼率趨近於0時bsc通道下的香農限為0 . 37db , awgn通道下的香農限為- 1 . 59db ,瑞利通道下通道增益已知時的香農限為- 2 . 31db 、通道未知時的香農限為- 1 . 45db ,萊斯通道下通道增益已知時的香農限為- 2 . 31db ,通道增益未知時香農限為- 1 . 44db 。
  3. Turbo code was introduced by c. berrou in 1993. turbo code can achieve the error correcting capacity close to the shannon - limit with reasonable decoding complexity, provided that the code words are long enough

    1993年, c . berrou提出了一種新的通道編碼方案? ? turbo碼, turbo碼能夠在編碼長度較長的情況下得到接近香農極限的糾錯性能。
  4. Recently, much interest of the coding community has focused around a new family of error - correcting codes, called turbo codes, whose perfor - mances in terms of bit error rate ( ber ) are close to the shannon limit

    Turbo碼作為一種新型的糾錯編碼類型備受通信界的注目,它的糾錯能力能夠接近shannon極限。 turbo碼自1993年由c
  5. Turbo code, which utilizes the condition of random coding and decoding of shannon noisy channel coding theorem, has obtained the performance near to shannon theoretic limit. the performance of turbo code is the best one in all presented coding methods

    Turbo碼由於很好地應用了shannon有噪通道編碼定理中的隨機性編譯碼條件而獲得了接近shannon理論極限的譯碼性能。
  6. Construction of low - density parity - check code approaching the shannon limit

    構造接近香農極限的低密度校驗碼
  7. For its error correction performance extremely close to the shannon limit, from the beginning, turbo codes attracts the eyes of enormous professionals and researchers. in turn, it is called the greatest contribution after ungerboeck ' s trellis coded modulation ( tcm )

    因為它具有極其逼近香農極限的糾錯性能,從一開始turbo碼便吸引了通信領域無數專家學者的關注與研究,進而被譽為繼ungerboeck提出格狀編碼調制( tcm )以來,通道編碼領域最偉大的貢獻。
  8. In awgn channel, this paper gives the shannon limit analysis of bfsk coherent detection

    本文還對bfsk信號相干檢測在awgn通道模型下的香農限進行了分析。
  9. Ldpc code were rediscovered and shown to form a class of shannon - limit - approaching codes in the late 1990s

    1990s末被重新認知為一類具有接近香農限特性的好碼。
  10. Low density parity check ( ldpc ) code, which is a special case of error correction code with sparse parity - check matrix, has the performance very close to the shannon limit

    Ldpc碼是一種特殊的具有稀疏校驗矩陣的糾錯編碼,其性能逼近香農限。這種碼具有實現復雜度低和數據吞吐量高的優點。
  11. Conventionally, dtv systems adopt coding schemes such as rs or convolutional codes, or concatenated codes, where the error correction performance is still quite far away from the shannon limit

    通常的,數字電視系統採用的通道編碼方案為rs碼或卷積碼,或二者的級聯碼,它的糾錯性能與香農極限相比,仍有一定的距離。
  12. At the same time, the simulation analysis on the decoding performance of turbo codes was given, and the results show that under the certain conditions, turbo codes approaches the theoretical shannon limit, which proves its excellent performance of decoding

    同時對其譯碼性能進行了模擬分析,結果表明,在特定的參數條件下,其誤碼率接近香農極限,驗證了其優異的糾錯譯碼性能。
  13. Shannon limit explanation on the unb modulation

    超窄帶調制的鄉農極限解釋
  14. Turbo codes were presented by c. berrou in international conference on communications in 1993. they hang convolutional code and random interleaver together to realize the idea of random coding, and adopt soft input / soft output ( siso ) iterated decoding to approach maximum likelihood decoding ( mld ). turbo codes come closer to approaching shannon ' s limit

    Turbo碼,由c . berrou等在icc 』 93會議上提出,它巧妙地將卷積碼和隨機交織器結合在一起,實現了隨機編碼的思想,同時,採用軟輸入軟輸出迭代譯碼來逼近最大似然譯碼,具有近shannon限的性能。
  15. This paper gives the shannon limit analysis and numerical results while the modulation is bpsk. the numerical results of different coding rate are shown

    本文對bpsk信號調制格式下的香農限進行了理論分析和數值求解。
  16. Shannon limit is the limit of communication resource utilization. the main aim of coding is to construct the practical codes to approach the shannon limit

    香農限是通信資源利用率的極限,編碼的目標是構造實用的逼近香農限的碼。
  17. The conclusion is made that in the same case, the shannon limit of bfsk based on coherent detection is 3db more than that of bpsk in bsc channel

    通過本文的分析可以得到結論,同樣條件下, bfsk信號相干檢測時的香農限比bpsk信號在bsc通道模型下的香農限多出3db 。
  18. Dvb - s2 is the second - generation digital video broadcasting specification for satellite applications developed by digital video broadcasting ( dvb ) project in 2003. compare with dvb - s, it has been specified around three concepts : best transmission performance approaching the shannon limit, total flexibility, and reasonable receiver complexity

    Dvb - s2是第二代衛星數字視頻廣播標準,由dvb ( digitalvideobroadcasting )項目組於2003年發布。與dvb - s標準相比,能夠在合理的接收機復雜度下得到更好的性能和更大的靈活性。
  19. Turbo code is regarded as the milestone in channel encoding theory history for its performance closing to shannon limit, which makes us covert to decrease the numbers of light weight code ( error coefficient ) from increasing the minimum hanming weigh. the research and analysis are concentrated on the following : 1

    Turbo碼具有近shannon限的性能,它的出現被看作是通道編碼理論發展史上的一個里程碑,它使人們設計通道編碼的方法從增加碼的最小漢明距離轉向了減少低重量碼字的個數(錯誤系數) 。
  20. Low density parity check ( ldpc ) codes are shown to be one class of shannon limit approaching codes. with advantages of high encoding gain, low decoding complexity and flexible code rates, etc., the research of these codes has become a hot spot of coding academia

    低密度校驗碼( ldpc )性能接近香農限,具有編碼增益高、譯碼簡單快捷、碼率靈活等優點,是當前編碼界的研究熱點。
分享友人