• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.39A no.3
• /
• pp.127-139
• /
• 2014

In this paper, we present two signal processing techniques for designing binary error correction codes for Multi-Level Cell(MLC) NAND flash memory. MLC NAND flash memory saves the non-binary symbol at each cell and shows asymmetric channel LLR l-density which makes it difficult to design soft-decision binary error correction codes such as LDPC codes and Polar codes. Therefore, we apply density mirroring and EM algorithm for approximating the MLC NAND flash memory channel to the binary-input memoryless channel. The density mirroring processes channel LLRs to satisfy roughly all-zero codeword assumption, and then EM algorithm is applied to l-density after density mirroring for approximating it to mixture of symmetric Gaussian densities. These two signal processing techniques make it possible to use conventional code design algorithms, such as density evolution and EXIT chart, for MLC NAND flash memory channel.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.17 no.6
• /
• pp.59-68
• /
• 2017

Random process plays a major role in wireless communication system to analytically derive the probability distribution function of the various statistical distribution. In this paper, we derive the decreasing function of the exponential distribution under the given condition which is expressed as wireless channel condition. The probability distribution function of Gaussian, Laplacian, Rayleigh and Nakagami distribution are also derived. Extensive simulation results of these statistical distributions are provided to prove that random process has a significant role in the wireless communications. In addition, the Rayleigh and Rician channels show specific examples of visible distance communication and invisible distance channel environment. This paper is motivated by that we assume a block fading channel model, where the channel is constant during a transmission block and changes independently between consecutive transmission block, can achieve a better performance in high SNR regime with i.i.d channel. This algorithm for realizing these transforms can be applied to the Kronecker MIMO channel.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.38A no.1
• /
• pp.79-87
• /
• 2013

A new modulation technique - correlative encoded FSK (CEFSK) - for use in power and bandwidth limited digital communication system is proposed. CEFSK is free of ISI and generates output signals which have a smooth and continuous phase transition and a reduced envelope fluctuation by keeping correlation between amplitude and phases of two subsequent symbols. In comparison to conventional one-bit differential detected (1DD) GFSK, the performance of the 1DD-CEFSK in a non-linearly amplified (NLA) channel impaired by additive white Gaussian noise (AWGN), ISI and IM, is analyzed via computer simulation. The simulation result shows that, in an NLA single-channel, 1DD-CEFSK provides a signal-to-noise ratio (SNR) advantage of up to 1.2dB and 0.8dB at BER of $1{\times}10^{-4}$ when input back-off (IBO) of HPA is -1.0dB and -3.0dB, respectively. For the same channel environment with multi-channel, 1DD-CEFSK outperforms 1DD-GFSK by 1.1dB in SNR, regardless of the value of IBO.

• Journal of Communications and Networks
• /
• v.11 no.5
• /
• pp.433-444
• /
• 2009

The bi-directional relay channel is the natural extension of a three-terminal relay channel where node a transmits to node b with the help of a relay r to allow for two-way communication between nodes a and b. That is, in a bi-directional relay channel, a and b wish to exchange independent messages over a shared channel with the help of a relay r. The rates at which this communication may reliably take place depend on the assumptions made on the relay processing abilities. We overview information theoretic limits of the bi-directional relay channel under a variety of conditions, before focusing on half-duplex nodes in which communication takes place in a number of temporal phases (resulting in protocols), and nodes may forward messages in four manners. The relay-forwarding considered are: Amplify and forward (AF), decode and forward (DF), compress and forward (CF), and mixed forward. The last scheme is a combination of CF in one direction and DF in the other. We derive inner and outer bounds to the capacity region of the bi-directional relay channel for three temporal protocols under these four relaying schemes. The first protocol is a two phase protocol where a and b simultaneously transmit during the first phase and the relay r alone transmits during the second. The second protocol considers sequential transmissions from a and b followed by a transmission from the relay while the third protocol is a hybrid of the first two protocols and has four phases. We provide a comprehensive treatment of protocols in Gaussian noise, obtaining their respective achievable rate regions, outer bounds, and their relative performance under different SNR and relay geometries.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.25 no.5B
• /
• pp.931-941
• /
• 2000

We propose a serial acquisition scheme using antenna arrays for initial acquisition of direct sequence spread spectrum (DS-SS) signals, which can lower substantially the range of detectable signal-to-noise ratio (SNR). The proposed scheme uses the sum of the independent decision samples form psedo-noise (PN) co-phased noncoherent I-Q matched filters (MFs) associated with antenna arrays as a decision variable in order to enhance SNR of the resulting signal. We analyze its mean acquisition time performance under an additive white Gaussian noise (AWGN) channel and a flat Rayleigh fading channel by deriving the expressions for the probabilities of detection and false alarm. From mumerical results, we see that the acquisition performance of the proposal scheme becomes improved continually as the number of antennas increses.

