• Journal of Satellite, Information and Communications
• /
• v.10 no.2
• /
• pp.109-114
• /
• 2015

Frame synchronization is achieved by correlation between received symbols and a preamble pattern which is periodically appended at a frame header. In this paper, we deal with a frame detection method complaint with satellite-based DVB-S2 system. In DVB-S2, frame synchronization is performed under the low signal-to-noise ratio(SNR), a large frequency offset which can be up to 20% of a symbol transmission rate and unknown modulation schemes ranging from QPSK to 32-APSK. In this environment, we propose a method combining differential correlation based on SOF and PLSC with an accumulated correlation method for the detection of frame structures. In addition, detection performances about mean acquisition time(MAT) and detection error probability are evaluated via computer simulations.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.20 no.5
• /
• pp.1013-1019
• /
• 2016

This paper describes a novel Context-awareness Markov Chain Prediction (CMCP) algorithm based on movement prediction using Markov chain in Delay Tolerant Network (DTN). The existing prediction models require additional information such as a node's schedule and delivery predictability. However, network reliability is lowered when additional information is unknown. To solve this problem, we propose a CMCP model based on node behaviour movement that can predict the mobility without requiring additional information such as a node's schedule or connectivity between nodes in periodic interval node behavior. The main contribution of this paper is the definition of approximate speed and direction for prediction scheme. The prediction of node movement forwarding path is made by manipulating the transition probability matrix based on Markov chain models including buffer availability and given interval time. We present simulation results indicating that such a scheme can be beneficial effects that increased the delivery ratio and decreased the transmission delay time of predicting movement path of the node in DTN.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.30 no.12C
• /
• pp.1181-1185
• /
• 2005

A combining of MIMO signal processing with OFDM is regarded as a promising solution of enhancing the performance of next generation wireless system. Therefore, in this paper, an OFDM-based wireless system employing layered space-time architecture is considered for a high-rate transmission. In the MIMO-OFDM system, we evaluate the PAR performance using the SLM approaches. The investigated SLM scheme for MIMO-OFDM signals selects the transmitted sequence with lowest average PAR over all transmitting antennas and retrieves the side information very accurately at the expense of a slight degradation of the PAR performance. The low probability of false side information can improve the overall detection performance of the MIMO-OFDM system with erroneous side information compared to the ordinary SLM approache, respectively. Also, we provide closed form of the average BER performance in MIMO-OFDM system using analytic approach.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.41 no.2
• /
• pp.269-276
• /
• 2016

Internet of Things (IoT) is based on wireless networks being able to connect things and people on a large scale. In the IoT environment, reliable broadcast plays an important role to distribute data to a large number of devices. Energy harvesting from a surrounding environment is a key technique to achieve a sustainable IoT network. In IoT networks, a problem of transmission errors and energy shortage should be mitigated for reliable broadcast. In this paper, we propose an energy-efficient and reliable broadcast method to consider packet errors and energy consumption in the environment where a large number of nodes are connected. The proposed scheme can improve data restoration probability by up to 15% and reduce energy consumption by up to 17%.

• Journal of Communications and Networks
• /
• v.12 no.3
• /
• pp.222-230
• /
• 2010

In this paper, we present a closed-form approximation of the average sum rate of zero-forcing (ZF) beamforming (BF) with semi-orthogonal user selection (SUS). We first derive the survival probability associated with the SUS that absolute square of the channel correlation between two users is less than the orthogonalization level threshold (OLT).With this result, each distribution for the number of surviving users at each iteration of the SUS and the number of streams for transmission is calculated. Secondly, the received signal power of ZF-BF is represented as a function of the elements of the upper triangular matrix from QR decomposition of the channel matrix. Thirdly, we approximate the received signal power of ZF-BF with the SUS as the maximum of scaled chisquare random variables where the scaling factor is approximated as a function of both OLT and the number of users in the system. Putting all the above derivations and order statistics together, the approximated ergodic sum rate of ZF-BF with the SUS is shown in a closed form. The simulation results verify that the approximation tightly matches with the sample average for any OLT and even for a small number of users.

