• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.19 no.4
• /
• pp.712-720
• /
• 1994

In digital mobile communication systems, the convolutional coding is considered as the optimum error correcting scheme. Recently, the Viterbi algorithm is widely used for the decoding of convolutional code. Most Viterbi decoder has been proposed in conde rate R=1/2 or 2/3 with memory components (m) less than 3. which degrades the error correcting capability because of small code constraints (K). We consider the design method for typical code rate R=1/2, K=7(171,133) convolutional code with memory components, m=6. In this paper, a novel construction method is presented which combines maximum likelihood decoding with a state transition double detection and comparison method. And the designed circuit has the error-correcting capability of random 2 bit error. As the results of logic simulation, it is shown that the proposed Viterbi decoder exactly corrects 1 bit and 2 bit error signal.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.28 no.3B
• /
• pp.183-190
• /
• 2003

The explosion of the Internet has brought an acute need for efficient operation, which becomes to develop several technologies based on optical networks. By matching merging technology using wavelength multiplexing, an efficient administration with limited wavelength can provide scalability of network. The merging in optical layer has limitation of devices since the merging can not be performed in this layer. Hence the merging must be implemented in electronic layer. When the merging is implemented, the delay time would be increased in OXC (Optical Cross Connection), but the improvement of throughput rate will be expected in the process of explosive traffic due to reduction of optical channel supporting large bandwidth. In this thesis, we proposed an OXC of dual module having a merging function. We considered the optimum merging point with the largest in system performance and confirmed results using the simulation.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.33 no.2B
• /
• pp.59-68
• /
• 2008

In order to activate the digital broadcasting in Korea, the analog broadcasting will have been closed down until 2012. Recently IPTV(Internet Protocol TV) thorough internet has been regarded as the fourth media following the terrestrial, satellite, and cable for the digital broad casting. And it has been the important medium for the communication and broadcasting system. However IP is not easy to replace the entire broadcasting system with the digital - type broadcasting system. For the digital broadcasting, we should replace all TV sets, install the settop-boxes to receive the various IP media, solve problems about time delaying when changing channels, and support communication and broadcasting consolidation service for such as PVR and Network CCTV. IPMG is the digital converter that is able to solve these problems. In this paper, I'll develop and analyze IPMG converter's performance which sends and receives both the analogue and digital broadcasting signals through various media gives the Network PVR service.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.37C no.12
• /
• pp.1328-1336
• /
• 2012

Compared to terrestrial RF communications, underwater acoustic communications have several limitations such as limited bandwidth, high level of fading effects, and a large underwater propagation delay. In this paper, in order to tackle those limitations of underwater communications and to make it possible to form a large underwater monitoring systems, we propose a hierarchical underwater network architecture, which consists of underwater sensors, clusterheads, underwater/surface sink nodes, autonomous underwater vehicles (AUVs). In the proposed architecture, for the maximization of packet delivery ratio and the minimization of underwater sensor's energy consumption, a hybrid routing protocol is used. More specifically, cluster members use Tree based routing to transmit sensing data to clusterheads. AUVs on optimal trajectory movements collect the aggregated data from clusterhead and finally forward the data to the sink node. Also, in order to minimize the maximum travel distance of AUVs, an Integer Linear Programming based algorithm is employed. Performance analysis through simulations shows that the proposed architecture can achieve a higher data delivery ratio and lower energy consumption than existing routing schemes such as gradient based routing and geographical forwarding. Start after striking space key 2 times.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.37C no.10
• /
• pp.1004-1010
• /
• 2012

In this paper, we propose the algorithm which considers applying recently proposed clock synchronization techniques with quite high accuracy in a few wireless sensor networks researches to time synchronization algorithm for multi-static radar system and especially overcomes the limitation of previous theory, cannot be applied between nodes in non-line of sight (NLOS). Proposed scheme estimates clock skew and clock offset using recursive robust least M-estimator with information of time stamp observations. And we improve the performance of algorithm by tracking and suppressing the time delays difference caused by NLOS system. Futhermore, this paper derive the mean square error (MSE) to present the performance of the proposed estimator and comparative analysis with previous methods.

• KIPS Transactions on Computer and Communication Systems
• /
• v.1 no.3
• /
• pp.219-228
• /
• 2012

