• Journal of Communications and Networks
• /
• v.11 no.5
• /
• pp.455-463
• /
• 2009

We consider the challenges of finding good puncturing patterns for rate-compatible low-density parity-check code (LDPC) codes over additive white Gaussian noise (AWGN) channels. Puncturing is a scheme to obtain a series of higher rate codes from a lower rate mother code. It is widely used in channel coding but it causes performance is lost compared to non-punctured LDPC codes at the same rate. Previous work, considered the role of survived check nodes in puncturing patterns. Limitations, such as single survived check node assumption and simulation-based verification, were examined. This paper analyzes the performance according to the role of multiple survived check nodes and multiple dead check nodes. Based on these analyses, we propose new algorithm to find a good puncturing pattern for LDPC codes over AWGN channels.

• ETRI Journal
• /
• v.26 no.2
• /
• pp.92-100
• /
• 2004

In this paper, we propose an efficient method to broadcast digital television signals using single frequency networks (SFNs) within the Advanced Television Systems Committee (ATSC) transmission systems. In implementing the SFNs of an 8-vestigial side band (8-VSB) Digital Television (DTV) system, the ambiguity problem of the trellis coder is unavoidable in a conventional ATSC transmission system. We propose a memory initialization of the trellis coder to resolve this ambiguity problem. Since the proposed scheme to synchronize multiple transmitters minimizes the changes from the conventional ATSC system, the hardware complexity for these changes is very low. Our simulation results show that the proposed scheme makes a less than 0.1 dB degradation at the threshold of visibility with a bit error rate of $3{\times}10^{-6}$ in the additive white Gaussian noise (AWGN) channel. It is possible to reduce the performance degradation by increasing the initialization period of the proposed scheme.

• ETRI Journal
• /
• v.9 no.3
• /
• pp.3-12
• /
• 1987

In this paper, a non-classical autocorrelation detector adopting a newly defined test statistic is introduced to solve the typical problem of detecting a narrowband signal transmitted over an additive white Gaussian noise (AWGN) channel. Error probability analyses are performed for a noncoherent frequency-shift-keying (FSK) system employing the proposed test-statistic. Through the histogram approach, the probability density functions of the test-statistics are plotted to explain the analysis model. All numerical results obtained indicate the limited improvement in error performance under the lower signal-to-noise ratio (SNR) and the use of higher number of samples per bit will finally provide the almost same confident potential of improvement in error rate as the system using matched filters (MFs) gives.

• Proceedings of the IEEK Conference
• /
• 2000.07a
• /
• pp.521-524
• /
• 2000

It is well known that the OFDM system is weak against the frequency offset. The frequency offset attenuates the received signal power and makes the performance bound in the OFDM transmission. We show the performance bound of the OFDM transmission with the frequency offset under the additive white Gaussian noise channel by the numerical method. According to the results, increasing the transmitting power is not useful to improve the performance, when the frequency offset exits. The performance degradation is very severe as the frequency offset increases.

• International journal of advanced smart convergence
• /
• v.7 no.3
• /
• pp.37-43
• /
• 2018

Lattice-reduction (LR) techniques have been developed for signal detection in spatial multiplexing multiple input multiple output (MIMO) systems to obtain the largest diversity gain. Thus, an LR-assisted zero-forcing (ZF) receiver can achieve the maximum diversity gain in spatial multiplexing MIMO systems. In this paper, a simplified analysis of the achievable diversity gain is presented by fitting the channel coefficients lattice-reduced by a complex Lenstra-Lenstra-$Lov{\acute{a}}z$ (LLL) algorithm into approximated Gaussian random variables. It will be shown that the maximum diversity gain corresponding to two times the number of receive antennas can be achieved by the LR-based ZF detector. In addition, the approximated bit error rate (BER) expression is also derived. Finally, the analytical BER performance is comparatively studied with the simulated results.

