<?xml version="1.0" encoding="UTF-8"?>
<collection xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.loc.gov/MARC21/slim http://www.loc.gov/standards/marcxml/schema/MARC21slim.xsd" xmlns="http://www.loc.gov/MARC21/slim">
 <record>
  <leader>00000cab a22000003a 4500</leader>
  <controlfield tag="001">UP-99796217609625086</controlfield>
  <controlfield tag="003">Buklod</controlfield>
  <controlfield tag="005">20231007234507.0</controlfield>
  <controlfield tag="006">m    |o  d |      </controlfield>
  <controlfield tag="007">ta</controlfield>
  <controlfield tag="008">110121s        xx     d | ||r |||||   ||</controlfield>
  <datafield tag="040" ind1=" " ind2=" ">
   <subfield code="a">DENGII</subfield>
  </datafield>
  <datafield tag="041" ind1=" " ind2=" ">
   <subfield code="a">eng</subfield>
  </datafield>
  <datafield tag="100" ind1="0" ind2=" ">
   <subfield code="a">Seokhyun Yoon</subfield>
  </datafield>
  <datafield tag="245" ind1="0" ind2="0">
   <subfield code="a">Packet data communications over coded CDMA - Part II</subfield>
   <subfield code="b">Throughput bound of CDMA unslotted ALOHA with hybrid type II ARQ using rate compatible punctured turbo codes.</subfield>
  </datafield>
  <datafield tag="300" ind1=" " ind2=" ">
   <subfield code="a">pp. 1616-1625</subfield>
  </datafield>
  <datafield tag="520" ind1=" " ind2=" ">
   <subfield code="a">In this part of the paper, we investigate the throughput bound of CDMA unslotted ALOHA system with a hybrid type II automatic-repeat-request (ARQ) implemented using rate compatible punctured turbo codes. The system under consideration can be regarded as an enhanced version of the classical CDMA packet radio network. When applying a hybrid type-II ARQ, the probability of packet success and packet length is generally different from attempt to attempt. Since the conventional analytical model, customarily employed for the ALOHA system with pure or hybrid type-I ARQ, cannot be applied for this case, we introduce an expanded analytical model, which can be regarded as a network of queues, and apply Jackson and Burke's theorems to simplify the analysis. When using code combining, soft-decision decoding is usually considered, in which case, it is very difficult to find the actual probability of packet success, especially when the number of terminals changes during a packet time duration. Hence, instead of finding the actual probability of packet success, we evaluate a lower and an upper bound. Together with the expanded model and the packet success probability bound, we obtain the corresponding throughput bounds by iteratively searching the steady-state arrival rate, λ, and the average departure rate, μ, for given composite offered traffic, G=λ/μ. The results show that significant improvement in throughput can be achieved by exploiting high coding gain of turbo codes and channel utilization efficiency of incremental redundancy retransmission protocol.</subfield>
  </datafield>
  <datafield tag="653" ind1=" " ind2=" ">
   <subfield code="a">CDMA throughput bound.</subfield>
  </datafield>
  <datafield tag="653" ind1=" " ind2=" ">
   <subfield code="a">Automatic repeat request.</subfield>
  </datafield>
  <datafield tag="653" ind1=" " ind2=" ">
   <subfield code="a">Average departure rate.</subfield>
  </datafield>
  <datafield tag="653" ind1=" " ind2=" ">
   <subfield code="a">Channel utilization.</subfield>
  </datafield>
  <datafield tag="653" ind1=" " ind2=" ">
   <subfield code="a">Code division multiple access.</subfield>
  </datafield>
  <datafield tag="653" ind1=" " ind2=" ">
   <subfield code="a">Coded CDMA.</subfield>
  </datafield>
  <datafield tag="653" ind1=" " ind2=" ">
   <subfield code="a">Coding gain.</subfield>
  </datafield>
  <datafield tag="653" ind1=" " ind2=" ">
   <subfield code="a">Composite offered traffic.</subfield>
  </datafield>
  <datafield tag="653" ind1=" " ind2=" ">
   <subfield code="a">Hybrid type II ARQ.</subfield>
  </datafield>
  <datafield tag="653" ind1=" " ind2=" ">
   <subfield code="a">Incremental redundancy retransmission protocol.</subfield>
  </datafield>
  <datafield tag="653" ind1=" " ind2=" ">
   <subfield code="a">Packet data communications.</subfield>
  </datafield>
  <datafield tag="653" ind1=" " ind2=" ">
   <subfield code="a">Packet radio network.</subfield>
  </datafield>
  <datafield tag="653" ind1=" " ind2=" ">
   <subfield code="a">Packet success probability.</subfield>
  </datafield>
  <datafield tag="653" ind1=" " ind2=" ">
   <subfield code="a">Packet time duration.</subfield>
  </datafield>
  <datafield tag="653" ind1=" " ind2=" ">
   <subfield code="a">Rate compatible punctured turbo codes.</subfield>
  </datafield>
  <datafield tag="653" ind1=" " ind2=" ">
   <subfield code="a">Soft-decision decoding.</subfield>
  </datafield>
  <datafield tag="653" ind1=" " ind2=" ">
   <subfield code="a">Steady-state arrival rate.</subfield>
  </datafield>
  <datafield tag="653" ind1=" " ind2=" ">
   <subfield code="a">Unslotted ALOHA.</subfield>
  </datafield>
  <datafield tag="773" ind1="0" ind2=" ">
   <subfield code="t">IEEE Transactions on wireless communications</subfield>
   <subfield code="g">3, 5 (2004).</subfield>
  </datafield>
  <datafield tag="905" ind1=" " ind2=" ">
   <subfield code="a">FO</subfield>
  </datafield>
  <datafield tag="852" ind1=" " ind2=" ">
   <subfield code="a">UPD</subfield>
   <subfield code="b">DENG-II</subfield>
  </datafield>
  <datafield tag="942" ind1=" " ind2=" ">
   <subfield code="a">Article</subfield>
  </datafield>
 </record>
</collection>