• Journal of the Korean Institute of Telematics and Electronics A
• /
• v.29A no.8
• /
• pp.34-40
• /
• 1992

This paper shows a new relational formula of multiplexing gain versus variable input bit rates useful for designing Nx1 ATM(Asynchronous Transfer Mode) multiplexer which mixes several asynchronous bit streams with different transmission rates. The relation between multiplexing gain and input bit stream speeds is derived from the occupied mean lenght(the width per unit time) of cells and the occupation probability of the number of cells at an arbitrary instant when the rates of the periodic cell strams change randomly. And the relation between multiplexing gain and variable bit rates from different number of input bit streams is analyzed accordingly. Under the condition of unlimited multiplexing speed, the more number of input bit streams increases, the bigger the multiplexing gain becomes. While for the case which restricts the multiplexing speed to a limited value, the multiplexing gain becomes smaller contrarily as the number of input bit streams continues too invrease beyond a boundary value. It is shown that for designing an ATM multiplexer according to the latter case, the combination of input bit streams should be determined such as its total bit rate is lower thean, but most apprpaximate to, the multiplexed output speed. Also the general formula evaluating the most significant parameters which should be needed to design the multiplexer is derived.

• Journal of Communications and Networks
• /
• v.13 no.4
• /
• pp.367-376
• /
• 2011

In this paper, we propose self-organizing schemes for the initial configuration of the neighbor cell list (NCL), maintenance of the NCL, and physical cell identifier (PCI) allocation in heterogeneous networks such as long term evolution systems where lower transmission power nodes are additionally deployed in macrocell networks. Accurate NCL maintenance is required for efficient PCI allocation and for avoiding handover delay and redundantly increased system overhead. Proposed self-organizing schemes for the initial NCL configuration and PCI allocation are based on evolved universal terrestrial radio access network NodeB (eNB) scanning that measures reference signal to interference and noise ratio and reference symbol received power, respectively, transmitted from adjacent eNBs. On the other hand, the maintenance of the NCL is managed by adding or removing cells based on periodic user equipment measurements. We provide performance analysis of the proposed schemes under various scenarios in the respects of NCL detection probability, NCL false alarm rate, handover delay area ratio, PCI conflict ratio, etc.

• Journal of Internet Computing and Services
• /
• v.17 no.5
• /
• pp.1-8
• /
• 2016

This paper proposes a novel broadcast scheduling algorithm for wireless large-scale networks based on theory of complex networks. In the proposed algorithm, the network topology is formed based on a scale-free network and the probability of link distribution is analyzed. In this paper, the characteristics of complex systems are analyzed (which are not concerned by the existing broadcast scheduling algorithm techniques) and the optimization of network transmission efficiency and network time delay are provided.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.47 no.7
• /
• pp.18-22
• /
• 2010

In this paper, we propose and analyze the two way ranging (TWR) positioning technique using ultra wideband (UWB) for indoor environment. We employed IEEE 802.15.3a channel as a simulation environment and used to time of arrival (TOA) algorithm. UWB technology in a low transmission power the less the effect of interfering with the existing system, the frequency can be shared so that it can improve the spectral efficiency. And, positioning technique based on UWB with a very narrow pulse width has high accuracy in indoor environment. From the simulation results, it is analyzed the probability of error and positioning performance for channel effects and confirmed usefulness of the proposed scheme.

• Journal of the Institute of Electronics Engineers of Korea TE
• /
• v.39 no.2
• /
• pp.51-59
• /
• 2002

In this paper, we studied the voice cryptograph system designed by the SEED algorithm for the safe transmission and receipt on the voice communication. Voice band signal converts to digital signal by the CODEC and DSP that applied the improved SEED algorithm encrypt the digital signal. The CODEC convert Encryption signal into analog voice signal. This voice signal is transmitted safely because of encryption signal even if someone wiretap. Receiver can hear the source voice, because the encryption signal decrypted using the SEED algorithm. In this paper, We designed the 32 round key instead of 16 round key in the SEED algorithm so that we improve the truncated differential probability from $2^{-143.1}$ to $2^{-286.6}$.