<?xml version="1.0" encoding="ISO-8859-1"?>

<rdf:RDF
 xmlns:rdf="http://www.w3.org/1999/02/22-rdf-syntax-ns#"
 xmlns="http://purl.org/rss/1.0/"
 xmlns:taxo="http://purl.org/rss/1.0/modules/taxonomy/"
 xmlns:dc="http://purl.org/dc/elements/1.1/"
 xmlns:syn="http://purl.org/rss/1.0/modules/syndication/"
 xmlns:prism="http://purl.org/rss/1.0/modules/prism/"
 xmlns:admin="http://webns.net/mvcb/"
>

<channel rdf:about="http://ietfec.oxfordjournals.org">
<title>IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences - recent issues</title>
<link>http://ietfec.oxfordjournals.org</link>
<description>IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences - RSS feed of recent issues (covers the latest 3 issues, including the current issue) </description>
<prism:eIssn>1745-1337</prism:eIssn>
<prism:publicationName>IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences</prism:publicationName>
<prism:issn>0916-8508</prism:issn>
<items>
 <rdf:Seq>
  <rdf:li rdf:resource="http://ietfec.oxfordjournals.org/cgi/content/short/E91-A/6/1301?rss=1" />
  <rdf:li rdf:resource="http://ietfec.oxfordjournals.org/cgi/content/short/E91-A/6/1303?rss=1" />
  <rdf:li rdf:resource="http://ietfec.oxfordjournals.org/cgi/content/short/E91-A/6/1310?rss=1" />
  <rdf:li rdf:resource="http://ietfec.oxfordjournals.org/cgi/content/short/E91-A/6/1320?rss=1" />
  <rdf:li rdf:resource="http://ietfec.oxfordjournals.org/cgi/content/short/E91-A/6/1329?rss=1" />
  <rdf:li rdf:resource="http://ietfec.oxfordjournals.org/cgi/content/short/E91-A/6/1337?rss=1" />
  <rdf:li rdf:resource="http://ietfec.oxfordjournals.org/cgi/content/short/E91-A/6/1347?rss=1" />
  <rdf:li rdf:resource="http://ietfec.oxfordjournals.org/cgi/content/short/E91-A/6/1357?rss=1" />
  <rdf:li rdf:resource="http://ietfec.oxfordjournals.org/cgi/content/short/E91-A/6/1362?rss=1" />
  <rdf:li rdf:resource="http://ietfec.oxfordjournals.org/cgi/content/short/E91-A/6/1367?rss=1" />
  <rdf:li rdf:resource="http://ietfec.oxfordjournals.org/cgi/content/short/E91-A/6/1369?rss=1" />
  <rdf:li rdf:resource="http://ietfec.oxfordjournals.org/cgi/content/short/E91-A/6/1383?rss=1" />
  <rdf:li rdf:resource="http://ietfec.oxfordjournals.org/cgi/content/short/E91-A/6/1392?rss=1" />
  <rdf:li rdf:resource="http://ietfec.oxfordjournals.org/cgi/content/short/E91-A/6/1400?rss=1" />
  <rdf:li rdf:resource="http://ietfec.oxfordjournals.org/cgi/content/short/E91-A/6/1408?rss=1" />
  <rdf:li rdf:resource="http://ietfec.oxfordjournals.org/cgi/content/short/E91-A/6/1416?rss=1" />
  <rdf:li rdf:resource="http://ietfec.oxfordjournals.org/cgi/content/short/E91-A/6/1426?rss=1" />
  <rdf:li rdf:resource="http://ietfec.oxfordjournals.org/cgi/content/short/E91-A/6/1438?rss=1" />
  <rdf:li rdf:resource="http://ietfec.oxfordjournals.org/cgi/content/short/E91-A/6/1443?rss=1" />
  <rdf:li rdf:resource="http://ietfec.oxfordjournals.org/cgi/content/short/E91-A/6/1446?rss=1" />
  <rdf:li rdf:resource="http://ietfec.oxfordjournals.org/cgi/content/short/E91-A/6/1455?rss=1" />
  <rdf:li rdf:resource="http://ietfec.oxfordjournals.org/cgi/content/short/E91-A/6/1463?rss=1" />
  <rdf:li rdf:resource="http://ietfec.oxfordjournals.org/cgi/content/short/E91-A/6/1470?rss=1" />
  <rdf:li rdf:resource="http://ietfec.oxfordjournals.org/cgi/content/short/E91-A/6/1478?rss=1" />
  <rdf:li rdf:resource="http://ietfec.oxfordjournals.org/cgi/content/short/E91-A/6/1488?rss=1" />
  <rdf:li rdf:resource="http://ietfec.oxfordjournals.org/cgi/content/short/E91-A/6/1502?rss=1" />
  <rdf:li rdf:resource="http://ietfec.oxfordjournals.org/cgi/content/short/E91-A/6/1509?rss=1" />
  <rdf:li rdf:resource="http://ietfec.oxfordjournals.org/cgi/content/short/E91-A/6/1516?rss=1" />
  <rdf:li rdf:resource="http://ietfec.oxfordjournals.org/cgi/content/short/E91-A/6/1529?rss=1" />
  <rdf:li rdf:resource="http://ietfec.oxfordjournals.org/cgi/content/short/E91-A/6/1533?rss=1" />
  <rdf:li rdf:resource="http://ietfec.oxfordjournals.org/cgi/content/short/E91-A/6/1537?rss=1" />
  <rdf:li rdf:resource="http://ietfec.oxfordjournals.org/cgi/content/short/E91-A/6/1541?rss=1" />
  <rdf:li rdf:resource="http://ietfec.oxfordjournals.org/cgi/content/short/E91-A/5/1241?rss=1" />
  <rdf:li rdf:resource="http://ietfec.oxfordjournals.org/cgi/content/short/E91-A/5/1253?rss=1" />
  <rdf:li rdf:resource="http://ietfec.oxfordjournals.org/cgi/content/short/E91-A/5/1265?rss=1" />
  <rdf:li rdf:resource="http://ietfec.oxfordjournals.org/cgi/content/short/E91-A/5/1268?rss=1" />
  <rdf:li rdf:resource="http://ietfec.oxfordjournals.org/cgi/content/short/E91-A/5/1274?rss=1" />
  <rdf:li rdf:resource="http://ietfec.oxfordjournals.org/cgi/content/short/E91-A/5/1278?rss=1" />
  <rdf:li rdf:resource="http://ietfec.oxfordjournals.org/cgi/content/short/E91-A/5/1283?rss=1" />
  <rdf:li rdf:resource="http://ietfec.oxfordjournals.org/cgi/content/short/E91-A/5/1288?rss=1" />
  <rdf:li rdf:resource="http://ietfec.oxfordjournals.org/cgi/content/short/E91-A/5/1293?rss=1" />
  <rdf:li rdf:resource="http://ietfec.oxfordjournals.org/cgi/content/short/E91-A/5/1296?rss=1" />
  <rdf:li rdf:resource="http://ietfec.oxfordjournals.org/cgi/content/short/E91-A/4/925?rss=1" />
  <rdf:li rdf:resource="http://ietfec.oxfordjournals.org/cgi/content/short/E91-A/4/927?rss=1" />
  <rdf:li rdf:resource="http://ietfec.oxfordjournals.org/cgi/content/short/E91-A/4/935?rss=1" />
  <rdf:li rdf:resource="http://ietfec.oxfordjournals.org/cgi/content/short/E91-A/4/943?rss=1" />
  <rdf:li rdf:resource="http://ietfec.oxfordjournals.org/cgi/content/short/E91-A/4/951?rss=1" />
  <rdf:li rdf:resource="http://ietfec.oxfordjournals.org/cgi/content/short/E91-A/4/957?rss=1" />
  <rdf:li rdf:resource="http://ietfec.oxfordjournals.org/cgi/content/short/E91-A/4/965?rss=1" />
  <rdf:li rdf:resource="http://ietfec.oxfordjournals.org/cgi/content/short/E91-A/4/971?rss=1" />
  <rdf:li rdf:resource="http://ietfec.oxfordjournals.org/cgi/content/short/E91-A/4/978?rss=1" />
  <rdf:li rdf:resource="http://ietfec.oxfordjournals.org/cgi/content/short/E91-A/4/987?rss=1" />
  <rdf:li rdf:resource="http://ietfec.oxfordjournals.org/cgi/content/short/E91-A/4/998?rss=1" />
  <rdf:li rdf:resource="http://ietfec.oxfordjournals.org/cgi/content/short/E91-A/4/1006?rss=1" />
  <rdf:li rdf:resource="http://ietfec.oxfordjournals.org/cgi/content/short/E91-A/4/1015?rss=1" />
  <rdf:li rdf:resource="http://ietfec.oxfordjournals.org/cgi/content/short/E91-A/4/1023?rss=1" />
  <rdf:li rdf:resource="http://ietfec.oxfordjournals.org/cgi/content/short/E91-A/4/1031?rss=1" />
  <rdf:li rdf:resource="http://ietfec.oxfordjournals.org/cgi/content/short/E91-A/4/1038?rss=1" />
  <rdf:li rdf:resource="http://ietfec.oxfordjournals.org/cgi/content/short/E91-A/4/1044?rss=1" />
  <rdf:li rdf:resource="http://ietfec.oxfordjournals.org/cgi/content/short/E91-A/4/1054?rss=1" />
  <rdf:li rdf:resource="http://ietfec.oxfordjournals.org/cgi/content/short/E91-A/4/1062?rss=1" />
  <rdf:li rdf:resource="http://ietfec.oxfordjournals.org/cgi/content/short/E91-A/4/1071?rss=1" />
  <rdf:li rdf:resource="http://ietfec.oxfordjournals.org/cgi/content/short/E91-A/4/1077?rss=1" />
  <rdf:li rdf:resource="http://ietfec.oxfordjournals.org/cgi/content/short/E91-A/4/1084?rss=1" />
  <rdf:li rdf:resource="http://ietfec.oxfordjournals.org/cgi/content/short/E91-A/4/1092?rss=1" />
  <rdf:li rdf:resource="http://ietfec.oxfordjournals.org/cgi/content/short/E91-A/4/1101?rss=1" />
  <rdf:li rdf:resource="http://ietfec.oxfordjournals.org/cgi/content/short/E91-A/4/1112?rss=1" />
  <rdf:li rdf:resource="http://ietfec.oxfordjournals.org/cgi/content/short/E91-A/4/1121?rss=1" />
  <rdf:li rdf:resource="http://ietfec.oxfordjournals.org/cgi/content/short/E91-A/4/1129?rss=1" />
  <rdf:li rdf:resource="http://ietfec.oxfordjournals.org/cgi/content/short/E91-A/4/1140?rss=1" />
  <rdf:li rdf:resource="http://ietfec.oxfordjournals.org/cgi/content/short/E91-A/4/1150?rss=1" />
  <rdf:li rdf:resource="http://ietfec.oxfordjournals.org/cgi/content/short/E91-A/4/1155?rss=1" />
  <rdf:li rdf:resource="http://ietfec.oxfordjournals.org/cgi/content/short/E91-A/4/1162?rss=1" />
  <rdf:li rdf:resource="http://ietfec.oxfordjournals.org/cgi/content/short/E91-A/4/1169?rss=1" />
  <rdf:li rdf:resource="http://ietfec.oxfordjournals.org/cgi/content/short/E91-A/4/1177?rss=1" />
  <rdf:li rdf:resource="http://ietfec.oxfordjournals.org/cgi/content/short/E91-A/4/1185?rss=1" />
  <rdf:li rdf:resource="http://ietfec.oxfordjournals.org/cgi/content/short/E91-A/4/1197?rss=1" />
  <rdf:li rdf:resource="http://ietfec.oxfordjournals.org/cgi/content/short/E91-A/4/1206?rss=1" />
  <rdf:li rdf:resource="http://ietfec.oxfordjournals.org/cgi/content/short/E91-A/4/1212?rss=1" />
  <rdf:li rdf:resource="http://ietfec.oxfordjournals.org/cgi/content/short/E91-A/4/1218?rss=1" />
  <rdf:li rdf:resource="http://ietfec.oxfordjournals.org/cgi/content/short/E91-A/4/1222?rss=1" />
  <rdf:li rdf:resource="http://ietfec.oxfordjournals.org/cgi/content/short/E91-A/4/1226?rss=1" />
  <rdf:li rdf:resource="http://ietfec.oxfordjournals.org/cgi/content/short/E91-A/4/1229?rss=1" />
  <rdf:li rdf:resource="http://ietfec.oxfordjournals.org/cgi/content/short/E91-A/4/1233?rss=1" />
 </rdf:Seq>
</items>
</channel>

<item rdf:about="http://ietfec.oxfordjournals.org/cgi/content/short/E91-A/6/1301?rss=1">
<title><![CDATA[Special Section on Acoustic Scene Analysis and Reproduction]]></title>
<link>http://ietfec.oxfordjournals.org/cgi/content/short/E91-A/6/1301?rss=1</link>
<description><![CDATA[]]></description>
<dc:creator><![CDATA[Makino, S.]]></dc:creator>
<dc:date>2008-06-16</dc:date>
<dc:identifier>info:doi/10.1093/ietfec/e91-a.6.1301</dc:identifier>
<dc:title><![CDATA[Special Section on Acoustic Scene Analysis and Reproduction]]></dc:title>
<dc:publisher>The Institute of Electronics, Information and Communication Engineers</dc:publisher>
<prism:number>6</prism:number>
<prism:volume>E91-A</prism:volume>
<prism:endingPage>1302</prism:endingPage>
<prism:publicationDate>2008-06-01</prism:publicationDate>
<prism:startingPage>1301</prism:startingPage>
<prism:section>Special Section on Acoustic Scene Analysis and Reproduction</prism:section>
</item>

<item rdf:about="http://ietfec.oxfordjournals.org/cgi/content/short/E91-A/6/1303?rss=1">
<title><![CDATA[Calculating Inverse Filters for Speech Dereverberation]]></title>
<link>http://ietfec.oxfordjournals.org/cgi/content/short/E91-A/6/1303?rss=1</link>
<description><![CDATA[<p>Speech dereverberation is one of the most difficult tasks in acoustic signal processing. Of the various problems involved in this task, this paper highlights "over-whitening," which flattens the characteristics of recovered speech. This distortion sometimes happens when inverse filters are directly calculated from microphone signals. This paper reviews two studies related to this problem. The first study shows the possibility of compensating for such over-whitening to achieve precise speech-dereverberation. The second study presents a new approach for approximating the original speech by removing the effect of late reflections from observed reverberant speech.</p>]]></description>
<dc:creator><![CDATA[MIYOSHI, M., DELCROIX, M., KINOSHITA, K.]]></dc:creator>
<dc:date>2008-06-16</dc:date>
<dc:identifier>info:doi/10.1093/ietfec/e91-a.6.1303</dc:identifier>
<dc:title><![CDATA[Calculating Inverse Filters for Speech Dereverberation]]></dc:title>
<dc:publisher>The Institute of Electronics, Information and Communication Engineers</dc:publisher>
<prism:number>6</prism:number>
<prism:volume>E91-A</prism:volume>
<prism:endingPage>1309</prism:endingPage>
<prism:publicationDate>2008-06-01</prism:publicationDate>
<prism:startingPage>1303</prism:startingPage>
<prism:section>Special Section on Acoustic Scene Analysis and Reproduction - Papers</prism:section>
</item>

<item rdf:about="http://ietfec.oxfordjournals.org/cgi/content/short/E91-A/6/1310?rss=1">
<title><![CDATA[Localization Model of Synthesized Sound Image Using Precedence Effect in Sound Field Reproduction Based on Wave Field Synthesis]]></title>
<link>http://ietfec.oxfordjournals.org/cgi/content/short/E91-A/6/1310?rss=1</link>
<description><![CDATA[<p>Although it is very important to conduct listening tests when constructing a practical sound field reproduction system based on wave field synthesis, listening tests are very expensive. A localization model of synthesized sound images that predicts the results of listening tests is proposed. This model reduces the costs of constructing a reproduction system because it makes it possible to omit the listening tests. The proposed model uses the precedence effect and predicts the direction of synthesized sound images based on the inter-aural time difference. A comparison of the results predicted by the proposed model and the localized results of listening tests shows that the model accurately predicts the localized results.</p>]]></description>
<dc:creator><![CDATA[KIMURA, T., YAMAKATA, Y., KATSUMOTO, M., KAKEHI, K.]]></dc:creator>
<dc:date>2008-06-16</dc:date>
<dc:identifier>info:doi/10.1093/ietfec/e91-a.6.1310</dc:identifier>
<dc:title><![CDATA[Localization Model of Synthesized Sound Image Using Precedence Effect in Sound Field Reproduction Based on Wave Field Synthesis]]></dc:title>
<dc:publisher>The Institute of Electronics, Information and Communication Engineers</dc:publisher>
<prism:number>6</prism:number>
<prism:volume>E91-A</prism:volume>
<prism:endingPage>1319</prism:endingPage>
<prism:publicationDate>2008-06-01</prism:publicationDate>
<prism:startingPage>1310</prism:startingPage>
<prism:section>Special Section on Acoustic Scene Analysis and Reproduction - Papers</prism:section>
</item>

