• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.29 no.6A
• /
• pp.683-689
• /
• 2004

The power and bandwidth efficient constant-envelope BPSK (CE-BPSK) modulation is proposed. The CE-BPSK signal is realized specifying the phase transition characteristics for the conventional low pass filtered BPSK signal. Since the CE-BPSK signal has constant envelope and modified waveform, the CE-BPSK signal has better power and bandwidth efficiency compared to the conventional BPSK signal while the CE-BPSK signal is backward compatible to the conventional BPSK signal. It is also shown that the bit error rate performance of the CE-BPSK signal is the same as that of the conventional BPSK signal.

• Proceedings of the Korean Society of Broadcast Engineers Conference
• /
• 2012.11a
• /
• pp.52-53
• /
• 2012

Belief propagation (BP) is a commonly used global energy minimization algorithm for solving stereo matching problem in 3D reconstruction. However, it requires large memory bandwidth and data size. In this paper, we propose a novel memory-efficient algorithm of BP in stereo matching on the Graphics Processing Units (GPU). The data size and transfer bandwidth are significantly reduced by storing only a part of the whole message. In order to maintain the accuracy of the matching result, the local messages are reconstructed using shared memory available in GPU. Experimental result shows that there is almost an order of reduction in the global memory consumption, and 21 to 46% saving in memory bandwidth when compared to the conventional algorithm. The implementation result on a recent GPU shows that we can obtain 22.8 times speedup in execution time compared to the execution on CPU.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.14 no.3
• /
• pp.240-248
• /
• 1989

In this paper, We analyse the Performance of Bandwidth efficient QORC modulation signal transmission through the presence of Additive White Gaussian noise. As a receiver, the QPSK receiver with Coherent demodultor is employed. The Sampling time for QORC Signal detection is [(2n-1)T, (2n+1)T] for decision of QORC Singla. It is abtained that the bandwidth of QORC is one half that of MSK, and QORC requires more power than QPSK by 1dB at a low error rate.

• The KIPS Transactions:PartC
• /
• v.18C no.2
• /
• pp.97-102
• /
• 2011

Since the game theory provides a theoretical ground to distribute a shared resource between demanding users in a fair and efficient manner, it has been used for the bandwidth allocation problem in a network. However, the bandwidth allocation schemes with different game theory assign different amount of bandwidth in the same operational environments. However, only the mathematical framework is adopted when a bandwidth allocation scheme is devised without quantitatively comparing the results when they applied to the bandwidth allocation problem. Thus, in this paper, we compare the characteristics of the bandwidth allocation schemes using the bankrupt game theory and the bargaining game theory when they applied to the situation where nodes are competing for the bandwidth in a network. Based on the numerical results, we suggest the future research direction.

• The Journal of the Acoustical Society of Korea
• /
• v.19 no.1
• /
• pp.89-96
• /
• 2000

ABR service is defined by ATM Forum and ITU for the efficient use of link bandwidth, and 2-pass service policing is proposed for this service. 2-pass service policing is effective by the real-time measurement of the used bandwidth, and this scheme obtains multiplexing gam and control efficiently ABR traffic as dynamically allocating rate by residual bandwidth information. In this study, we propose the real-time bandwidth prediction scheme for ABR traffic control, as using dynamic rate allocation by available bandwidth information. This study can obtain the simple hardware structure by means of as predicting available bandwidth by the total link bandwidth and the sum of transmission rate on the backlogged state connections.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.13 no.1
• /
• pp.291-304
• /
• 2019

This paper proposes a dynamic-tiling-based bandwidth-efficient (DTBE) virtual reality (VR) streaming scheme. We consider 360-degree VR contents with multiple view points such as the front, back, upper, and bottom sides. At a given time, the focus of a client is always bound to a certain view among multiple view points. By utilizing this perspective, under our proposed scheme, tiles with high encoding rates are selectively assigned to the focused view where multiple view points consist of multiple tiles with different encoding rates. The other tiles with low encoding rates are assigned to the remaining view points. Furthermore, for reducing view adaptation delay, we design a novel rapid view adaptation mechanism that selectively delivers an I-frame during view point updates by using frame indexing. We implement the proposed scheme on a commercial VR test bed where we adopt the MPEG media transport (MMT) standard with high-efficiency video coding (HEVC) tile modes. The measurement-based experiments show that the proposed scheme achieves an average data usage reduction of almost 65.2% as well as average view adaptation delay reduction of almost 57.7%.

• The KIPS Transactions:PartC
• /
• v.11C no.4
• /
• pp.555-562
• /
• 2004

We consider differentiated bandwidth allocation for a piconet in short-range wireless personal network systems : Bluetooth. Since bandwidth requirements nay vary among applications/services, and/or it may change over time, it is important to decide how to allocate limited resources to various service classes to meet their service requirements. We propose a simple and efficient bandwidth allocation mechanism which meets bandwidth requirements of various service types while saving power consumption by a Power saying mode, i.e., sniff node. We compare our proposed mechanism with a conventional (weighted) round-robin polling scheme and show that it achieves significant improvement of hroughput, delay, and power consumption.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.9 no.5
• /
• pp.15-21
• /
• 2009

An Ethernet passive optical network (EPON) is an economical and efficient access network that received significant research attention in recent year. A MAC protocol of the PON, the next generation access network, is based primarily on TDMA (Time Division Multiple Access). In this paper, we addressed the problems of a dynamic bandwidth allocation (DBA) in Fairness and QoS Performance. We augmented the advanced bandwidth allocation algorithms to support efficient resource utilization by reducing the unused remaining bandwidth made by idle state ONUs. Our new proposed advanced bandwidth allocation algorithm can allocate effectively and fairly the bandwidths between end-users.

• Journal of Broadcast Engineering
• /
• v.22 no.2
• /
• pp.257-260
• /
• 2017

In this letter, we propose an efficient automatic modulation recognition (AMR) method which classifies digitally modulated signals by estimating the bandwidth. In AMR, feature-based methods are widely used and the accuracy of the features is highly dependent on the number of symbols and the number of samples per symbol (NSPS). In this letter, at first, we coarsely estimate the bandwidth of the oversampled signals, and then decrease the sample rate to yield adequate NSPS. As a result, more symbols are used for AMR and the correct classification rate becomes high under the same number of samples.

• Journal of Communications and Networks
• /
• v.15 no.1
• /
• pp.15-24
• /
• 2013

Provisioning of quality of service (QoS) is a key issue in any multi-media system. However, in wireless systems, supporting QoS requirements of different traffic types is a more challenging problem due to the need to simultaneously minimize two performance metrics - the probability of dropping a handover call and the probability of blocking a new call. Since QoS requirements are not as stringent for non-real-time traffic, as opposed to real-time traffic, more calls can be accommodated by releasing some bandwidth from the already admitted non-real-time traffic calls. If the released bandwidth that is used to handle handover calls is larger than the released bandwidth that is used for new calls, then the resulting probability of dropping a handover call is smaller than the probability of blocking a new call. In this paper, we propose an efficient call admission control algorithm that relies on adaptive multi-level bandwidth-allocation scheme for non-realtime calls. The scheme allows reduction of the call dropping probability, along with an increase in the bandwidth utilization. The numerical results show that the proposed scheme is capable of attaining negligible handover call dropping probability without sacrificing bandwidth utilization.