• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.19 no.6
• /
• pp.1115-1125
• /
• 1994

In this paper, an efficient concatenated coding scheme under the satellite channel is presented. The performance of this scheme in terms of bit error rate versus energy per information bit over white gaussian noise power density E/N has been evaluated via computer simulation as a function of various system parameters. To achieve accuracy in simulation results, the distortions caused from the satellite channel, such as the nonlinearity of the TWTA(traveling wave tube amplifier), signal distortions of the input and output filters, has been considered. The simulation results show that, through using the 2/3 punctured convolutional code as the inner code of the concatenated code system, the coding rate can be improved more over 16%, while maintaining the same system complexity and bit error performance.

• Journal of the Institute of Electronics and Information Engineers
• /
• v.51 no.9
• /
• pp.3-10
• /
• 2014

The synchronization signal in Long Term Evolution (LTE) systems contains the primary synchronization signal (PSS) and the secondary synchronization signal (SSS), and the overall synchronization performance is dominated by PSS detection. In this paper, we propose a PSS detection scheme employing three partial correlation based PSS detectors with different partial correlation lengths, in which calculated partial correlation values are reused in order to reduce computational complexity. A coherent selection scheme using tentative frequency offsets is also proposed to select one reliable result from outputs of partial correlation based PSS detectors. It is shown through computer simulation that the proposed scheme can have a robust detection performance in wide range of frequency offsets.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.16 no.1
• /
• pp.55-60
• /
• 2016

In the traditional wireless LAN model, scan procedure to search a new AP starts when the predefined number of Rx failure of beacon frames are occurred. In this case, lots of data packet loss occur during MN's handover because loss of the relatively longer data packet starts before the small-sized beacon loss. Newly developed scanning mechanism in this paper has the beacon counter that increases when the Rx power level of beacon frame is less than the threshold and the previous rx power level. New scan procedure starts when the counter exceeds the predefined number. Beacon Rx power threshold is verified and performance of the new WLAN model is evaluated under UDP and TCP traffic environment.

• The KIPS Transactions:PartC
• /
• v.11C no.1
• /
• pp.89-98
• /
• 2004

AQM (Active Queue Management) techniques such as RED (Random Early Detection) which be proposed to solve the congestion of internet perform congestion control effectively for TCP data. However, in the situation where TCP and UDP share the bottleneck link, they can not solve the problems of the unfairness and long queueing delay. In this paper, we proposed an simple queue management algorithm, called PSRED (Protocol Sensitive RED), that improves fairness and decreases queueing delay. PSRED algorithm improves fairness and decreases average queue length by distinguishes each type of flow in using protocol field of packets and applies different drop functions to them respectively.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.21 no.2
• /
• pp.427-434
• /
• 1996

Hypercube has some advantages such as small diameter between nodes and relatively simple routing scheme, so it is one of the most popular interconnection networks used in real systems. But to make this structure more practical, it is required to reduce its diameter and to be able to expand it to any number of nodes. In this study, we proposed a Crossed Incomplete Hypercube structure. This scheme is based on the previous Crossed Hypercube topology that reduces the diameter about 50% and has the same complexity with general hypercube and is able to expand to any number of nodes. We also proposed a fixed routing scheme for this structure. In the repect of the average path and the average routing time, this structure shows an enhanced performance about 30% and it is enhanced about 20% ifn the average traffic density.

• Journal of KIISE:Computer Systems and Theory
• /
• v.34 no.5_6
• /
• pp.176-186
• /
• 2007

An interconnection network can be represented as a graph where a vertex corresponds to a node and an edge corresponds to a link. The diameter of an interconnection network is the maximum length of the shortest paths between all pairs of vertices. The fault diameter of an interconnection network G is the maximum length of the shortest paths between all two fault-free vertices when there are $_k(G)-1$ or less faulty vertices, where $_k(G)$ is the connectivity of G. The fault diameter of an R-regular graph G with diameter of 3 or more and connectivity ${\tau}$ is at least diam(G)+1 where diam(G) is the diameter of G. We show that the fault diameter of a 2-dimensional $m{\times}n$ torus with $m,n{\geq}3$ is max(m,n) if m=3 or n=3; otherwise, the fault diameter is equal to its diameter plus 1. We also show that in $d({\geq}3)$-dimensional $k_1{\times}k_2{\times}{\cdots}{\times}k_d$ torus with each $k_i{\geq}3$, there are 2d mutually disjoint paths joining any two vertices such that the lengths of all these paths are at most diameter+1. The paths joining two vertices u and v are called to be mutually disjoint if the common vertices on these paths are u and v. Using these mutually disjoint paths, we show that the fault diameter of $d({\geq}3)$-dimensional $k_1{\times}k_2{\times}{\cdots}{\times}k_d$ totus with each $k_i{\geq}3$ is equal to its diameter plus 1.

