Loading...
Please wait, while we are loading the content...
Similar Documents
An upper bound on decoding bit-error probability with linear coding on extremely noisy channels1.
| Content Provider | CiteSeerX |
|---|---|
| Author | Marc, H. Johannesson, Rolf Massey, James L. Stiihl, Per |
| Abstract | Abstract- When concatenated coding schemes op-erate near channel capacity their component encoders may operate above capacity. The decoding bit-error performance of binary convolutional codes near and above capacity is investigated. Let G ( D) be a b x c generator matrix of a rate R = b /c con-volutional code. We define a tap-minimal right pseudo inverse of the generator matrix G(D) to be a right pseudo inverse of G ( D) with the minimum number of taps among all right pseudo inverses. By the number of “taps ” in a right pseudo inverse we mean the total number of nonzero coefficients in the power series that are entries of this c x b matrix. We now define the pseudo-inverse decoder (T-decoder) for convolutional codes. Assume that we use a convolutional code C encoded by the generator matrix G(D) for transmission over |
| File Format | |
| Access Restriction | Open |
| Subject Keyword | Bit-error Probability Extremely Noisy Channels1 Generator Matrix Right Pseudo Inverse Upper Bound Convolutional Code Minimum Number Nonzero Coefficient Channel Capacity Rate Con-volutional Code Pseudo-inverse Decoder Total Number Component Encoders Binary Convolutional Code Tap-minimal Right Pseudo Inverse Bit-error Performance Power Series |
| Content Type | Text |
| Resource Type | Article |