• Journal of the Korean Institute of Telematics and Electronics B
• /
• v.33B no.7
• /
• pp.163-172
• /
• 1996

Recently, it was reported that gaussian distribution and difference of two gaussians (DOG) to have band pass characteristics can be generated by simple iterative processes of the diffusion networks. In this paper, we propose method of improved implementation of a diffusion filter which can reduce total runing time, and operate by simple algorithm in contrast to the latest diffusion filter. We rebuild the diffusion network to a difference network which can generate DOG independently. Different filter characteristics are obtained just by each diffusion process and difference process. Quantitative analysis shows that the center frequency and the selectivity of each filter channel can be varied independently. Also, it would requires smaller amount of hardwares than conventioanl method to build a filter bank.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.21 no.7
• /
• pp.1803-1813
• /
• 1996

This paper describes an automatic threshold decision using a maximum mismatched correlation value in the direct sequence spread spectrum (DS-SS) system. For received PN codes with different single-to-noise ratio (SNR), this scheme is able to detect a desired threshold value in the search mode, i.e. a maximum mismstched correlation value, so that value is utilized as a threshold for the verification mode. Performance of the proposed scheme in both the additive white gaussian noise (AWGN) and frequency-selective Rayleigh fading channels is analyzed through the Monte Carlo simulation. And hardware implementation of this scheme using a DSP processor is demonstrated. The proposed acquisition shceme is compared to the conventional constant threshold (CT) scheme, and significant improvement of performance is shown. Analysis of system performance in the verification mode is presented, and key quantities such as the false alarm probability and the detection probability are derived in a AWGN channel.

• The Transactions of the Korean Institute of Electrical Engineers D
• /
• v.49 no.5
• /
• pp.269-277
• /
• 2000

We propose two new types multi-stage blind clustering equalizers for QAM demoulation, which are called a complex classification algorithm(CCA) and a radial basis function algorithm(RBFA). The CCA uses a clustering technique based on the joint gaussian probability function and computes separately the real part and imaginary part for simple implementation as well as less computation. In order to improve the performance of CCA, the Dual-Mode CCA(DMCCA) incorporates the CCA tap-updating mode with the decision-directed(DD) mode. The RBFA reduces the number of cluster centers through three steps using the classification technique of RBF and then updates the equalizer taps for QAM demodulation. Test results on 16-QAM confirm that the proposed algorithms perform better the conventional multi-state equalizers in the senses of SER and MSE under multi-path fading channel.

• ETRI Journal
• /
• v.26 no.5
• /
• pp.432-436
• /
• 2004

In this paper, we propose the modified uniformly most powerful (UMP) belief-propagation (BP)-based decoding algorithm which utilizes multiplicative and additive factors to diminish the errors introduced by the approximation of the soft values given by a previously proposed UMP BP-based algorithm. This modified UMP BP-based algorithm shows better performance than that of the normalized UMP BP-based algorithm, i.e., it has an error performance closer to BP than that of the normalized UMP BP-based algorithm on the additive white Gaussian noise channel for low density parity check codes. Also, this algorithm has the same complexity in its implementation as the normalized UMP BP-based algorithm.

• ETRI Journal
• /
• v.33 no.2
• /
• pp.283-286
• /
• 2011

Path loss plays fundamental roles in system design, spectrum management, and performance evaluation. The traditional path loss model has a slight inconvenience; it depends on the unknown distance. In this letter, we explore the probability distribution function (PDF) of path loss in an indoor office environment by randomizing out the distance variable. It is shown that the resulting PDF is not Gaussian-like but is skewed to the right, and both the PDF and the moments are related to the size of the office instead of the unknown distance. To be specific, we incorporate the IEEE 802.15.4a channel parameters into our model and tabulate the cumulative distribution function with respect to different room sizes. Through a simple example, we show how our model helps a cognitive spectrum user to infer path loss information of primary users without necessarily knowing their transmitter-receiver distance.