1-6hit |
In this paper, we propose a simple peak power reduction (PPR) method based on adaptive inversion of parity-check block of codeword in BCH-coded OFDM system. In the proposed method, the entire parity-check block of the codeword is adaptively inversed by multiplying weighting factors (WFs) so as to minimize PAPR of the OFDM signal, symbol-by-symbol. At the receiver, these WFs are estimated based on the property of BCH decoding. When the primitive BCH code with single error correction such as (31,26) code is used, to estimate the WFs, the proposed method employs a significant bit protection method which assigns a significant bit to the best subcarrier selected among all possible subcarriers. With computer simulation, when (31,26), (31,21) and (32,21) BCH codes are employed, PAPR of the OFDM signal at the CCDF (Complementary Cumulative Distribution Function) of 10-4 is reduced by about 1.9, 2.5 and 2.5 dB by applying the PPR method, while achieving the BER performance comparable to the case with the perfect WF estimation in exponentially decaying 12-path Rayleigh fading condition.
Jung Gon KIM Chang-Seok LEE Hyung-Myung KIM
In this paper, we propose a partial erasure decoding scheme with erasure-decision threshold for Reed-Solomon (RS) codes and analyze its performance in frequency-hopped multiple-access communications. RS code is used to correct erasures and errors caused by other-user interference. Binary FSK is employed to transmit the channel symbol. The proposed decoder decides whether to erase the received RS code symbol based on the ersure decsion threshold. The approximated formula for optimal erasure decision threshold is derived in such a way that packet error probability can be minimized. Numerical results show that the employment of adaptive erasure decision threshold attains the higher normalized throughput in the areas of high channel traffic cases.
Hidenori KUWAKADO Hatsukazu TANAKA
Kurosawa, Obana, and Ogata proposed a (k,n) threshold scheme such that t cheaters can be identified, where t (k-1)/3. Their scheme is superior to previous schemes with respect to the number of participants for identifying cheaters and the size of a share. In this paper, we improve the detectability of their scheme. By using erasure decoding and the authentication code, we show that cheaters less than k/2 can be identified. Although the size of a share is larger than that of their scheme, it is independent of n.
Radhakrishna CANCHI Yoshihiko AKAIWA
In order to exploit fully the frequency diversity benefits of multicarrier modulation (MCM), and the very nature of the frequency selective radio channel, we investigate an erasure decoded π/4 QDPSK MCM (ED-MCM) by employing simple Hamming (block) code. We propose the threshold-free criteria, i. e. relative minimum receive power test (RMRPT) and relative maximum decision error test (RMDET) for erasure generation and evaluate ED-MCM's performance by applying these tests to average received power, average decision error, instantaneous symbol/bit decision errors. At a normalized delay spread of 1/64, computer simulation results indicate a coding gains of 6.0 - 7.0 dB with ED-MCM at a BER of 10-3. RMDET/RMRPT based erasure decoding yields a 1.5 - 2.5 dB improvement over the conventional forward error correction (FEC) decoding at a BER of 10-5. The simulation results at other normalized delay spreads, i. e. , 1/32, 1/16 are also obtained. The erasure criteria (RMRPT and RMDET) applied to average values of received power/decision error yield consistently better performance over error only decoding. The results indicate that the erasure decoding based on relative (threshold-free) measures clearly promises an improved performance of the MCM system.
Weidong MAO Ryuji KOHNO Hideki IMAI
In this paper we propose a two-stage address coding scheme to transmit two data symbols at once within a frame in a MFSK/FH-CDMA system. We compare it with the conventional system using single-stage address coding. Assumed that the address codes of all users are known in the receiver. A multiuser detection scheme is applied and the performance is evaluated by computer simulations to show the improvement in bit error rate (BER) compairing to the conventional system. We also investigate the performance of error-correcting coding and decoding in the two-stage address coded MFSK/FH-CDMA system. An erasure decoding scheme is modified for the two-stage address coded system and is utilized to improve spectral efficiency or to increase user capacity in the MFSK/FH-CDMA system. Finally, we investigate a hybrid scheme of combining the multi-user detection scheme and the error-correcting decoding scheme for the two-stage address coded MFSK/FH-CDMA system. The performance is evaluated by computer simulations.
Kin-ichiroh TOKIWA Hiroshi MATSUDA Hatsukazu TANAKA
Coding scheme is discussed for M-Choose-T communication in which at most T active users out of M potential users simultaneously transmit their messages over a common channel. The multiple-access channel considered in this paper is assumed to be a time-discrete noiseless adder channel without feedback with T binary inputs and one real-valued output, and is used on the assumption of perfect block and bit synchronization among users. In this paper a new class of uniquely decodable codes is proposed in order to realize error-free M-Choose-T communication over the adder channel described above. These codes are uniquely decodable in the sense that not only the set of active users can be specified but also their transmitted messages can be recovered uniquely as long as T or fewer users are active simultaneously. It is shown that these codes have a simple decoding algorithm and can achieve a very high sum rate arbitrarily close to unity if exactly T users are active.