<item rdf:about="http://ietfec.oxfordjournals.org/cgi/content/short/E91-A/6/1320?rss=1">
<title><![CDATA[Auditory Artifacts due to Switching Head-Related Transfer Functions of a Dynamic Virtual Auditory Display]]></title>
<link>http://ietfec.oxfordjournals.org/cgi/content/short/E91-A/6/1320?rss=1</link>
<description><![CDATA[<p>Auditory artifacts due to switching head-related transfer functions (HRTFs) are investigated, using a software-implemented dynamic virtual auditory display (DVAD) developed by the authors. The DVAD responds to a listener's head rotation using a head-tracking device and switching HRTFs to present a highly realistic 3D virtual auditory space to the listener. The DVAD operates on Windows XP and does not require high-performance computers. A total system latency (TSL), which is the delay between head motion and the corresponding change of the ear input signal, is a significant factor of DVADs. The measured TSL of our DVAD is about 50 ms, which is sufficient for practical applications and localization experiments. Another matter of concern is the auditory artifact in DVADs caused by switching HRTFs. Switching HRTFs gives rise to wave discontinuity of synthesized binaural signals, which can be perceived as click noises that degrade the quality of presented sound image. A subjective test and excitation patterns (EPNs) analysis using an auditory filter are performed with various source signals and HRTF spatial resolutions. The results of the subjective test reveal that click noise perception depends on the source signal and the HRTF spatial resolution. Furthermore, EPN analysis reveals that switching HRTFs significantly distorts the EPNs at the off signal frequencies. Such distortions, however, are masked perceptually by broad-bandwidth source signals, whereas they are not masked by narrow-bandwidth source signals, thereby making the click noise more detectable. A higher HRTF spatial resolution leads to smaller distortions. But, depending on the source signal, perceivable click noises still remain even with 0.5-degree spatial resolution, which is less than minimum audible angle (1 degree in front).</p>]]></description>
<dc:creator><![CDATA[OTANI, M., HIRAHARA, T.]]></dc:creator>
<dc:date>2008-06-16</dc:date>
<dc:identifier>info:doi/10.1093/ietfec/e91-a.6.1320</dc:identifier>
<dc:title><![CDATA[Auditory Artifacts due to Switching Head-Related Transfer Functions of a Dynamic Virtual Auditory Display]]></dc:title>
<dc:publisher>The Institute of Electronics, Information and Communication Engineers</dc:publisher>
<prism:number>6</prism:number>
<prism:volume>E91-A</prism:volume>
<prism:endingPage>1328</prism:endingPage>
<prism:publicationDate>2008-06-01</prism:publicationDate>
<prism:startingPage>1320</prism:startingPage>
<prism:section>Special Section on Acoustic Scene Analysis and Reproduction - Papers</prism:section>
</item>

<item rdf:about="http://ietfec.oxfordjournals.org/cgi/content/short/E91-A/6/1329?rss=1">
<title><![CDATA[Rapid Compensation of Temperature Fluctuation Effect for Multichannel Sound Field Reproduction System]]></title>
<link>http://ietfec.oxfordjournals.org/cgi/content/short/E91-A/6/1329?rss=1</link>
<description><![CDATA[<p>In this paper, we propose a computationally efficient method of compensating temperature for the transaural stereo. The conventional method can be used to estimate the change in impulse responses caused by the fluctuation of temperature with high accuracy. However, the large amount of computation required makes real-time implementation difficult. Focusing on the fact that the amount of compensation depends on the length of the impulse response, we reduce the computation required by segmenting the impulse response. We segment the impulse responses in the time domain and estimate the effect of temperature fluctuation for each of the segments. By joining the processed segments, we obtain the compensated impulse response of the whole length. Experimental results show that the proposed method can reduce the computation required by a factor of nine without degradation of the accuracy.</p>]]></description>
<dc:creator><![CDATA[YAI, Y., MIYABE, S., SARUWATARI, H., SHIKANO, K., TATEKURA, Y.]]></dc:creator>
<dc:date>2008-06-16</dc:date>
<dc:identifier>info:doi/10.1093/ietfec/e91-a.6.1329</dc:identifier>
<dc:title><![CDATA[Rapid Compensation of Temperature Fluctuation Effect for Multichannel Sound Field Reproduction System]]></dc:title>
<dc:publisher>The Institute of Electronics, Information and Communication Engineers</dc:publisher>
<prism:number>6</prism:number>
<prism:volume>E91-A</prism:volume>
<prism:endingPage>1336</prism:endingPage>
<prism:publicationDate>2008-06-01</prism:publicationDate>
<prism:startingPage>1329</prism:startingPage>
<prism:section>Special Section on Acoustic Scene Analysis and Reproduction - Papers</prism:section>
</item>

<item rdf:about="http://ietfec.oxfordjournals.org/cgi/content/short/E91-A/6/1337?rss=1">
<title><![CDATA[A Two-Microphone Noise Reduction Method in Highly Non-stationary Multiple-Noise-Source Environments]]></title>
<link>http://ietfec.oxfordjournals.org/cgi/content/short/E91-A/6/1337?rss=1</link>
<description><![CDATA[<p>In this paper, we propose a two-microphone noise reduction method to deal with non-stationary interfering noises in multiple-noise-source environments in which the traditional two-microphone algorithms cannot function well. In the proposed algorithm, multiple interfering noise sources are regarded as one virtually integrated noise source in each subband, and the spectrum of the integrated noise is then estimated using its virtual direction of arrival. To do this, we suggest a direction finder for the integrated noise using only two microphones that performs well even in speech active periods. The noise spectrum estimate is further improved by integrating a single-channel noise estimation approach and then subtracted from that of the noisy signal, finally enhancing the desired target signal. The performance of the proposed algorithm is evaluated and compared with the traditional algorithms in various conditions. Experimental results demonstrate that the proposed algorithm outperforms the traditional algorithms in various conditions in terms of objective and subjective speech quality measures.</p>]]></description>
<dc:creator><![CDATA[LI, J., AKAGI, M., SUZUKI, Y.]]></dc:creator>
<dc:date>2008-06-16</dc:date>
<dc:identifier>info:doi/10.1093/ietfec/e91-a.6.1337</dc:identifier>
<dc:title><![CDATA[A Two-Microphone Noise Reduction Method in Highly Non-stationary Multiple-Noise-Source Environments]]></dc:title>
<dc:publisher>The Institute of Electronics, Information and Communication Engineers</dc:publisher>
<prism:number>6</prism:number>
<prism:volume>E91-A</prism:volume>
<prism:endingPage>1346</prism:endingPage>
<prism:publicationDate>2008-06-01</prism:publicationDate>
<prism:startingPage>1337</prism:startingPage>
<prism:section>Special Section on Acoustic Scene Analysis and Reproduction - Papers</prism:section>
</item>

<item rdf:about="http://ietfec.oxfordjournals.org/cgi/content/short/E91-A/6/1347?rss=1">
<title><![CDATA[Robust Frequency Domain Acoustic Echo Cancellation Filter Employing Normalized Residual Echo Enhancement]]></title>
<link>http://ietfec.oxfordjournals.org/cgi/content/short/E91-A/6/1347?rss=1</link>
<description><![CDATA[<p>We propose a new robust frequency domain acoustic echo cancellation filter that employs a normalized residual echo enhancement. By interpreting the conventional robust step-size control approaches as a statistical-model-based residual echo enhancement problem, the optimal step-size introduced in the most of conventional approaches is regarded as optimal only on the assumption that both the residual echo and the outlier in the error output signal are described by Gaussian distributions. However, the Gaussian-Gaussian mixture assumption does not always hold well, especially when both the residual echo and the outlier are speech signals (known as a double-talk situation). The proposed filtering scheme is based on the Gaussian-Laplacian mixture assumption for the signals normalized by the reference input signal amplitude. By comparing the performances of the proposed and conventional approaches through the simulations, we show that the Gaussian-Laplacian mixture assumption for the normalized signals can provide a better control scheme for the acoustic echo cancellation.</p>]]></description>
<dc:creator><![CDATA[SHIMAUCHI, S., HANEDA, Y., KATAOKA, A.]]></dc:creator>
<dc:date>2008-06-16</dc:date>
<dc:identifier>info:doi/10.1093/ietfec/e91-a.6.1347</dc:identifier>
<dc:title><![CDATA[Robust Frequency Domain Acoustic Echo Cancellation Filter Employing Normalized Residual Echo Enhancement]]></dc:title>
<dc:publisher>The Institute of Electronics, Information and Communication Engineers</dc:publisher>
<prism:number>6</prism:number>
<prism:volume>E91-A</prism:volume>
<prism:endingPage>1356</prism:endingPage>
<prism:publicationDate>2008-06-01</prism:publicationDate>
<prism:startingPage>1347</prism:startingPage>
<prism:section>Special Section on Acoustic Scene Analysis and Reproduction - Papers</prism:section>
</item>

<item rdf:about="http://ietfec.oxfordjournals.org/cgi/content/short/E91-A/6/1357?rss=1">
<title><![CDATA[Fast Convergence Blind Source Separation Using Frequency Subband Interpolation by Null Beamforming]]></title>
<link>http://ietfec.oxfordjournals.org/cgi/content/short/E91-A/6/1357?rss=1</link>
<description><![CDATA[<p>We propose a new algorithm for the blind source separation (BSS) approach in which independent component analysis (ICA) and frequency subband beamforming interpolation are combined. The slow convergence of the optimization of the separation filters is a problem in ICA. Our approach to resolving this problem is based on the relationship between ICA and null beamforming (NBF). The proposed method consists of the following three parts: (I) a frequency subband selector part for learning ICA, (II) a frequency domain ICA part with direction-of-arrivals (DOA) estimation of sound sources, and (III) an interpolation part in which null beamforming constructed with the estimated DOA is used. The results of the signal separation experiments under a reverberant condition reveal that the convergence speed is superior to that of the conventional ICA-based BSS methods.</p>]]></description>
<dc:creator><![CDATA[OSAKO, K., MORI, Y., TAKAHASHI, Y., SARUWATARI, H., SHIKANO, K.]]></dc:creator>
<dc:date>2008-06-16</dc:date>
<dc:identifier>info:doi/10.1093/ietfec/e91-a.6.1357</dc:identifier>
<dc:title><![CDATA[Fast Convergence Blind Source Separation Using Frequency Subband Interpolation by Null Beamforming]]></dc:title>
<dc:publisher>The Institute of Electronics, Information and Communication Engineers</dc:publisher>
<prism:number>6</prism:number>
<prism:volume>E91-A</prism:volume>
<prism:endingPage>1361</prism:endingPage>
<prism:publicationDate>2008-06-01</prism:publicationDate>
<prism:startingPage>1357</prism:startingPage>
<prism:section>Special Section on Acoustic Scene Analysis and Reproduction - Letters</prism:section>
</item>

<item rdf:about="http://ietfec.oxfordjournals.org/cgi/content/short/E91-A/6/1362?rss=1">
<title><![CDATA[Sound Reproduction System Robust against Environmental Variation by Switching Control Band Range]]></title>
<link>http://ietfec.oxfordjournals.org/cgi/content/short/E91-A/6/1362?rss=1</link>
<description><![CDATA[<p>A robust multichannel sound reproduction system that utilizes the relationship between the width of the actual control area and the control frequency of the control points is proposed. The reproduction accuracy of a conventional sound reproduction system is reduced by room environment variations when fixed inverse filter coefficients are used. This tendency becomes more significant when control points are arranged more closely. To resolve this problem, the frequency control band at every control point is switched to avoid degrading the reproduced sound in low frequencies, so the pass band range of the control points at both ears is only high-range. That of the other control points is the entire control range. Numerical simulation with real environmental data showed that improvement of the reproduction accuracy is about 6.1 dB on average, even with a temperature fluctuation of 5&deg;C as an environmental variation in the listening room.</p>]]></description>
<dc:creator><![CDATA[TATEKURA, Y., WATANABE, T.]]></dc:creator>
<dc:date>2008-06-16</dc:date>
<dc:identifier>info:doi/10.1093/ietfec/e91-a.6.1362</dc:identifier>
<dc:title><![CDATA[Sound Reproduction System Robust against Environmental Variation by Switching Control Band Range]]></dc:title>
<dc:publisher>The Institute of Electronics, Information and Communication Engineers</dc:publisher>
<prism:number>6</prism:number>
<prism:volume>E91-A</prism:volume>
<prism:endingPage>1366</prism:endingPage>
<prism:publicationDate>2008-06-01</prism:publicationDate>
<prism:startingPage>1362</prism:startingPage>
<prism:section>Special Section on Acoustic Scene Analysis and Reproduction - Letters</prism:section>
</item>

<item rdf:about="http://ietfec.oxfordjournals.org/cgi/content/short/E91-A/6/1367?rss=1">
<title><![CDATA[Special Section on Image Media Quality]]></title>
<link>http://ietfec.oxfordjournals.org/cgi/content/short/E91-A/6/1367?rss=1</link>
<description><![CDATA[]]></description>
<dc:creator><![CDATA[Hangai, S.]]></dc:creator>
<dc:date>2008-06-16</dc:date>
<dc:identifier>info:doi/10.1093/ietfec/e91-a.6.1367</dc:identifier>
<dc:title><![CDATA[Special Section on Image Media Quality]]></dc:title>
<dc:publisher>The Institute of Electronics, Information and Communication Engineers</dc:publisher>
<prism:number>6</prism:number>
<prism:volume>E91-A</prism:volume>
<prism:endingPage>1368</prism:endingPage>
<prism:publicationDate>2008-06-01</prism:publicationDate>
<prism:startingPage>1367</prism:startingPage>
<prism:section>Special Section on Image Media Quality</prism:section>
</item>

<item rdf:about="http://ietfec.oxfordjournals.org/cgi/content/short/E91-A/6/1369?rss=1">
<title><![CDATA[The Interaction of Art, Technology and Customers in Picture Making]]></title>
<link>http://ietfec.oxfordjournals.org/cgi/content/short/E91-A/6/1369?rss=1</link>
<description><![CDATA[<p>Human interest in pictures dates back to 14,000 BC. Pictures can be drawn by hand or imaged by optical means. Over time pictures have changed from being rare and unique to ubiquitous and common. They have changed from treasures to transients. This paper summarizes many picture technologies, and discusses their dynamic range, their color and tone scale rendering. This paper discusses the interactions between advances in technology and the interests of its users over time. It is the combination of both technology and society's usage that has shaped imaging since its beginning and continues to do so.</p>]]></description>
<dc:creator><![CDATA[MCCANN, J. J., MIYAKE, Y.]]></dc:creator>
<dc:date>2008-06-16</dc:date>
<dc:identifier>info:doi/10.1093/ietfec/e91-a.6.1369</dc:identifier>
<dc:title><![CDATA[The Interaction of Art, Technology and Customers in Picture Making]]></dc:title>
<dc:publisher>The Institute of Electronics, Information and Communication Engineers</dc:publisher>
<prism:number>6</prism:number>
<prism:volume>E91-A</prism:volume>
<prism:endingPage>1382</prism:endingPage>
<prism:publicationDate>2008-06-01</prism:publicationDate>
<prism:startingPage>1369</prism:startingPage>
<prism:section>Special Section on Image Media Quality - Papers</prism:section>
</item>

<item rdf:about="http://ietfec.oxfordjournals.org/cgi/content/short/E91-A/6/1383?rss=1">
<title><![CDATA[Image and Video Quality Assessment Using LCD: Comparisons with CRT Conditions]]></title>
<link>http://ietfec.oxfordjournals.org/cgi/content/short/E91-A/6/1383?rss=1</link>
<description><![CDATA[<p>In this paper, the impact of display on quality assessment is addressed. Subjective quality assessment experiments have been performed on both LCD and CRT displays. Two sets of still images and two sets of moving pictures have been assessed using either an ACR or a SAMVIQ protocol. Altogether, eight experiments have been led. Results are presented and discussed, some differences are pointed out. Concerning moving pictures, these differences seem to be mainly due to LCD moving artefacts such as motion blur. LCD motion blur has been measured objectively and with psycho-physics experiments. A motion-blur metric based on the temporal characteristics of LCD can be defined. A prediction model have been then designed which predict the differences of perceived quality between CRT and LCD. This motion-blur-based model enables the estimation of perceived quality on LCD with respect to the perceived quality on CRT. Technical solutions to LCD motion blur can thus be evaluated on natural contents by this mean.</p>]]></description>
<dc:creator><![CDATA[TOURANCHEAU, S., LE CALLET, P., BARBA, D.]]></dc:creator>
<dc:date>2008-06-16</dc:date>
<dc:identifier>info:doi/10.1093/ietfec/e91-a.6.1383</dc:identifier>
<dc:title><![CDATA[Image and Video Quality Assessment Using LCD: Comparisons with CRT Conditions]]></dc:title>
<dc:publisher>The Institute of Electronics, Information and Communication Engineers</dc:publisher>
<prism:number>6</prism:number>
<prism:volume>E91-A</prism:volume>
<prism:endingPage>1391</prism:endingPage>
<prism:publicationDate>2008-06-01</prism:publicationDate>
<prism:startingPage>1383</prism:startingPage>
<prism:section>Special Section on Image Media Quality - Papers</prism:section>
</item>

<item rdf:about="http://ietfec.oxfordjournals.org/cgi/content/short/E91-A/6/1392?rss=1">
<title><![CDATA[Image Quality Assessment for Color Halftone Images Based on Color Structural Similarity]]></title>
<link>http://ietfec.oxfordjournals.org/cgi/content/short/E91-A/6/1392?rss=1</link>
<description><![CDATA[<p>This paper proposes a new color halftone image quality assessment method based upon the color structural similarity measure with considering the human visual characteristics. To include the color visual characteristics, we carry out the color filtering for each luminance, red-green, and blue-yellow channels. Then, we apply the color structural similarity measure to the color filtered images, which are the reference image and the halftoned image, to evaluate the localized structural difference. By considering those characteristics, in this paper, the assessment of the color halftone images can be realized. We apply the proposed measure to the various kinds of color halftone images and confirm that the proposed measure can give reasonable results compared with the results by subjective evaluation.</p>]]></description>
<dc:creator><![CDATA[LEE, J., HORIUCHI, T.]]></dc:creator>
<dc:date>2008-06-16</dc:date>
<dc:identifier>info:doi/10.1093/ietfec/e91-a.6.1392</dc:identifier>
<dc:title><![CDATA[Image Quality Assessment for Color Halftone Images Based on Color Structural Similarity]]></dc:title>
<dc:publisher>The Institute of Electronics, Information and Communication Engineers</dc:publisher>
<prism:number>6</prism:number>
<prism:volume>E91-A</prism:volume>
<prism:endingPage>1399</prism:endingPage>
<prism:publicationDate>2008-06-01</prism:publicationDate>
<prism:startingPage>1392</prism:startingPage>
<prism:section>Special Section on Image Media Quality - Papers</prism:section>
</item>

<item rdf:about="http://ietfec.oxfordjournals.org/cgi/content/short/E91-A/6/1400?rss=1">
<title><![CDATA[A Development of the TFT-LCD Image Defect Inspection Method Based on Human Visual System]]></title>
<link>http://ietfec.oxfordjournals.org/cgi/content/short/E91-A/6/1400?rss=1</link>
<description><![CDATA[<p>The TFT-LCD image has non-uniform brightness that is the major difficulty of finding the visible defect called Mura in the field. To facilitate Mura detection, background signal shading should level off and Mura signal must be amplified. In this paper, Mura signal amplification and background signal flattening method is proposed based on human visual system (HVS). The proposed DC normalized contrast sensitivity function (CSF) is used for the Mura signal amplification and polynomial regression (PR) is used to level off the background signal. In the enhanced image, tri-modal thresholding segmentation technique is used for finding Dark and White Mura at the same time. To select reliable defect, falsely detected invisible region is eliminated based on Weber's Law. By the experimental results of artificially generated 1-d signal and TFT-LCD image, proposed algorithm has novel enhancement results and can be applied to real automated inspection system.</p>]]></description>
<dc:creator><![CDATA[OH, J.-H., YUN, B.-J., KIM, S.-Y., PARK, K.-H.]]></dc:creator>
<dc:date>2008-06-16</dc:date>
<dc:identifier>info:doi/10.1093/ietfec/e91-a.6.1400</dc:identifier>
<dc:title><![CDATA[A Development of the TFT-LCD Image Defect Inspection Method Based on Human Visual System]]></dc:title>
<dc:publisher>The Institute of Electronics, Information and Communication Engineers</dc:publisher>
<prism:number>6</prism:number>
<prism:volume>E91-A</prism:volume>
<prism:endingPage>1407</prism:endingPage>
<prism:publicationDate>2008-06-01</prism:publicationDate>
<prism:startingPage>1400</prism:startingPage>
<prism:section>Special Section on Image Media Quality - Papers</prism:section>
</item>

<item rdf:about="http://ietfec.oxfordjournals.org/cgi/content/short/E91-A/6/1408?rss=1">
<title><![CDATA[A Masking Model for Motion Sharpening Phenomenon in Video Sequences]]></title>
<link>http://ietfec.oxfordjournals.org/cgi/content/short/E91-A/6/1408?rss=1</link>
<description><![CDATA[<p>In this paper, we show that motion sharpening phenomenon can be explained as a form of visual masking for a special case where a video sequence is composed of alternate frames with different level of sharpness. A frame of higher sharpness behaves to mask the ambiguity of a subsequent frame of lower sharpness and hence preserves the perceptive quality of the whole sequence. Borrowing the mechanism for visual masking, we formulated a quantitative model for deriving the minimum spatial frequency conditions which preserves the subjective quality of the frames being masked. The quantitative model takes into account three fundamental properties of the video signals, namely the size of motion, average luminance and the power of each frequency components. The psychophysical responses towards the changes of these properties are obtained through subjective assessment tests using video sequences of simple geometrical patterns. Subjective experiments on natural video sequences show that more than 75% of viewers could make no distinction between the original sequence and the one processed using the quantitative model.</p>]]></description>
<dc:creator><![CDATA[FUJIBAYASHI, A., BOON, C. S.]]></dc:creator>
<dc:date>2008-06-16</dc:date>
<dc:identifier>info:doi/10.1093/ietfec/e91-a.6.1408</dc:identifier>
<dc:title><![CDATA[A Masking Model for Motion Sharpening Phenomenon in Video Sequences]]></dc:title>
<dc:publisher>The Institute of Electronics, Information and Communication Engineers</dc:publisher>
<prism:number>6</prism:number>
<prism:volume>E91-A</prism:volume>
<prism:endingPage>1415</prism:endingPage>
<prism:publicationDate>2008-06-01</prism:publicationDate>
<prism:startingPage>1408</prism:startingPage>
<prism:section>Special Section on Image Media Quality - Papers</prism:section>
</item>

<item rdf:about="http://ietfec.oxfordjournals.org/cgi/content/short/E91-A/6/1416?rss=1">
<title><![CDATA[Identification of Piecewise Linear Uniform Motion Blur]]></title>
<link>http://ietfec.oxfordjournals.org/cgi/content/short/E91-A/6/1416?rss=1</link>
<description><![CDATA[<p>A motion blur identification scheme is proposed for non-linear uniform motion blurs approximated by piecewise linear models which consist of more than one linear motion component. The proposed scheme includes three modules that are a motion direction estimator, a motion length estimator and a motion combination selector. In order to identify the motion directions, the proposed scheme is based on a trial restoration by using directional forward ramp motion blurs along different directions and an analysis of directional information via frequency domain by using a Radon transform. Autocorrelation functions of image derivatives along several directions are employed for estimation of the motion lengths. A proper motion combination is identified by analyzing local autocorrelation functions of non-flat component of trial restored results. Experimental examples of simulated and real world blurred images are given to demonstrate a promising performance of the proposed scheme.</p>]]></description>
<dc:creator><![CDATA[PATANUKHOM, K., NISHIHARA, A.]]></dc:creator>
<dc:date>2008-06-16</dc:date>
<dc:identifier>info:doi/10.1093/ietfec/e91-a.6.1416</dc:identifier>
<dc:title><![CDATA[Identification of Piecewise Linear Uniform Motion Blur]]></dc:title>
<dc:publisher>The Institute of Electronics, Information and Communication Engineers</dc:publisher>
<prism:number>6</prism:number>
<prism:volume>E91-A</prism:volume>
<prism:endingPage>1425</prism:endingPage>
<prism:publicationDate>2008-06-01</prism:publicationDate>
<prism:startingPage>1416</prism:startingPage>
<prism:section>Special Section on Image Media Quality - Papers</prism:section>
</item>

<item rdf:about="http://ietfec.oxfordjournals.org/cgi/content/short/E91-A/6/1426?rss=1">
<title><![CDATA[Wavelet Based Multipurpose Color Image Watermarking by Using Dual Watermarks with Human Vision System Models]]></title>
<link>http://ietfec.oxfordjournals.org/cgi/content/short/E91-A/6/1426?rss=1</link>
<description><![CDATA[<p>In this study, we propose a complete architecture based on digital watermarking techniques to solve the issue of copyright protection and authentication for digital contents. We apply visible and semi-fragile watermarks as dual watermarks where visible watermarking is used to establish the copyright protection and semi-fragile watermarking authenticates and verifies the integrity of the watermarked image. In order to get the best tradeoff between the embedding energy of watermark and the perceptual translucence for visible watermark, the composite coefficients using global and local characteristics of the host and watermark images in the discrete wavelet transform (DWT) domain is considered with Human Vision System (HVS) models. To achieve the optimum noise reduction of the visibility thresholds for HVS in DWT domain, the contrast-sensitive function (CSF) and noise visible function (NVF) of perceptual model is applied which characterizes the global and local image properties and identifies texture and edge regions to determine the optimal watermark locations and strength at the watermark embedding stage. In addition, the perceptual weights according to the basis function amplitudes of DWT coefficients is fine tuned for the best quality of perceptual translucence in the design of the proposed watermarking algorithm. Furthermore, the semi-fragile watermark can detect and localize malicious attack effectively yet tolerate mild modifications such as JPEG compression and channel additive white Gaussian noise (AWGN). From the experimental results, our proposed technique not only improves the PSNR values and visual quality than other algorithms but also preserves the visibility of the watermark visible under various signal processing and advanced image recovery attacks.</p>]]></description>
<dc:creator><![CDATA[TSAI, M.-J., LIN, C.-W.]]></dc:creator>
<dc:date>2008-06-16</dc:date>
<dc:identifier>info:doi/10.1093/ietfec/e91-a.6.1426</dc:identifier>
<dc:title><![CDATA[Wavelet Based Multipurpose Color Image Watermarking by Using Dual Watermarks with Human Vision System Models]]></dc:title>
<dc:publisher>The Institute of Electronics, Information and Communication Engineers</dc:publisher>
<prism:number>6</prism:number>
<prism:volume>E91-A</prism:volume>
<prism:endingPage>1437</prism:endingPage>
<prism:publicationDate>2008-06-01</prism:publicationDate>
<prism:startingPage>1426</prism:startingPage>
<prism:section>Special Section on Image Media Quality - Papers</prism:section>
</item>

<item rdf:about="http://ietfec.oxfordjournals.org/cgi/content/short/E91-A/6/1438?rss=1">
<title><![CDATA[Factors of Incomplete Adaptation for Color Reproduction Considering Subjective White Point Shift for Varying Illuminant]]></title>
<link>http://ietfec.oxfordjournals.org/cgi/content/short/E91-A/6/1438?rss=1</link>
<description><![CDATA[<p>In this paper, we investigated the effect of chromaticity and luminance of surround to decide subject neutral white, and conducted a mathematical model of adapting degree for environment. Factors for adapting degree consist of two parts, adapting degree of ambient chromaticity and color saturation. These can be applied to color appearance models (CAM), actually improve the performance of color matching of CAM, hence would produce the method of image reproduction to general display systems.</p>]]></description>
<dc:creator><![CDATA[LEE, S.-H., LEE, M.-H., SOHNG, K.-I.]]></dc:creator>
<dc:date>2008-06-16</dc:date>
<dc:identifier>info:doi/10.1093/ietfec/e91-a.6.1438</dc:identifier>
<dc:title><![CDATA[Factors of Incomplete Adaptation for Color Reproduction Considering Subjective White Point Shift for Varying Illuminant]]></dc:title>
<dc:publisher>The Institute of Electronics, Information and Communication Engineers</dc:publisher>
<prism:number>6</prism:number>
<prism:volume>E91-A</prism:volume>
<prism:endingPage>1442</prism:endingPage>
<prism:publicationDate>2008-06-01</prism:publicationDate>
<prism:startingPage>1438</prism:startingPage>
<prism:section>Special Section on Image Media Quality - Letters</prism:section>
</item>

<item rdf:about="http://ietfec.oxfordjournals.org/cgi/content/short/E91-A/6/1443?rss=1">
<title><![CDATA[A Study about the Relationship between Frame Quality and Single Video Quality]]></title>
<link>http://ietfec.oxfordjournals.org/cgi/content/short/E91-A/6/1443?rss=1</link>
<description><![CDATA[<p>Digital video encapsulates the time series of a frame (still) images, where overall video quality can be obtained by using the quality of each frame image and the temporal information between the frame image. Coding of video produces degradation of these two types of information. These degradations can be classified as spatial degradation (static degradation) of a frame images and temporal degradation between frame image (dynamic degradation). In the framework of video quality evaluation it is necessary to consider those degradations, because their contents are strongly interdependable and quantification is problematic for these degradations. Therefore, the development of an objective video quality assessment method for single video quality requires to investigate how much static degradation and dynamic degradation affect single video quality. In this research, single video quality was predicted highly accuratly by using frame quality as static degradation and frame rate information as dynamic degradation.</p>]]></description>
<dc:creator><![CDATA[KAWAYOKE, Y., HORITA, Y.]]></dc:creator>
<dc:date>2008-06-16</dc:date>
<dc:identifier>info:doi/10.1093/ietfec/e91-a.6.1443</dc:identifier>
<dc:title><![CDATA[A Study about the Relationship between Frame Quality and Single Video Quality]]></dc:title>
<dc:publisher>The Institute of Electronics, Information and Communication Engineers</dc:publisher>
<prism:number>6</prism:number>
<prism:volume>E91-A</prism:volume>
<prism:endingPage>1445</prism:endingPage>
<prism:publicationDate>2008-06-01</prism:publicationDate>
<prism:startingPage>1443</prism:startingPage>
<prism:section>Special Section on Image Media Quality - Letters</prism:section>
</item>

<item rdf:about="http://ietfec.oxfordjournals.org/cgi/content/short/E91-A/6/1446?rss=1">
<title><![CDATA[A New Matrix Method for Reconstruction of Band-Limited Periodic Signals from the Sets of Integrated Values]]></title>
<link>http://ietfec.oxfordjournals.org/cgi/content/short/E91-A/6/1446?rss=1</link>
<description><![CDATA[<p>This paper presents a new method for reconstruction of trigonometric polynomials, a specific class of bandlimited signals, from a number of integrated values of input signals. It is applied in signal reconstruction, spectral estimation, system identification, as well as in other important signal processing problems. The proposed method of processing can be used for precise rms measurements of periodic signal (or power and energy) based on the presented signal reconstruction. Based on the value of the integral of the original input (analogue) signal, with a known frequency spectrum but unknown amplitudes and phases, a reconstruction of its basic parameters is done by the means of derived analytical and summarized expressions. Subsequent calculation of all relevant indicators related to the monitoring and processing of ac voltage and current signals is provided in this manner. Computer simulation demonstrating the precision of these algorithms. We investigate the errors related to the signal reconstruction, and provide an error bound around the reconstructed time domain waveform.</p>]]></description>
<dc:creator><![CDATA[PETROVIC, P.]]></dc:creator>
<dc:date>2008-06-16</dc:date>
<dc:identifier>info:doi/10.1093/ietfec/e91-a.6.1446</dc:identifier>
<dc:title><![CDATA[A New Matrix Method for Reconstruction of Band-Limited Periodic Signals from the Sets of Integrated Values]]></dc:title>
<dc:publisher>The Institute of Electronics, Information and Communication Engineers</dc:publisher>
<prism:number>6</prism:number>
<prism:volume>E91-A</prism:volume>
<prism:endingPage>1454</prism:endingPage>
<prism:publicationDate>2008-06-01</prism:publicationDate>
<prism:startingPage>1446</prism:startingPage>
<prism:section>Regular Section - Papers - Digital Signal Processing</prism:section>
</item>

<item rdf:about="http://ietfec.oxfordjournals.org/cgi/content/short/E91-A/6/1455?rss=1">
<title><![CDATA[Artificial Spiking Neurons and Analog-to-Digital-to-Analog Conversion]]></title>
<link>http://ietfec.oxfordjournals.org/cgi/content/short/E91-A/6/1455?rss=1</link>
<description><![CDATA[<p>This paper studies encoding/decoding function of artificial spiking neurons. First, we investigate basic characteristics of spike-trains of the neurons and fix parameter value that can minimize variation of spike-train length for initial value. Second we consider analog-to-digital encoding based upon spike-interval modulation that is suitable for simple and stable signal detection. Third we present a digital-to-analog decoder in which digital input is applied to switch the base signal of the spiking neuron. The system dynamics can be simplified into simple switched dynamical systems and precise analysis is possible. A simple circuit model is also presented.</p>]]></description>
<dc:creator><![CDATA[TORIKAI, H., TANAKA, A., SAITO, T.]]></dc:creator>
<dc:date>2008-06-16</dc:date>
<dc:identifier>info:doi/10.1093/ietfec/e91-a.6.1455</dc:identifier>
<dc:title><![CDATA[Artificial Spiking Neurons and Analog-to-Digital-to-Analog Conversion]]></dc:title>
<dc:publisher>The Institute of Electronics, Information and Communication Engineers</dc:publisher>
<prism:number>6</prism:number>
<prism:volume>E91-A</prism:volume>
<prism:endingPage>1462</prism:endingPage>
<prism:publicationDate>2008-06-01</prism:publicationDate>
<prism:startingPage>1455</prism:startingPage>
<prism:section>Regular Section - Papers - Nonlinear Problems</prism:section>
</item>

<item rdf:about="http://ietfec.oxfordjournals.org/cgi/content/short/E91-A/6/1463?rss=1">
<title><![CDATA[Self-Organizing Map with False-Neighbor Degree between Neurons for Effective Self-Organization]]></title>
<link>http://ietfec.oxfordjournals.org/cgi/content/short/E91-A/6/1463?rss=1</link>
<description><![CDATA[<p>In the real world, it is not always true that neighboring houses are physically adjacent or close to each other. in other words, "neighbors" are not always "true neighbors." In this study, we propose a new Self-Organizing Map (SOM) algorithm, SOM with False-Neighbor degree between neurons (called FN-SOM). The behavior of FN-SOM is investigated with learning for various input data. We confirm that FN-SOM can obtain a more effective map reflecting the distribution state of input data than the conventional SOM and Growing Grid.</p>]]></description>
<dc:creator><![CDATA[MATSUSHITA, H., NISHIO, Y.]]></dc:creator>
<dc:date>2008-06-16</dc:date>
<dc:identifier>info:doi/10.1093/ietfec/e91-a.6.1463</dc:identifier>
<dc:title><![CDATA[Self-Organizing Map with False-Neighbor Degree between Neurons for Effective Self-Organization]]></dc:title>
<dc:publisher>The Institute of Electronics, Information and Communication Engineers</dc:publisher>
<prism:number>6</prism:number>
<prism:volume>E91-A</prism:volume>
<prism:endingPage>1469</prism:endingPage>
<prism:publicationDate>2008-06-01</prism:publicationDate>
<prism:startingPage>1463</prism:startingPage>
<prism:section>Regular Section - Papers - Nonlinear Problems</prism:section>
</item>

<item rdf:about="http://ietfec.oxfordjournals.org/cgi/content/short/E91-A/6/1470?rss=1">
<title><![CDATA[Low-Complexity Parallel Systolic Montgomery Multipliers over GF(2m) Using Toeplitz Matrix-Vector Representation]]></title>
<link>http://ietfec.oxfordjournals.org/cgi/content/short/E91-A/6/1470?rss=1</link>
<description><![CDATA[<p>In this paper, a generalized Montgomery multiplication algorithm in GF(2<sup><I>m</I></sup>) using the Toeplitz matrix-vector representation is presented. The hardware architectures derived from this algorithm provide low-complexity bit-parallel systolic multipliers with trinomials and pentanomials. The results reveal that our proposed multipliers reduce the space complexity of approximately 15% compared with an existing systolic Montgomery multiplier for trinomials. Moreover, the proposed architectures have the features of regularity, modularity, and local interconnection. Accordingly, they are well suited to VLSI implementation.</p>]]></description>
<dc:creator><![CDATA[LEE, C.-Y.]]></dc:creator>
<dc:date>2008-06-16</dc:date>
<dc:identifier>info:doi/10.1093/ietfec/e91-a.6.1470</dc:identifier>
<dc:title><![CDATA[Low-Complexity Parallel Systolic Montgomery Multipliers over GF(2m) Using Toeplitz Matrix-Vector Representation]]></dc:title>
<dc:publisher>The Institute of Electronics, Information and Communication Engineers</dc:publisher>
<prism:number>6</prism:number>
<prism:volume>E91-A</prism:volume>
<prism:endingPage>1477</prism:endingPage>
<prism:publicationDate>2008-06-01</prism:publicationDate>
<prism:startingPage>1470</prism:startingPage>
<prism:section>Regular Section - Papers - Circuit Theory</prism:section>
</item>

<item rdf:about="http://ietfec.oxfordjournals.org/cgi/content/short/E91-A/6/1478?rss=1">
<title><![CDATA[Fast Custom Instruction Identification Algorithm Based on Basic Convex Pattern Model for Supporting ASIP Automated Design]]></title>
<link>http://ietfec.oxfordjournals.org/cgi/content/short/E91-A/6/1478?rss=1</link>
<description><![CDATA[<p>To improve the computation efficiency of the application specific instruction-set processor (ASIP), a strategy of hardware/software collaborative design is usually utilized. In this process, the auto-customization of specific instruction set has always been a key part to support the automated design of ASIP. The key issue of this problem is how to effectively reduce the huge exponential exploration space in the instruction identification process. To address this issue, we first formulate it as a feasible sub-graph enumeration problem under multiple constraints, and then propose a fast instruction identification algorithm based on a new model called basic convex pattern (BCP). The kernel technique in this algorithm is the transformation from the graph exploration to the formula-based computations. The experimental results have indicated that the proposed algorithm has a distinct reduction in the execution time.</p>]]></description>
<dc:creator><![CDATA[ZHAO, K., BIAN, J., DONG, S., SONG, Y., GOTO, S.]]></dc:creator>
<dc:date>2008-06-16</dc:date>
<dc:identifier>info:doi/10.1093/ietfec/e91-a.6.1478</dc:identifier>
<dc:title><![CDATA[Fast Custom Instruction Identification Algorithm Based on Basic Convex Pattern Model for Supporting ASIP Automated Design]]></dc:title>
<dc:publisher>The Institute of Electronics, Information and Communication Engineers</dc:publisher>
<prism:number>6</prism:number>
<prism:volume>E91-A</prism:volume>
<prism:endingPage>1487</prism:endingPage>
<prism:publicationDate>2008-06-01</prism:publicationDate>
<prism:startingPage>1478</prism:startingPage>
<prism:section>Regular Section - Papers - VLSI Design Technology and CAD</prism:section>
</item>

<item rdf:about="http://ietfec.oxfordjournals.org/cgi/content/short/E91-A/6/1488?rss=1">
<title><![CDATA[A Construction of Lossy Source Code Using LDPC Matrices]]></title>
<link>http://ietfec.oxfordjournals.org/cgi/content/short/E91-A/6/1488?rss=1</link>
<description><![CDATA[<p>Research into applying LDPC code theory, which is used for channel coding, to source coding has received a lot of attention in several research fields such as distributed source coding. In this paper, a source coding problem with a fidelity criterion is considered. Matsunaga et al. and Martinian et al. constructed a lossy code under the conditions of a binary alphabet, a uniform distribution, and a Hamming measure of fidelity criterion. We extend their results and construct a lossy code under the extended conditions of a binary alphabet, a distribution that is not necessarily uniform, and a fidelity measure that is bounded and additive and show that the code can achieve the optimal rate, rate-distortion function. By applying a formula for the random walk on lattice to the analysis of LDPC matrices on <b><I>Z</I></b><SUB><I>q</I></SUB>, where <I>q</I> is a prime number, we show that results similar to those for the binary alphabet condition hold for <b><I>Z</I></b><SUB><I>q</I></SUB>, the multiple alphabet condition.</p>]]></description>
<dc:creator><![CDATA[MIYAKE, S., MURAMATSU, J.]]></dc:creator>
<dc:date>2008-06-16</dc:date>
<dc:identifier>info:doi/10.1093/ietfec/e91-a.6.1488</dc:identifier>
<dc:title><![CDATA[A Construction of Lossy Source Code Using LDPC Matrices]]></dc:title>
<dc:publisher>The Institute of Electronics, Information and Communication Engineers</dc:publisher>
<prism:number>6</prism:number>
<prism:volume>E91-A</prism:volume>
<prism:endingPage>1501</prism:endingPage>
<prism:publicationDate>2008-06-01</prism:publicationDate>
<prism:startingPage>1488</prism:startingPage>
<prism:section>Regular Section - Papers - Information Theory</prism:section>
</item>

<item rdf:about="http://ietfec.oxfordjournals.org/cgi/content/short/E91-A/6/1502?rss=1">
<title><![CDATA[On the Minimum Weight of Simple Full-Length Array LDPC Codes]]></title>
<link>http://ietfec.oxfordjournals.org/cgi/content/short/E91-A/6/1502?rss=1</link>
<description><![CDATA[<p>We investigate the minimum weights of simple full-length array LDPC codes (SFA-LDPC codes). The SFA-LDPC codes are a subclass of LDPC codes, and constructed algebraically according to two integer parameters <I>p</I> and <I>j</I>. Mittelholzer and Yang et al. have studied the minimum weights of SFA-LDPC codes, but the exact minimum weights of the codes are not known except for some small <I>p</I> and <I>j</I>. In this paper, we show that the minimum weights of the SFA-LDPC codes with <I>j</I> = 4 and <I>j</I> = 5 are upper-bounded by 10 and 12, respectively, independent from the prime number <I>p</I>. By combining the results with Yang's lower-bound limits, we can conclude that the minimum weights of the SFA-LDPC codes with <I>j</I> = 4 and <I>p</I> &gt;7 are exactly 10 and those of the SFA-LDPC codes with <I>j</I> = 5 are 10 or 12.</p>]]></description>
<dc:creator><![CDATA[SUGIYAMA, K., KAJI, Y.]]></dc:creator>
<dc:date>2008-06-16</dc:date>
<dc:identifier>info:doi/10.1093/ietfec/e91-a.6.1502</dc:identifier>
<dc:title><![CDATA[On the Minimum Weight of Simple Full-Length Array LDPC Codes]]></dc:title>
<dc:publisher>The Institute of Electronics, Information and Communication Engineers</dc:publisher>
<prism:number>6</prism:number>
<prism:volume>E91-A</prism:volume>
<prism:endingPage>1508</prism:endingPage>
<prism:publicationDate>2008-06-01</prism:publicationDate>
<prism:startingPage>1502</prism:startingPage>
<prism:section>Regular Section - Papers - Coding Theory</prism:section>
</item>

<item rdf:about="http://ietfec.oxfordjournals.org/cgi/content/short/E91-A/6/1509?rss=1">
<title><![CDATA[A Combination of Adaptive Equalizer and LMS-RAKE Combining Scheme for DS-UWB System]]></title>
<link>http://ietfec.oxfordjournals.org/cgi/content/short/E91-A/6/1509?rss=1</link>
<description><![CDATA[<p>This paper proposes a combination of adaptive equalizer and Least Mean Square-RAKE (LMS-RAKE) combining scheme receiver system for Direct Sequence-Ultra Wideband (DS-UWB) multipath channel model. The main purpose of the proposed system is to overcome the performance degradation for UWB transmission due to the occurrence of Inter-Symbol Interference (ISI) during high speed transmission of ultra short pulses in a multipath channel. The proposed system improves the system performance by mitigating the multipath effect using LMS-RAKE receiver and suppressing the ISI effect with the adaptive equalizer. Simulation results verify that significant equalization gain can be obtained by the proposed system especially in UWB multipath channel models such as channel CM3 and channel CM4 that suffered severe ISI effect.</p>]]></description>
<dc:creator><![CDATA[TOH, K. B., TACHIKAWA, S.]]></dc:creator>
<dc:date>2008-06-16</dc:date>
<dc:identifier>info:doi/10.1093/ietfec/e91-a.6.1509</dc:identifier>
<dc:title><![CDATA[A Combination of Adaptive Equalizer and LMS-RAKE Combining Scheme for DS-UWB System]]></dc:title>
<dc:publisher>The Institute of Electronics, Information and Communication Engineers</dc:publisher>
<prism:number>6</prism:number>
<prism:volume>E91-A</prism:volume>
<prism:endingPage>1515</prism:endingPage>
<prism:publicationDate>2008-06-01</prism:publicationDate>
<prism:startingPage>1509</prism:startingPage>
<prism:section>Regular Section - Papers - Spread Spectrum Technologies and Applications</prism:section>
</item>

<item rdf:about="http://ietfec.oxfordjournals.org/cgi/content/short/E91-A/6/1516?rss=1">
<title><![CDATA[A Pre-Emptive Horizontal Channel Borrowing and Vertical Traffic Overflowing Channel Allocation Scheme for Overlay Networks]]></title>
<link>http://ietfec.oxfordjournals.org/cgi/content/short/E91-A/6/1516?rss=1</link>
<description><![CDATA[<p>In this paper, a channel allocation scheme is studied for overlay wireless networks to optimize connection-level QoS. The contributions of our work are threefold. First, a channel allocation strategy using both horizontal channel borrowing and vertical traffic overflowing (HCB-VTO) is presented and analyzed. When all the channels in a given macro-cell are used, high-mobility real-time handoff requests can borrow channels from adjacent homogeneous cells. In case that the borrowing requests fail, handoff requests may also be overflowed to heterogeneous cells, if possible. Second, high-mobility real-time service is prioritized by allowing it to pre-empt channels currently used by other services. And third, to meet the high QoS requirements of some services and increase the utilization of radio resources, certain services can be transformed between real-time services and non-real-time services as necessary. Simulation results demonstrate that the proposed schemes can improve system performance.</p>]]></description>
<dc:creator><![CDATA[ZHAO, F.-m., JIANG, L.-g., HE, C.]]></dc:creator>
<dc:date>2008-06-16</dc:date>
<dc:identifier>info:doi/10.1093/ietfec/e91-a.6.1516</dc:identifier>
<dc:title><![CDATA[A Pre-Emptive Horizontal Channel Borrowing and Vertical Traffic Overflowing Channel Allocation Scheme for Overlay Networks]]></dc:title>
<dc:publisher>The Institute of Electronics, Information and Communication Engineers</dc:publisher>
<prism:number>6</prism:number>
<prism:volume>E91-A</prism:volume>
<prism:endingPage>1528</prism:endingPage>
<prism:publicationDate>2008-06-01</prism:publicationDate>
<prism:startingPage>1516</prism:startingPage>
<prism:section>Regular Section - Papers - Mobile Information Network and Personal Communications</prism:section>
</item>

<item rdf:about="http://ietfec.oxfordjournals.org/cgi/content/short/E91-A/6/1529?rss=1">
<title><![CDATA[A New Method for Estimating Intra Prediction Mode in H.264/AVC]]></title>
<link>http://ietfec.oxfordjournals.org/cgi/content/short/E91-A/6/1529?rss=1</link>
<description><![CDATA[<p>In order to reduce spatial redundancies, the H.264/AVC Intra coding provides nine directional prediction modes including DC prediction for every 4 <FONT FACE="arial,helvetica">x</FONT> 4 block, but it needs a lot of overhead bits to represent the nine directional prediction modes for every 4 <FONT FACE="arial,helvetica">x</FONT> 4 block. To compress the directional mode bits efficiently, the most probable mode is estimated by using the correlation between the prediction mode of spatially adjacent blocks and that of the current block. In this paper, a new method for estimating the most probable mode is proposed by using the directional information of the prediction mode of the adjacent blocks. Experimental results show that the proposed method is able to achieve a coding gain of about 0.2 dB on average at low bit rate.</p>]]></description>
<dc:creator><![CDATA[KIM, D.-Y., KIM, D.-K., LEE, Y.-L.]]></dc:creator>
<dc:date>2008-06-16</dc:date>
<dc:identifier>info:doi/10.1093/ietfec/e91-a.6.1529</dc:identifier>
<dc:title><![CDATA[A New Method for Estimating Intra Prediction Mode in H.264/AVC]]></dc:title>
<dc:publisher>The Institute of Electronics, Information and Communication Engineers</dc:publisher>
<prism:number>6</prism:number>
<prism:volume>E91-A</prism:volume>
<prism:endingPage>1532</prism:endingPage>
<prism:publicationDate>2008-06-01</prism:publicationDate>
<prism:startingPage>1529</prism:startingPage>
<prism:section>Regular Section - Letters - Digital Signal Processing</prism:section>
</item>

<item rdf:about="http://ietfec.oxfordjournals.org/cgi/content/short/E91-A/6/1533?rss=1">
<title><![CDATA[Optimizing Markov Model Parameters for Asynchronous Impulsive Noise over Broadband Power Line Communication Network]]></title>
<link>http://ietfec.oxfordjournals.org/cgi/content/short/E91-A/6/1533?rss=1</link>
<description><![CDATA[<p>A statistical model based on a partitioned Markov-chains model has previously been developed to represent time domain behavior of the asynchronous impulsive noise over a broadband power line communication (PLC) network. However, the estimation of its model parameters using the Simplex method can easily trap the final solution at a local optimum. This study proposes an estimation scheme based on the genetic algorithm (GA) to overcome this difficulty. Experimental results show that the proposed scheme yields estimates that more closely match the experimental data statistics.</p>]]></description>
<dc:creator><![CDATA[TAN, T.-H., HUANG, S.-Y., CHANG, C.-S., HUANG, Y.-F.]]></dc:creator>
<dc:date>2008-06-16</dc:date>
<dc:identifier>info:doi/10.1093/ietfec/e91-a.6.1533</dc:identifier>
<dc:title><![CDATA[Optimizing Markov Model Parameters for Asynchronous Impulsive Noise over Broadband Power Line Communication Network]]></dc:title>
<dc:publisher>The Institute of Electronics, Information and Communication Engineers</dc:publisher>
<prism:number>6</prism:number>
<prism:volume>E91-A</prism:volume>
<prism:endingPage>1536</prism:endingPage>
<prism:publicationDate>2008-06-01</prism:publicationDate>
<prism:startingPage>1533</prism:startingPage>
<prism:section>Regular Section - Letters - Numerical Analysis and Optimization</prism:section>
</item>

<item rdf:about="http://ietfec.oxfordjournals.org/cgi/content/short/E91-A/6/1537?rss=1">
<title><![CDATA[Conditional Converge Cast]]></title>
<link>http://ietfec.oxfordjournals.org/cgi/content/short/E91-A/6/1537?rss=1</link>
<description><![CDATA[<p>In this paper, we introduce a new notion of <I>conditional converge cast</I> (CCC), by adding the conditional property to <I>converge cast</I>. A CCC protocol with predicate <I>Q</I> is a three-party protocol which involves two senders <I>S</I><SUB>0</SUB> and <I>S</I><SUB>1</SUB> and a receiver <I>R</I>. <I>S</I><SUB>0</SUB> owns a secret <I>x</I> and a message <I>m</I><SUB>0</SUB>, so does <I>S</I><SUB>1</SUB> with <I>y</I> and <I>m</I><SUB>1</SUB>. In a protocol, <I>S</I><SUB>0</SUB> and <I>S</I><SUB>1</SUB> send their messages to <I>R</I> in a masked form. <I>R</I> obtains the message depending on the value of <I>Q</I>(<I>x,y</I>), i.e. <I>R</I> obtains <I>m</I><SUB>0</SUB> if <I>Q</I>(<I>x,y</I>)=0, or <I>m</I><SUB>1</SUB> otherwise. The secrets, <I>x</I> and <I>y</I>, are not revealed to <I>R</I> or the other sender, and <I>Q</I>(<I>x,y</I>) is not revealed to <I>S</I><SUB>0</SUB> and <I>S</I><SUB>1</SUB>. In addition to the formulation, we propose a concrete scheme for conditional converge cast with the "equality" predicate.</p>]]></description>
<dc:creator><![CDATA[INOUE, D., TANAKA, K.]]></dc:creator>
<dc:date>2008-06-16</dc:date>
<dc:identifier>info:doi/10.1093/ietfec/e91-a.6.1537</dc:identifier>
<dc:title><![CDATA[Conditional Converge Cast]]></dc:title>
<dc:publisher>The Institute of Electronics, Information and Communication Engineers</dc:publisher>
<prism:number>6</prism:number>
<prism:volume>E91-A</prism:volume>
<prism:endingPage>1540</prism:endingPage>
<prism:publicationDate>2008-06-01</prism:publicationDate>
<prism:startingPage>1537</prism:startingPage>
<prism:section>Regular Section - Letters - Cryptography and Information Security</prism:section>
</item>

<item rdf:about="http://ietfec.oxfordjournals.org/cgi/content/short/E91-A/6/1541?rss=1">
<title><![CDATA[Bit-Depth Scalable Video Coding Based on H.264/AVC]]></title>
<link>http://ietfec.oxfordjournals.org/cgi/content/short/E91-A/6/1541?rss=1</link>
<description><![CDATA[<p>A bit-depth scalability is proposed in an adaptive way based on modified inter-layer predictions of the spatial scalability. A simple prediction for high dynamic range (HDR) sequences is implemented to reduce the redundancy of the residual signals between the base layer which contains low dynamic range (LDR) sequences and the enhancement layer which contains HDR sequences by using scaling and offset values.</p>]]></description>
<dc:creator><![CDATA[PARK, S., RAO, K.R.]]></dc:creator>
<dc:date>2008-06-16</dc:date>
<dc:identifier>info:doi/10.1093/ietfec/e91-a.6.1541</dc:identifier>
<dc:title><![CDATA[Bit-Depth Scalable Video Coding Based on H.264/AVC]]></dc:title>
<dc:publisher>The Institute of Electronics, Information and Communication Engineers</dc:publisher>
<prism:number>6</prism:number>
<prism:volume>E91-A</prism:volume>
<prism:endingPage>1544</prism:endingPage>
<prism:publicationDate>2008-06-01</prism:publicationDate>
<prism:startingPage>1541</prism:startingPage>
<prism:section>Regular Section - Letters - Image</prism:section>
</item>

<item rdf:about="http://ietfec.oxfordjournals.org/cgi/content/short/E91-A/5/1241?rss=1">
<title><![CDATA[Identity-Based Encryptions with Tight Security Reductions to the BDH Problem]]></title>
<link>http://ietfec.oxfordjournals.org/cgi/content/short/E91-A/5/1241?rss=1</link>
<description><![CDATA[<p>We present IND-ID-CPA secure identity-based encryption (IBE) schemes with tight reductions to the bilinear Diffie-Hellman (BDH) problem. Since the methods for obtaining IND-ID-CCA secure schemes from IND-ID-CPA secure schemes with tight reductions are already known, we can consequently obtain IND-ID-CCA secure schemes with tight reductions to the BDH problem. Our constructions are based on IBE schemes with tight reductions to the list bilinear Diffie-Hellman (LBDH) problem, and the schemes are converted to those with tight reductions to the BDH problem. Interestingly, it can be shown that there exists a black box construction, in which the former IBE schemes are given as black boxes. Our constructions are very simple and reasonably efficient.</p>]]></description>
<dc:creator><![CDATA[NISHIOKA, M.]]></dc:creator>
<dc:date>2008-05-16</dc:date>
<dc:identifier>info:doi/10.1093/ietfec/e91-a.5.1241</dc:identifier>
<dc:title><![CDATA[Identity-Based Encryptions with Tight Security Reductions to the BDH Problem]]></dc:title>
<dc:publisher>The Institute of Electronics, Information and Communication Engineers</dc:publisher>
<prism:number>5</prism:number>
<prism:volume>E91-A</prism:volume>
<prism:endingPage>1252</prism:endingPage>
<prism:publicationDate>2008-05-01</prism:publicationDate>
<prism:startingPage>1241</prism:startingPage>
<prism:section>Regular Section -- Papers -- Cryptography and Information Security</prism:section>
</item>

<item rdf:about="http://ietfec.oxfordjournals.org/cgi/content/short/E91-A/5/1253?rss=1">
<title><![CDATA[A Digital Signature Scheme Based on NP-Complete Lattice Problems]]></title>
<link>http://ietfec.oxfordjournals.org/cgi/content/short/E91-A/5/1253?rss=1</link>
<description><![CDATA[<p>In [13], we proposed new decision problems related to lattices, and proved their NP-completeness. In this paper, we present a new public-key identification scheme and a digital signature scheme based on one of the problems in [13]. We also prove the security of our schemes under certain assumptions, and analyze the efficiency of ours.</p>]]></description>
<dc:creator><![CDATA[HAYASHI, S., TADA, M.]]></dc:creator>
<dc:date>2008-05-16</dc:date>
<dc:identifier>info:doi/10.1093/ietfec/e91-a.5.1253</dc:identifier>
<dc:title><![CDATA[A Digital Signature Scheme Based on NP-Complete Lattice Problems]]></dc:title>
<dc:publisher>The Institute of Electronics, Information and Communication Engineers</dc:publisher>
<prism:number>5</prism:number>
<prism:volume>E91-A</prism:volume>
<prism:endingPage>1264</prism:endingPage>
<prism:publicationDate>2008-05-01</prism:publicationDate>
<prism:startingPage>1253</prism:startingPage>
<prism:section>Regular Section -- Papers -- Cryptography and Information Security</prism:section>
</item>

<item rdf:about="http://ietfec.oxfordjournals.org/cgi/content/short/E91-A/5/1265?rss=1">
<title><![CDATA[A Simple Adaptive Algorithm for Principle Component and Independent Component Analysis]]></title>
<link>http://ietfec.oxfordjournals.org/cgi/content/short/E91-A/5/1265?rss=1</link>
<description><![CDATA[<p>In this letter we propose a simple adaptive algorithm which solves the unit-norm constrained optimization problem. Instead of conventional parameter norm based normalization, the proposed algorithm incorporates single parameter normalization which is computationally much simpler. The simulation results illustrate that the proposed algorithm performs as good as conventional ones while being computationally simpler.</p>]]></description>
<dc:creator><![CDATA[SHIN, H.-C., KIM, H.-N., SONG, W.-J.]]></dc:creator>
<dc:date>2008-05-16</dc:date>
<dc:identifier>info:doi/10.1093/ietfec/e91-a.5.1265</dc:identifier>
<dc:title><![CDATA[A Simple Adaptive Algorithm for Principle Component and Independent Component Analysis]]></dc:title>
<dc:publisher>The Institute of Electronics, Information and Communication Engineers</dc:publisher>
<prism:number>5</prism:number>
<prism:volume>E91-A</prism:volume>
<prism:endingPage>1267</prism:endingPage>
<prism:publicationDate>2008-05-01</prism:publicationDate>
<prism:startingPage>1265</prism:startingPage>
<prism:section>Regular Section -- Letters -- Digital Signal Processing</prism:section>
</item>

<item rdf:about="http://ietfec.oxfordjournals.org/cgi/content/short/E91-A/5/1268?rss=1">
<title><![CDATA[A Closed Form Solution to L2-Sensitivity Minimization of Second-Order State-Space Digital Filters]]></title>
<link>http://ietfec.oxfordjournals.org/cgi/content/short/E91-A/5/1268?rss=1</link>
<description><![CDATA[<p>This paper proposes a closed form solution to <I>L</I><SUB>2</SUB>-sensitivity minimization of second-order state-space digital filters. Restricting ourselves to the second-order case of state-space digital filters, we can express the <I>L</I><SUB>2</SUB>-sensitivity by a simple linear combination of exponential functions and formulate the <I>L</I><SUB>2</SUB>-sensitivity minimization problem by a simple polynomial equation. As a result, the <I>L</I><SUB>2</SUB>-sensitivity minimization problem can be converted into a problem to find the solution to a fourth-degree polynomial equation of constant coefficients, which can be algebraically solved in closed form without iterative calculations.</p>]]></description>
<dc:creator><![CDATA[YAMAKI, S., ABE, M., KAWAMATA, M.]]></dc:creator>
<dc:date>2008-05-16</dc:date>
<dc:identifier>info:doi/10.1093/ietfec/e91-a.5.1268</dc:identifier>
<dc:title><![CDATA[A Closed Form Solution to L2-Sensitivity Minimization of Second-Order State-Space Digital Filters]]></dc:title>
<dc:publisher>The Institute of Electronics, Information and Communication Engineers</dc:publisher>
<prism:number>5</prism:number>
<prism:volume>E91-A</prism:volume>
<prism:endingPage>1273</prism:endingPage>
<prism:publicationDate>2008-05-01</prism:publicationDate>
<prism:startingPage>1268</prism:startingPage>
<prism:section>Regular Section -- Letters -- Digital Signal Processing</prism:section>
</item>

<item rdf:about="http://ietfec.oxfordjournals.org/cgi/content/short/E91-A/5/1274?rss=1">
<title><![CDATA[A Global Stability Analysis of a Class of Nolinear Time-Delay Systems Using Continued Fraction Property]]></title>
<link>http://ietfec.oxfordjournals.org/cgi/content/short/E91-A/5/1274?rss=1</link>
<description><![CDATA[<p>We consider a class of nonlinear time delay systems with time-varying delays, and achieve a time delay independent sufficient condition for the global asymptotic stability. The sufficient condition is proved by constructing a continued fraction that represents the lower and upper bound variations of the system trajectory along the current of time, and showing that the continued fraction converges to the equilibrium point of the system. The simulation results show the validity of the sufficient condition, and illustrate that the sufficient condition is a close approximation to the unknown necessary and sufficient condition for the global asymptotic stability.</p>]]></description>
<dc:creator><![CDATA[CHOI, J.-Y.]]></dc:creator>
<dc:date>2008-05-16</dc:date>
<dc:identifier>info:doi/10.1093/ietfec/e91-a.5.1274</dc:identifier>
<dc:title><![CDATA[A Global Stability Analysis of a Class of Nolinear Time-Delay Systems Using Continued Fraction Property]]></dc:title>
<dc:publisher>The Institute of Electronics, Information and Communication Engineers</dc:publisher>
<prism:number>5</prism:number>
<prism:volume>E91-A</prism:volume>
<prism:endingPage>1277</prism:endingPage>
<prism:publicationDate>2008-05-01</prism:publicationDate>
<prism:startingPage>1274</prism:startingPage>
<prism:section>Regular Section -- Letters -- Systems and Control</prism:section>
</item>

<item rdf:about="http://ietfec.oxfordjournals.org/cgi/content/short/E91-A/5/1278?rss=1">
<title><![CDATA[Efficient Calculation of the Transition Matrix in a Max-Plus Linear State-Space Representation]]></title>
<link>http://ietfec.oxfordjournals.org/cgi/content/short/E91-A/5/1278?rss=1</link>
<description><![CDATA[<p>This research considers an efficient method for calculating the transition matrix in an MPL (Max-Plus Linear) state-space representation. This matrix can be generated by applying the Kleene star operator to an adjacency matrix. The proposed method, based on the idea of a topological sort in graph theory and block splitting, is able to calculate the transition matrix efficiently.</p>]]></description>
<dc:creator><![CDATA[GOTO, H.]]></dc:creator>
<dc:date>2008-05-16</dc:date>
<dc:identifier>info:doi/10.1093/ietfec/e91-a.5.1278</dc:identifier>
<dc:title><![CDATA[Efficient Calculation of the Transition Matrix in a Max-Plus Linear State-Space Representation]]></dc:title>
<dc:publisher>The Institute of Electronics, Information and Communication Engineers</dc:publisher>
<prism:number>5</prism:number>
<prism:volume>E91-A</prism:volume>
<prism:endingPage>1282</prism:endingPage>
<prism:publicationDate>2008-05-01</prism:publicationDate>
<prism:startingPage>1278</prism:startingPage>
<prism:section>Regular Section -- Letters -- Systems and Control</prism:section>
</item>

<item rdf:about="http://ietfec.oxfordjournals.org/cgi/content/short/E91-A/5/1283?rss=1">
<title><![CDATA[Extended MPEG Video Format for Efficient Dynamic Voltage Scaling]]></title>
<link>http://ietfec.oxfordjournals.org/cgi/content/short/E91-A/5/1283?rss=1</link>
<description><![CDATA[<p>We present an extended MPEG video format for efficient Dynamic Voltage Scaling (DVS). DVS technique has been widely researched, but the execution time variation of a periodic task (i.e. MPEG decoding) is still a challenge to be tackled. Unlike previous works, we focus on the data (video stream) rather than the execution code to overcome such limitation. The proposed video format provides the decoding costs of frames to help the precise prediction of their execution times at client machines. The experimental results show that the extended format only increases the data size less than 1% by adding about 10 bits representing the decoding cost of each frame. Also, a DVS technique adjusted for the proposed format achieves 90% of efficiency compared to the oracle case, while keeping the run time overhead of the technique negligible.</p>]]></description>
<dc:creator><![CDATA[BANG, K., BANG, S.-Y., CHUNG, E.-Y.]]></dc:creator>
<dc:date>2008-05-16</dc:date>
<dc:identifier>info:doi/10.1093/ietfec/e91-a.5.1283</dc:identifier>
<dc:title><![CDATA[Extended MPEG Video Format for Efficient Dynamic Voltage Scaling]]></dc:title>
<dc:publisher>The Institute of Electronics, Information and Communication Engineers</dc:publisher>
<prism:number>5</prism:number>
<prism:volume>E91-A</prism:volume>
<prism:endingPage>1287</prism:endingPage>
<prism:publicationDate>2008-05-01</prism:publicationDate>
<prism:startingPage>1283</prism:startingPage>
<prism:section>Regular Section -- Letters -- VLSI Design Technology and CAD</prism:section>
</item>

<item rdf:about="http://ietfec.oxfordjournals.org/cgi/content/short/E91-A/5/1288?rss=1">
<title><![CDATA[Binary Constant Weight Codes Based on Cyclic Difference Sets]]></title>
<link>http://ietfec.oxfordjournals.org/cgi/content/short/E91-A/5/1288?rss=1</link>
<description><![CDATA[<p>Based on cyclic difference sets, sequences with two-valued autocorrelation can be constructed. Using these constructed sequences, two classes of binary constant weight codes are presented. Some codes proposed in this paper are proven to be optimal.</p>]]></description>
<dc:creator><![CDATA[LI, N., ZENG, X., HU, L.]]></dc:creator>
<dc:date>2008-05-16</dc:date>
<dc:identifier>info:doi/10.1093/ietfec/e91-a.5.1288</dc:identifier>
<dc:title><![CDATA[Binary Constant Weight Codes Based on Cyclic Difference Sets]]></dc:title>
<dc:publisher>The Institute of Electronics, Information and Communication Engineers</dc:publisher>
<prism:number>5</prism:number>
<prism:volume>E91-A</prism:volume>
<prism:endingPage>1292</prism:endingPage>
<prism:publicationDate>2008-05-01</prism:publicationDate>
<prism:startingPage>1288</prism:startingPage>
<prism:section>Regular Section -- Letters -- Coding Theory</prism:section>
</item>

<item rdf:about="http://ietfec.oxfordjournals.org/cgi/content/short/E91-A/5/1293?rss=1">
<title><![CDATA[Performance of Multiband OFDM Systems with Extra Diversity]]></title>
<link>http://ietfec.oxfordjournals.org/cgi/content/short/E91-A/5/1293?rss=1</link>
<description><![CDATA[<p>This letter presents the performance of ultra-wideband multi-band orthogonal frequency division multiplexing (UWB MB-OFDM) systems with an extra diversity. To fully obtain diversity gain in the current MB-OFDM system when a time-domain spreading (TDS) is adopted, two consecutive OFDM symbols are designed to be cyclic shifted against each other. Simulation results indicate that the MB-OFDM system using additional frequency diversity outperforms conventional MB-OFDM system.</p>]]></description>
<dc:creator><![CDATA[KIM, J.-H., KIM, S.-T., SONG, H.-K., YOU, Y.-H.]]></dc:creator>
<dc:date>2008-05-16</dc:date>
<dc:identifier>info:doi/10.1093/ietfec/e91-a.5.1293</dc:identifier>
<dc:title><![CDATA[Performance of Multiband OFDM Systems with Extra Diversity]]></dc:title>
<dc:publisher>The Institute of Electronics, Information and Communication Engineers</dc:publisher>
<prism:number>5</prism:number>
<prism:volume>E91-A</prism:volume>
<prism:endingPage>1295</prism:endingPage>
<prism:publicationDate>2008-05-01</prism:publicationDate>
<prism:startingPage>1293</prism:startingPage>
<prism:section>Regular Section -- Letters -- Communication Theory and Signals</prism:section>
</item>

<item rdf:about="http://ietfec.oxfordjournals.org/cgi/content/short/E91-A/5/1296?rss=1">
<title><![CDATA[Improved Fine Frequency Synchronization Method for OFDM-Based DRM]]></title>
<link>http://ietfec.oxfordjournals.org/cgi/content/short/E91-A/5/1296?rss=1</link>
<description><![CDATA[<p>In this letter, a robust pilot-assisted synchronization scheme is proposed for estimation of residual frequency offset (RFO) in OFDM-based digital radio mondiale (DRM) system. The RFO estimator uses the gain reference pilots mainly reserved for the channel tracking in the DRM standard. To demonstrate the efficiency of the proposed RFO estimator, comparisons are made with the conventional RFO estimator using the frequency reference pilots in terms of mean square error (MSE) performance.</p>]]></description>
<dc:creator><![CDATA[YOU, Y.-H., KIM, S.-T., LEE, K.-T., SONG, H.-K.]]></dc:creator>
<dc:date>2008-05-16</dc:date>
<dc:identifier>info:doi/10.1093/ietfec/e91-a.5.1296</dc:identifier>
<dc:title><![CDATA[Improved Fine Frequency Synchronization Method for OFDM-Based DRM]]></dc:title>
<dc:publisher>The Institute of Electronics, Information and Communication Engineers</dc:publisher>
<prism:number>5</prism:number>
<prism:volume>E91-A</prism:volume>
<prism:endingPage>1298</prism:endingPage>
<prism:publicationDate>2008-05-01</prism:publicationDate>
<prism:startingPage>1296</prism:startingPage>
<prism:section>Regular Section -- Letters -- Mobile Information Network and Personal Communications</prism:section>
</item>

<item rdf:about="http://ietfec.oxfordjournals.org/cgi/content/short/E91-A/4/925?rss=1">
<title><![CDATA[Special Section on Selected Papers from the 20th Workshop on Circuits and Systems in Karuizawa]]></title>
<link>http://ietfec.oxfordjournals.org/cgi/content/short/E91-A/4/925?rss=1</link>
<description><![CDATA[]]></description>
<dc:creator><![CDATA[Abe, M.]]></dc:creator>
<dc:date>2008-04-14</dc:date>
<dc:identifier>info:doi/10.1093/ietfec/e91-a.4.925</dc:identifier>
<dc:title><![CDATA[Special Section on Selected Papers from the 20th Workshop on Circuits and Systems in Karuizawa]]></dc:title>
<dc:publisher>The Institute of Electronics, Information and Communication Engineers</dc:publisher>
<prism:number>4</prism:number>
<prism:volume>E91-A</prism:volume>
<prism:endingPage>926</prism:endingPage>
<prism:publicationDate>2008-04-01</prism:publicationDate>
<prism:startingPage>925</prism:startingPage>
<prism:section>Special Section on Selected Papers from the 20th Workshop on Circuits and Systems in Karuizawa</prism:section>
</item>

<item rdf:about="http://ietfec.oxfordjournals.org/cgi/content/short/E91-A/4/927?rss=1">
<title><![CDATA[Design of Class DE Amplifier with Nonlinear Shunt Capacitances for Any Output Q]]></title>
<link>http://ietfec.oxfordjournals.org/cgi/content/short/E91-A/4/927?rss=1</link>
<description><![CDATA[<p>This paper investigates the design curves of the class DE amplifier with the nonlinear shunt capacitances for any output <I>Q</I> and any grading coefficient <I>m</I> of the diode junction in the MOSFET. The design curves are derived by the numerical calculation using Spice. The results of this paper have two important meanings. Firstly, it is clarified that the nonlinearities of the shunt capacitances affect the design curves of the class DE amplifier, especially, for low output <I>Q</I>. Moreover, the supply voltage is a quite important parameter to design the class DE amplifier with the nonlinear shunt capacitances. Secondly, it is also clarified that the numerical design tool using Spice, which is proposed by authors, can be applied to the derivation of the design curves. This shows the possibility of the algorithm to be a powerful tool for the analysis of the class E switching circuits. The waveforms from Spice simulations denote the validity of the design curves.</p>]]></description>
<dc:creator><![CDATA[EZAWA, T., SEKIYA, H., YAHAGI, T.]]></dc:creator>
<dc:date>2008-04-14</dc:date>
<dc:identifier>info:doi/10.1093/ietfec/e91-a.4.927</dc:identifier>
<dc:title><![CDATA[Design of Class DE Amplifier with Nonlinear Shunt Capacitances for Any Output Q]]></dc:title>
<dc:publisher>The Institute of Electronics, Information and Communication Engineers</dc:publisher>
<prism:number>4</prism:number>
<prism:volume>E91-A</prism:volume>
<prism:endingPage>934</prism:endingPage>
<prism:publicationDate>2008-04-01</prism:publicationDate>
<prism:startingPage>927</prism:startingPage>
<prism:section>Special Section on Selected Papers from the 20th Workshop on Circuits and Systems in Karuizawa -- Papers</prism:section>
</item>

<item rdf:about="http://ietfec.oxfordjournals.org/cgi/content/short/E91-A/4/935?rss=1">
<title><![CDATA[Hardware Neural Network for a Visual Inspection System]]></title>
<link>http://ietfec.oxfordjournals.org/cgi/content/short/E91-A/4/935?rss=1</link>
<description><![CDATA[<p>The visual inspection of defects in products is heavily dependent on human experience and instinct. In this situation, it is difficult to reduce the production costs and to shorten the inspection time and hence the total process time. Consequently people involved in this area desire an automatic inspection system. In this paper, we propose a hardware neural network, which is expected to provide high-speed operation for automatic inspection of products. Since neural networks can learn, this is a suitable method for self-adjustment of criteria for classification. To achieve high-speed operation, we use parallel and pipelining techniques. Furthermore, we use a piecewise linear function instead of a conventional activation function in order to save hardware resources. Consequently, our proposed hardware neural network achieved 6GCPS and 2GCUPS, which in our test sample proved to be sufficiently fast.</p>]]></description>
<dc:creator><![CDATA[CHUN, S., HAYAKAWA, Y., NAKAJIMA, K.]]></dc:creator>
<dc:date>2008-04-14</dc:date>
<dc:identifier>info:doi/10.1093/ietfec/e91-a.4.935</dc:identifier>
<dc:title><![CDATA[Hardware Neural Network for a Visual Inspection System]]></dc:title>
<dc:publisher>The Institute of Electronics, Information and Communication Engineers</dc:publisher>
<prism:number>4</prism:number>
<prism:volume>E91-A</prism:volume>
<prism:endingPage>942</prism:endingPage>
<prism:publicationDate>2008-04-01</prism:publicationDate>
<prism:startingPage>935</prism:startingPage>
<prism:section>Special Section on Selected Papers from the 20th Workshop on Circuits and Systems in Karuizawa -- Papers</prism:section>
</item>

<item rdf:about="http://ietfec.oxfordjournals.org/cgi/content/short/E91-A/4/943?rss=1">
<title><![CDATA[Recalling Temporal Sequences of Patterns Using Neurons with Hysteretic Property]]></title>
<link>http://ietfec.oxfordjournals.org/cgi/content/short/E91-A/4/943?rss=1</link>
<description><![CDATA[<p>Further development of a network based on the Inverse Function Delayed (ID) model which can recall temporal sequences of patterns, is proposed. Additional advantage is taken of the negative resistance region of the ID model and its hysteretic properties by widening the negative resistance region and letting the output of the ID neuron be almost instant. Calling this neuron <I>limit ID neuron</I>, a model with limit ID neurons connected pairwise with conventional neurons enlarges the storage capacity and increases it even further by using a weightmatrix that is calculated to guarantee the storage after transforming the sequence of patterns into a linear separation problem. The network's tolerance, or the model's ability to recall a sequence, starting in a pattern with initial distortion is also investigated and by choosing a suitable value for the output delay of the conventional neuron, the distortion is gradually reduced and finally vanishes.</p>]]></description>
<dc:creator><![CDATA[SVEHOLM, J., HAYAKAWA, Y., NAKAJIMA, K.]]></dc:creator>
<dc:date>2008-04-14</dc:date>
<dc:identifier>info:doi/10.1093/ietfec/e91-a.4.943</dc:identifier>
<dc:title><![CDATA[Recalling Temporal Sequences of Patterns Using Neurons with Hysteretic Property]]></dc:title>
<dc:publisher>The Institute of Electronics, Information and Communication Engineers</dc:publisher>
<prism:number>4</prism:number>
<prism:volume>E91-A</prism:volume>
<prism:endingPage>950</prism:endingPage>
<prism:publicationDate>2008-04-01</prism:publicationDate>
<prism:startingPage>943</prism:startingPage>
<prism:section>Special Section on Selected Papers from the 20th Workshop on Circuits and Systems in Karuizawa -- Papers</prism:section>
</item>

<item rdf:about="http://ietfec.oxfordjournals.org/cgi/content/short/E91-A/4/951?rss=1">
<title><![CDATA[Application of Correlation-Based Regression Analysis for Improvement of Power Distribution Network]]></title>
<link>http://ietfec.oxfordjournals.org/cgi/content/short/E91-A/4/951?rss=1</link>
<description><![CDATA[<p>Stochastic approaches for effective power distribution network optimization are proposed. Considering node voltages obtained using dynamic voltage drop analysis as sample variables, multi-variate regression is conducted to optimize clock timing metrics, such as clock skew or jitter. Aggregate correlation coefficient (ACC) which quantifies connectivity between different chip regions is defined in order to find a possible insufficiency in wire connections of a power distribution network. Based on the ACC, we also propose a procedure using linear regression to find the most effective region for improving clock timing metrics. By using the proposed procedure, effective fixing point were obtained two orders faster than by using brute force circuit simulation.</p>]]></description>
<dc:creator><![CDATA[HAGIWARA, S., UEZONO, T., SATO, T., MASU, K.]]></dc:creator>
<dc:date>2008-04-14</dc:date>
<dc:identifier>info:doi/10.1093/ietfec/e91-a.4.951</dc:identifier>
<dc:title><![CDATA[Application of Correlation-Based Regression Analysis for Improvement of Power Distribution Network]]></dc:title>
<dc:publisher>The Institute of Electronics, Information and Communication Engineers</dc:publisher>
<prism:number>4</prism:number>
<prism:volume>E91-A</prism:volume>
<prism:endingPage>956</prism:endingPage>
<prism:publicationDate>2008-04-01</prism:publicationDate>
<prism:startingPage>951</prism:startingPage>
<prism:section>Special Section on Selected Papers from the 20th Workshop on Circuits and Systems in Karuizawa -- Papers</prism:section>
</item>

<item rdf:about="http://ietfec.oxfordjournals.org/cgi/content/short/E91-A/4/957?rss=1">
<title><![CDATA[An Evaluation Method of the Number of Monte Carlo STA Trials for Statistical Path Delay Analysis]]></title>
<link>http://ietfec.oxfordjournals.org/cgi/content/short/E91-A/4/957?rss=1</link>
<description><![CDATA[<p>We present an evaluation method for estimating the lower bound number of Monte Carlo STA trials required to obtain at least one sample which falls within top-<I>k</I> % of its parent population. The sample can be used to ensure that target designs are timing-error free with a predefined probability using the minimum computational cost. The lower bound number is represented as a closed-form formula which is general enough to be applied to other verifications. For validation, Monte Carlo STA was carried out on various benchmark data including ISCAS circuits. The minimum number of Monte Carlo runs determined using the proposed method successfully extracted one or more top-<I>k</I> % delay instances.</p>]]></description>
<dc:creator><![CDATA[IMAI, M., SATO, T., NAKAYAMA, N., MASU, K.]]></dc:creator>
<dc:date>2008-04-14</dc:date>
<dc:identifier>info:doi/10.1093/ietfec/e91-a.4.957</dc:identifier>
<dc:title><![CDATA[An Evaluation Method of the Number of Monte Carlo STA Trials for Statistical Path Delay Analysis]]></dc:title>
<dc:publisher>The Institute of Electronics, Information and Communication Engineers</dc:publisher>
<prism:number>4</prism:number>
<prism:volume>E91-A</prism:volume>
<prism:endingPage>964</prism:endingPage>
<prism:publicationDate>2008-04-01</prism:publicationDate>
<prism:startingPage>957</prism:startingPage>
<prism:section>Special Section on Selected Papers from the 20th Workshop on Circuits and Systems in Karuizawa -- Papers</prism:section>
</item>

<item rdf:about="http://ietfec.oxfordjournals.org/cgi/content/short/E91-A/4/965?rss=1">
<title><![CDATA[Novel Architecture of Feedforward Second-Order Multibit {Delta}{Sigma}AD Modulator]]></title>
<link>http://ietfec.oxfordjournals.org/cgi/content/short/E91-A/4/965?rss=1</link>
<description><![CDATA[<p>This paper proposes novel feedforward architecture of the second-order multibit AD modulator with single DAC-feedback topology. The AD modulator realizes high resolution by oversampling and noise shaping techniques. However, its SNDR (Signal to Noise and Distortion Ratio) is limited by the dynamic range of the input signal and non-idealities of circuit building blocks, particularly by the harmonic distortion in amplifier circuits. A full feedforward AD modulator structure has the signal transfer function of unity under ideal circumstances, which means that the signal swings through the loop filter become smaller compared with a feedbacked AD modulator. Therefore, the harmonic distortion generated inside the loop filter can be significantly reduced in the feedforward structure because the effect of non-idealities in amplifiers can be suppressed when signal swing is small. Moreover, the reduction of the internal signal swings also relaxes output swing requirements for amplifiers with low supply voltage. However, in conventional feedforward AD modulator, an analog adder is needed before quantizer, and especially in a multibit modulator, an additional amplifier is necessary to realize the summation of feedforward signals, which leads to extra chip area and power dissipation. In this paper, we propose a novel architecture of a feedforward AD modulator which realizes the summation of feedforward signals without additional amplifier. The proposed architecture is functionally equivalent to the conventional one but with smaller chip area and lower power dissipation. We conducted MATLAB and SPICE simulations to validate the proposed architecture and modulator circuits.</p>]]></description>
<dc:creator><![CDATA[SAN, H., KONAGAYA, H., XU, F., MOTOZAWA, A., KOBAYASHI, H., ANDO, K., YOSHIDA, H., MURAYAMA, C., MIYAZAWA, K.]]></dc:creator>
<dc:date>2008-04-14</dc:date>
<dc:identifier>info:doi/10.1093/ietfec/e91-a.4.965</dc:identifier>
<dc:title><![CDATA[Novel Architecture of Feedforward Second-Order Multibit {Delta}{Sigma}AD Modulator]]></dc:title>
<dc:publisher>The Institute of Electronics, Information and Communication Engineers</dc:publisher>
<prism:number>4</prism:number>
<prism:volume>E91-A</prism:volume>
<prism:endingPage>970</prism:endingPage>
<prism:publicationDate>2008-04-01</prism:publicationDate>
<prism:startingPage>965</prism:startingPage>
<prism:section>Special Section on Selected Papers from the 20th Workshop on Circuits and Systems in Karuizawa -- Papers</prism:section>
</item>

<item rdf:about="http://ietfec.oxfordjournals.org/cgi/content/short/E91-A/4/971?rss=1">
<title><![CDATA[A High-Speed Design of Montgomery Multiplier]]></title>
<link>http://ietfec.oxfordjournals.org/cgi/content/short/E91-A/4/971?rss=1</link>
<description><![CDATA[<p>With the increase of key length used in public cryptographic algorithms such as RSA and ECC, the speed of Montgomery multiplication becomes a bottleneck. This paper proposes a high speed design of Montgomery multiplier. Firstly, a modified scalable high-radix Montgomery algorithm is proposed to reduce critical path. Secondly, a high-radix clock-saving dataflow is proposed to support high-radix operation and one clock cycle delay in dataflow. Finally, a hardware-reused architecture is proposed to reduce the hardware cost and a parallel radix-16 design of data path is proposed to accelerate the speed. By using HHNEC 0.25 &micro;m standard cell library, the implementation results show that the total cost of Montgomery multiplier is 130 KGates, the clock frequency is 180 MHz and the throughput of 1024-bit RSA encryption is 352 kbps. This design is suitable to be used in high speed RSA or ECC encryption/decryption. As a scalable design, it supports any key-length encryption/decryption up to the size of on-chip memory.</p>]]></description>
<dc:creator><![CDATA[FAN, Y., IKENAGA, T., GOTO, S.]]></dc:creator>
<dc:date>2008-04-14</dc:date>
<dc:identifier>info:doi/10.1093/ietfec/e91-a.4.971</dc:identifier>
<dc:title><![CDATA[A High-Speed Design of Montgomery Multiplier]]></dc:title>
<dc:publisher>The Institute of Electronics, Information and Communication Engineers</dc:publisher>
<prism:number>4</prism:number>
<prism:volume>E91-A</prism:volume>
<prism:endingPage>977</prism:endingPage>
<prism:publicationDate>2008-04-01</prism:publicationDate>
<prism:startingPage>971</prism:startingPage>
<prism:section>Special Section on Selected Papers from the 20th Workshop on Circuits and Systems in Karuizawa -- Papers</prism:section>
</item>

<item rdf:about="http://ietfec.oxfordjournals.org/cgi/content/short/E91-A/4/978?rss=1">
<title><![CDATA[Color Demosaicing Using Asymmetric Directional Interpolation and Hue Vector Smoothing]]></title>
<link>http://ietfec.oxfordjournals.org/cgi/content/short/E91-A/4/978?rss=1</link>
<description><![CDATA[<p>This paper presents a color demosaicing method applied to the Bayer pattern color filter array (CFA). Reliable estimation of an edge direction, edge-directed asymmetric interpolation, and the use of color samples at immediate neighbors are considered as the key guidelines for smooth and sharp image restoration. Also, special interest is directed to local areas that are rich in high spatial frequency variations. For suppression of false colors likely to occur in those areas, a hue vector representation is introduced so that the spatial correlation between different color components may be exploited in consistent with the local constant-hue principle. Smoothing is repeated in the hue vector field a few times. Experimental results have shown preferable performances in terms of PSNR, CIELAB color difference, hue angle difference, CIE chromaticity and visual appearance, in particular resulting in less false colors.</p>]]></description>
<dc:creator><![CDATA[TAKAHASHI, Y., HIRAKI, K., KIKUCHI, H., MURAMATSU, S.]]></dc:creator>
<dc:date>2008-04-14</dc:date>
<dc:identifier>info:doi/10.1093/ietfec/e91-a.4.978</dc:identifier>
<dc:title><![CDATA[Color Demosaicing Using Asymmetric Directional Interpolation and Hue Vector Smoothing]]></dc:title>
<dc:publisher>The Institute of Electronics, Information and Communication Engineers</dc:publisher>
<prism:number>4</prism:number>
<prism:volume>E91-A</prism:volume>
<prism:endingPage>986</prism:endingPage>
<prism:publicationDate>2008-04-01</prism:publicationDate>
<prism:startingPage>978</prism:startingPage>
<prism:section>Special Section on Selected Papers from the 20th Workshop on Circuits and Systems in Karuizawa -- Papers</prism:section>
</item>

<item rdf:about="http://ietfec.oxfordjournals.org/cgi/content/short/E91-A/4/987?rss=1">
<title><![CDATA[Parallel Improved HDTV720p Targeted Propagate Partial SAD Architecture for Variable Block Size Motion Estimation in H.264/AVC]]></title>
<link>http://ietfec.oxfordjournals.org/cgi/content/short/E91-A/4/987?rss=1</link>
<description><![CDATA[<p>One hardware efficient and high speed architecture for variable block size motion estimation (VBSME) in H.264 is presented in this paper. By improving the pipeline structure and processing element (PE) circuits, the system latency and hardware cost is reduced, which makes this structure more hardware efficient than the original Propagate Partial SAD architecture. For small and middle frame size picture's coding, the proposed structure can save 12.1% hardware cost compared with original Propagate Partial SAD structure. In the case of HDTV, since small inter modes trivially contribute to the coding quality, we remove modes below 8 <FONT FACE="arial,helvetica">x</FONT> 8 in our design. By adopting mode reduction technique, when the set number of PE array is less than 8, the proposed mode reduction based Propagate Partial SAD structure can work at faster clock speed and consume less hardware cost than widely used SAD Tree architecture. It is more robust to the high speed timing constraint when parallel processing is considered. With TSMC 0.18&micro;m technology in worst work conditions (1.62 V, 125&deg;C), its peak throughput of 8-set PE array structure is 720p@30 Hz with 128 <FONT FACE="arial,helvetica">x</FONT> 64 search range and 5 reference frames. 12 k gates hardware cost can be reduced by our design compared with the parallel SAD Tree architecture.</p>]]></description>
<dc:creator><![CDATA[HUANG, Y., LIU, Z., SONG, Y., GOTO, S., IKENAGA, T.]]></dc:creator>
<dc:date>2008-04-14</dc:date>
<dc:identifier>info:doi/10.1093/ietfec/e91-a.4.987</dc:identifier>
<dc:title><![CDATA[Parallel Improved HDTV720p Targeted Propagate Partial SAD Architecture for Variable Block Size Motion Estimation in H.264/AVC]]></dc:title>
<dc:publisher>The Institute of Electronics, Information and Communication Engineers</dc:publisher>
<prism:number>4</prism:number>
<prism:volume>E91-A</prism:volume>
<prism:endingPage>997</prism:endingPage>
<prism:publicationDate>2008-04-01</prism:publicationDate>
<prism:startingPage>987</prism:startingPage>
<prism:section>Special Section on Selected Papers from the 20th Workshop on Circuits and Systems in Karuizawa -- Papers</prism:section>
</item>

<item rdf:about="http://ietfec.oxfordjournals.org/cgi/content/short/E91-A/4/998?rss=1">
<title><![CDATA[A New Progressive Image Quality Control Method for ROI Coding in JPEG2000 Standard]]></title>
<link>http://ietfec.oxfordjournals.org/cgi/content/short/E91-A/4/998?rss=1</link>
<description><![CDATA[<p>JPEG2000 still image coding standard has a feature called Region of Interest (ROI) coding. This feature can encode a restricted region in an image prior to than its background (BG) region. In low bit rate compression, the code of the ROI region occupies the most of the bit stream in the whole image and it causes the serious deterioration of the image quality in the BG region. This paper proposes a new image quality control method between the ROI region and the BG one by the one time encoding process and it can achieve more detailed image quality control. The use of ROI masks in the encoder makes it possible. The standard decoder of JPEG2000 part1 can decode the encoded data in the proposed method.</p>]]></description>
<dc:creator><![CDATA[KITAURA, Y., MUNEYASU, M., NAKANISHI, K.]]></dc:creator>
<dc:date>2008-04-14</dc:date>
<dc:identifier>info:doi/10.1093/ietfec/e91-a.4.998</dc:identifier>
<dc:title><![CDATA[A New Progressive Image Quality Control Method for ROI Coding in JPEG2000 Standard]]></dc:title>
<dc:publisher>The Institute of Electronics, Information and Communication Engineers</dc:publisher>
<prism:number>4</prism:number>
<prism:volume>E91-A</prism:volume>
<prism:endingPage>1005</prism:endingPage>
<prism:publicationDate>2008-04-01</prism:publicationDate>
<prism:startingPage>998</prism:startingPage>
<prism:section>Special Section on Selected Papers from the 20th Workshop on Circuits and Systems in Karuizawa -- Papers</prism:section>
</item>

<item rdf:about="http://ietfec.oxfordjournals.org/cgi/content/short/E91-A/4/1006?rss=1">
<title><![CDATA[Functionally Layered Video Coding for Water Level Monitoring]]></title>
<link>http://ietfec.oxfordjournals.org/cgi/content/short/E91-A/4/1006?rss=1</link>
<description><![CDATA[<p>This paper proposes a new type of layered video coding especially for the use of monitoring water level of a river. A sensor node of the system decomposes an input video signal into some kinds of component signals and produces a bit stream functionally separated into three layers. The first layer contains the minimum components effective for detecting the water level. It is transmitted at very low bit rate for regular monitoring. The second layer contains signals for thumb-nail video browsing. The third layer contains additional data for decoding the original video signal. These are transmitted in case of necessity. A video signal is decomposed into several bands with the three dimensional Haar transform. In this paper, optimum bands to be contained into the 1st layer are experimentally investigated considering both of water level detection and data size to be transmitted. As a result, bit rate for transmitting the first layer is reduced by 32.5% at the cost of negligible 3.7% decrease of recognition performance for one of video examples.</p>]]></description>
<dc:creator><![CDATA[UDOMSIRI, S., IWAHASHI, M., MURAMATSU, S.]]></dc:creator>
<dc:date>2008-04-14</dc:date>
<dc:identifier>info:doi/10.1093/ietfec/e91-a.4.1006</dc:identifier>
<dc:title><![CDATA[Functionally Layered Video Coding for Water Level Monitoring]]></dc:title>
<dc:publisher>The Institute of Electronics, Information and Communication Engineers</dc:publisher>
<prism:number>4</prism:number>
<prism:volume>E91-A</prism:volume>
<prism:endingPage>1014</prism:endingPage>
<prism:publicationDate>2008-04-01</prism:publicationDate>
<prism:startingPage>1006</prism:startingPage>
<prism:section>Special Section on Selected Papers from the 20th Workshop on Circuits and Systems in Karuizawa -- Papers</prism:section>
</item>

<item rdf:about="http://ietfec.oxfordjournals.org/cgi/content/short/E91-A/4/1015?rss=1">
<title><![CDATA[Adaptive Search Range Algorithms for Variable Block Size Motion Estimation in H.264/AVC]]></title>
<link>http://ietfec.oxfordjournals.org/cgi/content/short/E91-A/4/1015?rss=1</link>
<description><![CDATA[<p>Comparing with search pattern motion estimation (ME) algorithms, adaptive search range (ASR) algorithms are more fundamental, regular and flexible. In variable block size motion estimation (VBSME), ASR algorithms can be applied whether on a whole frame (frame level), or on an entire macroblock which includes up to forty-one blocks (macroblock level), or just on a single block (block level). In the other hand, in H.264/AVC, not the motion vectors (MVs) but the motion vector differences (MVDs) are coded and the median motion vector predictors (median-MVPs) are used to place the search centers. In this sense, it can be thought that the search windows (SWs) are centered at the positions pointed by median-MVPs, the search ranges (SRs) play the role of limiting MVDs. Thus it is reasonable for considering using MVDs to predict SRs. In this paper, one of the MB level and two of the block level, at all three MVD based SR prediction algorithms are proposed. VBSME based experiments are carried out to assess the proposed algorithms. Comparisons between the proposed three algorithms and the previously proposed one given in [8] are done in terms of encoding quality and computational complexity.</p>]]></description>
<dc:creator><![CDATA[CHEN, Z., SONG, Y., IKENAGA, T., GOTO, S.]]></dc:creator>
<dc:date>2008-04-14</dc:date>
<dc:identifier>info:doi/10.1093/ietfec/e91-a.4.1015</dc:identifier>
<dc:title><![CDATA[Adaptive Search Range Algorithms for Variable Block Size Motion Estimation in H.264/AVC]]></dc:title>
<dc:publisher>The Institute of Electronics, Information and Communication Engineers</dc:publisher>
<prism:number>4</prism:number>
<prism:volume>E91-A</prism:volume>
<prism:endingPage>1022</prism:endingPage>
<prism:publicationDate>2008-04-01</prism:publicationDate>
<prism:startingPage>1015</prism:startingPage>
<prism:section>Special Section on Selected Papers from the 20th Workshop on Circuits and Systems in Karuizawa -- Papers</prism:section>
</item>

<item rdf:about="http://ietfec.oxfordjournals.org/cgi/content/short/E91-A/4/1023?rss=1">
<title><![CDATA[A Palmprint Recognition Algorithm Using Phase-Only Correlation]]></title>
<link>http://ietfec.oxfordjournals.org/cgi/content/short/E91-A/4/1023?rss=1</link>
<description><![CDATA[<p>This paper presents a palmprint recognition algorithm using Phase-Only Correlation (POC). The use of phase components in 2D (two-dimensional) discrete Fourier transforms of palmprint images makes it possible to achieve highly robust image registration and matching. In the proposed algorithm, POC is used to align scaling, rotation and translation between two palmprint images, and evaluate similarity between them. Experimental evaluation using a palmprint image database clearly demonstrates efficient matching performance of the proposed algorithm.</p>]]></description>
<dc:creator><![CDATA[ITO, K., AOKI, T., NAKAJIMA, H., KOBAYASHI, K., HIGUCHI, T.]]></dc:creator>
<dc:date>2008-04-14</dc:date>
<dc:identifier>info:doi/10.1093/ietfec/e91-a.4.1023</dc:identifier>
<dc:title><![CDATA[A Palmprint Recognition Algorithm Using Phase-Only Correlation]]></dc:title>
<dc:publisher>The Institute of Electronics, Information and Communication Engineers</dc:publisher>
<prism:number>4</prism:number>
<prism:volume>E91-A</prism:volume>
<prism:endingPage>1030</prism:endingPage>
<prism:publicationDate>2008-04-01</prism:publicationDate>
<prism:startingPage>1023</prism:startingPage>
<prism:section>Special Section on Selected Papers from the 20th Workshop on Circuits and Systems in Karuizawa -- Papers</prism:section>
</item>

<item rdf:about="http://ietfec.oxfordjournals.org/cgi/content/short/E91-A/4/1031?rss=1">
<title><![CDATA[Cross-Correlation by Single-bit Signal Processing for Ultrasonic Distance Measurement]]></title>
<link>http://ietfec.oxfordjournals.org/cgi/content/short/E91-A/4/1031?rss=1</link>
<description><![CDATA[<p>Ultrasonic distance measurement using the pulse-echo method is based on the determination of the time of flight of ultrasonic waves. The pulse-compression technique, in which the cross-correlation function of a detected ultrasonic wave and a transmitted ultrasonic wave is obtained, is the conventional method used for improving the resolution of distance measurement. However, the calculation of a cross-correlation operation requires high-cost digital signal processing. This paper presents a new method of sensor signal processing within the pulse-compression technique using a delta-sigma modulated single-bit digital signal. The proposed sensor signal processing method consists of a cross-correlation operation employing single-bit signal processing and a smoothing operation involving a moving average filter. The proposed method reduces the calculation cost of the digital signal processing of the pulse-compression technique.</p>]]></description>
<dc:creator><![CDATA[HIRATA, S., KUROSAWA, M. K., KATAGIRI, T.]]></dc:creator>
<dc:date>2008-04-14</dc:date>
<dc:identifier>info:doi/10.1093/ietfec/e91-a.4.1031</dc:identifier>
<dc:title><![CDATA[Cross-Correlation by Single-bit Signal Processing for Ultrasonic Distance Measurement]]></dc:title>
<dc:publisher>The Institute of Electronics, Information and Communication Engineers</dc:publisher>
<prism:number>4</prism:number>
<prism:volume>E91-A</prism:volume>
<prism:endingPage>1037</prism:endingPage>
<prism:publicationDate>2008-04-01</prism:publicationDate>
<prism:startingPage>1031</prism:startingPage>
<prism:section>Special Section on Selected Papers from the 20th Workshop on Circuits and Systems in Karuizawa -- Papers</prism:section>
</item>

<item rdf:about="http://ietfec.oxfordjournals.org/cgi/content/short/E91-A/4/1038?rss=1">
<title><![CDATA[A Performance Optimized Architecture of Deblocking Filter in H.264/AVC]]></title>
<link>http://ietfec.oxfordjournals.org/cgi/content/short/E91-A/4/1038?rss=1</link>
<description><![CDATA[<p>In this paper, we propose memory and performance optimized architecture to accelerate the operation speed of adaptive deblocking filter for H.264/JVT/AVC video coding. The proposed deblocking filter executes loading/storing and filtering operations with only 192 cycles for 1 macroblock. Only 2<FONT FACE="arial,helvetica">x</FONT>4<FONT FACE="arial,helvetica">x</FONT>4 internal buffers and 32<FONT FACE="arial,helvetica">x</FONT>16 internal SRAM are adopted for the buffering operation of deblocking filter with I/O bandwidth of 32 bit. The proposed architecture can process the filtering operation for 1 macroblock with less filtering cycles and lower memory sizes than some conventional approaches of realizing deblocking filter. The efficient hardware architecture is implemented with novel data arrangement, hybrid filter scheduling and minimum number of buffer. The proposed architecture is suitable for low cost and real-time applications, and the real-time decoding with 1080HD (1920<FONT FACE="arial,helvetica">x</FONT>1088@30 fps) can be easily achieved when working frequency is 70 MHz.</p>]]></description>
<dc:creator><![CDATA[MIN, K.-Y., CHONG, J.-W.]]></dc:creator>
<dc:date>2008-04-14</dc:date>
<dc:identifier>info:doi/10.1093/ietfec/e91-a.4.1038</dc:identifier>
<dc:title><![CDATA[A Performance Optimized Architecture of Deblocking Filter in H.264/AVC]]></dc:title>
<dc:publisher>The Institute of Electronics, Information and Communication Engineers</dc:publisher>
<prism:number>4</prism:number>
<prism:volume>E91-A</prism:volume>
<prism:endingPage>1043</prism:endingPage>
<prism:publicationDate>2008-04-01</prism:publicationDate>
<prism:startingPage>1038</prism:startingPage>
<prism:section>Special Section on Selected Papers from the 20th Workshop on Circuits and Systems in Karuizawa -- Papers</prism:section>
</item>

<item rdf:about="http://ietfec.oxfordjournals.org/cgi/content/short/E91-A/4/1044?rss=1">
<title><![CDATA[Novel Register Sharing in Datapath for Structural Robustness against Delay Variation]]></title>
<link>http://ietfec.oxfordjournals.org/cgi/content/short/E91-A/4/1044?rss=1</link>
<description><![CDATA[<p>As the feature size of VLSI becomes smaller, delay variations become a serious problem in VLSI. In this paper, we propose a novel class of robustness for a datapath against delay variations, which is named structural robustness against delay variation (SRV), and propose sufficient conditions for a datapath to have SRV. A resultant circuit designed under these conditions has a larger timing margin to delay variations than previous designs without sacrificing effective computation time. In addition, under any degree of delay variations, we can always find an available clock frequency for a datapath having SRV property to operate correctly, which could be a preferable characteristic in IP-based design.</p>]]></description>
<dc:creator><![CDATA[INOUE, K., KANEKO, M., IWAGAKI, T.]]></dc:creator>
<dc:date>2008-04-14</dc:date>
<dc:identifier>info:doi/10.1093/ietfec/e91-a.4.1044</dc:identifier>
<dc:title><![CDATA[Novel Register Sharing in Datapath for Structural Robustness against Delay Variation]]></dc:title>
<dc:publisher>The Institute of Electronics, Information and Communication Engineers</dc:publisher>
<prism:number>4</prism:number>
<prism:volume>E91-A</prism:volume>
<prism:endingPage>1053</prism:endingPage>
<prism:publicationDate>2008-04-01</prism:publicationDate>
<prism:startingPage>1044</prism:startingPage>
<prism:section>Special Section on Selected Papers from the 20th Workshop on Circuits and Systems in Karuizawa -- Papers</prism:section>
</item>

<item rdf:about="http://ietfec.oxfordjournals.org/cgi/content/short/E91-A/4/1054?rss=1">
<title><![CDATA[Low Power LDPC Code Decoder Architecture Based on Intermediate Message Compression Technique]]></title>
<link>http://ietfec.oxfordjournals.org/cgi/content/short/E91-A/4/1054?rss=1</link>
<description><![CDATA[<p>Reducing the power dissipation for LDPC code decoder is a major challenging task to apply it to the practical digital communication systems. In this paper, we propose a low power LDPC code decoder architecture based on an intermediate message-compression technique which features as follows: <b>(i)</b> An intermediate message compression technique enables the decoder to reduce the required memory capacity and write power dissipation. <b>(ii)</b> A clock gated shift register based intermediate message memory architecture enables the decoder to decompress the compressed messages in a single clock cycle while reducing the read power dissipation. The combination of the above two techniques enables the decoder to reduce the power dissipation while keeping the decoding throughput. The simulation results show that the proposed architecture improves the power efficiency up to 52% and 18% compared to that of the decoder based on the overlapped schedule and the rapid convergence schedule without the proposed techniques respectively.</p>]]></description>
<dc:creator><![CDATA[SHIMIZU, K., TOGAWA, N., IKENAGA, T., GOTO, S.]]></dc:creator>
<dc:date>2008-04-14</dc:date>
<dc:identifier>info:doi/10.1093/ietfec/e91-a.4.1054</dc:identifier>
<dc:title><![CDATA[Low Power LDPC Code Decoder Architecture Based on Intermediate Message Compression Technique]]></dc:title>
<dc:publisher>The Institute of Electronics, Information and Communication Engineers</dc:publisher>
<prism:number>4</prism:number>
<prism:volume>E91-A</prism:volume>
<prism:endingPage>1061</prism:endingPage>
<prism:publicationDate>2008-04-01</prism:publicationDate>
<prism:startingPage>1054</prism:startingPage>
<prism:section>Special Section on Selected Papers from the 20th Workshop on Circuits and Systems in Karuizawa -- Papers</prism:section>
</item>

<item rdf:about="http://ietfec.oxfordjournals.org/cgi/content/short/E91-A/4/1062?rss=1">
<title><![CDATA[A Novel Expression of Spatial Correlation by a Random Curved Surface Model and Its Application to LSI Design]]></title>
<link>http://ietfec.oxfordjournals.org/cgi/content/short/E91-A/4/1062?rss=1</link>
<description><![CDATA[<p>We have proposed a random curved surface model as a new mathematical concept which enables the expression of spatial correlation. The model gives us an appropriate methodology to deal with the systematic components of device variation in an LSI chip. The key idea of the model is the fitting of a polynomial to an array of Gaussian random numbers. The curved surface is expressed by a new extension from the Legendre polynomials to form two-dimensional formulas. The formulas were proven to be suitable to express the spatial correlation with reasonable computational complexity. In this paper, we show that this approach is useful in analyzing characteristics of device variation of actual chips by using experimental data.</p>]]></description>
<dc:creator><![CDATA[OHKAWA, S.-i., MASUDA, H., INOUE, Y.]]></dc:creator>
<dc:date>2008-04-14</dc:date>
<dc:identifier>info:doi/10.1093/ietfec/e91-a.4.1062</dc:identifier>
<dc:title><![CDATA[A Novel Expression of Spatial Correlation by a Random Curved Surface Model and Its Application to LSI Design]]></dc:title>
<dc:publisher>The Institute of Electronics, Information and Communication Engineers</dc:publisher>
<prism:number>4</prism:number>
<prism:volume>E91-A</prism:volume>
<prism:endingPage>1070</prism:endingPage>
<prism:publicationDate>2008-04-01</prism:publicationDate>
<prism:startingPage>1062</prism:startingPage>
<prism:section>Special Section on Selected Papers from the 20th Workshop on Circuits and Systems in Karuizawa -- Papers</prism:section>
</item>

<item rdf:about="http://ietfec.oxfordjournals.org/cgi/content/short/E91-A/4/1071?rss=1">
<title><![CDATA[Fujimaki-Takahashi Squeeze: Linear Time Construction of Constraint Graphs of Floorplan for a Given Permutation]]></title>
<link>http://ietfec.oxfordjournals.org/cgi/content/short/E91-A/4/1071?rss=1</link>
<description><![CDATA[<p>A floorplan is a subdivision of a rectangle into rectangular faces with horizontal and vertical line segments. We call a floorplan room-to-room when adjacencies between rooms are considered. Fujimaki and Takahashi showed that any room-to-room floorplan can be represented as a permutation. In this paper, we give an <I>O</I>(<I>n</I>)-time algorithm that constructs the vertical and the horizontal constraint graphs of a floorplan for a given permutation under this representation.</p>]]></description>
<dc:creator><![CDATA[TAKAHASHI, T., FUJIMAKI, R.]]></dc:creator>
<dc:date>2008-04-14</dc:date>
<dc:identifier>info:doi/10.1093/ietfec/e91-a.4.1071</dc:identifier>
<dc:title><![CDATA[Fujimaki-Takahashi Squeeze: Linear Time Construction of Constraint Graphs of Floorplan for a Given Permutation]]></dc:title>
<dc:publisher>The Institute of Electronics, Information and Communication Engineers</dc:publisher>
<prism:number>4</prism:number>
<prism:volume>E91-A</prism:volume>
<prism:endingPage>1076</prism:endingPage>
<prism:publicationDate>2008-04-01</prism:publicationDate>
<prism:startingPage>1071</prism:startingPage>
<prism:section>Special Section on Selected Papers from the 20th Workshop on Circuits and Systems in Karuizawa -- Papers</prism:section>
</item>

<item rdf:about="http://ietfec.oxfordjournals.org/cgi/content/short/E91-A/4/1077?rss=1">
<title><![CDATA[Prevention in a Chip of EMI Noise Caused by X'tal Oscillator]]></title>
<link>http://ietfec.oxfordjournals.org/cgi/content/short/E91-A/4/1077?rss=1</link>
<description><![CDATA[<p>Developing LSIs with EMI suppression, particularly for use in automobiles, is important for improving warranties and customer acquisition. First, we describe that the measures against EMI noise caused by a X'tal oscillator are important. Next, we present a practical method for analyzing the noise with models of the inside and outside of a chip. In addition, we propose a within-chip measure against EMI noise that takes chip cost into account. The noise is suppressed by using an appropriate resistance and capacitance on the power line. Simulation results demonstrated the method's effectiveness in suppressing noise.</p>]]></description>
<dc:creator><![CDATA[KUROKAWA, A., FUJITA, H., IBE, T.]]></dc:creator>
<dc:date>2008-04-14</dc:date>
<dc:identifier>info:doi/10.1093/ietfec/e91-a.4.1077</dc:identifier>
<dc:title><![CDATA[Prevention in a Chip of EMI Noise Caused by X'tal Oscillator]]></dc:title>
<dc:publisher>The Institute of Electronics, Information and Communication Engineers</dc:publisher>
<prism:number>4</prism:number>
<prism:volume>E91-A</prism:volume>
<prism:endingPage>1083</prism:endingPage>
<prism:publicationDate>2008-04-01</prism:publicationDate>
<prism:startingPage>1077</prism:startingPage>
<prism:section>Special Section on Selected Papers from the 20th Workshop on Circuits and Systems in Karuizawa -- Papers</prism:section>
</item>

<item rdf:about="http://ietfec.oxfordjournals.org/cgi/content/short/E91-A/4/1084?rss=1">
<title><![CDATA[A Behavioral Synthesis Method with Special Functional Units]]></title>
<link>http://ietfec.oxfordjournals.org/cgi/content/short/E91-A/4/1084?rss=1</link>
<description><![CDATA[<p>This paper proposes a novel Behavioral Synthesis method that tries to reduce the number of clock cycles under clock cycle time and total functional unit area constraints using special functional units efficiently. Special functional units are designed to have shorter delay and/or smaller area than the cascaded basic functional units for specific operation patterns. For example, a Multiply-Accumulator is one of them. However, special functional units may have less flexibility for resource sharing because intermediate operation results may not be able to be obtained. Hence, almost all conventional methods can not handle special functional units efficiently for the reduction of clock cycles in practical time, especially under a tight area constraint. The proposed method makes it possible to solve module selection, scheduling, and functional unit allocation problems using special functional units in practical time with some heuristics. Experimental results show that the proposed method has achieved maximally 33% reduction of the cycles for a small application and 14% reduction for a realistic application in practical time.</p>]]></description>
<dc:creator><![CDATA[SADAKATA, T., MATSUNAGA, Y.]]></dc:creator>
<dc:date>2008-04-14</dc:date>
<dc:identifier>info:doi/10.1093/ietfec/e91-a.4.1084</dc:identifier>
<dc:title><![CDATA[A Behavioral Synthesis Method with Special Functional Units]]></dc:title>
<dc:publisher>The Institute of Electronics, Information and Communication Engineers</dc:publisher>
<prism:number>4</prism:number>
<prism:volume>E91-A</prism:volume>
<prism:endingPage>1091</prism:endingPage>
<prism:publicationDate>2008-04-01</prism:publicationDate>
<prism:startingPage>1084</prism:startingPage>
<prism:section>Special Section on Selected Papers from the 20th Workshop on Circuits and Systems in Karuizawa -- Papers</prism:section>
</item>

<item rdf:about="http://ietfec.oxfordjournals.org/cgi/content/short/E91-A/4/1092?rss=1">
<title><![CDATA[Issue Mechanism for Embedded Simultaneous Multithreading Processor]]></title>
<link>http://ietfec.oxfordjournals.org/cgi/content/short/E91-A/4/1092?rss=1</link>
<description><![CDATA[<p>Simultaneous Multithreading (SMT) technology enhances instruction throughput by issuing multiple instructions from multiple threads within one clock cycle. For in-order pipeline to each thread, SMT processors can provide large number of issued instructions close to or surpass than using out-of-order pipeline. In this work, we show an efficient issue logic for predicated instruction sequence with the parallel flag in each instruction, where the predicate register based issue control is adopted and the continuous instructions with the parallel flag of '0' are executed in parallel. The flag is pre-defined by a compiler. Instructions from different threads are issued based on the round-robin order. We also introduce an Instruction Queue skip mechanism for thread if the queue is empty. Using this kind of issue logic, we designed a 6 threads, 7-stage, in-order pipeline processor. Based on this processor, we compare round-robin issue policy (RR(<I>T</I><SUB>1</SUB>&ndash;<I>T</I><SUB>n</SUB>)) with other policies: thread one always has the highest priority (PR(<I>T</I><SUB>1</SUB>)) and thread one or thread n has the highest priority in turn (PR(<I>T</I><SUB>1</SUB>&ndash;<I>T</I><SUB>n</SUB>)). The results show that RR(<I>T</I><SUB>1</SUB>&ndash;<I>T</I><SUB>n</SUB>) policy outperforms others and PR(<I>T</I><SUB>1</SUB>&ndash;<I>T</I><SUB>n</SUB>) is almost the same to RR(<I>T</I><SUB>1</SUB>&ndash;<I>T</I><SUB>n</SUB>) from the point of view of the issued instructions per cycle.</p>]]></description>
<dc:creator><![CDATA[ZANG, C., IMAI, S., FRANK, S., KIMURA, S.]]></dc:creator>
<dc:date>2008-04-14</dc:date>
<dc:identifier>info:doi/10.1093/ietfec/e91-a.4.1092</dc:identifier>
<dc:title><![CDATA[Issue Mechanism for Embedded Simultaneous Multithreading Processor]]></dc:title>
<dc:publisher>The Institute of Electronics, Information and Communication Engineers</dc:publisher>
<prism:number>4</prism:number>
<prism:volume>E91-A</prism:volume>
<prism:endingPage>1100</prism:endingPage>
<prism:publicationDate>2008-04-01</prism:publicationDate>
<prism:startingPage>1092</prism:startingPage>
<prism:section>Special Section on Selected Papers from the 20th Workshop on Circuits and Systems in Karuizawa -- Papers</prism:section>
</item>

<item rdf:about="http://ietfec.oxfordjournals.org/cgi/content/short/E91-A/4/1101?rss=1">
<title><![CDATA[The Optimal Architecture Design of Two-Dimension Matrix Multiplication Jumping Systolic Array]]></title>
<link>http://ietfec.oxfordjournals.org/cgi/content/short/E91-A/4/1101?rss=1</link>
<description><![CDATA[