香農碼 的英文怎麼說

中文拼音 [xiāngnóngmǎ]
香農碼 英文
shannon code
  • 香 : Ⅰ形容詞1 （氣味好聞） fragrant; sweet smelling; aromatic; scented:稻香千里 the fragrance of ripen...
  • 農 : 名詞1. （農業） agriculture; farming 2. （農民） peasant; farmer 3. （姓氏） a surname
  • 碼 : Ⅰ名詞（表示數目的符號或用具） a sign or object indicating number; code Ⅱ量詞1 （指一件事或一類的...
  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. In the last half century, researchers have always been searching good code with rate closing to the shannon theory limitation, error ratio being low and it being to be decoded easily

    半個世紀以來，人們一直在尋找碼率接近香農理論極限、誤差概率小和譯碼復雜性低的好碼（又稱漸近好碼或shannon碼） 。
  4. 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碼能夠在編碼長度較長的情況下得到接近香農極限的糾錯性能。
  5. Channel coding is one of the important part of communication system, whose theoretic base is the shannon ' s law of channel code set up by shannon who inaugurated the information theory in 1948

    通道編碼是通信系統中的重要組成部分之一，其理論基礎是1948年信息論的開創者香農提出的通道編碼定理。
  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. Ldpc code were rediscovered and shown to form a class of shannon - limit - approaching codes in the late 1990s

    1990s末被重新認知為一類具有接近香農限特性的好碼。
  9. Turbo code and ldpc code are good codes. this paper shows the coding and decoding methods of them

    Turbo碼和ldpc碼是逼近香農限的好碼，本文介紹了他們的編碼和譯碼方案。
  10. Several years before, he did some other good things and some which are still locked up in the security of cryptography

    想想香農，他不僅僅搞了信息理論，多年以前他就做了一些別的有益的事，還有一些防衛密碼系統。
  11. 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碼是一種特殊的具有稀疏校驗矩陣的糾錯編碼，其性能逼近香農限。這種碼具有實現復雜度低和數據吞吐量高的優點。
  12. Low density parity check codes are a class of linear block error - correcting codes that can be defined by the very sparse parity - check matrix. their error performance approach shannon limits

    Ldpc碼（低密度校驗碼）是一類可以用非常稀疏的奇偶校驗矩陣定義的線性分組糾錯碼，具有逼近香農限的性能。
  13. 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碼或卷積碼，或二者的級聯碼，它的糾錯性能與香農極限相比，仍有一定的距離。
  14. Since their rediscovery, design, construction, decoding, analysis and applications of ldpc coded have become focal points of research. among them, the decoding algorithm and its implementation design are the focus of this thesis

    Ldpc碼是一種具有稀疏校驗矩陣的線性分組碼，研究結果表明，採用迭代的概率譯碼演算法， ldpc碼可以達到接近香農極限的性能。
  15. This class of codes decoded with soft - in soft - out ( siso ) iterative decoding performs amazingly well. since their rediscovery, design, construction, decoding, analysis and applications of ldpc coded have become focal points of research

    Ldpc碼是一種具有稀疏校驗矩陣的線性分組碼，研究結果表明，採用迭代的概率譯碼演算法， ldpc碼可以達到接近香農極限的性能。
  16. 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

    同時對其譯碼性能進行了模擬分析，結果表明，在特定的參數條件下，其誤碼率接近香農極限，驗證了其優異的糾錯譯碼性能。
  17. In detail, they are bit - interleaved coded modulation ( with iterative decoding ), low - density parity - check codes and stf technology. by the performance analysis of bicm ( - id ), which can make code and modulation optimal separately, and achieve maximum possible coding diversity as well as modulation gain, guidelines for its design and an easy algorithm for siso are proposed. design of capacity - approaching of ldpc codes and efficient encoding of them as well as several kinds of its decoding algorithms are investigated

    具體的講，就是討論了基於比特交織的編碼調制技術，並給出了映射方式的設計準則以及核心模塊siso的一種簡單的f - map演算法；研究了編碼最小漢明距隨碼長線性增加的ldpc碼的幾個方面的問題，包括接近香農限碼子集的度分佈對的設計、有效編碼器的實現和各種譯碼演算法的優缺點，並對基於ldpc碼的bicm應用於ofdm傳輸系統中的性能進行了模擬。
  18. Such code is also called gradually good code or shannon code. in 1993, c. berro etc. firstly proposed a new channel code method - turbo code, which employed recursive systematic code 、 the random interleaver 、 map ( maximum a posteriori ) algorithm and iterative decoding algorithm obtained the capacity that had only 0. 7db difference compared to the shannon limitation

    1993年c . berro等首先提出了一種全新的通道編碼方式? turbo碼，採用遞歸系統碼與隨機交織器構造turbo碼，並將map （ maximumaposteriori ）演算法和迭代演算法應用於解碼過程，獲得了與香農理論極限僅差0 . 7db的性能。
  19. Low density parity check ( ldpc ) codes are good error - correcting codes, which can approach shannon ' s capacity limit. due to the sparsity of its check matrix, ldpc codes can be decoded only with linear time complexity using iterative decoding algorithm. therefore, ldpc codes have become one of the most attractive fields in the channel coding community

    低密度校驗碼是一種逼近香農限的好碼，由於其校驗矩陣的稀疏特性，採用迭代譯碼演算法，它的譯碼僅具有線性時間復雜度，所以目前ldpc碼己成為通道編碼理論界的研究熱點之一。
  20. 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

    香農限是通信資源利用率的極限，編碼的目標是構造實用的逼近香農限的碼。
分享友人
分享到 Line

分享到臉書