| Tag |
First Indicator |
Second Indicator |
Subfields |
| LEADER |
00000ctm a22000005a 4500 |
| 001 |
in00001440413 |
| 005 |
20220103134716.0 |
| 007 |
cr unu a |
| 008 |
981013s1997 xx a b 000 0 eng d |
| 035 |
|
|
|9 AJB7716AM
|
| 035 |
|
|
|a (OCoLC)40100622
|
| 040 |
|
|
|a TXA
|c TXA
|d UtOrBLW
|
| 049 |
|
|
|a TXAM
|a TXAR
|
| 099 |
|
|
|a 1997
|a Thesis
|a O93
|
| 100 |
1 |
|
|a Ovalekar, Sameer V.,
|d 1974-
|
| 245 |
1 |
2 |
|a A serially concatenated BCH-Turbo code scheme over an Additive White Gaussion Noise channel /
|c by Sameer V. Ovalekar.
|
| 264 |
|
1 |
|a [Place of publication not identified] :
|b [publisher not identified] ;
|c 1997.
|
| 300 |
|
|
|a ix, 64 leaves :
|b illustrations ;
|c 28 cm.
|
| 336 |
|
|
|a text
|b txt
|2 rdacontent
|
| 337 |
|
|
|a computer
|b c
|2 rdamedia
|
| 338 |
|
|
|a online resource
|b cr
|2 rdacarrier
|
| 500 |
|
|
|a "Major subject: Electrical Engineering".
|
| 500 |
|
|
|a Vita.
|
| 502 |
|
|
|b M.S.
|c Texas A&M University
|d 1997.
|
| 504 |
|
|
|a Includes bibliographical references: pages 41-42.
|
| 520 |
|
|
|a algorithm and have enough algebraic structure within them to
|
| 520 |
|
|
|a an Additive White Gaussian Noise (AWGN) channel. Turbo
|
| 520 |
|
|
|a and breakthrough work in error control coding in recent
|
| 520 |
|
|
|a applications requires several iterations between the multiple
|
| 520 |
|
|
|a at the receiver. Using a sole turbo code for deep space
|
| 520 |
|
|
|a BCH code, so that no loss in performance is observed due to
|
| 520 |
|
|
|a be less complicated than a fully iterative turbo decoder
|
| 520 |
|
|
|a because of the intensive computations required at each
|
| 520 |
|
|
|a codes involved combining some dormant concepts with novel
|
| 520 |
|
|
|a codes, first presented in 1993, represent the most innovative
|
| 520 |
|
|
|a concatenated BCH-turbo code scheme for faster decoding over
|
| 520 |
|
|
|a converge so that no significant loss in performance is
|
| 520 |
|
|
|a decoder to operate at fewer iterations so that the turbo code
|
| 520 |
|
|
|a decoders at the receiver. Typically no less than 10
|
| 520 |
|
|
|a decoding process speeds up and at the same time provides
|
| 520 |
|
|
|a enough protection (error correcting capability) within the
|
| 520 |
|
|
|a inner turbo code and an outer BCH code which would permit the
|
| 520 |
|
|
|a inner turbo code. The proposed coding scheme employs an
|
| 520 |
|
|
|a It is also likely that the concatenated coding scheme would
|
| 520 |
|
|
|a iteration of the turbo decoder.
|
| 520 |
|
|
|a iterations would be required for the decoding algorithm to
|
| 520 |
|
|
|a observed. This work attempts to look at one way to reduce
|
| 520 |
|
|
|a parallel concatenated convolutional codes. Research in turbo
|
| 520 |
|
|
|a relatively simple to decode using the Berlekamp-Massey
|
| 520 |
|
|
|a residual errors that may remain after the decoding of the
|
| 520 |
|
|
|a space and satellite channels. Turbo codes are essentially
|
| 520 |
|
|
|a techniques for decoding, to offer the kind of performance
|
| 520 |
|
|
|a that these codes do. Turbo codes use an iterative decoder
|
| 520 |
|
|
|a the decoding delay by using a concatenated coding scheme.
|
| 520 |
|
|
|a The outer BCH code is essentially used to clear out any
|
| 520 |
|
|
|a the reduced iterations within the turbo code. BCH codes are
|
| 520 |
|
|
|a This work deals with the implementation of a serially
|
| 520 |
|
|
|a times. These codes offer nearcapacity performance on deep
|
| 520 |
|
|
|a use where multiple error-correcting capability is required.
|
| 520 |
|
|
|a which could take up a considerable amount of processing time
|
| 530 |
|
|
|a Also available online.
|
| 530 |
|
|
|a Issued also on microfiche from Lange Micrographics.
|
| 650 |
|
4 |
|a Major electrical engineering.
|
| 856 |
4 |
1 |
|u https://hdl.handle.net/1969.1/ETD-TAMU-1997-THESIS-O93
|z Link to OAKTrust copy
|t 0
|
| 999 |
|
|
|a MARS
|
| 999 |
f |
f |
|s d06800c5-7c78-3c5a-82f0-3ef80aa4c768
|i 66f8d97d-41d5-3756-9691-c2b13b15755a
|t 0
|
| 952 |
f |
f |
|p noncirc
|a Texas A&M University
|b College Station
|c Cushing Memorial Library & Archives
|s cush tdrm
|d Cushing: Theses & Dissertations Microforms (Does not check out)
|t 0
|e 1997 Thesis O93
|h Other scheme
|i computer -- online resource
|
| 952 |
f |
f |
|a Texas A&M University
|b College Station
|c Electronic Resources
|s www_evans
|d Available Online
|t 0
|e 1997 Thesis O93
|h Other scheme
|
| 998 |
f |
f |
|a 1997 Thesis O93
|t 0
|l Cushing: Theses & Dissertations Microforms (Does not check out)
|
| 998 |
f |
f |
|a 1997 Thesis O93
|t 0
|l Available Online
|