- Library Home /
- Search Collections /
- Open Collections /
- Browse Collections /
- UBC Theses and Dissertations /
- A generalized post-detector compatible soft-output...
Open Collections
UBC Theses and Dissertations
UBC Theses and Dissertations
A generalized post-detector compatible soft-output vitebri algorithm (sova) Kwan, David
Abstract
A generalized soft-output Viterbi algorithm (SOVA) that is applicable to any (n, k, m) convolutional code is proposed. The algorithm is compatible with the post-detector architecture proposed by Berrou et al. thereby achieving low computational complexity. By starting with Battail's generalized revision algorithm and re-referencing the relative values to the surviving path to each state, significant simplifications are made possible. By comparing the resultant simplified revision equation for (n,1,m) convolutional codes with Berrou's proposed post-detector compatible algorithm it is possible to deduce the additional modifications necessary to arrive at a (n,k,m) post detector compatible algorithm. Simulations show that with a revision depth greater than five times a code's constraint length, the proposed algorithm is capable of producing relatively high quality a posteriori input symbol estimates.
Item Metadata
Title |
A generalized post-detector compatible soft-output vitebri algorithm (sova)
|
Creator | |
Publisher |
University of British Columbia
|
Date Issued |
1996
|
Description |
A generalized soft-output Viterbi algorithm (SOVA) that is applicable to any (n, k, m)
convolutional code is proposed. The algorithm is compatible with the post-detector architecture
proposed by Berrou et al. thereby achieving low computational complexity.
By starting with Battail's generalized revision algorithm and re-referencing the relative
values to the surviving path to each state, significant simplifications are made possible.
By comparing the resultant simplified revision equation for (n,1,m) convolutional codes
with Berrou's proposed post-detector compatible algorithm it is possible to deduce the
additional modifications necessary to arrive at a (n,k,m) post detector compatible algorithm.
Simulations show that with a revision depth greater than five times a code's
constraint length, the proposed algorithm is capable of producing relatively high quality
a posteriori input symbol estimates.
|
Extent |
4123908 bytes
|
Genre | |
Type | |
File Format |
application/pdf
|
Language |
eng
|
Date Available |
2009-02-10
|
Provider |
Vancouver : University of British Columbia Library
|
Rights |
For non-commercial purposes only, such as research, private study and education. Additional conditions apply, see Terms of Use https://open.library.ubc.ca/terms_of_use.
|
DOI |
10.14288/1.0065312
|
URI | |
Degree | |
Program | |
Affiliation | |
Degree Grantor |
University of British Columbia
|
Graduation Date |
1996-05
|
Campus | |
Scholarly Level |
Graduate
|
Aggregated Source Repository |
DSpace
|
Item Media
Item Citations and Data
Rights
For non-commercial purposes only, such as research, private study and education. Additional conditions apply, see Terms of Use https://open.library.ubc.ca/terms_of_use.