Search results

From LNTwww
  • *Anderson, J.B.; Mohan, S.: Source and Channel Coding. Norwell (Mass.).: Kluwer Academic Publisher, 1990. * Berlekamp, E.R.: Algebraic Coding Theory. Laguna Hills: Aegean Park Press, 1984.
    5 KB (688 words) - 14:47, 9 July 2020
  • ...r  [[Digital_Signal_Transmission/Block_Coding_with_4B3T_Codes|"Block Coding with 4B3T Codes"]]  of the book  "Digital Signal Transmission". ...ignal_Transmission/Symbolwise_Coding_with_Pseudo-Ternary_Codes|"Symbolwise Coding with Pseudo-Ternary Codes"]]  of the same book.
    8 KB (1,200 words) - 17:54, 24 October 2022
  • ...»'''HS-PDSCH'''«  $($"High-Speed Physical Downlink Shared Channel"$)$  was newly introduced,  which is shared by multiple users and ...ere is the additional transport channel  »'''Enhanced Dedicated Channel'''«  $($'''E-DCH'''$)$. Among other things,  this minimizes
    6 KB (972 words) - 18:22, 4 March 2023
  • {What are the results of row coding with the  $(7, \ 4, \ 3)$ code  $\mathcal{C}_1$? {What are the results of column coding with the  $(6, \ 3, \ 3)$ code  $\mathcal{C}_2$?
    7 KB (862 words) - 18:09, 6 December 2022
  • #Introduction of an additional shared channel:  »'''HS-PDSCH'''«, #use of  '''adaptive'''  modulation,  coding and transmission rate.
    15 KB (2,250 words) - 19:21, 25 March 2023
  • |Untermenü=Binary Block Codes for Channel Coding == Channel coding theorem and channel capacity ==
    27 KB (4,255 words) - 12:12, 22 November 2022
  • *ideal channel equalization, and<br> ...on/Berücksichtigung_von_Kanalverzerrungen_und_Entzerrung|"Consideration of Channel Distortion and Equalization"]].&nbsp; The two sums in the above equation ta
    16 KB (2,617 words) - 16:14, 23 January 2023
  • ...s"&nbsp; can also be taken from the graphic&nbsp; (red labels).&nbsp; Gray coding is assumed here. * For subtask&nbsp; '''(4)''',&nbsp; the (discrete-time) AWGN channel with variance&nbsp; $\sigma_n^2 = N_0/2$&nbsp; is assumed.
    7 KB (1,152 words) - 14:03, 21 August 2022
  • |Nächste Seite=Error Correction According to Reed-Solomon Coding ...des#Decoding_at_the_Binary_Erasure_Channel|"Decoding at the Binary Erasure Channel"]]&nbsp; chapter we showed for the binary block codes,&nbsp; which calculat
    14 KB (1,978 words) - 12:36, 24 November 2022
  • The net data rate of a&nbsp; $\rm B$ channel&nbsp; ("Bearer Channel") is&nbsp; $64 \ \rm kbit/s$&nbsp; and corresponds to the bit rate of the r However,&nbsp; because of the subsequent redundant channel coding and the inserted signaling bits,&nbsp; the gross data rate – i.e.,&nbsp;
    4 KB (661 words) - 17:36, 23 January 2023
  • ...ficiently low to be able to transmit a speech signal over a single traffic channel. ...the aim of being able to transmit two calls simultaneously in one traffic channel if required.&nbsp; However, the quality does not quite reach the full rate
    6 KB (975 words) - 13:28, 23 January 2023
  • ...(DLR), where he is leading the Information Transmission Group, working on coding and modulation for space communication systems and on random access protoco ...niversity of Science and Technology (China). Since 2014 he is lecturer for channel codes with iterative decoding at the Institute for Communications Engineeri
    6 KB (761 words) - 10:25, 10 November 2021
  • ...characterized by two matrices&nbsp; &ndash;&nbsp; as is common in Channel Coding: ...nnot be correct already because this does not correspond to any systematic coding.
    9 KB (1,260 words) - 17:59, 23 January 2023
  • *one signaling channel&nbsp; $($"data channel"$)$&nbsp; with&nbsp; $\text{64 kbit/s}$, *one synchronization channel&nbsp; (also with&nbsp; $\text{64 kbit/s})$,&nbsp; and accordingly
    12 KB (1,926 words) - 17:05, 23 January 2023
  • ...mental redundancy".&nbsp; This means that after conventional convolutional coding,&nbsp; bits corresponding to the puncturing matrix&nbsp; $\mathbf{P}_l$&nbs ...ission of redundancy that is not required and adapts the throughput to the channel conditions.
    6 KB (917 words) - 15:39, 19 November 2022
  • * The Reed&ndash;Solomon coder works blockwise.&nbsp; In the first coding step,&nbsp; the code symbols &nbsp; $c_0, \hspace{0.05cm} \text{...} \hspac {What is the binary information block in the first coding step?
    10 KB (1,342 words) - 18:47, 7 October 2022
  • *Csiszar, I.; Körner, J.: Information Theory: Coding Theorems for Discrete Memoryless System. Cambridge University Press, 2. Auf *McEliece, R. J.: The Theory of Information Theory and Coding. Volume 86. Cambridge: Cambridge University Press, 2004. ISBN 978-0-52183-1
    4 KB (527 words) - 15:51, 23 April 2023
  • ...nd_Decision_Structures#Binary_Erasure_Channel_.E2.80.93_BEC|Binary Erasure Channel]]&nbsp; $\rm (BEC)$ - with binary input values&nbsp; $x_{i} \in \{0, \ 1\}$ ...the chapter&nbsp; [[Channel_Coding/Channel_Models_and_Decision_Structures|"Channel Models and Decision Structures"]].
    7 KB (963 words) - 17:26, 23 January 2023
  • ...'''&nbsp; [[LNTwww:Imprint_for_the_book_"Channel_Coding"|&raquo;'''Channel Coding'''&laquo;]]<br>
    3 KB (441 words) - 18:26, 16 April 2023
  • Bhattacharyya has used the pseudo-function&nbsp; $W(X)$&nbsp; to specify a channel-independent&nbsp; (upper)&nbsp; bound on the block error probability: ...ary_Symmetric_Channel_.E2.80.93_BSC|"BSC model"]]&nbsp; ("Binary Symmetric Channel"),
    8 KB (1,147 words) - 16:14, 8 October 2022

View (previous 20 | next 20) (20 | 50 | 100 | 250 | 500)