Zobrazeno 1 - 10
of 145
pro vyhledávání: '"Mao-Chao Lin"'
Publikováno v:
IEEE Access, Vol 11, Pp 28887-28895 (2023)
Gain division multiple access (GDMA) is a non-orthogonal multiple access (NOMA) technique for uplink communications. In GDMA, the receiver employs both the magnitudes and phases of channel gains associated to the users to separate users. In the power
Externí odkaz:
https://doaj.org/article/bff22fc6219f4e61abbbcef930a90465
Publikováno v:
IEEE Communications Letters. 25:3449-3453
For an orthogonal frequency division multiplexing (OFDM) communication system which requires channel estimation for each sub-carrier without using pilot signals, there may exist the problem of phase ambiguity. By extending the conventional concept of
Publikováno v:
2021 IEEE 94th Vehicular Technology Conference (VTC2021-Fall).
Publikováno v:
ISPACS
A transformation technique has been designed, where the encoding result of the polar code can be transfered to an low-density parity-check (LDPC) code. The belief-propagation decoding can be applied to the received sequence according to the parity-ch
Publikováno v:
IEEE Communications Letters. 22:1124-1127
We study physical-layer raptor (PLR) coding for message blocks of moderate lengths to achieve low decoding complexity with only a slight degradation in throughput. Approaches include systematic PLR code construction, convergence analysis, and an earl
Publikováno v:
IEEE Transactions on Broadcasting. 63:123-133
In the orthogonal frequency division multiplexing communications, bit flipping can be used for the reduction of peak-to-average-power ratio (PAPR). Error-correction coding can be used to relieve the degradation of bit-error rates (BERs) resultant fro
Publikováno v:
VTC-Fall
We construct polar codes for OFDM systems over the frequency selective channel. The channel coefficients are assumed to be available to the transmitter such that the encoder of polar codes can correctly distinguish the input reliabilities and make pr
Publikováno v:
IEEE Transactions on Information Theory. 62:4857-4866
In this paper, the unequal error protection (UEP) capability of convolutional encoders, in terms of the separation vector, is studied from an algebraic viewpoint. A simple procedure is presented for constructing a generator matrix, which is basic and
Publikováno v:
ISITA
A* algorithm is a kind of tree search algorithm which aims to decode short block codes. In the A* algorithm, a stack is needed to store the partially computed paths. The cost of maintaining the stack is very significant. As the size of the stack incr
Publikováno v:
IEEE Transactions on Communications. 63:3471-3481
The $A^{\ast}$ algorithm for decoding linear block codes is an efficient tree-search method for decoding short linear block codes. The information contained in the parity bits are potentially useful for reducing the edges needed in the tree search. W