- Library Home /
- Search Collections /
- Open Collections /
- Browse Collections /
- UBC Theses and Dissertations /
- Multiple copy combining schemes for the additive white...
Open Collections
UBC Theses and Dissertations
UBC Theses and Dissertations
Multiple copy combining schemes for the additive white Gaussian noise channel Lam, Carson Y.H.
Abstract
A generalized version of a memory automatic repeat request (ARQ) scheme [15-221 using hard, soft, and completely soft detection is examined. The communication channel is modeled as an additive white Gaussian noise (AWGN) channel. The following six combining schemes are considered. In Scheme 1, error detection is performed on each of the n received copies. In Scheme 2, all n copies are combined and error detection is performed on the resulting packet. Scheme 3 uses Scheme 1 followed by Scheme 2 (if decoding using Scheme 1 is not successful). In Scheme 4, each incoming packet is combined with the copies received so far, and the resulting combined packet is checked for errors. Scheme 5 uses Schemes 1 followed by Scheme 4. The last scheme, Scheme 6, attempts decoding on up to all 2n- I possible combinations of the received copies. For an arbitrary detector quantization, analytic expressions for the retransmission probability, PϜ of Scheme 3 are derived, and numerical procedures for evaluating the PϜ of Schemes 4, 5 and 6 are described. Numerical examples showing the dependence of PϜ on various parameters, such as the signal to noise ratio (SNR), number of transmissions n, number of quantization levels M and packet length L are given. Although Scheme 6 has the lowest PϜ its decoding complexity increases exponentially with n. The six combining schemes are applied to the Weldon ARQ scheme [13,14,22] It is found that the throughput T is generally improved using multiple copy combining schemes. The throughput can be further increased by using a soft detector. For block error rates BKER > 0.5 and soft detectors, the throughputs of Schemes 2 to 6 are typically higher than that of an ideal selective repeat ARQ system with no packet combining. In general, Scheme 3 appears to be a good choice among all the six schemes with a good performance and a simple decoder structure.
Item Metadata
Title |
Multiple copy combining schemes for the additive white Gaussian noise channel
|
Creator | |
Publisher |
University of British Columbia
|
Date Issued |
1992
|
Description |
A generalized version of a memory automatic repeat request (ARQ) scheme
[15-221 using hard, soft, and completely soft detection is examined. The communication
channel is modeled as an additive white Gaussian noise (AWGN) channel. The following
six combining schemes are considered. In Scheme 1, error detection is performed on each
of the n received copies. In Scheme 2, all n copies are combined and error detection is
performed on the resulting packet. Scheme 3 uses Scheme 1 followed by Scheme 2 (if
decoding using Scheme 1 is not successful). In Scheme 4, each incoming packet is
combined with the copies received so far, and the resulting combined packet is checked
for errors. Scheme 5 uses Schemes 1 followed by Scheme 4. The last scheme, Scheme
6, attempts decoding on up to all 2n- I possible combinations of the received copies.
For an arbitrary detector quantization, analytic expressions for the retransmission
probability, PϜ of Scheme 3 are derived, and numerical procedures for evaluating the PϜ
of Schemes 4, 5 and 6 are described. Numerical examples showing the dependence of PϜ
on various parameters, such as the signal to noise ratio (SNR), number of transmissions n,
number of quantization levels M and packet length L are given. Although Scheme 6 has
the lowest PϜ its decoding complexity increases exponentially with n.
The six combining schemes are applied to the Weldon ARQ scheme [13,14,22] It
is found that the throughput T is generally improved using multiple copy combining
schemes. The throughput can be further increased by using a soft detector. For block
error rates BKER > 0.5 and soft detectors, the throughputs of Schemes 2 to 6 are
typically higher than that of an ideal selective repeat ARQ system with no packet
combining. In general, Scheme 3 appears to be a good choice among all the six schemes
with a good performance and a simple decoder structure.
|
Extent |
1257397 bytes
|
Genre | |
Type | |
File Format |
application/pdf
|
Language |
eng
|
Date Available |
2009-01-05
|
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.0064795
|
URI | |
Degree | |
Program | |
Affiliation | |
Degree Grantor |
University of British Columbia
|
Graduation Date |
1992-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.