As the wireless Internet become more widely accessible, variety of Internet services can be used without limitation of location. However, existing mobility management methods such as MIP and PMIP of IETF requires the load of heavy protocol stack on the mobile nodes or the addition of components such as LMA and MAG. In this paper, we proposed the location management technique in the PMIPv6 and Fast Handover technique. according to the moving pattern of the node, the location management technique proposed in order to adjust the paging area dynamically. The Fast Handover technique applied MIH technology and it reduced the handover signal processing time between heterogeneous network. The location management cost in the environment which the node moves in order to evaluate this and handover delay time was calculate. The proposal technique was efficiently more evaluated than PMIPv6 with the smallest 29% and maximum 83%.

• The KIPS Transactions:PartD
• /
• v.14D no.7
• /
• pp.719-726
• /
• 2007

Recently, NAND flash memory has been used for a storage device in various mobile computing devices such as MP3 players, mobile phones and laptops because of its shock-resistant, low-power consumption, and none-volatile properties. However, due to the very distinct characteristics of flash memory, disk based systems and applications may result in severe performance degradation when directly adopting them on flash memory storage systems. Especially, when a B-tree is constructed, intensive overwrite operations may be caused by record inserting, deleting, and its reorganizing, This could result in severe performance degradation on NAND flash memory. In this paper, we propose an efficient buffer management scheme, called IBSF, which eliminates redundant index units in the index buffer and then delays the time that the index buffer is filled up. Consequently, IBSF significantly reduces the number of write operations to a flash memory when constructing a B-tree. We also show that IBSF yields a better performance on a flash memory by comparing it to the related technique called BFTL through various experiments.

• The Transactions of the Korea Information Processing Society
• /
• v.4 no.7
• /
• pp.1797-1803
• /
• 1997

Message handling function of the SS7(Signaling System N0.7) provides signaling traffic routing capabilities to transfer the signaling traffic to the destination nodes in the signaling network. This message handling function should be handled without any transfer delay for real time processing of large amount of signaling traffic for data communication service, and visual information service. In this paper, we suggest two routing algorithms working on the distributed message handling processors which were specially designed for message handling function. The one is an internal distributing algorithm for equal distribution of signaling traffic among the distributed message handling processors and the other is a distributing algorithm for distribution of signaling traffic in the multiple signaling routes. Both of algorithms are using signaling link selection codes labled in each signaling messages. It is shown that the suggested algorithms are very efficient for routing signaling traffic at the fault condition of signaling routes and the restoration of unavailable signaling routes.

• The KIPS Transactions:PartB
• /
• v.12B no.7 s.103
• /
• pp.775-782
• /
• 2005

In this paper, we propose multicast technique in order to reduce the required network bandwidth by n times, by merging the adjacent multicasts depending on the number of HENs (Head-End-Nodes) n that request the same video. Allowing new clients to immediately join an existing multicast through patching improves the efficiency of the multicast and offers services without any initial latency. A client might have to download data through two channels simultaneously, one for multicast and the other for patching. The more the frequency of requesting the video is, the higher the probability of caching it among HENs increases. Therefore, the requests for the cached video data can be served by HENs. Multicast from server is generated when the playback time exceeds the amount of cached video data. Since the interval of multicast can be dynamically expanded according to the popularity of videos, it can be reduced the server's workload and the network bandwidth. We perform simulations to compare its performance with that of conventional multicast. From simulation results, we confirm that the Proposed multicast technique offers substantially better performance.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.22 no.8
• /
• pp.1755-1764
• /
• 1997

In this paper, we proposed the mechanism for the buffer allocation and a cell scheduling method with logical separation a single buffer in the ATm switch, and analyzed the cell loss probability and the delay of each trafic (CBR/VBR/ABR) based on the weighted value and the dynamic cell service scheduling algorithm. The proposed switch buffering system classifies composite trafics incoming to the switch, according to the characteristic of traffic, then stores them in the logically separated buffers, and adopts the round-robin service with weighted value in order to transmit cells in buffers though one output port. We analyzed 4 cell service scheduling algorithms with dynamic round-robinfor each logically separated service line of a single buffer, in which buffers have the respective weighted values and 3 classes on mixed traffic which characteristized by traffic descriptor. In simulation, using SIMCRIPT II.5., we model the VBR and the ABR traffics as ON/OFF processes, and the CBR traffic as a Poisson processes. As the results of analysis according to the proposed buffer management mechanism and cell service algorithm, we have found that the required QoS of each VC can be quaranteed depends on a scale of weighted values allocated to buffers that changed the weighted values, and cell scheduling algorithm.