• The Journal of The Korea Institute of Intelligent Transport Systems
• /
• v.10 no.3
• /
• pp.25-35
• /
• 2011

Traffic volume increases due to diversification of industry. Also, Automobile ownerships also increase steadily. It is estimated that the registered number of vehicle is expected to be 20 milion in the year 2015. These trends may result in increasing the number of woman drivers and elderly drivers. Therefore, this study aims to identify routes that reflect characteristics of each driver's preferences. A survey was conducted on different routes attributes for variances drivers. Driver types were classified by gender, age, and driving career. Accordingly, a weight for road composition attribute such as number of lanes, number of accidents, slope was estimated by using Swing Weighting technique in Multi-Attribute Utility Theory. In addition, a case study was conducted and identified weights were applied to routes. In result, drivers commonly prefer short route when they considered their routes. Also, male drivers prefer speedy and shorter route than that of female drivers. Elderly drivers prefer safe routes that represent low accidents rate. Moreover driving career under a year drivers prefer safe and easy routes. Therefore, we may conclude that the necessity of diversified route information is essential in the future car navigation system.

• 전자공학회논문지 IE
• /
• v.43 no.3
• /
• pp.41-48
• /
• 2006

In this paper, we propose a new active queue management (AQM) scheme by utilizing the predictability of the Internet traffic. The proposed scheme predicts future traffic input rate by using the auto-regressive (AR) time series model and determines the future congestion level by comparing the predicted input rate with the service rate. If the congestion is expected, the packet drop probability is dynamically adjusted to avoid the anticipated congestion level. Unlike the previous AQM schemes which use the queue length variation as the congestion measure, the proposed scheme uses the variation of the traffic input rate as the congestion measure. By predicting the network congestion level, the proposed scheme can adapt more rapidly to the changing network condition and stabilize the average queue length and its variation even if the traffic input level varies widely. Through ns-2 simulation study in varying network environments, we compare the performance among RED, Adaptive RED (ARED), REM, Predicted AQM (PAQM) and the proposed scheme in terms of average queue length and packet drop rate, and show that the proposed scheme is more adaptive to the varying network conditions and has shorter response time.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.34 no.4C
• /
• pp.341-348
• /
• 2009

In this paper, we propose a grouping technique for the SDD(Synchronous Digital Duplexing) based on OFDMA(Orthogonal Frequency Division Multiple Access). The SDD has advantages of increasing data efficiency and flexibility of resource since SDD can transmit uplink signals and downlink signals simultaneously by using mutual time information and mutual channel information, obtained during mutual ranging process. However, the SDD has a disadvantage of requiring additional CS to maintain orthogonality of OFDMA symbols when the sum of mutual time difference and mutual channel length between AP(access point) and SS(subscriber station) or among SSs are larger than CP length. In order to minimize the length of CS for the case of requiring additional CS in SDD, we proposes a grouping technique which controls transmit timing and receive timing of AP and SS in a cell by classifying them into groups. Performances of the proposed grouping technique are evaluated by computer simulation.

• The Journal of Korean Institute of Electromagnetic Engineering and Science
• /
• v.20 no.8
• /
• pp.701-713
• /
• 2009

This paper studies a method for reducing performance degradation due to losing sub-carrier orthogonality caused by power transient between physical channels in LTE uplink transmission. The pattern of inter-carrier interference(ICI) caused by power transient is different from what has been studied for doppler shift, in that its pattern occurs at front and rear sides of channels in each period of power transient. The reason of ICI's occurrence results from power difference between channels, power transient duration, multi-path channel delay spread, and numbers of sub-carrier. New criterion is proposed to find out number of taps of multi-tap equalizer enough to improve the ICI. The scheme is to determine the number of taps of multi-tap equalizer when a normalized interference or a normalized ICI is greater than a normalized noise. Simulation results show that the number of taps is flexibly adjusted according to SNR(Signal to Noise Ratio) of a received signal to improve Bit Error Rate(BER), while the complexity of the proposed scheme is reduced down to 88 percentage of the classical method.