Hiroyasu OBATA Ryo HAMAMOTO Chisa TAKANO Kenji ISHIDA
Wireless local area networks (LANs) based on the IEEE802.11 standard usually use carrier sense multiple access with collision avoidance (CSMA/CA) for media access control. However, in CSMA/CA, if the number of wireless terminals increases, the back-off time derived by the initial contention window (CW) tends to conflict among wireless terminals. Consequently, a data frame collision often occurs, which sometimes causes the degradation of the total throughput in the transport layer protocols. In this study, to improve the total throughput, we propose a new media access control method, SP-MAC, which is based on the synchronization phenomena of coupled oscillators. Moreover, this study shows that SP-MAC drastically decreases the data frame collision probability and improves the total throughput when compared with the original CSMA/CA method.
Wiparat BUSYATRAS Chanon WARISARN Lin M. M. MYINT Piya KOVINTAVEWAT
Track mis-registration (TMR) is one of the major problems in high-density magnetic recording systems such as bit-patterned media recording (BPMR). In general, TMR results from the misalignment between the center of the read head and that of the main track, which can deteriorate the system performance. Although TMR can be handled by a servo system, this paper proposes a novel method to alleviate the TMR effect, based on the readback signal. Specifically, the readback signal is directly used to estimate a TMR level and is then further processed by the suitable target and equalizer designed for such a TMR level. Simulation results indicate that the proposed method can sufficiently estimate the TMR level and then helps improve the system performance if compared to the conventional receiver that does not employ a TMR mitigation method, especially when an areal density is high and/or a TMR level is large.
Takashi IMAGAWA Masayuki HIROMOTO Hiroyuki OCHI Takashi SATO
Time redundancy is sometimes an only option for enhancing circuit reliability when the circuit area is severely restricted. In this paper, a time-redundant error-correction scheme, which is particularly suitable for coarse-grained reconfigurable arrays (CGRAs), is proposed. It judges the correctness of the executions by comparing the results of two identical runs. Once a mismatch is found, the second run is terminated immediately to start the third run, under the assumption that the errors tend to persist in many applications, for selecting the correct result in the three runs. The circuit area and reliability of the proposed method is compared with a straightforward implementation of time-redundancy and a selective triple modular redundancy (TMR). A case study on a CGRA revealed that the area of the proposed method is 1% larger than that of the implementation for the selective TMR. The study also shows the proposed scheme is up to 2.6x more reliable than the full-TMR when the persistent error is predominant.
Chanon WARISARN Autthasith ARRAYANGKOOL Piya KOVINTAVEWAT
In bit-patterned media recording (BPMR), the readback signal is severely corrupted by the inter-symbol interference (ISI) and inter-track interference (ITI), especially at high recording densities, due to small bit and track pitches. One way to alleviate the ITI effect is to encode an input data sequence before recording, so as to avoid some data patterns that easily cause an error at the data detection process. This paper proposes an ITI-mitigating 5/6 modulation code for a multi-track multi-head BPMR system to eliminate the data patterns that lead to severe ITI. Specifically, each of the 5 user bits is converted into a 6-bit codeword in the form of a 3-by-2 data array, based on a look-up table. Experimental results indicate that the system with the proposed coding scheme outperforms that without coding, especially when an areal density is high and/or the position jitter is large.
In this letter, we propose a simple framework for accelerating a state-of-the-art histogram-based weighted median filter at no expense. It is based on a process of determining the filter processing direction. The determination is achieved by measuring the local feature variation of input images. Through experiments with natural images, it is verified that, depending on input images, the filtering speed can be substantially increased by changing the filtering direction.
Dang Ngoc Hai NGUYEN NamUk KIM Yung-Lyul LEE
A new technology for video frame rate up-conversion (FRUC) is presented by combining a median filter and motion estimation (ME) with an occlusion detection (OD) method. First, ME is performed to obtain a motion vector. Then, the OD method is used to refine the MV in the occlusion region. When occlusion occurs, median filtering is applied. Otherwise, bidirectional motion compensated interpolation (BDMC) is applied to create the interpolated frames. The experimental results show that the proposed algorithm provides better performance than the conventional approach. The average gain in the PSNR (Peak Signal to Noise Ratio) is always better than the other methods in the Full HD test sequences.
Cognitive radio has been developed recently as a promising solution to tackle the spectrum related issues such as spectrum scarcity and spectrum underutilization. Cognitive spectrum assignment is necessary for allocating spectrum bands to secondary users in order to avoid conflicts among secondary users and maximize the total network performance under a given set of conditions. In most spectrum assignment schemes, throughput is considered as the main criterion for spectrum selection or spectrum assignment. In this paper, we propose a distortion-aware channel allocation scheme for multiple secondary users who compete for primary channels to transmit multimedia data. In the proposed scheme, idle spectrum bands are assigned to the multimedia secondary users that attain the highest video distortion reduction. The scheme is expected to mitigate the selfish behaviors of users in competing channels. The performance effectiveness of our proposed channel allocation scheme is demonstrated through simulation by comparing with a benchmark of two reference spectrum assignment schemes.
Ye GAO Masayuki SATO Ryusuke EGAWA Hiroyuki TAKIZAWA Hiroaki KOBAYASHI
Vector processors have significant advantages for next generation multimedia applications (MMAs). One of the advantages is that vector processors can achieve high data transfer performance by using a high bandwidth memory sub-system, resulting in a high sustained computing performance. However, the high bandwidth memory sub-system usually leads to enormous costs in terms of chip area, power and energy consumption. These costs are too expensive for commodity computer systems, which are the main execution platform of MMAs. This paper proposes a new multi-banked cache memory for commodity computer systems called MVP-cache in order to expand the potential of vector architectures on MMAs. Unlike conventional multi-banked cache memories, which employ one tag array and one data array in a sub-cache, MVP-cache associates one tag array with multiple independent data arrays of small-sized cache lines. In this way, MVP-cache realizes less static power consumption on its tag arrays. MVP-cache can also achieve high efficiency on short vector data transfers because the flexibility of data transfers can be improved by independently controlling the data transfers of each data array.
Junyang QIU Yibing WANG Zhisong PAN Bo JIA
Independent and identically distributed (i.i.d) assumptions are commonly used in the machine learning community. However, social media data violate this assumption due to the linkages. Meanwhile, with the variety of data, there exist many samples, i.e., Universum, that do not belong to either class of interest. These characteristics pose great challenges to dealing with social media data. In this letter, we fully take advantage of Universum samples to enable the model to be more discriminative. In addition, the linkages are also taken into consideration in the means of social dimensions. To this end, we propose the algorithm Semi-Supervised Linked samples Feature Selection with Universum (U-SSLFS) to integrate the linking information and Universum simultaneously to select robust features. The empirical study shows that U-SSLFS outperforms state-of-the-art algorithms on the Flickr and BlogCatalog.
This letter proposes an efficient Two-stage Resource scheduling algorithm for cloud based Live Media Streaming system (TRLMS). It transforms the cloud-based resource scheduling problem to a min-cost flow problem in a graph, and solves it by an improved Successive Short Path (SSP) algorithm. Simulation results show that TRLMS can enhance user demand satisfaction by 17.1% than mean-based method, and its time complexity is much lower than original SSP algorithm.
A number of studies have been conducted on topic modeling for various types of data, including text and image data. We focus particularly on the burstiness of the local features in modeling topics within video data in this paper. Burstiness is a phenomenon that is often discussed for text data. The idea is that if a word is used once in a document, it is more likely to be used again within the document. It is also observed in video data; for example, an object or visual word in video data is more likely to appear repeatedly within the same video data. Based on the idea mentioned above, we propose a new topic model, the Correspondence Dirichlet Compound Multinomial LDA (Corr-DCMLDA), which takes into account the burstiness of the local features in video data. The unknown parameters and latent variables in the model are estimated by conducting a collapsed Gibbs sampling and the hyperparameters are estimated by focusing on the fixed-point iterations. We demonstrate through experimentation on the genre classification of social video data that our model works more effectively than several baselines.
Taekook KIM Chunying LI Taihyong YIM Youngjun KIM Myeongyu KIM Jinwoo PARK
This study proposes an integrated technology based on Proxy Mobile IPv6, which is a network-based protocol with mobility support, and a mobile content delivery network (CDN) that provides efficient content delivery management. The proposed architecture offers several benefits, such as the conservation of network resources because of reduced total traffic between hops and a reduced hop count.
Ryosuke OZAKI Naoya SUGIZAKI Tsuneki YAMASAKI
In this paper, we propose a method for deciding the parameters to satisfy the experiment values, and also checked the effectiveness of this method based on Kramers-Kronig (K.K.) relation. In our proposed method, we are expressed as matrix the Sellmeier's formula, and are solved the simulatenaous equation until the satisfied the experiment value. Numerical results are given for the influence of pulse responses using the medium constants which can be found by proposed method. Also, numerical technique of pulse responses is employed the fast inversion of Laplace transform (FILT).
Yasuhiro TAKEI Hasitha Muthumala WAIDYASOORIYA Masanori HARIYAMA Michitaka KAMEYAMA
Heterogeneous multi-core architectures with CPUs and accelerators attract many attentions since they can achieve power-efficient computing in various areas from low-power embedded processing to high-performance computing. Since the optimal architecture is different from application to application, finding the most suitable accelerator is very important. In this paper, we propose an FPGA-based heterogeneous multi-core platform with custom accelerators for power-efficient computing. Using the proposed platform, we evaluate several applications and accelerators to identify many key requirements of the applications and properties of the accelerators. Such an evaluation is very important to select and optimize the most suitable accelerator according to the requirements of an application to achieve the best performance.
The objective of this research is to design a high-performance NAND flash memory system with a data buffer. The proposed buffer system in the NAND flash memory consists of two parts, i.e., a fully associative temporal buffer for temporal locality and a fully associative spatial buffer for spatial locality. We propose a new operating mechanism for reducing overhead of flash memory, that is, erase and write operations. According to our simulation results, the proposed buffer system can reduce the write and erase operations by about 73% and 79% for spec application respectively, compared with a fully associative buffer with two times more space. Futhermore, the average memory access time can improve by about 60% compared with other large buffer systems.
Deposition of inclined anisotropy film for bit-patterned media was studied using an oblique incidence collimated sputtering. Pt underlayer increased the inclination angle of magnetic layer more than 5° on a Ta seed layer. Further increase of the angle was obtained by annealing Pt/Ru underlayer resulting an inclination angle of 9.4° for a Co-Cr15.5 film on the underlayer. The magnetic properties of the Co-Cr15.5 film with an inclined orientation was estimated comparing measured hysteresis loops with simulated ones, which indicated to have inclined magnetic anisotropy with an anisotropy field of about 4.5kOe and a deflection angle of the anisotropy about the same as that of the crystalline orientation.
Shohei SATO Yoshiaki YAMAGUCHI Ryuji SUGITA
The uniform magnetic field of various strength was applied to the perpendicularly and in-plane demagnetized media, and the change in each magnetic cluster state was investigated as the fundamental investigation of the influence of demagnetization method on noise during signal recording on the stacked perpendicular recording media. The results showed that the in-plane demagnetization can achieve lower noise level if the recording field is not very high. In other words, the in-plane demagnetization is an effective way to achieve lower noise in transition area, near track edge of recorded bit, and in high-density bit. In addition, the simulation clarified that this noise reduction can be explained using the idea of sub-domain structure in the in-plane demagnetized media.
Autthasith ARRAYANGKOOL Chanon WARISARN Piya KOVINTAVEWAT
To achieve high recording density in a bit-patterned media recording system, the spacing between data bit islands in both the along-track and the across-track directions must be decreased, thus leading to the increase of two-dimensional (2D) interference. One way to reduce the 2D interference is to apply a 2D coding scheme on a data sequence before recording; however, this method usually requires many redundant bits, thus lowering a code rate. Therefore, we propose a novel 2D coding scheme referred to as a recorded-bit patterning (RBP) scheme to mitigate the 2D interference, which requires no redundant bits at the expense of using more buffer memory. Specifically, an input data sequence is first split into three tracks in which will then be rotated to find the best 3-track data pattern based on a look-up table before recording, such that the shifted data tracks yield the least effect of 2D interference in the readback signal. Numerical results indicate that the proposed RBP scheme provides a significant performance improvement if compared to a conventional system (without 2D coding), especially when the recording density is high and/or the position jitter noise is large.
Inwoong LEE Jincheol PARK Seonghyun KIM Taegeun OH Sanghoon LEE
We seek a resource allocation algorithm through carrier allocation and modulation mode selection for improving the quality of service (QoS) that can adapt to various screen sizes and dynamic channel variations. In terms of visual quality, the expected visual entropy (EVE) is defined to quantify the visual information of being contained in each layer of the scalable video coding (SVC). Fairness optimization is conducted to maximize the EVE using an objective function for given constraints of radio resources. To conduct the fairness optimization, we propose a novel approximation algorithm for resource allocation for the maximal EVE. Simulations confirm that the QoS in terms of the EVE or peak signal to noise ratio (PSNR) is significantly improved by using the novel algorithm.
Yoshikazu MIYANAGA Wataru TAKAHASHI Shingo YOSHIZAWA
This paper introduces our developed noise robust speech communication techniques and describes its implementation to a smart info-media system, i.e., a small robot. Our designed speech communication system consists of automatic speech detection, recognition, and rejection. By using automatic speech detection and recognition, an observed speech waveform can be recognized without a manual trigger. In addition, using speech rejection, this system only accepts registered speech phrases and rejects any other words. In other words, although an arbitrary input speech waveform can be fed into this system and recognized, the system responds only to the registered speech phrases. The developed noise robust speech processing can reduce various noises in many environments. In addition to the design of noise robust speech recognition, the LSI design of this system has been introduced. By using the design of speech recognition application specific IC (ASIC), we can simultaneously realize low power consumption and real-time processing. This paper describes the LSI architecture of this system and its performances in some field experiments. In terms of current speech recognition accuracy, the system can realize 85-99% under 0-20dB SNR and echo environments.