Trade-Off Between Frame Synchronization and Channel Decoding for Short Packets

Bidan, Raphaël Le; Guilloud, Frédéric

doi:10.1109/lcomm.2019.2913363

Cited by 6 publications

(7 citation statements)

References 11 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In the calculation of η, the transition probability p (r) νλ given in (20) is used for M 2 times to obtain the probability transition matrix P (r) . Moreover, the complexity in the calculation of p (r) νλ is O(M 3 ), as there are two layers of summation shown in (20) and another layer of summation in S(•, •) is given by (11). Therefore, the complexity in the calculation of η is…”

Section: B Impact Of Unloaded Tssmentioning

confidence: 99%

“…Fig. 8 depicts the stationary distribution of the events that the numbers of unloaded TSs are 0 and 1, versus the total packet number in the storage containing M = 16, 32, 64 queues, i.e., the number of OBs, K o = 4, 5, 6, where the theoretical results are calculated using (21) based on the transition matrix approximation in (20). As shown in this figure, the theoretical and simulation results match well.…”

Section: B Impact Of Unloaded Tssmentioning

confidence: 99%

“…Firstly, the IoT device configuration and the service latency requirement limit the transceiver's buffer size [18], [19]. Secondly, the meta-data size, arising from control information, is comparable to the payload size in short packets [20], [21].…”

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

Opportunistic Bits in Short-Packet Communications: A Finite Blocklength Perspective

Yin

Yang

et al. 2021

IEEE Trans. Commun.

View full text Add to dashboard Cite

In this paper, the concept of opportunistic bits (OBs) is developed in short-packet communications and investigated from a finite blocklength perspective. In the OB-based transmission, the data unit of a packet is divided into two parts: OBs and conventional bits (CBs). The OBs are not physically transmitted but used to indicate the index of the time slot (TS) when the packet containing CBs is transmitted. The loading of a bulk of OB-based packets into multiple TSs can be modelled as a Repeated Balls-into-Bins process with a multi-queue storage. If the bulk is not large enough, certain combination(s) of OBs will not appear, which leaves certain TS(s) empty and hence reduces the TS load efficiency. To evaluate the OB-based transmission performance, we formulate its maximal payload rate and TS load efficiency. With the aid of these two formulations, the energy gain, the goodput, and the latency of OB-based short-packet communications are derived and obtained in analytical forms. For achieving further insights, illustrative numerical results on the resource utilisation efficiency and the performance not only substantiate the advantages of the OB-based transmission over the conventional but also provide useful tools and specifications for its design in massive short-packet communications.Index Terms-Opportunistic bit (OB), short-packet communications, finite blocklength, time slot (TS) load efficiency, maximal payload rate, energy gain, goodput.

show abstract

Section: B Impact Of Unloaded Tssmentioning

confidence: 99%

Section: B Impact Of Unloaded Tssmentioning

confidence: 99%

See 1 more Smart Citation

Opportunistic Bits in Short-Packet Communications: A Finite Blocklength Perspective

Yin

Yang

et al. 2021

IEEE Trans. Commun.

View full text Add to dashboard Cite

show abstract

“…In this section, we derive the pairwise probability expressions given in (4) first for the coherent, then for the non-coherent receiver. Note that an ML based metric derivation can be found in [10].…”

Section: Pairwise Synchronization Error Probabilitymentioning

confidence: 99%

“…Evaluating The exact and approximate derivation of P e,up (τ ), P e,lo1 (τ ) and P e,lo2 (τ ) can be found in [10]. Note that the proposed approximation is quite accurate and simple to manipulate.…”

Section: Concatenation Sw (Csw)mentioning

confidence: 99%

On the optimization of resources for short frame synchronization

2020

Self Cite

View full text Add to dashboard Cite

We consider the transmissions of successive short packets. Each of them combines information to be transmitted (codeword) with information for synchronizing the frame (syncword). For short packets, the cost of including syncwords is no longer negligible and its design requires careful optimization. In particular, a trade-off arises depending on the way the total transmit power or the total frame length is split among the syncword and the codeword. Assuming optimal finite-length codes, we develop tight upper bounds on the probability of erroneous synchronization, for both frames with concatenated syncword and frames with superimposed syncword. We use these bounds to optimize this trade-off. Simulation results show that the proposed bounds and analysis have practical relevance for short packet communication system design.

show abstract