• The Journal of the Acoustical Society of Korea
• /
• v.12 no.1
• /
• pp.47-54
• /
• 1993

Performance analysis is very important to transmit the high quality information and to construct the optimal system for the minimze the noise from the channel of spread spectrum system. In this paper the error rate performance is analyzed with computer simulation in noncoherent frequency hopping M-qry frequency shift keying(FH/MFSk) systems with regard to thermal noise under the partial band jamming environments. AS a result, in case the thermal noise is disregarded, bit error probability of system in jamming fraction ρ and Eb/Nj(bit energy to jamming power density) is reduced with the increase of K and in worst case 32FSK system is better than 2FSK system by 3.23dB with the variatio of Eb/Nj. In case thermal noise is considered, bit error probability of system by 3.23dB with the variation of Eb/Nj. In case thermal noise is considered, bit error probability of system are reduced with the increase of K and Eb/No(bit energy to thermal noise density). Bit error probability in connection with worst case ρ is not largely influenced form over the 14dB to K=1 and 8dB to K=5 accordingly thermal noise disregarding. These results may be useful for avoiding the common vulnerabilities when the spread spectrum system is designed.

• The Journal of the Acoustical Society of Korea
• /
• v.24 no.2E
• /
• pp.61-66
• /
• 2005

Experimental work in underwater acoustic communications using passive phase conjugation has shown that the demodulation error depends on the relative drift rate between the source and receiver [Rouseff et al., IEEE J. Oceanic Eng. 26, 821-831 (2001)]. The observed effect involves the mismatch between the initial impulse response and the subsequent response after the source or receiver has changed locations. In the present work, the effect of drifting source is analyzed by numerical simulations and compared to the experimental results. The communications bit error rate is qualified as a function of drift rate, drifting direction, and source-receiver range.

• Journal of Communications and Networks
• /
• v.16 no.3
• /
• pp.301-304
• /
• 2014

This paper proposes accurate interference probability and bit error rate formulas for cognitive relay networks with underlay spectrum sharing and channel estimation error (CEE). Numerous results reveal that the CEE not only degrades the performance of secondary systems (SSs) but also increases interference power caused by SSs to primary systems (PSs), eventually unfavorable to both systems. A solution to further protect PSs from this effect through reducing the power of secondary transmitters is investigated and analyzed.

• Journal of the Institute of Electronics Engineers of Korea SC
• /
• v.44 no.3
• /
• pp.45-50
• /
• 2007

We present a auto compensating quantum key distribution system based on optical fiber at 1550nm. In the quantum key transmission system, main control board and phase modulation driving board are fabricated for auto controlling quantum key distribution(QKD). We tested the single photon counts per dark counts for a single photon detector, quantum key distribution rate($R_{sift}$) and the quantum bit error rate (QBER). Quantum bit error rate of 3.5% in 25km QKD is obtained. This system is commercially available.

• Journal of the Korean Institute of Telematics and Electronics A
• /
• v.33A no.2
• /
• pp.32-39
• /
• 1996

Hybrid decision decoding for the extended hamming codes without retransmission, which is a combination of hard and soft decision decoding, is proposed and its performance is analyzed in this paper. As results, hybsrid decision decoding shows a little bit higher residual bit error rate than soft decision decoding. However, as the size of the extended hamming code increases, the difference of th enumber of comparisons increases further. In addition, hybrid decision decoding shows almost same residual bit error rate as hard decision decoding with retrassmission and shows much lower residual bit error rate than hard decision decoding without retransmission.

• 한국초전도학회:학술대회논문집
• /
• v.14
• /
• pp.64-64
• /
• 2004

• Journal of the Korean Institute of Telematics and Electronics
• /
• v.27 no.4
• /
• pp.484-490
• /
• 1990

In speech coding scheme, because information bits have different error sensitivities over channel errors, the channel coder for combining with speech coding should be realized by the variable coding rate considering the bit importance of speech information bits. In realizing the 4 kbps channel coder for 12kbps speech, this paper have chosen the channel coding method by analyzing the hard-decision post-decoding error rate of RCPC(Rate Compatible Punctured Convolutional) codes and bit error sensitivity of 12 kbps speech. Under the coherent QPSK and Rayleigh fading channel, the performance analysis has showed that 10dB gain was obtained in speech SEGSNR by 4-level uneuqal error protection, which was compared with the caseof no channel coding at 7dB channel SNR.

• Journal of the Korea Society of Computer and Information
• /
• v.20 no.12
• /
• pp.1-8
• /
• 2015

Wear leveling techniques have been studied to prolong the lifetime of NAND flash memory. Most of studies have used Program/Erase(P/E) cycles as wear index for wear leveling. Unfortunately, P/E cycles could not predict the real lifetime of NAND flash blocks. Therefore, these algorithms have the limited performance from prolonging the lifetime when applied to the SSD. In order to apply the real lifetime, wear leveling algorithms, which use raw Bit Error Rate(rBER) as wear index, have been studied in recent years. In this paper, we propose CrEWL(Cold data identification using raw Bit error rate in Wear Leveling), which uses rBER as wear index to apply to the real lifetime. The proposed wear leveling reduces an overhead of garbage collections by using HBSQ(Hot Block Sequence Queue) which identifies hot data. In order to reduce overhead of wear leveling, CrEWL does not perform wear leveling until rBER of the some blocks reaches a threshold value. We evaluate CrEWL in comparison with the previous studies under the traces having the different Hot/Cold rate, and the experimental results show that our wear leveling technique can reduce the overhead up to 41% and prolong the lifetime up to 72% compared with previous wear leveling techniques.

• Journal of the Institute of Electronics and Information Engineers
• /
• v.50 no.8
• /
• pp.21-27
• /
• 2013

In this paper, we propose a low-complexity Turbo coded BICM-ID (bit-interleaved coded modulation with iterative decoding) system. A Turbo code is a powerful error correcting code with a BER (bit error rate) performance very close to the Shannon limit. In order to increase spectral efficiency of the Turbo code, a coded modulation combining Turbo code with high order modulation is used. The BER performance of Turbo-BICM can be improved by Turbo-BICM-ID using iterative demodulation and decoding algorithm. However, compared with Turbo-BICM, the decoding complexity of Turbo-BICM-ID is increased by exchanging information between decoder and demodulator. To reduce the decoding complexity of Turbo-BICM-ID, we propose a low-complexity Turbo-BICM-ID system. When compared with conventional Turbo-BICM-ID, the proposed scheme not only show similar BER performance but also reduce the decoding complexity.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.12 no.8
• /
• pp.3749-3768
• /
• 2018

As one of the most potential types of low-density parity-check (LDPC) codes, CPM-QC-LDPC code has considerable advantages but there still exist some limitations in practical application, for example, the existing decoding algorithm has a low convergence rate and a high decoding complexity. According to the structural property of this code, we propose a new method based on a CPM-RID decoding algorithm that decodes block-by-block with weights, which are obtained by neural network training. From the simulation results, we can conclude that our proposed method not only improves the bit error rate and frame error rate performance but also increases the convergence rate, when compared with the original CPM-RID decoding algorithm and scaled MSA algorithm.