• Journal of Communications and Networks
• /
• v.1 no.3
• /
• pp.182-188
• /
• 1999

The optimal joint maximum-likelihood sequence estima-for using an array of antennas is derived for synchronous direct sequence-code division multiple access (DS-CDMA) system. Each user employs a rate 1/n convolutional code for channel coding for the additive white Gaussian noise (AWGN) channel. The array re-ceiver structure is composed of beamformers in the users' direc-tions followed by a bank of matched filters. The decoder is imple-mented using a Viterbi algorithm whose states depend on the num-ber of users and the constraint length of the convolutional code. The asymptotic array multiuser coding gain(AAMCG)is defined to encompass the asymptotic multiuser coding gain and the spatial information on users' locations in the system. We derive the upper and lower bounds of the AAMCG. As an example, the upper and lower bounds of AAMCG are obtained for the two user case where each user employes the maximum free distance convolutional code with rate 1/2. The enar-far resistance property is also investigated considering the number of antenna elements and user separations in the space.

• Journal of Communications and Networks
• /
• v.16 no.1
• /
• pp.45-55
• /
• 2014

The paper investigates the problem of designing the multiple-antenna relay in a two-way relay network by taking into account the imperfect channel state information (CSI). The objective is to design the multiple-antenna relay based upon the CSI estimates, where the estimation errors are included to attain the robust design under the worst-case philosophy. In particular, the worst-case transmit power at the multiple-antenna relay is minimized while guaranteeing the worst-case quality of service requirements that the received signal-to-noise ratio (SNR) at both sources are above a prescribed threshold value. Since the worst-case received SNR expression is too complex for subsequent derivation and processing, its lower bound is explored instead by minimizing the numerator and maximizing the denominator of the worst-case SNR. The aforementioned problem is mathematically formulated and shown to be nonconvex. This motivates the pursuit of semidefinite relaxation coupled with a randomization technique to obtain computationally efficient high-quality approximate solutions. This paper has shown that the original optimization problem can be reformulated and then relaxed to a convex problem that can be solved by utilizing suitable randomization loop. Numerical results compare the proposed multiple-antenna relay with the existing nonrobust method, and therefore validate its robustness against the channel uncertainty. Finally, the feasibility of the proposed design and the associated influencing factors are discussed by means of extensive Monte Carlo simulations.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.7 no.4
• /
• pp.767-783
• /
• 2013

This paper aims at designing a selective demodulation scheme based on Log-likelihood Ratio threshold (SDLT) instead of the conventional adaptive demodulation (ADM) scheme, by using rateless codes. The major difference is that the Log-likelihood ratio (LLR) threshold is identified as a key factor to control the demodulation rate, while the ADM uses decision region set (DRS) to adjust the bit rate. In the 16-QAM SDLT scheme, we deduce the decision regions over an additive white Gaussian channel, corresponding to the variation of LLR threshold and channel states. We also derived the equations to calculate demodulation rate and bit error rate (BER), which could be proven by simulation results. We present an adaptation strategy for SDLT, and compare it with ADM and adaptive modulation (AM). The simulation results show that our scheme not only significantly outperforms the ADM in terms of BER, but also achieves a performance as good as the AM scheme. Moreover, the proposed scheme can support much more rate patterns over a wide range of channel states.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.8 no.8
• /
• pp.1613-1619
• /
• 2004

Turbo codes of long block sizes have been known to show very good performance in an AWGN channel and the turbo code has been strongly recommended as error correction code for W-CDMA in 3GPP(3rd Generation Partnership Project). Recently, turbo codes of short block sizes suitable for real time communication systems have attracted a lot of attention. Thus, in this paper we consider the turbo code of 1/3 code rate and short frame size of 192 bits in ITU-R channel model. We analyzed the performance of W-CDMA systems of 10MHz bandwidths employing RAKE receiver with not only MRC diversity but also SOVA-based turbo code.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.8 no.10
• /
• pp.3342-3360
• /
• 2014

In this paper, the capacity and BER performance of downlink distributed antenna systems (DAS) with transmit antenna selection and multiple receive antennas are investigated in MIMO composite channel, where path loss, Rayleigh fading and lognormal shadowing are all considered. Based on the performance analysis, using the probability density function (PDF) of the effective SNR and numerical integrations, tightly-approximate closed-form expressions of ergodic capacity and average BER of DAS are derived, respectively. These expressions have more accuracy than the existing expressions, and can match the simulation well. Besides, the outage capacity of DAS is also analyzed, and a tightly-approximate closed-form expression of outage capacity probability is derived. Moreover, a practical iterative algorithm based on Newton's method for finding the outage capacity is proposed. To avoid iterative calculation, another approximate closed-form outage capacity is also derived by utilizing the Gaussian distribution approximation. With these theoretical expressions, the downlink capacity and BER performance of DAS can be effectively evaluated. Simulation results show that the theoretical analysis is valid, and consistent with the corresponding simulation.