ISITA2006 The 2006 International Symposium on Information Theory … · ISITA2006 The 2006...

ISITA2006 The 2006 International Symposiumon Information Theory and its Applications

COEX, Seoul, KoreaOctober 29 – November 1, 2006

PROGRAM & ABSTRACTS

Monday 30 October

08.00 Registration08.30 - 09.30 PLENARY: Collaboration, Competition and Cognitive Radio Transmission in Wireless Networks, Professor Vahid Tarokh (Harvard University, USA),

GRAND CONFERENCE ROOM (4F)

09.30 - 10.30 PLENARY: WiBro: A Wireless Broadband Technology, Professor Daehyoung Hong (Sogang University, Korea), GRAND CONFERENCE ROOM (4F)

10.50 - 11.50 PLENARY: How to Prove the Security of Cryptography, Dr. Tatsuaki Okamoto (NTT, Japan), GRAND CONFERENCE ROOM (4F)

11.50 - 14.00 Lunch

14.00 - 15.40 CONCURRENT SESSIONS Mon1-1 - Mon1-5

SESSION Mon1-1 SESSION Mon1-2 SESSION Mon1-3 SESSION Mon1-4 SESSION Mon1-5

Coding Theory (1) Digital Right Management(1)

Shannon Theory (1) Communication Theory Turbo Codes (1)

Chair: Hitoshi Tokushige(The University of Tokushima)

Chair: Minoru Kuribayashi(Kobe University)

Chair: Tomohiko Uyematu(Tokyo Institute of Technology)

Chair: Ikuo Oka(Osaka City University)

Chair: Hidetoshi Saito(Kogakuin University)

ROOM: 1 ROOM: 2 ROOM: 3 ROOM: 4 ROOM: 5

14.00 A Constraint-Based Design ofShort Erasure Codes

Saejoon Kim, Min-Ho Shin

Improvements of theRobustness against SignalProcessing by UsingError-Correcting-Codes inDigital Watermarking –Study for Audio Data –

Satoshi Aoki, Kenji Nagasaka

A New Look at LargeDeviation Theorems

Te Sun Han

A New Trellis Shaping Designfor Peak Power Reduction ofSingle-Carrier QAM Signals

Makoto Tanahashi, Hideki Ochiai

Performance Evaluation ofHigh-Dimensional ParityCheck Code with High CodeRate

Satoru Kose, Hiroshi Kamabe

14.20 Efficient ConstructionMethod of the BestPunctured ConvolutionalCode

Yuuki Ogami, Hiroshi Sasano,Takuya Nishimura

A Music Watermark inConsideration of MP3Compression

Akio Ogihara, Nobuhiko Maeda,Motoi Iwata, Akira Shiozaki

Application of TauberianTheorem to the ExponentialDecay of the Tail Probabilityof a Random Variable

Kenji Nakagawa

A Study on Estimation ofFrequency Offset Using EMAlgorithm for Multi-CarrierSystems

Masahiro Fujii, Akihiro Waku,Makoto Itami, Yu Watanabe,Kohji Itoh

Study on Turbo DecodingUsing Hard Decision Decoder– Principle of Hard-inSoft-out Decoding –

Kazuhiko Yamaguchi, ShinyaMaehara, Brian M. Kurkoski,Kingo Kobayashi

14.40 On Construction ofReversible Variable-LengthCodes IncludingResynchronization Markersas Codewords

Dongzhao Sun, Hiroyoshi Morita,Mikihiko Nishiara

Video Watermark forDetecting Alteration onSpatial Domain andTemporal Domain

Akio Ogihara, Keisuke Tanaka,Hirofumi Toguchi, Motoi Iwata,Akira Shiozaki

Improving and ValidatingCramer-Rao BoundsThrough Higher-orderAsymptotic EstimationTheory: A Case Study

Justin Dauwels

Blind Matched Filter Methodfor Linear FrequencyModulated Pulse Radar

Fumio Nishiyama, HideoMurakami

Theoretical Analysis of BitError Probability forConvolutional Code withMax-Log MAP Decoding

Hideki Yoshikawa

15.00 A New Class of BinaryConstant Weight Codes andIts Decoding Algorithm

Jun Imai, Yoshinao Shiraki

A Scheme ofCorrelation-basedWatermarking forThree-Dimensional ComputerGraphics via TopologicalData

Yuuji Kawasaki, Hiromu Koda,Shojiro Sakata

Fisher Information andMinimum Test Sample Size

Choon Peng Tan

Detection Scheme for BurstErasures in MagneticRecording Channel

Masayuki Hayashi, Ryuji Kohno

Modified EMLMAPAlgorithm Using VariableScaling Factor for Low-powerImplemenation of TurboDecoder

Jaebum Kim, Jaehong Kim,Byeongjo Kim, Seongsu Park,Hyuncheol Park

15.20 A Note on Correlation-basedWatermarking Scheme via1-D SSKF

Takashi Hayashi, Hiromu Koda,Shojiro Sakata

Scaling Property and TsallisEntropy Uniquely Derivedfrom a FundamentalNonlinear DifferentialEquation

Hiroki Suyari, Tatsuaki Wada

A Novel EqualizationAlgorithm forFrequency-Selective Channels

Peng Wang, Wee Ser

Monday 30 October continued

15.40 - 16.00 Coffee Break

16.00 - 17.40 CONCURRENT SESSIONS Mon2-1 - Mon2-5

SESSION Mon2-1 SESSION Mon2-2 SESSION Mon2-3 SESSION Mon2-4 SESSION Mon2-5

Coding Theory (2) Digital Right Management(2)

Shannon Theory (2) Communication Systems Turbo Codes (2)

Chair: Habong Chung(Hongik University)

Chair: Motoi Iwata(Osaka Prefecture University)

Chair: Kenji Nakagawa(Nagaoka University ofTechnology)

Chair: Martin Schubert(Fraunhofer German-Sino Lab forMobile Communications)

Chair: Hideki Yoshikawa(Suzuka National College ofTechnology)


16.00 On the Correcting Propertyof a Two-dimensionalError-correcting Code Basedon the Lee Metric on Z2m

Banri Bannai, Manabu Hagiwara,Hideki Imai

Digital Watermarking withEncrypted Watermarks byUsing Masking Effects

Takahiko Oyachi, Kenji Nagasaka

A Class of AverageDistributions for MonotoneSources

Mohammadali Khosravifard,Morteza Esmaeili, Hossein Saidi,T. Aaron Gulliver

Modeling of Impulse Noisefor Indoor Broadband PowerLine Communications

Daisuke Umehara, Shinji Hirata,Satoshi Denno, YoshiteruMorihiro

Improvements andExtensions of Low-RateTurbo-Hadamard Codes

Noriyuki Shimanuki, Brian M.Kurkoski, Kazuhiko Yamaguchi,Kingo Kobayashi

16.20 A Bound on q-aryt-EC-AUED Codes andConstructions of SomeOptimal Ternary t-EC-AUEDCodes

Irina Naydenova, Torleiv Kløve

Sanitizable Signature SchemeApplying Reversible DataHiding

Minoru Kuribayashi, MasakatuMorii

Information-SpectrumCharacterization of aMulti-terminal Channel withGeneral Correlated Sources

Ken-ichi Iwata, YasutadaOohama

A Modulation ClassificationAnalysis Using JointMoments with LinearTransform

Daisuke Shimbo, Ikuo Oka,Shingo Ata

Interleaver Design for a Classof High-Rate SeriallyConcatenated Codes

Motohiko Isaka

16.40 One Conjecture forRelationship between theShift Bound and SchaubPlusBound for Cyclic Codes

Junru Zheng, Takayasu Kaida

Provider Authentication forBidirectional BroadcastingService with FixedVerification Key

Go Ohtake, Goichiro Hanaoka,Kazuto Ogawa

Source Coding of CorrelatedGaussian Vector Sources withSeveral Side Informations atthe Decoder

Yasutada Oohama

Intersymbol InterferenceCompensation Scheme inCollaboration with TransmitPre-coding and AdaptiveEqualization

Hiroshi Kubo, Shinich Mochida,Katsuyuki Motoyoshi, TakashiMizuochi, Akihiro Shibuya

Stopping Sets for IterativeRow-Column Decoding ofProduct Codes

Eirik Rosnes

17.00 Specifying the SubtreeNumber of a ContentDistribution Tree UsingVisual Cryptography

Hyunho Kang, Brian M.Kurkoski, Kazuhiko Yamaguchi,Kingo Kobayashi

Multiterminal Source Codingwith ComplementaryDelivery

Akisato Kimura, TomohikoUyematsu

Modified PN CodeAcquisition Scheme Based onAdaptive Filter UnderFrequency Selective RayleighFading Channels

Donghoon Lee, KyungwhoonCheun, Jeongchang Kim

The Double Binary TurboHybrid ARQ Scheme

Woo Suk Kwon, Jeong Woo Lee

17.20 Subset Incremental ChainBased Broadcast Encryptionwith Shorter Ciphertext

Nuttapong Attrapadung, HidekiImai

Tuesday 31 October

08.00 Registration08.30 - 10.10 CONCURRENT SESSIONS Tue1-1 - Tue1-5

SESSION Tue1-1 SESSION Tue1-2 SESSION Tue1-3 SESSION Tue1-4 SESSION Tue1-5

Coding Theory (3) Network Security Source Coding Spread Spectrum Systems MIMO (1)

Chair: Hiroshi Sasano(Kinki University)

Chair: Souhwan Jung(Soongsil University)

Chair: Hiroyoshi Morita(University ofElectro-Communications)

Chair: Minoru Okada(Nara Institute of Science andTechnology)

Chair: Hidekazu Murata(Tokyo Institute of Technology)


08.30 Optimality on ProbabilisticMinimax Robust Decoder

Libo Yang, Lei Wei

A New Secret KeyAgreement Scheme Based onEigenvalues of ChannelMatrices in Phase-ControlledMIMO Systems

Kengo Hiwatashi, Hideki Ochiai,Junji Shikata

Universal Lossy Coding forIndividual Sequences Basedon Complexity Functions

Shigeaki Kuzuoka, TomohikoUyematsu

Impact of NarrowbandInterference forDS-multiband-UWB WirelessCommunications

Yun-Seok Song, Shigenobu Sasaki,Chin Sean Sum, Hisakazu Kikuchi

Communication overHypercomplex KahlerManifolds: Capacity ofDual-PolarizedMultidimensional-MIMOChannels

Ozgur Ertug

08.50 A Comparison between WBAlgorithm and BMAlgorithm

Shojiro Sakata, Masaya Fujisawa

A Study on Detection ofVaried Worms withAnalyzing SessionInformation

Il-Ahn Cheong, Taek-Yong Nam

On the OptimumPerformance TheoreticallyAttainable for ScalarlyQuantized Correlated Sources

Thorsten Clevorn, LaurentSchmalen, Peter Vary, MarcAdrat

On Interference Mitigation ofDS-Multiband-UWB SystemOver Indoor MultipathEnvironment

Chin Sean Sum, ShigenobuSasaki, Hisakazu Kikuchi

Transceiver Optimization forMultiuser MIMO Systems:Min-Max Relative User-MSEunder a Total PowerConstraint

Shuying Shi, Martin Schubert,Holger Boche

09.10 On Behavior of RS-decoderBased on Welch-BerlekampAlgorithm for t + µ Errors

Masami Mohri, Masakatu Morii

Reliability Improved PortKnocking Scheme

Hiroyuki Tanaka, Takashi Katoh,Bhed Bahadur Bista, ToyooTakata

Bounds on ExponentiatedExpected Length of OptimalBinary Prefix Codes

Yen-Yi Lee, Jay Cheng

Short and Efficient FrequencyHopping Sequences

Young-Joon Kim, Dae-Son Kim,Hong-Yeop Song

Selecting a Near-Optimal Setof Joint Transmit-ReceiveAntennas for a MIMOChannel Based onMaximizing ChannelCapacity

Hyo-Shil Kim, Sung-Yeon Kim,Youn-Shik Byun

09.30 An Improvement to anIterative Bounded-distanceand Encoding-basedDecoding Algorithm forBinary Linear Block Codes

Hitoshi Tokushige, MarcFossorier, Toru Fujiwara, TadaoKasami

An IP Traceback Schemewith Variably ProbabilisticPacket Marking

Takeaki Terada, Masakazu Soshi,Atsuko Miyaji

Improving LZ77 DataCompression Using BitRecycling

Danny Dube, Vincent Beaudoin

Throughput Performance ofthe MPPM DS/SS ALOHASystem on the AWGNChannel

Masayuki Matsuzaki, Fumie Ono,Hiromasa Habuchi

On the Complexity ofFeedback Generation inMISO Beamforming andDiversity Schemes

Albrecht J. Fehske, PatrickMarsch, Gerhard P. Fettweis

09.50 Method for Generating aCompeting Codeword Usinga Chain of MinimumDistance Searches

Jun Asatani, Takuya Koumoto,Toru Fujiwara, Tadao Kasami

Implementation andEvaluation of DynamicProcess Resolution ProtocolActualizing LocationTransparency

Hidekazu Suzuki, Akira Watanabe

Linear-Time Encodable andDecodable Codes forSlepian-Wolf SourceNetworks

Tomohiko Uyematsu

Construction ofContinuous-Time Equivalentsof Welch Bound EqualitySequences

Joon Ho Cho


Tuesday 31 October continued

10.30 - 12.10 CONCURRENT SESSIONS Tue2-1 - Tue2-5


LDPC Codes (1) Data Security Shannon Theory (3) UWB MIMO (2)

Chair: Sae-Young Chung(KAIST)

Chair: Shunsuke Araki(Kyushu Institute of Technology)

Chair: Yasutada Oohama(Kyushu University)

Chair: Shigenobu Sasaki(Nigata University)

Chair: Eiji Okamoto(Nagoya Institute of Technology)


10.30 A Minimum Weight Test fora Certain Subclass of ArrayLDPC Codes

Kenji Sugiyama, Yuichi Kaji

Perfect (2, n) ThresholdSecret Sharing SystemsBased on Binary Matriceswith Constant ColumnWeight

Todorka Alexandrova, HiroyoshiMorita

Channel Coding Theorem forDiscrete Multipath Channel

Yoichiro Watanabe, KoichiKamoi

Effect of Multi-path on RakeReception for UWB-IRCommunications

Isamu Matsunami, KeijiTerasaka, Kenji Higashikatsuragi,Akihiro Kajiwara

Influence of Transmit andReceive Correlations onPerformance of the MIMOSystem with MultipleAntennas and RelayTerminals

Ryosuke Uchida, Hiraku Okada,Takaya Yamazato, MasaakiKatayama

10.50 On Minimal Length of QuasiCyclic LDPC Codes withGirth ≥ 6

Manabu Hagiwara, Koji Nuida,Takashi Kitagawa, MarcFossorier, Hideki Imai

Collision-Controllable HashFunction

Hidenori Kuwakado, MasakatuMorii

Outage Behavior of DiscreteMemoryless Channels UnderChannel Estimation Errors

Pablo Piantanida, Gerald Matz,Pierre Duhamel

Experimental Evaluation ofIn-home UWB-IRPropagation Characteristics

Keiji Terasaka, KenjiHigashikatsuragi, IsamuMatsunami, Akihiro Kajiwara

On Iterative Decoding inMultiuser Space-TimeCoding Systems

Ha H. Nguyen, Yajun Yang, EdShwedyk

11.10 Use of DynamicProgramming for the Designof Irregular LDPC Codes

Sang Hyun Lee, Duho Rhee, IlMu Byun, Kwang Soon Kim

A Cache Attack on SEED

Yoshitaka Ikeda, TakenoriIchikawa, Toshinobu Kaneko

Improved Bounds for theCapacity of the BinaryDeletion Channel

Hugues Mercier, Vijay K.Bhargava

Optimality of ModulatedHermite Pulses forUWB/PPM Systems

Burak Berksoy, Lei Wei

Sphere Decoder for ImperfectChannel State Estimation

Chimato Koike, RyutarohMatsumoto, Tomohiko Uyematsu

11.30 New Bit Mapping Scheme ofIrregular LDPC Codes forNonuniform GaussianChannels

Hyeong-Gun Joo, Song-NamHong, Dong-Joon Shin

ACategorizing-Guessed-ValuesApproach for the KeyRecovery Attack againstWEP

Toshihiro Ohigashi, YoshiakiShiraishi, Masakatu Morii

Multi-Band Ultra-WideBandwidth DataTransmission Using RaisedCosine Pulse Shaping

Chaiyaporn Khemapatapan

Multirate Multiuser Code forMultiple-Access AdderChannel

Jun Cheng, Koichi Kamoi,Yoichiro Watanabe

11.50 A Method for Checking theParity of (#JC − 1)/2

Masataka Akane, YasuyukiNogami, Yoshitaka Morikawa

A Simple Non-CoherentDetector for OOK on UWBChannels


12.10 - 14.00 Lunch




LDPC Codes (2) Public Key Cryptography Multi-User InformationTheory

CDMA MIMO (3)

Chair: Lei Wei(University of Central Florida)

Chair: Dong-Joon Shin(Hanyang University)

Chair: Yoichiro Watanabe(Doshisha University)

Chair: Shinji Tsuzuki(Ehime University)

Chair: Kiyomichi Araki(Tokyo Institute of Technology)


14.00 Complete Erasure Recoveryof IrregularRepeat-accumulate Codes

Saejoon Kim

Efficient Multiple Encryptionfrom OW-PCA Primitives

Yang Cui, Kazukuni Kobara,Hideki Imai

Optimal Resource Allocationfor a BidirectionalRegenerative Half-duplexRelaying

Tobias J. Oechtering, HolgerBoche

A Non-Gaussian CodingScheme that ExceedsConjectured GaussianCapacity Limit in CDMATransmission withSingle-User Decoding

Aminata Amadou Garba, JanBajcsy

A Practical Vector DirtyPaper Coding Scheme forMIMO Gaussian BroadcastChannels

Shih-Chun Lin, Hsuan-Jung Su

14.20 Cycle Analysis andInterleaver Design ofFinite-Length PuncturedLDPC Codes withDual-Diagonal ParityStructure

Yong Chun Piao, Dong-Joon Shin

A Simple Approach toEvaluate Fujisaki-OkamotoConversion in Identity BasedEncryption

Peng Yang, Takashi Kitagawa,Goichiro Hanaoka, Rui Zhang,Hajime Watanabe, KantaMatsuura, Hideki Imai

Characterization of OptimalResource Assignments in theFramework of BlockingSystem Theory

Marcin Wiczanowski, HolgerBoche, Slawomir Stanczak

CDMA Signal Design toOptimize Trade-off betweenthe Bandwidth-efficiency andPower-efficiency in UplinkSystems

Atsurou Handa, Masahiro Fujii,Makoto Itami, Kohji Itoh

Approximate MLD forMIMO Systems Using ErrorDetection Scheme Based onLRAD

Dong-Jin Lee, Ryun-Woo Kim,Youn-Shik Byun

14.40 Analysis of GeneralizedLDPC Codes with RandomComponent Codes for theBinary Erasure Channel

Enrico Paolini, Marc Fossorier,Marco Chiani

Notes on Several ID BasedCryptosystems

Ryuichi Sakai

Characterization of theFairness Gap in ResourceAllocation for WirelessCellular Networks

Holger Boche, MarcinWiczanowski, Slawomir Stanczak

Localization ofRadio-Controlled Car byAcoustic DS-CDM Signals

Shinji Tsuzuki, Naoyuki Takeichi,Yutaka Tano, Yoshio Yamada

Code Controlled SphereDecoding of Four EfficientMISO Lattices

Camilla Hollanti

15.00 Performance of Low-DensityParity-Check Codes for BurstErasure Channels

Gou Hosoya, Hideki Yagi,Toshiyasu Matsushima, ShigeichiHirasawa

A Public-Key IdentificationScheme Based on a NewLattice Problem

Shunichi Hayashi, Mitsuru Tada

On the Transport Capacity ofWireless Ad-hoc Networks

Sae-Young Chung

Generalized RandomSpreading PerformanceAnalysis of CDMA overGWSSUS Fading Channels

Ozgur Ertug

A Consideration on theComplexity Reduction ofLDPC Coded MIMO OFDMReceiver Structure

Le Khoa Nguyen, YasunoriIwanami, Eiji Okamoto

15.20 Concatenated Coding Systemwith Array and LDPC Codesfor Burst-Error Channel

Hidetoshi Saito, MasayukiHayashi, Ryuji Kohno

An Efficient N-PartyPassword-basedAuthenticated Key ExchangeProtocol

SeongHan Shin, KazukuniKobara, Hideki Imai

An Algebra for Log-ConvexInterference Functions

Holger Boche, Martin Schubert,Marcin Wiczanowski

Generalized MPSC and ItsPerformance in SynchronousOptical CDMA Systems

Tomoko K. Matsushima, YasuakiTeramachi





Iterative Decoding Data Network Network Coding Mobile Communications OFDM

Chair: Kenta Kasai(Tokyo Institute of Technology)

Chair: Yoshiaki Shiraishi(Nagoya Institute of Technology)

Chair: Ken-ichi Iwata(Yamagata University)

Chair: Kyungwhoon Cheun(POSTECH)

Chair: Makoto Itami(Tokyo University of Science)


16.00 Reducing ComputationalCost on Modified MDBFDecoding for HighDimensional Parity-CheckCode

Yuuki Funahashi, Shogo Usami,Akira Ogawa, Ichi Takumi,Masayasu Hata

Researches on MobileCommunications over aPrivate Address Area and aGlobal Address Area

Kazuto Enomoto, HidekazuSuzuki, Junichi Sakamoto, AkiraWatanabe

Characterization ofCommunication Cost Usingan Information TheoreticApproach

Terence H. Chan

A Consideration forProtection Ratio of RadioRelay System with DiversityTechniques for FrequencyCoordination

Kyoung-Whoan Suh, Joohwan Lee

New Selection Method ofNear Optimal PRT Set in TRScheme for PAPR Reductionof OFDM

Dae-Woon Lim, Hyung-Suk Noh,Jong-Seon No, Dong-Joon Shin

16.20 Reduced-ComplexityDecoding of LDPC CodesBased on the Sum-ProductAlgorithm

Seho Myung, Kyeongcheol Yang

A Proposal of Voice over IPPassing through Firewall andIts Evaluation

Masashi Ito, Akira Watanabe

Architecture for EfficientlyDecodable Network Codes

Terence H. Chan

An Improvement ofClosed-loop TransmitDiversity with ThreeTransmit Antennas

Manabu Sugawara, Eiji Okamoto,Yasunori Iwanami

Frequency Domain TurboEqualization Combined withFrequency OffsetCompensation in UplinkOFDMA Systems

Yuusuke Miyauchi, Takahiko Saba

16.40 On the Implementation ofBelief Propagation (BP)Algorithm for DecodingLow-Density Parity-Check(LDPC) Codes

Young Seob Lee, Min Seok Oh,Jin Sung Choi

Researches on Connectionsbetween WAPL and theInternet

Yoshiyuki Kato, Masashi Ito,Akira Watanabe

Calculus of ServiceGuarantees for NetworkCoding

Ali Mahmino, Jerome Lacan,Christian Fraboul

A Study on Route DiversityEffect Using Turbo Codes inMesh Networks

Tadahiro Wada, AbbasJamalipour

Turbo Detector UsingModified SISO-MLD for CCISuppression in LDPC CodedSDM-OFDM Systems

Shoichi Sasahara, Takahiko Saba

17.00 On the Decoding of LDPCCodes in IEEE 802.16eStandards for Improving theConvergence Speed

Min-Ho Jang, Beomkyu Shin,Woo-Myoung Park, Jong-SeonNo, In San Jeon

Using Hybrid Method toDetect Internet Worms byAnalyzing ICMP Type 3Messages and WormCharacteristic Matching

WenHung Su, JaeHo Lee,Tomokazu Nagata, Shiro Tamaki

Analysis of Jong NangMultiple Access Channel

MoonHo Lee, Xueqin Jiang,Chang-hui Choe, Sung Hoon Kim

Reactance-domainModulation Scheme for BurstError Reduction of ISDB-Tin Slow Fading Environment

Young-Cheol Yu, Minoru Okada,Heiichi Yamamoto

17.20 Analysis of Complexity andConvergence Speed ofSequential Schedules forDecoding LDPC Codes

Sunghwan Kim, Min-Ho Jang,Jong-Seon No, Song-Nam Hong,Dong-Joon Shin

An Error Control Scheme forthe Routing Control Onboardthe Satellite Repeater

Shunsuke Saiki, Akira Ogawa,Takaya Yamazato

A Simple Cooperative MobileSelection in CooperativeDiversity System

Sung-Yeon Kim, Hyo-Shil Kim,Youn-Shik Byun

Delay and Buffer SizeBounds for OFDM BroadcastSystems

Gerhard Wunder, Chan Zhou,Thomas Michel

18.00 - Banquet, JANBOGO HALL (3F, 335+336)

Wednesday 1 November

08.00 Registration08.30 - 10.10 CONCURRENT SESSIONS Wed1-1 - Wed1-5

SESSION Wed1-1 SESSION Wed1-2 SESSION Wed1-3 SESSION Wed1-4 SESSION Wed1-5

Weight Distribution Quantum InformationProcessing (1)

Random Number Sensor Networks Image & Speech

Chair: Marc Fossorier(University of Hawaii)

Chair: Koichi Yamazaki(Tamagawa University)

Chair: Hidenori Kuwakado(Kobe University)

Chair: Justin Dauwels(Riken Brain Science Institute)

Chair: Hiroshi Kamabe(Gifu University)


08.30 Asymptotic Average CosetWeight Distribution ofMulti-Edge Type LDPCCode Ensembles

Kenta Kasai, Yuji Shimoyama,Tomoharu Shibuya, KohichiSakaniwa

Property of OptimumQuantum Detection forMixed States with NonGaussian and Gaussian Noise

Toshiyuki Tsuchimoto, TomohiroSawada, Shogo Usami, TsuyoshiSasaki Usuda, Ichi Takumi

Generation of a DiscreteDistribution Using BiasedCoins

Danielle P. B. de A. Camara,Valdemar C. da Rocha Jr.,Cecilio Pimentel

Measurement of DistanceBetween Nodes in an Ad-hocNetwork by MultipleAcoustic Waves

Wataru Uemura, Masashi Murata

Sign-only Synthesis

Zhimei Yang, Hiroshi Kondo,Takaharu Koda, Lifeng Zhang

08.50 Support Weight Distributionof Regular LDPC CodeEnsembles

Takayuki Itsui, Kenta Kasai,Ryoji Ikegaya, TomoharuShibuya, Kohichi Sakaniwa

Characteristics of ClassicalCapacity of an AttenuatedChannel Assisted byOrthogonal Entangled States

Seiji Hattori, Tsuyoshi SasakiUsuda

Analysis for PseudorandomNumber Generators UsingLogistic Map

Shunsuke Araki, TakeruMiyazaki, Satoshi Uehara

Acoustic Sensing forDetection of ApproachingVehicles

Kensaku Asahi, FumiyasuMiyoshi, Akira Ogawa

Statistical Methods for aLarge Vocabulary ContinuousSpeech Recognition Systemfor Hindi

Kshitij Gupta, Pramod KumarSharma

09.10 New Probabilistic Algorithmto Enhance the Reliability ofComputed WeightDistribution of LDPC Codes

Masanori Hirotomo, MasamiMohri, Masakatu Morii

Counter-examples of theTrace Inequalities Related tothe Auxiliary Function of theQuantum Reliability Function

Shigeru Furuichi, Kenjiro Yanagi

Correction of OverlappingTemplate Matching TestIncluded in NISTRandomness Test Suite

Kenji Hamano, ToshinobuKaneko

Bayes Stopping Rule forWireless Sensor Networks

Jin Kyung Park, Woo Cheol Shin,Jun Ha, Cheon Won Choi

Supplement to a Theorem forBiorthogonal Bases ofWavelets and a Considerationof Four-term Sequence (hn)

Hajime Sato

09.30 An Efficient Method forComputing the MinimumWeight of High Rate BinaryCyclic Codes

Zheyu Li, Masami Mohri,Masakatu Morii

Artificial but Fully QuantumDescription Approach toQuantum State DistinctionProblem

Kentaro Imafuku, Hideki Imai

A KeystreamResynchronization by Timeand Precision Information

Janghong Yoon

Iterative JointChannel-Decoding SchemeUsing the Correlation ofTransmitted InformationSequences in SensorNetworks

Kentaro Kobayashi, TakayaYamazato, Hiraku Okada,Masaaki Katayama

Application of BackgroundSubtraction with RenewableBackground to GestureRegion Extraction

Akio Ogihara, HiroshiMatsumoto, Akira Shiozaki

09.50 On Relation between theDefining Set and the WeightDistribution for Cyclic Codes

Takayasu Kaida, Junru Zheng

An Effective Simple FuzzyApproach for Stable RealRandom Number Generator

Sunchun Park, Youngmi Park,Daesun Park, Chunsu Kim,ChoogHo Cho

A Study on the Expansion ofa Resolution ConversionMethod into Rational ScaleUsing Neighboring Blocks’DCT Coefficients

Tomio Goto, Yoshihiro Shinkai,Masaru Sakurai, TadashiKitamura

Wednesday 1 November continued


10.30 - 11.50 CONCURRENT SESSIONS Wed2-1 - Wed2-5

SESSION Wed2-1 SESSION Wed2-2 SESSION Wed2-3 SESSION Wed2-4 SESSION Wed2-5

Coded Modulation andSpace-Time Codes

Quantum InformationProcessing (2)

Pattern Recognition Ad Hoc Networks Sequences

Chair: Kazuhiko Yamaguchi(University ofElectro-Communications)

Chair: Ryutaroh Matsumoto(Tokyo Institute of Technology)

Chair: Tomoko K. Matsushima(Polytechnic University)

Chair: Takaya Yamazato(Nagoya University)

Chair: Takayasu Kaida(Kinki University)


10.30 Improved Decoding for TrellisCoded Modulation with aConvolutional Processor

Yeong-Luh Ueng, Ruey-Yi Wei,Chia-Jung Yeh, Mao-Chao Lin,Jun-Yun Lu

Entanglement of Formation ofa Decohered Quasi-Bell State

Ryutaro Yamamoto, TsuyoshiSasaki Usuda, Ichi Takumi

A Note on SpellingCorrection Methods Basedupon Statistical DecisionTheory

Yasunari Maeda, Hideki Yoshida,Yoshitaka Fujiwara, ToshiyasuMatsushima

Equalization Techniques forMultihop CooperativeWireless Networks withAsynchronous Relaying

Ryu Yamashita, HidekazuMurata, Susumu Yoshida,Kiyomichi Araki

Correlation Distribution ofQuadriphase ZCZ SequencesObtained from a PerfectSequence and a UnitaryMatrix

Shuichi Jono, Satoshi Uehara

10.50 Golden Space-Time TrellisCoded Modulation

Yi Hong, Emanuele Viterbo,Jean-Claude Belfiore

Quantum Secure DirectCommunication Protocols forSending a Quantum State

Yumiko Murakami, MasakiNakanishi, Manabu Hagiwara,Shigeru Yamashita, YasuhikoNakashima

Fast Nearest Neighbor SearchAlgorithm for WaveformQuantization UsingReflection Group

Shuichi Maki, NobumotoYamane, Yoshitaka Morikawa

Adaptive ModulationSchemes for MultihopCooperative WirelessNetworks

Bao Thi Ngoc Pham, HidekazuMurata, Susumu Yoshida,Kiyomichi Araki

Higher DimensionalComplete-ComplementarySequences: A GeneralApproach

R. S. Raja Durai, Naoki Suehiro

11.10 New Optimal Rate-DiversityTradeoff Space-Time Codeswith Adaptive IterativeDecoding

Wen-Hsien Chiu, Hsuan-Jung Su

Uncertainty Principle andOblivious Transfer

Takayuki Miyadera, Hideki Imai

The Entropy Potential of aDiscrete ProbabilityDistribution

Jan Poland

Adaptive Node SelectionAlgorithm for Co-operativeMulti-hop Networks

Ryu Atsuta, Takahiko Saba

On the Relationship ofSidel’nikov Sequences

Tae-Hyung Lim, Young-Sik Kim,Jung-Soo Chung, Jong-Seon No

11.30 Performance ComparisonBetween ConventionalSpace-Time Block Code andProposed ConstellationRotation Space-Time Codes

Mea-Hwa Park, Hyo-Shil Kim,Jong-Deuk Kim, Youn-Shik Byun

PerfectSingle-Error-CorrectingBinary Code for InteractiveSecret Key Reconciliation

Koichi Yamazaki

User Verification Method byBiometric Feature inKeystroke Motion and KeyPress Timing

Akio Ogihara, HiroyukiMatsumura, Akira Shiozaki

Implementation of MobilePPC Realizing Mobility ofMobile Nodes

Masaki Sejimo, Akira Watanabe

ISITA2006 The 2006 International Symposiumon Information Theory and its Applications

COEX, Seoul, KoreaOctober 29 – November 1, 2006

ABSTRACTS

Mon1-1 Coding Theory (1) . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 1Mon1-2 Digital Right Management (1) . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 1Mon1-3 Shannon Theory (1) . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 2Mon1-4 Communication Theory . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 2Mon1-5 Turbo Codes (1) . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 3Mon2-1 Coding Theory (2) . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 3Mon2-2 Digital Right Management (2) . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 3Mon2-3 Shannon Theory (2) . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 4Mon2-4 Communication Systems . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 4Mon2-5 Turbo Codes (2) . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 5Tue1-1 Coding Theory (3) . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 5Tue1-2 Network Security . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 6Tue1-3 Source Coding . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 7Tue1-4 Spread Spectrum Systems . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 7Tue1-5 MIMO (1) . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 8Tue2-1 LDPC Codes (1) . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 8Tue2-2 Data Security . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 9Tue2-3 Shannon Theory (3) . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 9Tue2-4 UWB . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 10Tue2-5 MIMO (2) . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 10Tue3-1 LDPC Codes (2) . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 11Tue3-2 Public Key Cryptography . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 11Tue3-3 Multi-User Information Theory . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 12Tue3-4 CDMA . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 12Tue3-5 MIMO (3) . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 13Tue4-1 Iterative Decoding . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 14Tue4-2 Data Network . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 14Tue4-3 Network Coding . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 15Tue4-4 Mobile Communications . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 15Tue4-5 OFDM . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 16Wed1-1 Weight Distribution . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 16Wed1-2 Quantum Information Processing (1) . . . . . . . . . . . . . . . . . . . . . . . . . 17Wed1-3 Random Number . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 17Wed1-4 Sensor Networks . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 18Wed1-5 Image & Speech . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 18Wed2-1 Coded Modulation and Space-Time Codes . . . . . . . . . . . . . . . . . . . . . . 19Wed2-2 Quantum Information Processing (2) . . . . . . . . . . . . . . . . . . . . . . . . . 20Wed2-3 Pattern Recognition . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 20Wed2-4 Ad Hoc Networks . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 20Wed2-5 Sequences . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 21

ISITA 2006 October 29 - November 1, 2006, Seoul, Korea

Mon1-1 : Coding Theory (1)

A Constraint-Based Design of Short Erasure Codes

Saejoon Kim, Min-Ho Shin

The design of erasure codes of short code lengths is considered.The proposed codes perform pretty well and significantly out-perform optimal degree distribution-generated codes. It is alsoshown that the use of regular codes suffices to achieve very lowloss recovery failure probability and that LDPC codes are in-herently superior to the extended IRA codes of Yang et al. atfinite code lengths.

Efficient Construction Method of the Best PuncturedConvolutional Code

Yuuki Ogami, Hiroshi Sasano, Takuya Nishimura

It has been shown that for any punctured convolutional codethere exists a high rate convolutional code (equivalent code)whose weight spectrum is the same as that of the puncturedcode. We present a new method for constructing best punc-tured convolutional codes. In the method, we search forthe best equivalent code and derive the best punctured codefrom it. Using the method, we can reduce the number ofcandidates of the high rate code then we can obtain bestpunctured codes with relatively large constraint length. Weshow some new best punctured convolutional codes with ratesR = (n − 1)/n, (n = 1, 2, · · · , 10).

On Construction of Reversible Variable-Length CodesIncluding Resynchronization Markers as Codewords

Dongzhao Sun, Hiroyoshi Morita, Mikihiko Nishiara

A reversible variable-length code (RVLC) is a code such thatno codeword is a prefix or a suffix of any other codeword. AnRVLC can decode backward as well as forward starting at aspecial resynchronization marker (re-sync) that is periodicallyinserted into the sequence of codewords. In this paper, we pro-pose an algorithm to construct an RVLC in which some code-words function as re-sync. Some codewords in the RVLC arereplaced by minimum forbidden words (MFW) of a sequenceof codewords. MFWs can be obtained from the antidictionaryassociated with the sequence.

A New Class of Binary Constant Weight Codes andIts Decoding Algorithm

Jun Imai, Yoshinao Shiraki

This paper proposes a new class of binary constant weightcodes as well as a decoding algorithm for it. Let A(n, d, w)denote the maximum possible number of code words inbinary (n, d, w) constant weight codes. Unknown in-stances still remain for larger (n, d, w)s. The proposedclass of binary constant weight codes fills in the remain-ing blank instances of (n, d, w)s . Our new constructiontechnique is performed by considering a triad (G, Ω, f) :=(”Group G”, ”SetΩ, ”Action f on Ω”) simultaneously. More-over, we describe a decoding algorithm for proposed class ofconstant weight codes.

Mon1-2 : Digital Right Management (1)

Improvements of the Robustness against SignalProcessing by Using Error-Correcting-Codes inDigital Watermarking – Study for Audio Data –

Satoshi Aoki, Kenji Nagasaka

This note is an improvement of our former notes [5], [1] and[2]. For [5], we do not have physical random number generatingdevice, but the frame work of digital watermarking for audiosignal data is settled. The physical random number generatingdevice made by Aoki[1] has outputs with so small value of au-tocorrelation function that we consider this property to applyspectrum spreading. Indeed this idea is affirmative in [2]. Thento tackle the difficult problem of breaking digitalwatermarkingembedded, introduce error correcting code and against the de-

tection trial introduce an encryption system. Those two intro-duction is our idea and for the moment, our idea may not giveenough results and remains many problems.

A Music Watermark in Consideration of MP3Compression

Akio Ogihara, Nobuhiko Maeda, Motoi Iwata, Akira Shiozaki

Recently, copyright infringement becomes a social problemsuch as some rogues illegally distribute the reproduction onthe Internet. These illegal distributors often use MP3 (MPEGaudio layer-3) compression which is usually used in personalcomputer, portable IC audio player, etc. MP3 compressionoccasionally erases the digital watermark which is preventiontechnique against the copyright infringement. Hence we pro-pose a new watermarking method for audio data in considera-tion of MP3 compression. In the proposed method, watermarkis embedded in large MDCT (modified discrete cosine trans-form) coefficients by avoiding small MDCT coefficients, be-cause it is highly possible that the magnitude relation of smallMDCT coefficients is destroyed by MP3 compression. More-over, we improve the above method by avoiding the fragilelarge MDCT coefficients according to the correlation betweenthe fragileness of MDCT coefficients and the parameters whichare used in MP3 encoding process.

Video Watermark for Detecting Alteration on SpatialDomain and Temporal Domain

Akio Ogihara, Keisuke Tanaka, Hirofumi Toguchi, MotoiIwata, Akira Shiozaki

We propose a new video watermarking method for detectingalteration. In the proposed method, the watermark for eachframe (frame length = 1/30 second) is determined by a secretkey, and then it is embedded in LL4 DWT (discrete wavelettransform) coefficient of image data and MDCT (modified dis-crete cosine transform) coefficient of sound data. By check-ing whether extracted watermark is correct or not, we can de-tect the alteration of the video data. By using the proposedmethod, we can detect alteration on both spatial domain andtemporal domain.

A Scheme of Correlation-based Watermarking forThree-Dimensional Computer Graphics viaTopological Data

Yuuji Kawasaki, Hiromu Koda, Shojiro Sakata

In this paper we propose a scheme of correlation-based wa-termarking for three-dimensional(3-D) computer graphics viatopological data, and examine the resistance to some funda-mental attacks. First, we formulate the structure of 3-D polyg-onal models. Next, we explain a spread sequence(i.e. M-sequence) that is concerned with our scheme, and propose ascheme of correlation-based watermarking for 3-D computergraphics via topological data. The experimental results forsome test models show that the watermark information in eachmodel can be detected by our scheme even when the water-marked models are subjected to attack such as additive ran-dom noise.

A Note on Correlation-based Watermarking Schemevia 1-D SSKF

Takashi Hayashi, Hiromu Koda, Shojiro Sakata

In this paper, we present a scheme of correlation-based wa-termarking via 1-D SSKF(Symmetric Short Kernel Filter).First, we formulate 5/3 taps SSKF, orthogonal transform andbiorthogonal transform. Next, we explain an oblivious algo-rithm for the watermarking in wavelet transform (WT) do-main, which need not refer to original images in order to de-tect watermarks. The experimental results for some test im-ages show that watermark information in each image can bedetected sensitively by our scheme even when the watermarkedimages are subjected to processing technique such as clipping.

1


Mon1-3 : Shannon Theory (1)

A New Look at Large Deviation Theorems

Te Sun Han

In this paper we show some new look at large deviation the-orems from the viewpoint of the informationspectrum (IS)methods, which has been first exploited in information the-ory, and also demonstrate a new basic formula for the largedeviation rate function in general, which is expressed as a pairof the lower and upper IS rate functions.

Application of Tauberian Theorem to theExponential Decay of the Tail Probability of aRandom Variable

Kenji Nakagawa

We give a sufficient condition for the exponential decay of thetail probability of a non-negative random variable. We considerthe Laplace-Stieltjes transform of the probability distributionfunction of the random variable. We show a theorem that ifthe abscissa of convergence of the LS transform is negative fi-nite and the real point on the axis of convergence is a poleof the LS transform, then the tail probability decays expo-nentially. For the proof of the theorem, we extend and applyso-called a finite form of Ikehara’s complex Tauberian theoremby Graham-Vaaler.

Improving and Validating Cramer-Rao BoundsThrough Higher-order Asymptotic EstimationTheory: A Case Study

Justin Dauwels

The Cramer-Rao bound (CRB) is a well-known lower boundon the mean square estimation error. The CRB has been com-puted for numerous estimation problems in digital communi-cations, signal processing, and beyond. In many interestingapplications (as for example phase, frequency and timing syn-chronization, which are estimation problems that appear in thecontext of digital communications), the Cramer-Rao bound isonly valid in the limit of an infinite number of observations. Inpractice, the number of observations is obviously finite and theCRB may not be applicable. For example, the CRB for theproblem of phase estimation (with a finite number of observa-tions) is invalid for low signal-to-noise ratios. In this paper, wedemonstrate (by means of higher-order asymptotic estimationtheory) (i) how the validity of the CRB (for a finite numberof observations) can be verified; (ii) how the CRB can be im-proved. As an illustration, we consider the problem of jointphase and variance estimation.

Fisher Information and Minimum Test Sample Size

Choon Peng Tan

It is well-known that the maximum likelihood estimator of aparameter has an asymptotic normal distribution subject tocertain regularity conditions. We consider a simple hypothe-ses testing problem where a normalized maximum likelihoodestimator is used as a test statistic. The Fisher index of dis-crimination of this test statistic is shown to be a function of thesample size and the Fisher informations of the probability den-sity functions under testing. Utilizing a previous theorem ofthe author, we show that the Fisher index converges to a con-stant depending only on the pre-assigned Type I and Type IIerror probabilities as the minimum sample size required for thetest goes to infinity. This result can be applied to estimate theminimum sample sizes of tests using the Fisher informations.In particular, we consider tests on certain functions of the pa-rameters of a probability density function belonging to the reg-ular exponential class using a normalized version of a maximumlikelihood estimator achieving the Cramer-Rao lower bound forthe variance of the unbiased estimators of that function of theparameter. In this case, there is a clear relationship betweenthe Fisher information and the minimum test sample size inthe limit of the Fisher index.

Scaling Property and Tsallis Entropy UniquelyDerived from a Fundamental Nonlinear DifferentialEquation

Hiroki Suyari, Tatsuaki Wada

We derive a scaling property from a fundamental nonlinear dif-ferential equation whose solution is the so-called q-exponentialfunction. A scaling property has been believed to be givenby a power function only, but actually more general expres-sion for the scaling property is found to be a solution of theabove fundamental nonlinear differential equation. In fact, anypower function is obtained by restricting the domain of the q-exponential function appropriately. As similarly as the cor-respondence between the exponential function and Shannonentropy, an appropriate generalization of Shannon entropy isexpected for the scaling property. Although the q-exponentialfunction is often appeared in the optimal distributions of someone-parameter generalized entropies such as Renyi entropy,only Tsallis entropy is uniquely derived from the algebra ofthe q -exponential function, whose uniqueness is shown in thetwo ways in this paper.

Mon1-4 : Communication Theory

A New Trellis Shaping Design for Peak PowerReduction of Single-Carrier QAM Signals

Makoto Tanahashi, Hideki Ochiai

In this paper, we propose a new trellis shaping design forpeak power reduction of single-carrier QAM signals. Simu-lation results show that significant reduction of peak powercan be achieved. The performance of the proposed system isalso compared with several other known peak power reduc-tion techniques in terms of the trade-offs between peak powerefficiency and information rate.

A Study on Estimation of Frequency Offset UsingEM Algorithm for Multi-Carrier Systems

Masahiro Fujii, Akihiro Waku, Makoto Itami, Yu Watanabe,Kohji Itoh

Orthogonal Frequency Division Multiplexing (OFDM) systemsare very sensitive to the frequency offset of the local oscillatorat the receiver. For the same reason, estimation of the fre-quency characteristics, needed for OFDM to be adapted tothe frequency selective fading, can only be carried out con-ventionally after the frequency offset has been compensated.And accurate estimation of large frequency offset certainly re-quires high precision estimate of the frequency characteristics.In this paper, we propose a new joint estimation method ofthe frequency offset and the channel frequency response us-ing an Expectation-Maximization (EM) algorithm for OFDMsystems. The proposed algorithm overcomes the limitation ofthe thus far proposed algorithm. By computer simulations,we show the proposed algorithm provides estimation accuracyclose to its lower bound in a wide range of the frequency offset.

Blind Matched Filter Method for Linear FrequencyModulated Pulse Radar

Fumio Nishiyama, Hideo Murakami

Linear frequency modulation has been used in air search radarprimarily for pulse compression. Received signals observed bylinear frequency modulated pulse radar are of target signalsor clutter signals with different carrier frequencies. In severalcases, received target data with different carrier frequencieshave stronger correlation than clutter data has. In these cases,target data is assumed to follow the statistics of a MovingAverage (MA) model, in spite of the fact that the statistics arenot known in advance. The MA parameter is estimated fromonly the received data by the blind matched filter method.The matched filter is designed based on this estimated MAparameter. Signal-to-clutter Ratio is improved by this matchedfilter.

2


Detection Scheme for Burst Erasures in MagneticRecording Channel

Masayuki Hayashi, Ryuji Kohno

In practical magnetic recording channel, burst erasures occurin addition to random error. It is well known that burst era-sures are caused by thermal asperity (TA) and media defect(MD). In this paper, the detection scheme of the position ofburst erasures is proposed. Proposed scheme utilizes the powermonitoring of the read signal after equalization and calculatesthe erasure position and the erasure length. We show thatthe sequence estimation with viterbi algorithm using this bursterasure position and burst erasure depth as channel state infor-mation (CSI) outperforms the conventional scheme in perpen-dicular magnetic recording channels. Furthermore, we studiedjoint design schemes with error correcting code (ECC).

A Novel Equalization Algorithm forFrequency-Selective Channels

Peng Wang, Wee Ser

A common strategy to combat channel frequency selectivity isto implement an inverse filtering process at the receiver to re-cover the transmitted signal. This paper, however, introduces adifferent equalization algorithm. By adapting the decision ruleto the time-varying inter-symbol interference, the proposed al-gorithm can provide satisfactory performance for a variety ofchannels.

Mon1-5 : Turbo Codes (1)

Performance Evaluation of High-Dimensional ParityCheck Code with High Code Rate

Satoru Kose, Hiroshi Kamabe

The simplicity of encoding and decoding procedures of a code isan important factor when these procedures are implemented inpractical systems. The structure of a high dimensional paritycode with high code rate (HDPChc ) is very simple and thereis a very simple hard decoding procedure. In this paper weshow the performance of the code when we use the code as aconstituent code for a iterated coding scheme by P. Elias andD. Rankin et al.

Study on Turbo Decoding Using Hard DecisionDecoder – Principle of Hard-in Soft-out Decoding –

Kazuhiko Yamaguchi, Shinya Maehara, Brian M. Kurkoski,Kingo Kobayashi

We propose a new construction and decoding method for con-catenated codes. One of the target coding schemes is a serially-concatenated coding scheme with a turbo code as the innercode and a Reed-Solomon (or other block) code as the outercode. The proposed decoding strategies include following twopoints. (1) New repetitive diagram of whole serial concate-nated code is investigated. (2) To reduce complexity, hard-input soft-output decoding for the outer code is applied. Us-ing a double error-correcting Reed-Solomon code as outer code,the results are evaluated and discussed.

Theoretical Analysis of Bit Error Probability forConvolutional Code with Max-Log MAP Decoding

Hideki YoshikawaIn this paper, an analytical technique for bit error probabilityof 4-state convolutional code with Max-Log-MAP decoding ispresented. This technique employs an iterative calculation ofprobability density function of state metric per a transition,and gives exact bit error probability for all SNR.

Modified EMLMAP Algorithm Using VariableScaling Factor for Low-power Implemenation ofTurbo Decoder

Jaebum Kim, Jaehong Kim, Byeongjo Kim, Seongsu Park,Hyuncheol Park

We propose a modified enhanced max-log-MAP (EMLMAP)algorithm using variable scaling factors (SFs) for low-power im-plementations of a Turbo decoder. We find the sub-optimumSFs α which are quantized from 0.6 to 0.9 using extrinsictransfer characteristics (EXIT) analysis. Based on the anal-ysis, the variation scheme of the SF is described, which is afunction of half-iteration hard-decision-aided (HIHDA) earlytermination criteria S. Using computer simulations applying8-state WCDMA Turbo codes of the rate R = 1/3 on memory-less binary-input continuous-output AWGN channel, we ana-lyze the BER performance and average number of iterations ofthe proposed algorithm by comparing that of the conventionalEMLMAP algorithm which is applied fixed SF and HIHDAearly termination scheme. According to results of the simu-lations, the proposed algorithm has low-power efficiency andimprovement in BER performance for a large interleaver oflength N > 3000.

Mon2-1 : Coding Theory (2)

On the Correcting Property of a Two-dimensionalError-correcting Code Based on the Lee Metric onZ2m

Banri Bannai, Manabu Hagiwara, Hideki Imai

A method for constructing Lee metric codes over arbitrary al-phabet sizes and its decoding way is presented. This codeis constructed without using the previously known techniquessuch as Galois rings and Gray map. In this paper, we introducethe code over Z2m and consider it when code length is 2. Wefind that whether m is even or odd is deeply concerned withthe Lee-error-correcting property t. To know t is difficult whenm is odd, however we find the way evaluating t from lower sideover any Z2m . We also show that the codes can correct errorwhich exceeds t in some special cases, and that our decodingmethod approximates the bounded distance decoding when mis sufficiently small.

A Bound on q-ary t-EC-AUED Codes andConstructions of Some Optimal Ternary t-EC-AUEDCodes

Irina Naydenova, Torleiv Kløve

Boinck and van Tilborg gave a bound on the length of binaryt-EC-AUED codes. In this paper a generalization of this boundto arbitrary alphabet size is given. This generalized Boinck-vanTilborg bound, combined with constructions, is used to deter-mine the length of some optimal ternary t-EC-AUED codes.An illustration of the the constructing method is given by con-structing optimal ternary t-EC-AUED codes with size up to9.

One Conjecture for Relationship between the ShiftBound and SchaubPlus Bound for Cyclic Codes

Junru Zheng, Takayasu Kaida

The Schaub bound is one of well-known lower bounds of theminimum distance for a cyclic code, and defined from its defin-ing sequence. In 2003, this bound was improved and an algo-rithm for this improved bound called SchaubPlus bound wasproposed by F.Ponchio and M.Sala. In this paper, we willclaim one conjecture from numerical examples in binary andternary cases.

Mon2-2 : Digital Right Management (2)

Digital Watermarking with Encrypted Watermarksby Using Masking Effects

Takahiko Oyachi, Kenji Nagasaka

In this note, we propose a method of embedding digital water-marks into digital still image keeping the quality of the embed-ded image. By using our method, the detection of embeddedwatermarks becomes harder, since they are encrypted. Theencrypted digital watermarks are also converted into a certaincode, with this code, the possibility of obtaining correct digitalwatermarks embedded against the overwriting and various de-structions to the digital watermarking images. We need fairly

3


big number of bits to imbed digital watermarks and we make itpossible to embedding bits by generalizing the idea of maskingeffects, which will be discussed else where.

Sanitizable Signature Scheme Applying ReversibleData Hiding

Minoru Kuribayashi, Masakatu Morii

When a document to be public contains the privacy or diplo-matic information, such parts should be closed. However, adigital signature is attached with the document for the verifi-cation of the alteration on a digital document, no modificationis allowed in general. The sanitizable signature scheme is oneof the solutions which allows the conditional modification onthe original document. In this paper, we proposed a new san-itizable signature scheme applying the reversible data hidingtechnique. In order to store the information concerning to clos-ing parts of an original document, it is directly embedded intothe disclosing parts of the document. Then generating a signa-ture on such distorted and sanitized document, the integrity ofboth the document and the disclosing conditions determinedby a sanitizer is assured in our scheme. Since the embeddingoperation is completely reversible, the original disclosing partsof the document can be recovered, hence the verification of thesigner’s signature is possible.

Provider Authentication for BidirectionalBroadcasting Service with Fixed Verification Key

Go Ohtake, Goichiro Hanaoka, Kazuto Ogawa

Several content distribution services via the Internet have beendeveloped, and a number of bidirectional broadcasting serviceswill be provided in the near future. To gain access to these ser-vices, a user must transmit personal information to a broad-caster through a network. This information may be leaked toa third party who impersonates the broadcaster, so providerauthentication using a digital signature scheme is necessary toensure the secure transfer of information. If the broadcaster’ssigning key is leaked to a third party, they could easily im-personate the broadcaster. To minimize damage caused byimpersonation, we propose a content distribution system thatenables secure provider authentication for bidirectional broad-casting services with fixed verification key even when a sign-ing key is leaked. The system enables users to securely sendpersonal information to the broadcaster while obtaining bidi-rectional broadcasting services.

Specifying the Subtree Number of a ContentDistribution Tree Using Visual Cryptography

Hyunho Kang, Brian M. Kurkoski, Kazuhiko Yamaguchi,Kingo Kobayashi

In our previous study, we have presented an approach for avideo fingerprinting system. Recently, we have proposed somemethods for generalization and considered tree specific andendbuyer specific problem under collusion attacks. In this pa-per, we use a visual cryptography scheme to minimize dete-rioration of tree-specific problem in our previous work. Thisapproach is able to detect distinctly the logo image of our pre-vious content distribution system even if the video content hasbeen distorted by collusion attacks. In video fingerprinting sys-tem, collusion attacks such as averaging, maximum minimum,negative correlation and zero correlation collusion attacks arevery powerful. Within the limits of a collusion attack on asingle subtree, the attacked logo can be extracted. But if thecollusion attack spans more than one subtree, distinctive logosare superimposed making it difficult to identify the subtrees ofthe colluding users. The technique proposed by Ateniese et al.(Extended VCC) will be the key to solve this problem in ouropinion.

Subset Incremental Chain Based BroadcastEncryption with Shorter Ciphertext

Nuttapong Attrapadung, Hideki Imai

We propose a new efficient broadcast encryption scheme. Itsciphertext length is upper bounded by 2r, the key size isO(k log n), and its computational cost is O(kn1/k) for any pa-

rameter k; where r and n are the number of revoked users andall users respectively. This improves the ciphertext lengthsfrom the previously best schemes, which were essentially forcedto be 2kr in order to achieve sub-linear computational costs ofO(n1/k).

Mon2-3 : Shannon Theory (2)

A Class of Average Distributions for MonotoneSources

Mohammadali Khosravifard, Morteza Esmaeili, Hossein Saidi,T. Aaron GulliverIn order to select a unique code for the class of monotonesources with N symbols one may use the minimum averagecriterion. It is known that the optimal code is the Huffmancode for the expected symbol probabilities. In this paper, weconsider the case when monotone sources with a higher kthsymbol probability are more likely. Assuming a probabilitydensity function f(p1, p2, . . . , pN ), which is proportional to pm

kfor some m ∈ IN , a closed form expression for the expectedsymbol probabilities, i.e. Ek,m(pi) is presented. The Huffmancode for the average probabilities is optimum from the mini-mum average redundancy point of view. Some properties of theaverage distribution, i.e. (Ek,m(p1), . . . , Ek,m(pN )), are exam-ined. Also, a minimax method for determining the appropriatevalue of the exponent m is proposed.

Information-Spectrum Characterization of aMulti-terminal Channel with General CorrelatedSources

Ken-ichi Iwata, Yasutada Oohama

In this paper, Information-Spectrum characterizations are de-rived for the reliable transmission of correlated outputs fromgeneral sources over a general multi-terminal channel. We pro-vide the necessary and sufficient conditions for the transmissionof the given general sources over the given general channel byusing Information-Spectrum methods which was introduced byHan and Verdu.

Source Coding of Correlated Gaussian Vector Sourceswith Several Side Informations at the Decoder

Yasutada OohamaWe consider the source coding of L correlated Gaussian sourcesXi, i = 1, 2, · · · , L. We consider the case where L noisy ob-servations Yi = Xi + Ni of Xi, i = 1, 2, · · · , L work as par-tial side informations at the decoder. Distortion is measuredby a covariance matrix with the difference between original Lsources and their estimations. We derive explicit outer andinner bounds of the rate distortion region. We show that theabove the outer bound coincides with the inner bounds whenGaussian correlated sources satisfy some conditions.

Multiterminal Source Coding with ComplementaryDelivery

Akisato Kimura, Tomohiko Uyematsu

A coding problem where messages from two correlated sourcesare jointly encoded and separately decoded is investigated.Each encoder has access to one of the two messages to enable itto reproduce the other message. The rate-distortion functionfor lossy coding is clarified. Some related coding problems arealso examined.

Mon2-4 : Communication Systems

Modeling of Impulse Noise for Indoor BroadbandPower Line Communications

Daisuke Umehara, Shinji Hirata, Satoshi Denno, YoshiteruMorihiroResidential power line is one of the most attractive communi-cation media for in-home networking, since almost all roomsin a house have power outlets. The regulations on power linecommunication (PLC) may be eased in Japan and we could

4


utilize a frequency band from 2 to 30MHz in the future. How-ever, many electrical appliances and/or shortwave systems fre-quently cause man-made electromagnetic interference on in-door power line. This man-made noise often has impulsivecharacteristics. We will extend knowledge about impulse noiseat indoor power line in the frequency range from 2 to 30MHz.We measure indoor power line noise in several environmentsand apply a detection method by chi-square test to the mea-sured noise. Further we model the amplitudes, durations, andinterarrival time of indoor power line impulses. These impulsenoise models are expected to utilize for communication designabout PLC.

A Modulation Classification Analysis Using JointMoments with Linear Transform

Daisuke Shimbo, Ikuo Oka, Shingo Ata

In adaptive modulation systems, a transmitter selects the bestmodulation from various signaling formats against time vary-ing disturbances, and a receiver identifies the modulation us-ing a received signal. In this paper, a modulation classificationmethod based on joint moments using linear transform is pro-posed. In the method, the amplitude and phase of a receivedsignal are transformed linearly, and joint moments are mea-sured from the amplitude and phase. The moments dependon the linear transform, and the classification performance im-proves by some transforms. The joint moments are derivedin a form of an infinite series of elementary functions to an-alyze an optimal decision threshold and a classification errorprobability. Numerical results of the classification error prob-ability for BPSK, QPSK and 16QAM show the superiority ofthe proposed method with appropriate linear transforms.

Intersymbol Interference Compensation Scheme inCollaboration with Transmit Pre-coding andAdaptive Equalization

Hiroshi Kubo, Shinich Mochida, Katsuyuki Motoyoshi,Takashi Mizuochi, Akihiro Shibuya

This paper proposes a communication system employing pre-coding at a transmitter and adaptive equalization at a re-ceiver, i.e., a collaborative equalization scheme. Assumingslowly time-varying and large time-span intersymbol interfer-ence (ISI) channels, e.g. hundreds of symbol duration, the pro-posed collaborative equalization scheme roughly compensatesISI by pre-coding at the transmitter and precisely compen-sates a residual ISI by adaptive equalization at the receiver.Computer simulation confirms that the proposed collaborativeequalization scheme has excellent performance in the presenceof large time-span ISI and residual ISI due to mismatch ofpre-coding, assuming chromatic dispersion in optical commu-nications.

Modified PN Code Acquisition Scheme Based onAdaptive Filter Under Frequency Selective RayleighFading Channels

Donghoon Lee, Kyungwhoon Cheun, Jeongchang Kim

A hybrid PN code acquisition system based on a least-mean-square adaptive filter, interpreted as a channel estimator, isproposed for direct-sequence spread-spectrum systems underfrequency selective Rayleigh fading channels. Closed form ex-pressions for the detection and false alarm probabilities arederived. Compared to the previously proposed channel equal-izer based system, the proposed system achieves smaller meanacquisition times and is more robust to the selection of theadaptation step-size. The proposed algorithm does not requiremultiplication operations for coefficient weight updates.

Mon2-5 : Turbo Codes (2)

Improvements and Extensions of Low-RateTurbo-Hadamard Codes

Noriyuki Shimanuki, Brian M. Kurkoski, KazuhikoYamaguchi, Kingo Kobayashi

In this paper, we consider a number of system improvementsthat have been proposed for convolutional turbo codes, and ap-

ply them to turbo-Hadamard codes (THC). Our findings are asfollows. 1. Asymmetrical THC, employing differing constituentcodes, improves the waterfall region performance compared tosymmetrical THC. 2. Punctured THC have improved perfor-mance in both the waterfall and error floor regions, relativeto non-punctured codes of the same rate. 3. An LDPC code,when serially concatenated with an inner THC code, can cor-rect low weight errors to improve the error floor performance.4. Parallel-schedule decoding of THC can converge significantlyfaster than conventional serial-mode decoding, leading to a re-duction in decoder complexity.

Interleaver Design for a Class of High-Rate SeriallyConcatenated Codes

Motohiko Isaka

This paper discusses an interleaver design for a class of seriallyconcatenated coding schemes with relatively short linear outerblock codes and an inner accumulator encoder. It is shownthat an appropriate design of an interleaver enhances the per-formance of the error floor, in which the associated error eventsare not entirely due to the existence of low-weight codewords.

Stopping Sets for Iterative Row-Column Decoding ofProduct Codes

Eirik Rosnes

In this work we introduce stopping sets for iterative row-column decoding of product codes using optimal constituentdecoders. Let Cp denote the product code of two binary linearcodes Cc and Cr of minimum distances dc and dr and secondgeneralized Hamming weights d2(Cc) and d2(Cr), respectively.We show that the size smin of the smallest non-codeword stop-ping set is at least min(drd2(Cc), dcd2(Cr)) > drdc, wherethe inequality follows from the Griesmer bound. If thereare no codewords in Cp with support set S, where S is astopping set, then S is said to be a non-codeword stoppingset. We also give an explicit formula for the number of non-codeword stopping sets of size smin, which depends only onthe first non-zero coefficient of the constituent (row and col-umn) first and second support weight enumerators, for thecase when d2(Cr) < 2dr and d2(Cc) < 2dc. An immediateconsequence is that the erasure probability after iterative row-column decoding of (finite-length) product codes on the bi-nary erasure channel approaches the erasure probability aftermaximum-likelihood decoding as the channel erasure proba-bility decreases. Finally, as an example, we apply the derivedresults to the product of two (extended) Hamming codes andtwo Golay codes.

The Double Binary Turbo Hybrid ARQ Scheme

Woo Suk Kwon, Jeong Woo Lee

In this paper, we propose an incremental redundancy(IR)-hybrid ARQ (HARQ) scheme which uses double binary turbocodes for error correction. The proposed double binary turboIR-HARQ scheme provides higher throughput than the IR-HARQ, which uses binary turbo codes for error correction, atall Es/N0. An extra coding gain is also attained by usingthe proposed HARQ scheme over the coding gain achieved byturbo codes only.

Tue1-1 : Coding Theory (3)

Optimality on Probabilistic Minimax RobustDecoder

Libo Yang, Lei Wei

In this paper we show the minimax robust decoder in [10] isactually optimal in term of minimizing the worst case bit errorprobability for channels with two-type noise model with un-known prior probabilities. We prove that the decoder basedon minimax rule is actually not affected by prior probabilitiesof the noise model, which means average bit error probabilitya constant, regardless of prior probabilities of the noise model.An example is given to illustrate the results.

5


A Comparison between WB Algorithm and BMAlgorithm

Shojiro Sakata, Masaya Fujisawa

Before, we presented dualistic extensions of the Berlekamp-Massey (BM) algorithm, i.e. for multiple arrays and for arrayvectors. The former extension which is equivalent to the Feng-Tzeng algorithm can be applied to decoding of BCH codes upto Hartmann-Tzeng bound, but the latter remained to be ap-plied to any significant decoding of RS codes or other algebraiccodes. In this paper we show that the vector-version of BMalgorithm is useful in solving the Welch-Belekamp (WB) keyequations for decoding of RS codes as an alternative of theWB algorithm. Both methods have the same computationalcomplexity.

On Behavior of RS-decoder Based onWelch-Berlekamp Algorithm for t + µ Errors

Masami Mohri, Masakatu Morii

When (t + µ)-error is occurred on a codeword of t-error-correcting Reed-Solomon code, it has been shown some casessuch that the candidate vector generated by RS decoder (basedon the Euclidian algorithm and Peterson algorithm) is not acodeword. These cases are called decoder-malfunction. How-ever, the behavior of decoder-malfunction for Welch-Berlekampalgorithm has not been shown. In this paper, we show the con-dition for decoder-malfunction of Welch-Berlekamp algorithm.Furthermore, we show some consideration about candidate vec-tors obtained by decoder-malfunction of WB-algorithm.

An Improvement to an Iterative Bounded-distanceand Encoding-based Decoding Algorithm for BinaryLinear Block Codes

Hitoshi Tokushige, Marc Fossorier, Toru Fujiwara, TadaoKasami

We proposed an effective selection method of test patterns foran iterative decoding algorithm using bounded-distance andencoding-based decodings of binary linear block codes. Simu-lation results show that the iterative decoding algorithm usingthe selected test patterns (IDA) provides considerably bettererror performance than conventional iterative decoding algo-rithms with the same number of iterations. In this paper,we present simulation results of decoding complexity of theIDA with an early termination condition for the BCH(127, 64,21) code over an additive white Gaussian noise channel us-ing binary phase shift keying modulation. The results showthat the early termination condition reduces a large numberof iterations. Hamming distance distributions between trans-mitted codewords and the decoded codewords of the IDA arealso shown by computer simulation. We give a suggestion forimprovement of error performance of the IDA based on thedistributions.

Method for Generating a Competing CodewordUsing a Chain of Minimum Distance Searches

Jun Asatani, Takuya Koumoto, Toru Fujiwara, Tadao Kasami

In list-based soft-input soft-output decoding algorithms, twocodewords are necessary to calculate a soft-output value ateach bit position, that is, the most likely codeword and acompeting codeword. We have proposed a list-based soft-input soft-output decoding algorithm using minimum distancesearch, which finds a competing codeword effectively except forlow SN ratios. However, from a survey of the distribution ofthe Hamming distance between the most likely codeword andthe competing codeword, which are generated by maximumlikelihood decoding algorithm, it turned out that there werenot negligible competing codewords at second or further Ham-ming distance from the most likely codeword for relatively lowSN ratios. In this paper, a method is proposed for generatinga competing codeword by using a chain of minimum distancesearches to find a competing codeword at further Hammingdistance from the most likely codeword. By computer simula-tion, the proposed method is shown to be capable of generatingcompeting codewords more accurately than the previous one.

Tue1-2 : Network Security

A New Secret Key Agreement Scheme Based onEigenvalues of Channel Matrices in Phase-ControlledMIMO Systems

Kengo Hiwatashi, Hideki Ochiai, Junji Shikata

In this paper, a new secret key agreement scheme is proposedfor land mobile communications. This scheme generates a pairof secret key on both sides of two legitimate users by the useof eigenvalues of channel matrices similar to the existing work,but without making use of reciprocity of radio wave propaga-tion. The simulation results show that the proposed schememaintains robustness against a mismatch in term of channelreciprocity.

A Study on Detection of Varied Worms withAnalyzing Session Information

Il-Ahn Cheong, Taek-Yong Nam

Since many worm attacks appear, more and more varied wormshave become a threat to our networks. In this paper, we studyto detect these varied worms with analyzing session informa-tion from a worm data. We use the session information of anetwork dump data generated by worm attack and the auto-matic generation method to generate detection rules that isadequate to find peculiar rules of worm based on entropy the-ory. As the result, we are able to automatically generate thedetection rules of worm attacks and to effectively detect variedworms with the rules.

Reliability Improved Port Knocking Scheme

Hiroyuki Tanaka, Takashi Katoh, Bhed Bahadur Bista, ToyooTakataPort knocking is a method of communication in which infor-mation is encoded into a sequence of port numbers, and isregarded as the most promising method to realize remote au-thentication in a mobile environment.

In this paper, we propose a new port knocking scheme espe-cially suitable for wireless environment. Our proposed schemeemploys interleaving and erasure-correcting coding to combata packet loss before establishing connection.

An IP Traceback Scheme with Variably ProbabilisticPacket Marking

Takeaki Terada, Masakazu Soshi, Atsuko Miyaji

One of the effective countermeasures against Denial of Service(DoS for short) attacks is IP traceback, which tries to iden-tify the attacker by determining the attack path. In particularProbabilistic Packet Marking (PPM) for IP traceback is sopromising that many researches on it have so far been done.However, most of the previous PPM schemes have the disad-vantage such that they require a large number of packets toreconstruct the attack path. Therefore we propose an efficienttraceback scheme based on PPM in this paper.

Implementation and Evaluation of Dynamic ProcessResolution Protocol Actualizing LocationTransparency

Hidekazu Suzuki, Akira Watanabe

In order to realize secure communications in an enterprise net-work, an effective way is to form communication groups cor-responding to different types of tasks. However, based on tra-ditional forming methods, it has been difficult to realize aneffective system because a management load increases in theenvironment where individual-based and unit-based communi-cation groups coexist or when dynamic adjustment to changesin the network configuration is needed. Thus, we have beenproposing the concept of Flexible Private Network (FPN) thatprovides both flexibility and security. Dynamic Process Reso-lution Protocol (DPRP) is a protocol that can actualize Lo-cation Transparency. In DPRP, all devices existing in thecommunication path mutually exchange information in ad-vance of communication, and create Process Information Table

6


(PIT) which is needed for communication between terminalsin each device. We have implemented DPRP in the IP layer onFreeBSD and confirmed that the overhead of DPRP does notaffect on TCP/UDP communications. We have also provedthat a management load can be reduced drastically.

Tue1-3 : Source Coding

Universal Lossy Coding for Individual SequencesBased on Complexity Functions

Shigeaki Kuzuoka, Tomohiko Uyematsu

A theory of lossless compression of individual sequences hasbeen formulated by Ziv and Lempel, and developed by theirsubsequent papers. While the framework of lossless codingproblem of individual sequences can be extended to lossycoding problem, the lossy coding problem of individual se-quences are not so well studied as the lossless coding prob-lem. This paper considers four kinds of rate-distortion prob-lems for individual sequences: the fix-rate coding under themaximum-distortion criterion (fm-coding) and the average-distortion criterion (fa-coding), the variablerate coding un-der the maximum-distortion criterion (vm-coding) and theaverage-distortion criterion (va-coding). The converse codingtheorems for each problem are established. Moreover, univer-sal lossy coding schemes for individual sequences based on thecomplexity function are proposed, and the coding theorems forfm, fa and vm-coding problems are clarified.

On the Optimum Performance TheoreticallyAttainable for Scalarly Quantized Correlated Sources

Thorsten Clevorn, Laurent Schmalen, Peter Vary, Marc Adrat

Turbo processing enables appropriately designed systems tooperate close to their capacity limits. In this contribution wepresent an upper bound, the optimum performance theoret-ically attainable (OPTA), that can be achieved when trans-mitting the samples of scalarly quantized correlated sources.This OPTA limit is based on the combination of the channelcapacity and and the distortion rate function. To incorporatethe effects of the finite block sizes in real systems, additionallythe inevitable loss is taken into account by the sphere-packingbound. In a simulation example we present a multi-mode iter-ative source-channel decoding scheme that is based on highlyredundant index assignments. By its Turbo processing at thereceiver and due to its multi-mode flexibility this system canapproach the OPTA limit in a wide range of channel condi-tions.

Bounds on Exponentiated Expected Length ofOptimal Binary Prefix Codes

Yen-Yi Lee, Jay Cheng

In this paper, we consider the exponentially weighted averagecodeword length introduced by Campbell, which assumes thatthe cost is an exponential function of the codeword length andincludes the usual expected codeword length as a special case.Such situations could arise when the cost for encoding and de-coding is significant, or if the buffer overflow caused by longcodewords is a serious issue. Under Campbell’s average code-word length criterion, we derive some properties of optimalbinary prefix codes, and obtain new lower and upper boundson the exponentiated expected length of optimal binary prefixcodes when the probabilities of the most and/or the least likelysource symbols are available.

Improving LZ77 Data Compression Using BitRecycling

Danny Dube, Vincent Beaudoin

Many data compression techniques allow for more than oneway to encode the compressed form of data. In particular, thisis the case for the LZ77 technique and its derivatives, wherematches can often be described in more than one way. Thevery existence of multiple encodings for the same data actsas a side-channel through which additional information can beconveyed from the compressor to the decompressor, and so, forfree. We show that this side-channel can be used to carry parts

of the compressed file itself, thereby shortening the latter, andimproving compression ratios. We call our technique bit recy-cling and show how it applies to Huffman encoding. We presentit as a way to improve LZ77 compression and demonstrate itthrough many experiments. One of these experiments has al-ready been presented but the new ones take better advantageof recycling. The experiments show that we can improve com-pression efficiency significantly and tend to point to a methodwith which bit recycling is most profitable.

Linear-Time Encodable and Decodable Codes forSlepian-Wolf Source Networks

Tomohiko Uyematsu

This paper proposes an explicit construction of fixed lengthcodes for Slepian-Wolf source networks. The proposed codecan be encoded and decoded in linear time. Our constructionof the code is similar to the error correcting code proposed byGuruswami and Indyk for channel coding, and the code hasiterative decoding procedure. It is shown that the probabilityof error vanishes exponentially as the block length tends toinfinity, if the pair of encoding rates is in the achievable regionof the correlated source.

Tue1-4 : Spread Spectrum Systems

Impact of Narrowband Interference forDS-multiband-UWB Wireless Communications

Yun-Seok Song, Shigenobu Sasaki, Chin Sean Sum, HisakazuKikuchiThis paper presents the simulation results of a direct sequenceultra wideband (DS-UWB) communication system applyingmultiband modulation over multipath wireless channel in thepresence of narrowband interference. Simulation results of sys-tem performance are presented corresponding to different chipduty factor and signal to interference ratio (SIR). We foundthat system performance can be improved significantly by de-creasing chip duty factor.

On Interference Mitigation of DS-Multiband-UWBSystem Over Indoor Multipath Environment

Chin Sean Sum, Shigenobu Sasaki, Hisakazu Kikuchi

This paper presents the interference mitigation capability of ahybrid direct sequence (DS) multiband (MB) ultra wideband(UWB) system with Rake receiver over indoor multipath envi-ronment. By suppressing the power of the particular sub-bandaffected by coexisting narrowband or wideband interference,the impact of interference can be reduced significantly. The-oretical analysis is conducted to investigate this interferencemitigation capability corresponding to various system param-eters such as level of power suppression, signal to noise ratio,signal to interference ratio, number of employed bands and in-terference signal bandwidth. We found that by suppressing thesub-band power, system performance can be improved whilemaintaining the processing gain.

Short and Efficient Frequency Hopping Sequences

Young-Joon Kim, Dae-Son Kim, Hong-Yeop Song

This paper is about designing a short hopping sequence. Be-cause of short length, we have only to consider balance andHamming autocorrelation. Modulo q reduction of consecutivepowers of a primitive root µ (mod p) and deleting a positionat a given q-ary power residue sequence of period p are pro-posed as a design of q-ary sequence of period p− 1, where p isa prime. These sequences are compared in terms of Hammingautocorrelation and balance.

Throughput Performance of the MPPM DS/SSALOHA System on the AWGN Channel

Masayuki Matsuzaki, Fumie Ono, Hiromasa Habuchi

In this paper, the throughput performance of the MultipulsePulse Position Modulation Direct Sequence/Spread Spectrum(MPPM DS/SS) ALOHA system is evaluated on the AWGN

7


channel. In the MPPM DS/SS ALOHA system, informationdata are represented by combination the slot positions of sev-eral spreading codes and the sign in a packet. Therefore, thissystem can reduce interferences of other users by decreasing thenumber of spreading codes per packet. The packet length ofthe MPPM DS/SS ALOHA system is shorter than that of theDS/SS ALOHA system. As a result, throughput performanceof the MPPM DS/SS ALOHA system is about 2.3 times largerthan that of the DS/SS ALOHA system, about 1.3 times largerthan that of the ALOHA system applied with three-valued sig-naling.

Construction of Continuous-Time Equivalents ofWelch Bound Equality Sequences

Joon Ho Cho

Recently, the Welch bound equality (WBE) sequences andtheir variations have been intensively investigated for appli-cations to code-division multiple-access (CDMA) communica-tions and, accordingly, many algorithms to construct these se-quences have been proposed. In this paper, we propose an algo-rithm called multi-user piecewise-constant constrained water-filling to construct the continuous-time equivalents of Welchbound equality (CTE-WBE) sequences, which are continuous-time counterparts of the WBE sequences.

Tue1-5 : MIMO (1)

Communication over Hypercomplex KahlerManifolds: Capacity of Dual-PolarizedMultidimensional-MIMO Channels

Ozgur Ertug

We consider single-user communications over joint space-pattern-polarization diversity providing dual-polarizedmultidimensional-MIMO (MD-MIMO) channels establishedby the use of multiple dual-polarized transmit/receive anten-nas in the form of uniformly-spaced 1D, 2D and/or 3D MIMOarrays. Based on the equivalent channel-models formulatedbased on hypercomplex Kahler manifolds, we subsequentlyidentify the decomposition of dual-polarized multidimensional-MIMO channels into multiple independently-fading and scaledclassical MIMO channels in parallel through the algebraicproperties of hyperKahler manifolds and consequently derivethe corresponding ergodic capacities analytically. We show inessence via the diversity-reception over independent channelsperspective deduction of the decomposition into parallelMIMO channels observation that the capacity gains achiev-able by dual-polarized multidimensional-MIMO Tx/Rx overclassical single-polarized linear antenna array MIMO Tx/Rxmay be notably large with equal number of transmit and/orreceive antenna locuses constrained compactly and undersame resource requirements/channel conditions whenever thecross-polar discrimination is good, i.e. ρ ¿ 1.

Transceiver Optimization for Multiuser MIMOSystems: Min-Max Relative User-MSE under a TotalPower Constraint

Shuying Shi, Martin Schubert, Holger Boche

We address the problem of jointly optimizing linear transmitand receive filters for a multiuser MIMO system, under the as-sumption that all users have individual minimum mean squareerror (MMSE) requirements. The design goal is to minimizethe maximum relative MSE per user under a total power con-straint. This results in a non-convex problem formulation.We propose an iterative algorithm which performs optimiza-tion in an alternating manner by switching between the up-link and downlink channel. The proposed algorithm has verylow complexity and fast convergence behavior. We prove thatthe balanced relative user-MSE level returned by the iterationdecreases monotonically and converges. Furthermore, the pro-posed algorithm has no restriction on the number of transmitand receive antennas.

Selecting a Near-Optimal Set of JointTransmit-Receive Antennas for a MIMO ChannelBased on Maximizing Channel Capacity

Hyo-Shil Kim, Sung-Yeon Kim, Youn-Shik Byun

Increasing the number of transmit and receive antennas are re-quired for higher hardware costs and computational burden inmultiple input multiple output wireless systems. For systemswith a large number of antennas, there is strong motivation todevelop techniques with reduced hardware and computationalcosts. In this paper, we propose an efficient transmit-receiveantenna selection algorithms for MIMO wireless systems. Ouralgorithm achieves the more near ergodic capacity as the opti-mal selection technique than existing nearly optimal antennaselection schemes. We present the proposed algorithms thattractable linear algebra analysis of channel capacity. Simu-lations validating analysis and illustrating the proposed algo-rithms performance are also presented.

On the Complexity of Feedback Generation in MISOBeamforming and Diversity Schemes

Albrecht J. Fehske, Patrick Marsch, Gerhard P. Fettweis

Recently, different schemes have been introduced that improvethe bit error rate of single user MISO transmissions throughtransmit diversity or transmitter-sided beamforming. This isparticularly interesting in the downlink of cellular systems,where it is feasible to employ multiple transmit antennas atthe base stations, but only few receive antennas at the mobileterminals. In this paper, we observe both classical beamform-ing schemes, where a beamforming vector is chosen to optimizethe SINR at the receiver, and Coherent Alamouti schemes,which extend the classical rate one Alamouti STBC to mul-tiples of two transmit antennas. In both cases, full diversityand an additional gain can be achieved, if a certain extent ofchannel knowledge is present at the transmitter, which usuallyhas to be supplied by the receiver through feedback. In ourwork, we evaluate the performance and feedback requirementsof the different schemes, while putting a special emphasis onthe non-negligible computational complexity required at thereceiver to produce optimal feedback. We introduce a novelbeamforming scheme that can significantly reduce this com-plexity while achieving a comparable performance, and pro-vide a comprehensive summary on the choice of an optimaltransmission scheme for different applications.

Tue2-1 : LDPC Codes (1)

A Minimum Weight Test for a Certain Subclass ofArray LDPC Codes

Kenji Sugiyama, Yuichi Kaji

LDPC codes is a class of linear codes introduced by Gallagerin early 60’s. Array LDPC (ALDPC) codes is a class of LDPCcodes which are algebraically constructed from a family of ar-ray codes. This paper proposes a procedure to check if thereis a codeword with specified weight in a certain ALDPC code.The minimum weight of a linear code has strong relationshipto the performance of the code, but unfortunately it is diffi-cult to compute the exact minimum weight of long and ran-domly constructed LDPC codes. We restrict ourselves to aclass of complete array LDPC codes (C-ALDPC codes) whichis a subclass of array LDPC codes, and investigate positions ofnonzero components in a codeword. The code in the consid-ered subclass is invariant under a doubly transitive group ofaffine permutations. This property gives significant constrainton the positions of nonzero components in a codeword, whichmeans that the positions of nonzero components in a codewordcan be classified into rather small number of patterns. Usingthese conditions, the proposed procedure checks if there existsa codeword with specified weight.

On Minimal Length of Quasi Cyclic LDPC Codeswith Girth ≥ 6

Manabu Hagiwara, Koji Nuida, Takashi Kitagawa, MarcFossorier, Hideki Imai

In this paper, we investigate the smallest value of p for which

8


a (J, L, p) QC LDPC code with girth 6 exists for J = 3 andJ = 4. For J = 3, we determine the smallest value of p for anyL. For J = 4, we determine the smallest value of p for L ≤31. Furthermore we provide examples of specific constructionsmeeting these smallest values of p.

Use of Dynamic Programming for the Design ofIrregular LDPC Codes

Sang Hyun Lee, Duho Rhee, Il Mu Byun, Kwang Soon Kim

A simple design method using dynamic programming is pro-posed for good LDPC codes with relatively low code-rate. Byapplying a dynamic programming optimization to the con-struction of the portion fixed for easy encoding in the parity-check matrix, we can maximize the girth associated withcolumns contained in that portion of the matrix. Simulationresults show performance improvement over the conventionalcontrolled random construction method.

New Bit Mapping Scheme of Irregular LDPC Codesfor Nonuniform Gaussian Channels

Hyeong-Gun Joo, Song-Nam Hong, Dong-Joon Shin

In this paper, we propose a mapping scheme to assign the code-word bits of irregular LDPC codes to nonuniform Gaussianchannels. Contrary to the previously known mapping schemessuch as mapping the codeword bits in consecutive order andmapping the information bits to more reliable channel, the pro-posed scheme flexibly maps the information and parity bits ofcodewords by considering the characteristics of code and chan-nel such as degree distributions and channel gap. The proposedmapping scheme select the best bit mapping for the given en-vironment, while keeping the same overall system complexity.For the various irregular LDPC codes and nonuniform Gaus-sian channels, the best mappings are derived and the validityof them is confirmed through simulation.

Tue2-2 : Data Security

Perfect (2, n) Threshold Secret Sharing SystemsBased on Binary Matrices with Constant ColumnWeight

Todorka Alexandrova, Hiroyoshi Morita

In this paper we propose a construction of (2, n) thresholdsecret sharing systems using the generalized vector space con-struction based on matrices over GF (2) with constant columnweight. For this constraint on the matrices, we present lowerand upper bound on the size of the shares for each user and alower bound on the number of rows in the matrices assignedto each user.

A principal problem in the generalized vector space con-struction is the practical construction of the matrices that de-fine the secret sharing scheme. Adding the constraint of con-stant column weight in the matrices, allows us to present apractical algorithm, which constructs recursively a set of ma-trices with constant column weight, that is suitable to definea (2, n) threshold secret sharing scheme. The detailed steps inthis algorithm are described in this paper.

For good practical implementation we would like to increasethe number of users in the secret sharing scheme as many aspossible. For this purpose the problem of calculating the max-imum number of users in the secret sharing scheme has beenstudied in the paper. The proposed construction algorithmgives a lower bound on the maximum number of users that areable to joint the secret sharing scheme.

Collision-Controllable Hash Function

Hidenori Kuwakado, Masakatu Morii

This paper proposes a one-way hash function such that resis-tance to a collision is controllable, called a collision-controllablehash function. Specifically, the collision-controllable hash func-tion is characterized by the property that it is easy to find acollision for any c − 1 inputs but it is hard to find a colli-sion for any c inputs. The collision-controllable hash functioncan be constructed by using an ordinary collision-resistancehash function. Applications of the collision-controllable hash

function include sanitizable signature schemes and chameleoncommitment schemes.

A Cache Attack on SEED

Yoshitaka Ikeda, Takenori Ichikawa, Toshinobu Kaneko

SEED is a 128-bit block cipher with 128-bit key developed byKorea Information Security Agency in 1998. We propose acache attack for SEED, which reveals 128-bit secret key withdata complexity of 228.6. In general, cache attack reveals roundkey, we analysed key scheduling process of SEED to determinethe secret key. There are 128 bits round key for two rounds.It means that the effective key space size is 2120 for the key. Itmay seem some weakness for the key schedule of SEED.

A Categorizing-Guessed-Values Approach for theKey Recovery Attack against WEP

Toshihiro Ohigashi, Yoshiaki Shiraishi, Masakatu Morii

Wired Equivalent Privacy (WEP) protocol is a security pro-tocol for wireless LAN communication. Recently, a lot of keyrecovery attacks against WEP were proposed, and the meth-ods to improve those attacks were proposed too. In this paper,we propose a new method to increase the success probabilityof the key recovery attack. Our method can improve the keyrecovery attack even at the parameters that other methodscannot. Additionally, we confirm that the key recovery attackapplying our method can work effectively against secure WEPimplementation proposed by Yoshida et al.

A Method for Checking the Parity of (#JC − 1)/2

Masataka Akane, Yasuyuki Nogami, Yoshitaka Morikawa

This paper especially deals with genus two hyperelliptic curvesin the form of H(x, y) = f(x) − y2 = 0, where f(x) is anirreducible polynomial of degree 5 over the prime field Fp. Us-ing shift product-based polynomial transformation (SPPT), wepropose a method to check the parity of (#JC − 1)/2, where#JC is the order of hyperelliptic curve. Then, especialy forthe hyperelliptic curves in the form of H(x, y) = x5 + a− y2 =0 , a ∈ Fp, this paper shows that the proposed parity checkcan be carried out only by two exponensiations over the primefield Fp.

Tue2-3 : Shannon Theory (3)

Channel Coding Theorem for Discrete MultipathChannel

Yoichiro Watanabe, Koichi Kamoi

A channel coding theorem is proved for a discrete multipathchannel (DMPC), which is a single-input, single-output dis-crete channel with memory. Memory in DMPC is induced byfeedforward delay devices. A rate less than maximum value ofthe conditional mutual information of a multiple-access chan-nel is an achievable rate for the DMPC.

Outage Behavior of Discrete Memoryless ChannelsUnder Channel Estimation Errors

Pablo Piantanida, Gerald Matz, Pierre Duhamel

Classically, communication systems are designed assuming per-fect channel state information at the receiver and/or transmit-ter. However, in many practical situations, only an estimateof the channel is available that differs from the true channel.We address this channel mismatch scenario by introducing thenotion of estimation-induced outage capacity, for which we pro-vide an associated coding theorem and its strong converse, as-suming a discrete memoryless channel. The transmitter andreceiver strive to construct codes for ensuring reliable commu-nication with a quality of service (QoS), in terms of achievinga target rate with small error probability, no matter whichdegree of accuracy channel estimation arises during a trans-mission. We illustrate our ideas via numerical simulations fortransmissions over Ricean fading channels using rate-limitedfeedback channel and maximum likelihood (ML) channel esti-

9


mation. Our results provide intuitive insights on the impactof the channel estimate and the channel characteristics (SNR,Ricean K-factor, training sequence length, feedback rate, etc.)on the mean outage capacity.

Improved Bounds for the Capacity of the BinaryDeletion Channel

Hugues Mercier, Vijay K. Bhargava

We consider the deletion channel, where each transmitted bitis deleted with probability pd, and present two computationalmethods to estimate its capacity. The first approach boundsthe mutual information between the input and the output ofthe channel. It converges from above as the size of the inputblocks approaches infinity and leads to the first nontrivial up-per bound for the capacity. The second method uses stochasticoptimization to maximize the information rate of the channelwhen the input source is modeled by a Markov process. It con-verges from below as the order of the optimal Markov chainincreases, and as a result we improve on the existing capacitylower bounds.

Tue2-4 : UWB

Effect of Multi-path on Rake Reception for UWB-IRCommunications

Isamu Matsunami, Keiji Terasaka, Kenji Higashikatsuragi,Akihiro Kajiwara

UWB-IR communications have attracted considerable atten-tion because of their multi-path mitigation and system sim-plicity. Also the performance can be improved using the Rakecombining of multiple paths. However the performance mightbe affected by the correlation loss with its template waveformwhere the transmit waveform is used as the template wave-form. Especially in OLOS and NLOS channels the receivedsignal waveform should be distorted by multi-path interfer-ence. In this paper we conducted various UWB-IR channelmeasurements and the signal distortion by multi-path interfer-ence is investigated. Also the Rake gain and energy captureare estimated.

Experimental Evaluation of In-home UWB-IRPropagation Characteristics

Keiji Terasaka, Kenji Higashikatsuragi, Isamu Matsunami,Akihiro Kajiwara

In this paper, the feasibility of human movement being de-tected is discussed, aiming at a Ultra-wideband Impulse-radio(UWB-IR) based home security sensor to protect a house,not a room like infra-red and conventional microwave sensor,from intruders. Measurement of the UWB-IR channels wasconducted inside a house with four rooms including a livingroom where the transmit and receive antennas were placed ina fixed position of different rooms respectively in order to coverover the house. Measurement was conducted over all the floorswith 365 locations and the power delay profiles are discussed inorder to investigate the feasibility of human movement beingdetected. From the measurement results, the channel sensingbased on UWB-IR is found to be useful to protect a home fromintruder.

Optimality of Modulated Hermite Pulses forUWB/PPM Systems


In this paper we compare the modulated Hermite pulse, whichis proposed for UWB/OOK communication systems (802.15-03) and optimal pulse waveforms developed for UWB/PPM.We show the hermite pulse is practically optimal when we se-lect correct modulation index. This means if the future UWBsystem selects PPM modulation scheme instead of OOK, thenthe performance can be substantially improved without chang-ing pulse waveform. On Gaussian-channels, the gain is 2.963dBover OOK and 0.838dB over PPM with conventional gaussianderived pulse.

Multi-Band Ultra-Wide Bandwidth DataTransmission Using Raised Cosine Pulse Shaping

Chaiyaporn Khemapatapan

In this paper, quadrature-phase shift-keying (QPSK) modula-tion and time hopping spread spectrum technique are appliedto impulse radio signals for transmission data in an ultra-widebandwidth (UWB) system. The proposed system takes an ad-vantage of transmission carrier with pulse shaping in orderto ease the design and implementation of transmitter and re-ceiver using digital devices. Raised cosine filter is used as apulse shaper. The transmitted signal consists of multi-bandUWB signals in order to make spectrum to be efficiency andto enhance data transmission rate. By using raised cosine pulseshaping, the proposed system can be easily and partly imple-mented by digital devices.

A Simple Non-Coherent Detector for OOK on UWBChannels


In this paper, we introduce and evaluate two noncoherent de-tectors for UWB channels. The bit error performance is com-pared with the optimal coherent receiver and the energy detec-tor. Different pulse waveforms are evaluated and bandwidthof transmitter and receiver filters are also optimized. The re-sults show that on Gaussian channels , one of detectors notonly achieves a performance better than the energy detector,but also requires much less computation complexity if imple-menting in DSP chips. On UWB channels, the performance iscomparable with the energy detector, however, the circuitry ismuch less complex.

Tue2-5 : MIMO (2)

Influence of Transmit and Receive Correlations onPerformance of the MIMO System with MultipleAntennas and Relay Terminals

Ryosuke Uchida, Hiraku Okada, Takaya Yamazato, MasaakiKatayama

In this manuscript, spatial diversity for in-factory environ-ments is considered. The proposed scheme uses multiple anten-nas at a transmitter and a receiver, and also multiple relay ter-minals to provide diversity gain against fading and shadowing.If the separation of antennas at the transmitter or the receiveris not enough, then diversity gain is influenced by correlationat the transmitter or the receiver. This manuscript shows theanalytical and numerical results of the effects of transmit andreceive correlations on bit error performance of the proposedspatial diversity scheme.

On Iterative Decoding in Multiuser Space-TimeCoding Systems

Ha H. Nguyen, Yajun Yang, Ed Shwedyk

In iterative receivers of bandwidth-efficient multiuser space-time block coding systems, the extrinsic information can beiteratively exchanged among the soft-input soft-output (SISO)channel decoders, the SISO multiuser detector and the SISOM-ary demodulators. This paper investigates and comparesthe performance of such receivers when different strategies ofexchanging the extrinsic information are implemented. It isshown that the receiver that runs two inner iterations (be-tween the channel decoders and the M-ary demodulators) forevery one outer iteration (between the channel decoders andthe multiuser detector) is the most attractive when taking intoaccount the error performance, receiver complexity and decod-ing delay.

Sphere Decoder for Imperfect Channel StateEstimation

Chimato Koike, Ryutaroh Matsumoto, Tomohiko Uyematsu

In the multi-antenna communication, it is usually necessaryto estimate the channel state information(CSI). However, it isdifficult to estimate CSI perfectly. We propose an algorithm

10


that effectively finds the most likely transmitted signals withthe imperfect CSI. The computer simulation shows that theproposed method improves the symbol error rate and reducesthe required number of the pilot symbols.

Multirate Multiuser Code for Multiple-Access AdderChannel

Jun Cheng, Koichi Kamoi, Yoichiro Watanabe

Multiuser error-correcting code for multirate data transmis-sion is proposed for multiple-access adder channel (MAAC). Byspreading sequences, chosen among tree-structured spreadingsets, with different lengths and with decodability, data trans-mission is carried out at different rates. This satisfies the mul-tirate requirement in multiple-access communication system,even if there exits channel noise.

Tue3-1 : LDPC Codes (2)

Complete Erasure Recovery of IrregularRepeat-accumulate Codes

Saejoon Kim

We consider the problem of complete erasure recovery of ir-regular repeat-accumulate codes used over the binary erasurechannel. Elaborating on the properties of expander graphs, wegive an extended construction of irregular repeat-accumulatecodes that complete the recovery of all erasures and as a result,achieve the channel capacity.

Cycle Analysis and Interleaver Design ofFinite-Length Punctured LDPC Codes withDual-Diagonal Parity Structure

Yong Chun Piao, Dong-Joon Shin

In this paper, we analyze the cycle structure of finite-lengthpunctured RA-type LDPC codes and design interleavers whichhave good memory efficiency and avoid short cycles. Fur-thermore, introduce the check-node merging scheme for finite-length punctured RA-type LDPC codes and design simple in-terleavers. Simulation results show that finite-length punc-tured RA-type LDPC codes using the proposed simple inter-leavers have better performance than those with random andS-random interleavers.

Analysis of Generalized LDPC Codes with RandomComponent Codes for the Binary Erasure Channel

Enrico Paolini, Marc Fossorier, Marco Chiani

In this paper, a method for the asymptotic analysis of gener-alized low-density parity-check (GLDPC) codes on the binaryerasure channel (BEC) is proposed. The considered GLDPCcodes have block linear codes as check nodes. Instead of consid-ering specific check component codes, like Hamming or BCHcodes, random codes are considered, and a technique is de-veloped for obtaining the expected check EXIT function forthe overall GLDPC code. Each check component code is sup-posed to belong to an expurgated ensemble. Some GLDPCthresholds obtained by this technique are compared with thoseof GLDPC codes, with the same distribution and componentcodes lengths, using specific codes. Results obtained by com-bining our analysis with differential evolution tool are also pre-sented.

Performance of Low-Density Parity-Check Codes forBurst Erasure Channels

Gou Hosoya, Hideki Yagi, Toshiyasu Matsushima, ShigeichiHirasawaPerformance of low-density parity-check (LDPC) codes withmaximum likelihood decoding (MLD) for solid burst erasuresis discussed. The columns of the parity-check matrix of LDPCcodes are permuted to increase the distance between elements(DBEs) which is defined as a number of symbol positions be-tween elements 1 at each row of the parity-check matrix. Thecolumn permutation method can change the burst erasure cor-rection capabilities by both the sum-product decoding algo-

rithm and MLD algorithm. We derive some properties andshow from simulation results that large values of DBEs leadsto good performance for MLD.

Concatenated Coding System with Array and LDPCCodes for Burst-Error Channel

Hidetoshi Saito, Masayuki Hayashi, Ryuji Kohno

It is shown that the maximum a posteriori decoding with anautoregressive model (MAP-AR) is useful to correct a burstof length 70 symbols or less and any random errors when thetransmission errors occur in a perpendicular magnetic record-ing channel. The proposed MAP-AR decoding outperforms theconventional MAP decoding in the BER performance of PR2channel with these compound errors and gives reliable BERperformance if the maximum burst error of length is shorterthan the length of a column vector for the parity matrix of thearray code.

Tue3-2 : Public Key Cryptography

Efficient Multiple Encryption from OW-PCAPrimitives

Yang Cui, Kazukuni Kobara, Hideki Imai

Security of communication systems could be enhanced by mul-tiple encryption (ME) has been noted by Shannon’s pioneeringwork. Although this security for symmetric key encryptionswas presented more than half a century ago, the appropriateone for public key encryptions has not been rigourously defineduntil very recently. However, it is common in ME that the totalciphertext will have a huge ciphertext overhead. This papershows a general way to achieve this which could be provento be the semantic secure multiple encryption, efficient frombandwidth viewpoint in particular.

A Simple Approach to Evaluate Fujisaki-OkamotoConversion in Identity Based Encryption

Peng Yang, Takashi Kitagawa, Goichiro Hanaoka, Rui Zhang,Hajime Watanabe, Kanta Matsuura, Hideki Imai

The Fujisaki-Okamoto (FO) conversion is a very powerful se-curity enhancement method in public key encryption (PKE)schemes. The generality of the plain FO in identity based en-cryption (IBE) schemes was verified, and a slightly differentversion, the modified FO, was proposed. Both of the plainFO and the modified FO could achieve the goal of convert-ing a weak IBE scheme, i.e., one-way against adaptive cho-sen identity and chosen plaintext attacks (OW-ID-CPA), tothe strongest one, namely, indistinguishability against adap-tive chosen identity and adaptive chosen ciphertext attacks(IND-ID-CCA). This work aims to evaluate the plain FO andthe modified FO by substituting proper concrete values. Bymainly focusing on the time costs of security reductions, weshow the modified FO is better than the plain one.

Notes on Several ID Based Cryptosystems

Ryuichi Sakai

The first collusion resistant executable ID based cryptosystemswere proposed by Ohogishi-Sakai-Kasahara as the ID based keysharing scheme, and the collusion resistant ID based public keycryptosystems were proposed by them. Recently, Boneh-Byronand Waters propose ID based encryption schemes with secu-rity proofs in standard model. In this paper, we consider thestructure of these schemes and modify the schemes. The maindifferences between modified version of the schemes and theoriginal scheme is that the center knows the discrete log of thepublic parameter or not. We also show that if it makes thatthe original schemes can be always executed appropriately, thecenter must construct key parameter with the same orders ofthe modified schemes. In this case, the modified schemes canmore freely select the key parameters compared with the orig-inal schemes. The efficiency of the encryption and the decryp-tion of the modified schemes are same as the original schemeswhen in the original schemes the user pre-computes the pairinge(P1, P2).

11


A Public-Key Identification Scheme Based on a NewLattice Problem

Shunichi Hayashi, Mitsuru Tada

In this paper, we introduce a few decision problems related tolattices. These problems are shown to be NP-complete undermany-to-one reductions. Moreover, we propose a public-keyidentification scheme based on one of these problems, and provethe security of the scheme. We also compare the efficiency ofthe proposed scheme to that of other identification schemes.The proposed scheme is more efficient than schemes based onNP-complete problems or lattice problems in round complexity.The scheme is also more efficient than schemes based on thediscrete logarithm problem in asymptotical time complexity.

An Efficient N-Party Password-based AuthenticatedKey Exchange Protocol

SeongHan Shin, Kazukuni Kobara, Hideki Imai

In this paper, we propose an efficient N -party password-basedauthenticated key exchange (called N-PAKE) protocol whereN clients who are sharing pair-wise passwords with a serverwant to establish a common session key securely. The N-PAKEprotocol provides AKE-security and key privacy with respectto the server. In addition, the N-PAKE protocol is remark-ably efficient rather than the previous works and each client’scomputational cost is independent with the group size. Specif-ically, each client involved in the protocol is required only fourexponentiations and some negligible operations.

Tue3-3 : Multi-User Information Theory

Optimal Resource Allocation for a BidirectionalRegenerative Half-duplex Relaying

Tobias J. Oechtering, Holger Boche

In this work, we analyze the combinatorial structure of theachievable rate region of a spectral efficient bidirectional relay-ing decode-and-forward protocol, which makes future studieson the achievable stability region possible. Based on the in-sights on the combinatorial structure of this Gaussian channelfurther results on minimal necessary relay power and the max-imal achievable sum-rate are derived. Finally, the scenario isextended by additional relay communication, where it is opti-mal to decode the relay message first. Furthermore, we derivethe maximal possible relay rate for a given bidirectional sum-rate.

Characterization of Optimal Resource Assignmentsin the Framework of Blocking System Theory

Marcin Wiczanowski, Holger Boche, Slawomir Stanczak

We address the general problem of optimal orthogonal assign-ment of resources in a wireless network, e.g. in the form ofassignment of carriers to links in a multi-carrier uplink/ down-link. We provide a step towards a better understanding of theassignment problem by a novel characterization of the opti-mizers and optimal values within the framework of blockingsystems.

Characterization of the Fairness Gap in ResourceAllocation for Wireless Cellular Networks

Holger Boche, Marcin Wiczanowski, Slawomir Stanczak

We address the relations between the notions of min-max fair-ness and max-min fairness in wireless cellular networks. Weprove the existence of a performance gap between these fair-ness notions in general. We characterize network classes forwhich both fairness notions coincide and for which there existpower allocations which are fair in terms of both definitions.

On the Transport Capacity of Wireless Ad-hocNetworks

Sae-Young Chung

We show how transport capacity in bit-meters/s/Hz scales as

the node density increases in ad-hoc networks. This was con-sidered by many including. In this paper, we do not considerthe scaling law of the transport capacity of the entire network,but focus on the transport capacity of one source-destinationpair. We assume opportunistic routing is used to select thebest relay node that is closest to the destination among nodeswho successfully decode the current packet. We assume thesquared channel gain decays as e−αd/dγ , where α ≥ 0 is theabsorption constant, γ ≥ 0 is the path exponent, and d isthe distance between a transmitter-receiver pair. We assumeuniformly distributed nodes in n dimensions.

We show the transport capacity is bounded from above ifthere is no fading. Assuming slow flat Rayleigh fading andα = 0, we show the transport capacity scales as Θ((ln λ)1/γ)as the node density λ tends to infinity for one-dimensionalnetworks. For any dimensional network, the transport capacityscales as Θ(

√ln λ) if α = 0 and γ = 2.

An Algebra for Log-Convex Interference Functions

Holger Boche, Martin Schubert, Marcin Wiczanowski

We study an interference-coupled multiuser network under theassumption of log-convex interference functions. Examples areinterference models for matched-filter designs or channel un-certainties (robustness). We focus on the problem of maximiz-ing the minimum signal-to-interference ratio of all users. Weexploit that each log-convex interference function can be rep-resenteted as the product of basic building blocks dependingon a non-negative stochastic coefficient matrix. For fixed coef-ficients, we provide necessary and sufficient conditions for theexistence and uniqueness of a min-max optimal power alloca-tion. Then, the results are generalized for arbitrary log-convexinterference functions. The proposed theoretical frameworkprovides a basis for the development and analysis of new re-source allocation strategies based on log-convex models.

Tue3-4 : CDMA

A Non-Gaussian Coding Scheme that ExceedsConjectured Gaussian Capacity Limit in CDMATransmission with Single-User Decoding

Aminata Amadou Garba, Jan Bajcsy

Based on Gaussian signaling/interference arguments, it hasbeen widely conjectured that the spectral efficiency limiton code-division multiple access (CDMA) transmission withsingle-user demodulation/decoding is about 0.72 bits perCDMA chip. Based on our recent channel capacity results forCDMA network transmission, we design a non-binary CDMAscheme that yields non-Gaussian multi-user interference andsignificantly exceeds the conjectured Gaussian capacity limit.In the proposed CDMA scheme, users’ data are spread usinga combination of time hopping, error-control coding and M-ary trellis coded modulation (TCM), i.e., no direct sequencespreading is employed. The receiver performs soft-decisionsingle-user demodulation and iterative decoding between theTCM demodulator and the error correcting decoder. Wepresent both designed TCM codes and simulation results for16-ary and 64-ary CDMA transmission that achieve spectralefficiencies of 1.13 and 2.00 bits per chip, respectively.

CDMA Signal Design to Optimize Trade-off betweenthe Bandwidth-efficiency and Power-efficiency inUplink Systems

Atsurou Handa, Masahiro Fujii, Makoto Itami, Kohji Itoh

In this paper we compare two signal designs for uplink quasi-synchronous CDMA channels in order to optimize the trade-offbetween bandwidth-efficiency and power-efficiency. The onedesign, we call band-limited DS/CDMA design, is based ontime domain assignment of Gold sequences just as in the or-dinary DS/CDMA, with band-constrained cyclic chip inter-polation functions, being unlike in the ordinary DS/CDMA.The other design, we call MC/CDMA design, is based on fre-quency domain assignment of the sequences as in MC/CDMA.The both designs presume insertion of guard intervals at thetransmitter and frequency domain equalization in reception.Assuming quasi-synchronous arrival of CDMA signals at the

12


CDMA base station and FFT in the effective symbol inter-val, the inter-symbol interference is evaded in both designs.First we found the signal parameters which optimized thebandwidth-efficiency in band-limited DS design and MC designrespectively. Second we found the signal parameters which op-timize the power-efficiency in each of the designs. Finally wederived and compared the trade-off between the bandwidth-efficiency and power-efficiency of the band-limited DS and MCdesign. We found superiority of band-limited DS design to theMC design with respect to the optimized trade-off.

Localization of Radio-Controlled Car by AcousticDS-CDM Signals

Shinji Tsuzuki, Naoyuki Takeichi, Yutaka Tano, YoshioYamadaThe authors have proposed a beacon signal radiation systemfrom the power-line for time synchronization among wirelessand wired nodes. The considered application of the radiationsystem is an indoor fine-grained localization. Our rangefinderuses Direct-Sequence Code Division Multiplexed (DS-CDM)audible sound signals. This technique significantly improvesperformance in obstructed and noisy environments because ofthe diffraction of the sound wave and the spreading gain. Inthis paper, it is shown that the obtained average and worst ac-curacy of the localization in a 4m2 plane was 1cm and 4cm, re-spectively, under the ideal environment. The proposed methodwas also applied to find the location of a radio-controlled car.It is shown experimentally that although the localization ac-curacy was sensitive to the direction of the microphone, theaverage accuracy was less than 7cm in the 4m2 plane. As forthe degradation due to the movement of the microphone, theallowed maximum speed, which avoid the effect of Dopplershift, was analyzed, and it was confirmed experimentally.

Keywords: Spread Spectrum Systems, Sensor network, Mo-bile node localization, Acoustic rangefinder, Doppler shift,Clock skew.

Generalized Random Spreading PerformanceAnalysis of CDMA over GWSSUS Fading Channels

Ozgur Ertug

Signal-to-interference ratio (SIR) experienced by users is themajor quality and capacity indicator of CDMA systems. In thispaper, we analyze the SIRs achievable with diversity-receptionlinear multiuser receivers over GWSSUS time-variant fadinguplink DS-CDMA channels based on finite-dimensional gen-eralized random spreading performance evaluation methodol-ogy. Through the results of random matrix theory on thenon-asymptotic eigenvalue distributions of finite-size randommatrices, SIR statistics with linear RAKE and decorrelatingmultiuser receivers are derived in terms of the key system pa-rameters. Besides deciphering the performance expectationsfor finite-size systems independent of the specific choice andassignment of spreading sequences, the analysis of the derivedaverage SIR expressions at the asymptotic wideband regimealso further validate the predictions of previous large-systemresults on the deterministic SIRs with multiuser receivers atwideband limits.

Generalized MPSC and Its Performance inSynchronous Optical CDMA Systems

Tomoko K. Matsushima, Yasuaki Teramachi

A new class of codes for synchronous optical CDMA and asimple construction method of the codes are presented. Theclass, which is composed of codes constructed over extensionfields GF(pm), is a generalized version of the class of modi-fied prime sequence codes (MPSCs), while original MPSCs areconstructed over prime fields GF(p). It is shown that the pro-posed codes, which we call ’generalized MPSCs’, have the samecorrelation properties with original MPSCs. Furthermore, thispaper investigates the bit error rate performances of opticalsynchronous OOK and EWO systems employing interferencecancellation techniques with generalized MPSCs. It has beenshown that these systems can eliminate multiple user interfer-ence (MUI) errors completely, when they employ the originalMPSCs. Our results show that the OOK and EWO systemsemploying generalized MPSCs also have the advantage to elim-

inate MUI errors.

Tue3-5 : MIMO (3)

A Practical Vector Dirty Paper Coding Scheme forMIMO Gaussian Broadcast Channels

Shih-Chun Lin, Hsuan-Jung Su

Recently, the vector dirty paper coding (DPC) achievablerate region has been shown to be the capacity region ofa multiple-input multiple-output Gaussian broadcast channel(MIMO GBC). With DPC, the multiuser interference non-causally known at the transmitter can be completely removed.In this paper, we present a vector DPC structure for MIMOGBC channels. It is a generalization of the single antennasuperposition coding for the scalar Gaussian dirty paper prob-lem proposed by Bennatan et al. In a theoretical random codesetting, this construction is shown to be able to achieve thepromised rate performance of the MIMO GBC channel. Wealso implement it with existing vector quantizer and capacity-achieving channel coding. Combined with iterative decoding,an design example validates the effectiveness of our methods,which performs only 1.1 dB away from the capacity.

Approximate MLD for MIMO Systems Using ErrorDetection Scheme Based on LRAD

Dong-Jin Lee, Ryun-Woo Kim, Youn-Shik Byun

Maximum likelihood detection (MLD) for MIMO systems isknown as an optimal method for signal detection in terms ofbit error rate. However, the main drawback of MLD is itshigh complexity. To simplify the complexity of MLD, manylinear and nonlinear techniques have been proposed. Here, weconsider the lattice-reduction-aided detection (LRAD) schemebased on the well-known LLL algorithm for MIMO systems.By specific expression on rounding operation of LRAD scheme,we can search gap-symbols (error symbols) in the estimatedsymbols. As a result, performances of these methods approachmore nearly to that of maximum likelihood detection thatshows optimum performance. The complexities of these meth-ods reduce and they converge on that of lattice-reduction-aideddetection.

Code Controlled Sphere Decoding of Four EfficientMISO Lattices

Camilla HollantiPreviously we have constructed some geometrically dense, full-rank, rate-one matrix lattices with large non-vanishing mini-mum determinants for 4 transmit antenna MISO applications.In this paper, we will consider the decoding of these lattices.The main concern is not in improving existing algorithms, butin finding a way to decode our lattices that are not as simplein structure, at least not at the first glance, as the majority ofpreviously known ST lattices. We show that the decoding canbe efficiently performed by using a modified version of a cer-tain sphere decoding algorithm. We call this method ”CodeControlled Sphere Decoding” (CCSD). Our lattice construc-tions are based on the theory of rings of algebraic integers andrelated subrings of the Hamiltonian quaternions. Simulationsin a quasi-static Rayleigh fading channel have shown that ourdense quaternionic constructions outperform the earlier rect-angular lattices as well as the DAST-lattice.

A Consideration on the Complexity Reduction ofLDPC Coded MIMO OFDM Receiver Structure

Le Khoa Nguyen, Yasunori Iwanami, Eiji Okamoto

Due to the increasing demands for the recent high capacity andhigh speed transmission in mobile communications, MIMO-OFDM (Multiple Input Multiple Output - Orthogonal Fre-quency Division Multiplex) schemes attract much attention.MIMO OFDM schemes are considered to be useful for Wire-less LAN’s, fourth-generation (4G) mobile phones, etc. On theother hand, LDPC (Low Density Parity Check) code seems tobe an attractive channel coding scheme because of its very pow-erful error correction capability with less computational com-plexity. In the MIMO spatial multiplexing, the signal from

13


each transmit antenna must be separated. MLD (MaximumLikelihood Detection) can achieve the best BER performance,but it is pointed out that it needs the high computational com-plexity. To overcome this problem, we have investigated theQRM-MLD (Maximum Likelihood Detection with QR decom-position and the M-algorithm) and the SD (Sphere Decoding)w/o SQRD (Sorted QR Decomposition) in our proposed LDPCcoded MIMO OFDM scheme. Furthermore, the soft outputfeedback from the LDPC decoder to the signal detector (SD,MLD, QRM-MLD), is used to generate the reliable soft replica,to extract the desired signal precisely from the spatially mul-tiplexed signals.

Tue4-1 : Iterative Decoding

Reducing Computational Cost on Modified MDBFDecoding for High Dimensional Parity-Check Code

Yuuki Funahashi, Shogo Usami, Akira Ogawa, Ichi Takumi,Masayasu Hata

We have researched high dimensional parity-check (HDPC)codes that give good performance for channels over a very higherror rate. HDPC codes are constructed using a combinationof single parity-check codes, and it is easy to implement thecode on hardware because of the simple structures. It can besaid that HDPC codes are subset of LDPC codes. Maximumdetected bit flipping (MDBF) decoding is known as a hard-indecoding method for HDPC codes with reasonable error perfor-mance and computational cost. We modified MDBF decodingfor more improving error performance by introducing the pa-rameter as decoding radius. However, modified method maymake computational cost increase. In this paper, we proposean algorithm based on Modified MDBF(MMDBF) decoding toreduce computational costs with same error performance. Theproposed method stops decoding when loop state is detectedin decoding process. Then we perform computational coststo compare the proposed method with the original MMDBFdecoding.

Reduced-Complexity Decoding of LDPC CodesBased on the Sum-Product Algorithm

Seho Myung, Kyeongcheol Yang

In this paper we propose a reduced-complexity algorithmfor decoding LDPC codes. It is a simplified sum-productalgorithm obtained by linearly approximating the functionln cosh(x) and properly quantizing the received channel val-ues. Simulation results show that the proposed algorithm doesnot cause a serious performance degradation, as compared withthe floating-point sum-product algorithm.

On the Implementation of Belief Propagation (BP)Algorithm for Decoding Low-Density Parity-Check(LDPC) Codes

Young Seob Lee, Min Seok Oh, Jin Sung Choi

We present a simplified decoding algorithm reducing the com-plexity of BP algorithm with trivial performance loss. Thisalgorithm is based on clever linear approximations of complexoperations which usually would cause serious hardware com-plexity. For the approximation, existing decoding algorithmsare discussed and a novel decoding processing is introduced inorder to minimize performance degradation and hardware im-plementation cost. In addition, hardware architecture for theproposed algorithm is explained for the practical applicationof LDPC codes. In the simulation results, it is shown that theproposed algorithm produces almost same performance as theexisting BP algorithm with signicantly reduced complexity.

On the Decoding of LDPC Codes in IEEE 802.16eStandards for Improving the Convergence Speed

Min-Ho Jang, Beomkyu Shin, Woo-Myoung Park, Jong-SeonNo, In San Jeon

In this paper, the modified iterative decoding algorithm bypartitioning check nodes is applied to low-density parity-check(LDPC) codes in IEEE 802.16e standards, which gives us theimprovement for convergence speed of decoding. Also, the new

method of check node partitioning which is suitable for decod-ing of the LDPC codes in IEEE 802.16e system is proposed.The improvement of convergence speed in decoding reduces thenumber of iterations and thus the computational complexity ofthe decoder. The decoding method by partitioning check nodescan be applied to the LDPC codes whose decoder cannot beimplemented in the fully parallel processing.

Analysis of Complexity and Convergence Speed ofSequential Schedules for Decoding LDPC Codes

Sunghwan Kim, Min-Ho Jang, Jong-Seon No, Song-NamHong, Dong-Joon Shin

In this paper, a sequential message-passing decoding algo-rithm of low-density parity-check (LDPC) codes by partition-ing check nodes is analyzed. This decoding algorithm showsbetter bit error rate (BER) performance than the conventionalmessage-passing decoding algorithm, especially for the smallnumber of iterations. Analytical results tell us that as thenumber of partitioned subsets of check nodes increases, theBER performance becomes better. We also derive the recur-sive equations for mean values of messages at check and vari-able nodes by using density evolution with Gaussian approx-imation. Finally, the analytical results are confirmed by thesimulation results.

Tue4-2 : Data Network

Researches on Mobile Communications over aPrivate Address Area and a Global Address Area

Kazuto Enomoto, Hidekazu Suzuki, Junichi Sakamoto, AkiraWatanabe

IP addresses are classified to two types of addresses, those areglobal addresses used in the Internet and the private addressesused only in the home networks or enterprise networks. Inubiquitous networks, it is desired that mobile terminals canmove freely during communications without being consciousof difference of the address types. We have been proposedthe technology called Mobile PPC which realizes mobile trans-parency. In this paper, we have researched the realization ofmobile transparency over a private address area and a globaladdress area by extending Moible PPC.

A Proposal of Voice over IP Passing through Firewalland Its Evaluation

Masashi Ito, Akira Watanabe

Due to development of communication infrastructure, IP tele-phone has reached a level of practice use. However, it is diffi-cult to use IP telephone freely and safely, because there exista firewall and a NAT between a global network and enterprisenetworks. In this paper, we propose a system called SoFW(SIP over Firewall) that enables passing through a firewall anda NAT by placing two relay agents on a global network anda private network, and generating an HTTP tunnel. Thoughthere exist similar technologies, however, they need special ter-minals or integrated control of IP addresses. SoFW can usenormal SIP terminals, and does not need integrated control ofIP addresses, and it is easy to setup. We have implementedSoFW on Linux machines and confirmed the effectiveness.

Researches on Connections between WAPL and theInternet

Yoshiyuki Kato, Masashi Ito, Akira Watanabe

The technology of a mesh network attracts attention these daysas the method of making wireless LAN easily. A mesh networkmakes it easy to set and maintain AP(Access Point)s in wire-less LAN by connecting APs with an ad hoc network.In a meshnetwork, it is need to manage the information of relationshipsbetween the AP and terminals under the AP. We have beenproposing WAPL(Wireless Access Point Link) as a mesh net-work. In this paper, principles of WAPL and its connectingmethod with the Internet are described.

14


Using Hybrid Method to Detect Internet Worms byAnalyzing ICMP Type 3 Messages and WormCharacteristic Matching

WenHung Su, JaeHo Lee, Tomokazu Nagata, Shiro Tamaki

Recent well publicized attacks have made it clear that wormsconstitute a threat to Internet security. Internet worms canspread so fast that in-time human-mediated reaction is notpossible. Therefore initial response to attacks has to be auto-mated in early stage of worm spread. A useful method involvesthe use of ICMP Destination Unreachable (ICMP Type 3) mes-sages generated from routers to detect the random scanningbehavior of worms. But, as more and more people use peerto peer (P2P) file-sharing applications, using ICMP Type 3messages to detect worm becomes difficult. The reason is thatthere are many similar activities between worm and P2P appli-cations. But, by analyzing the worm activities, we still can getsome characteristics only can be found in worms. In this paper,we present an early warning system by collecting and analyz-ing ICMP T3 messages and worm characteristic matching. Byanalyzing the ICMP T3 messages we can get doubtful events.By matching the characteristics of worms we can determinewhether doubtful events are real worms or not. Therefore, wecan detect a new worm in early infection stage and generatean alert to avoid serious damage.

An Error Control Scheme for the Routing ControlOnboard the Satellite Repeater

Shunsuke Saiki, Akira Ogawa, Takaya Yamazato

This paper is concerned with performance evaluation for er-ror control of the routing information onboard the simplifiedsatellite repeater for broadband satellite communications. Thenecessary information for the onboard routing is carried on thepreamble portion placed at the top of the packet and modu-lated with the differential binary PSK. In this paper, we adopta simple two- dimensional parity check code for the routinginformation. It is decoded by iterated soft decision decoding,then the error correction is performed together with the era-sure processing. We describe the results obtained by computersimulation in terms of the block error rate, the erasure rateand the erroneous erasure rate.

Tue4-3 : Network Coding

Characterization of Communication Cost Using anInformation Theoretic Approach

Terence H. ChanIn this paper, we use an information-theoretic approach tostudy the minimal communication cost required to solve a dis-tributive computing problem involving multiple participatingparties connected by an underlying communication network.The set of admissible communication cost (in terms of theamount of information transmitted along each communicationchannel) tuples are identified and its outer bounds are alsoobtained. Furthermore, we prove that the separation of ”datatransportation” and ”computation” layers may be suboptimal.

Architecture for Efficiently Decodable NetworkCodes

Terence H. ChanThis paper studies the use of ”hypertrees” to disseminate datato a group of receivers. Compared to traditional routing-based approach, the proposed one can achieve higher networkthroughput (and hence can operate at a lower cost) at theexpense of moderate increase in computing costs at receiversand a set of selected network nodes. A heuristic algorithm isthen proposed to obtain cost-efficient hypertree-based multi-cast schemes.

Calculus of Service Guarantees for Network Coding

Ali Mahmino, Jerome Lacan, Christian Fraboul

A large class of networks is able to provide some guarantees interms of quality of service, end-to-end delays and throughput

to data flows. In return, the data flows must verify constraintsof burstiness and throughput.

The aim of this work is to introduce and evaluate the net-work coding for independent flows in such networks. First,we present efficient coding nodes strategies allowing the build-ing of output flows as a combination of a subset of all theinput flows. These strategies are evaluated in terms of max-imal output throughput, maximum buffer size and maximalcrossing-delays of the network node.

In a second part, we show that a generalization of these re-sults to a complete network can be obtained through a transfermatrix whose entries are expressed in terms of network calcu-lus.

Thanks to the formalism used to characterize the flows, theobtained results can be considered as guarantees in terms ofthe burstiness, buffers size or end-to-end delays.

Tue4-4 : Mobile Communications

A Consideration for Protection Ratio of Radio RelaySystem with Diversity Techniques for FrequencyCoordination

Kyoung-Whoan Suh, Joohwan Lee

In this paper, the efficient and generalized algorithm of theprotection ratio and its mathematical formulation are newlysuggested for radio relay systems with diversity. The net fil-ter discrimination has been also examined to see the effect ofthe adjacent channel protection ratio caused by adjacent chan-nel interference. Protection ratios are investigated in terms ofdiversity improvement factor related with main and diversityantenna gains, distance between main and diversity antennas,and carrier frequency. The presented method gives easy andsystematic extension to calculate the protection ratio and canbe applied to the initial planning of frequency coordination forfixed wireless networks up to millimeter wave band.

An Improvement of Closed-loop Transmit Diversitywith Three Transmit Antennas

Manabu Sugawara, Eiji Okamoto, Yasunori Iwanami

Transmit diversity techniques is one of the solutions in thewireless communication. In this techniques, multiple anten-nas are used in the transmitter, and it enables a small andlightweight receiver. Moreover, transmit diversity needs feed-back bits, including the information of fading in the channelfrom receiver to transmitter, because the fading needs to beequalized at the transmitter. The feedback information isquantized at the receiver to reduce the number of bits. Inthe quantization, the information vector is quantized into afixed point or a differential phase, and it is known that theiterative LIoyd algorithm is effective in this calculation. Inthis paper, we propose an improvement scheme of closed-looptransmit diversity which generates a better performance withfewer feedback bits based on LIoyd algorithm.

A Study on Route Diversity Effect Using TurboCodes in Mesh Networks

Tadahiro Wada, Abbas Jamalipour

In this paper, we show the performance of route diversity ef-fect in wireless mesh networks. Wireless mesh networks are akey technology for next generation wireless networking. In themesh networks, many relay nodes are spread in a geographi-cal area and make an ad-hoc wireless network having a meshstructure. Multi-route transmissions are available in the meshnetworks and can achieve high link quality because of the routediversity effect. It is well known that forward error correctionschemes and turbo codes significantly enhance the diversity ef-fect. In this paper, we investigate the route diversity effectby turbo codes in wireless mesh networks. We evaluate theBER performance in the mesh networks and show that the ef-fect can prevent large performance degradation against AWGNenvironment.

15


Analysis of Jong Nang Multiple Access Channel

MoonHo Lee, Xueqin Jiang, Chang-hui Choe, Sung Hoon Kim

In this paper, we describe the Jong Nang which used the binarysystem similar to digital communications and computers today.Three timbers were exactly like three binary digits. And wecompute the capacity of the Jong Nang channel, and proposea modified code for the Jong Nang detect the error in case thatat an error occurs because one timber falls down from its place.

A Simple Cooperative Mobile Selection inCooperative Diversity System

Sung-Yeon Kim, Hyo-Shil Kim, Youn-Shik Byun

Cooperative diversity has been recently proposed as a wayto form virtual antenna arrays that provide dramatic gainsin slow fading wireless environments. However, most of theproposed solutions require distributed space-time coding algo-rithms, the careful design of which is left for future investiga-tion if there is more than one cooperative relay. We proposea simple cooperative mobile selection in cooperative diversitysystem. The power and the bandwidth of the proposed cooper-ative user selection scheme are equal to those of a cooperativeand non-cooperative scheme. By using this method, trans-mitted signals are sent to multiple users, and then to the basestation. The performance of cooperative diversity is best whenselect maximizing channel capacity among branch channel ca-pacities. The success (or failure) to select the best availablepath depends on the statistics of the wireless channel, and amethodology to evaluate performance for any kind of wirelesschannel statistics, is provided. Information theoretic analy-sis of outage probability shows that our scheme achieves thesame diversity-multiplexing tradeoff as achieved by more com-plex protocols, where coordination and distributed space-timecoding for relay nodes is required, such as those proposed byLaneman and Wornell (2003). The simplicity of the techniqueallows for immediate implementation in existing radio hard-ware and its adoption could provide for improved flexibility,reliability, and efficiency in future 4G wireless systems.

Tue4-5 : OFDM

New Selection Method of Near Optimal PRT Set inTR Scheme for PAPR Reduction of OFDM

Dae-Woon Lim, Hyung-Suk Noh, Jong-Seon No, Dong-JoonShinIn the tone reservation (TR) scheme, it is known that the setof randomly selected peak reduction tones (PRT’s) performsbetter than the contiguous PRT set and the interleaved PRTset in the PAPR reduction of orthogonal frequency divisionmultiplexing (OFDM). It is also known that finding the opti-mal PRT set corresponds to the secondary peak minimizationproblem in the TR scheme. But, the problem cannot be solvedfor the practical number of tones since it is NP-hard. In thispaper, a new search algorithm for the near optimal PRT set isproposed based on the fact that the secondary peak value ofthe PRT set statistically tends to decrease as the variance ofthe PRT set decreases.

Frequency Domain Turbo Equalization Combinedwith Frequency Offset Compensation in UplinkOFDMA Systems

Yuusuke Miyauchi, Takahiko Saba

In uplink orthogonal frequency division multiple ac-cess (OFDMA) systems, the amounts of carrier frequency off-set (CFO) are different in each user. CFO spoils the or-thogonality among subcarriers, and causes intercarrier inter-ference (ICI) and multiple access interference (MAI). Since ICIand MAI degrade the demodulation performance significantly,CFO compensation is required in uplink OFDMA systems. Inthis paper, we propose a CFO compensation scheme whichuses frequency domain turbo equalization with soft cancella-tion. The proposed receiver accomplishes CFO compensationand channel equalization simultaneously in the frequency do-main. Simulation results show that the proposed receiver at-tains a bit error rate (BER) performance which is almost the

same as that in the case without CFO when the variance ofoffset among users is small.

Turbo Detector Using Modified SISO-MLD for CCISuppression in LDPC Coded SDM-OFDM Systems

Shoichi Sasahara, Takahiko Saba

In space division multiplexing with orthogonal division multi-plexing (SDM–OFDM) systems, since co-channel interference(CCI) degrades the demodulation performance, CCI suppres-sion is essential. For CCI suppression, a turbo detector withsoft cancellation (SC) followed by minimum mean square error(MMSE) filter is well known. However, although SC/MMSEdetector realizes the turbo detection by simple processing, it re-quires a number of iterations to achieve a reasonable CCI sup-pression performance. Therefore, we consider to apply max-imum likelihood detector (MLD) to the turbo detector. Inthis paper, we propose an SC/MLD to improve the CCI sup-pression performance in LDPC coded SDM–OFDM systems.In our proposed detector, soft-in soft-out (SISO) MLD is em-ployed and modified to cope with SDM–OFDM systems. Fromthe simulation results, the performance of SC/MLD is superiorto that of SC/MMSE detector by more than 3 [dB] of bit errorrate (BER) of 10−3.

Reactance-domain Modulation Scheme for BurstError Reduction of ISDB-T in Slow FadingEnvironment

Young-Cheol Yu, Minoru Okada, Heiichi Yamamoto

In this paper, we propose a reactance-domain modulationscheme for burst error reduction of ISDB-T (Integrated Ser-vices Digital Broadcasting for terrestrial) in slow fading envi-ronment. The Japanese DTTB (Digital Terrestrial TelevisionBroadcasting) standard, ISDB-T, employ OFDM (OrthogonalFrequency Division Multiplexing) for its transmission scheme.Thanks to the efficient FEC (Forward Error Correction) withlong-depth time interleaving, ISDB-T is capable of receivingthe signal in severe fading channel. In slow fading environ-ment, burst error deteriorates its performance because the fadeduration exceeds the interleaving depth. In order to solve thisproblem, we propose a reactance domain modulation scheme,which virtually generates the fast fading for efficient use of timeinterleaving. Our proposed scheme can solve burst error prob-lem in slow fading environment. Computer simulation resultsshow effectiveness of our proposed scheme.

Delay and Buffer Size Bounds for OFDM BroadcastSystems

Gerhard Wunder, Chan Zhou, Thomas Michel

Upper bounds on the maximum average delay and queue lengthof an OFDM broadcast system are derived. The system ismodeled as a queue system including information-theoreticand queuing-theoretic characteristics like the channel state, thepower constraint and packet arrival rate. Choosing an appro-priate set of Lyapunov functions a general path for bound-ing the polynomial moments is provided. Explicit bounds areprovided for the first and second moment. Furthermore, it isshown that all moments are finite and converge geometricallyto their stationary values. Thus, the system is stable in a verystrong sense.

Wed1-1 : Weight Distribution

Asymptotic Average Coset Weight Distribution ofMulti-Edge Type LDPC Code Ensembles

Kenta Kasai, Yuji Shimoyama, Tomoharu Shibuya, KohichiSakaniwaMulti-Edge type Low-Density Parity-Check codes (MET-LDPC codes) introduced by Richardson and Urbanke are gen-eralized LDPC codes which can be seen being constituted ofsome standard (ir)regular LDPC codes. We prove MET-LDPCcode ensembles possess a certain symmetry with respect totheir average coset weight distributions (ACWD). Using thesymmetry, we drive asymptotic ACWD of MET-LDPC code

16


ensembles from asymptotic ACWD of their constituent con-stituent ensembles.

Support Weight Distribution of Regular LDPC CodeEnsembles

Takayuki Itsui, Kenta Kasai, Ryoji Ikegaya, TomoharuShibuya, Kohichi Sakaniwa

The support weight distribution of a code is the number ofsubspaces of the code with specified dimension and supportweight. In this paper, we formulate the average support weightdistribution of regular LDPC code ensembles.

New Probabilistic Algorithm to Enhance theReliability of Computed Weight Distribution ofLDPC Codes

Masanori Hirotomo, Masami Mohri, Masakatu Morii

We have proposed a probabilistic method for computing theweight distribution of LDPC codes. In this method, we useStern’s algorithm which finds the low-weight codewords to es-timate the weight distribution for the low-weight codewords.However, there are some differences between the computedweight distribution and the true weight distribution. In thispaper, we propose two probabilistic algorithms in order to es-timate the weight distribution of LDPC codes with high accu-racy. These algorithms are used instead of Stern’s algorithmto find the low-weight codewords quite randomly. Using thesealgorithms, we can improve the reliability of the weight distri-bution computed by the probabilistic method.

An Efficient Method for Computing the MinimumWeight of High Rate Binary Cyclic Codes

Zheyu Li, Masami Mohri, Masakatu Morii

It is important to develop the efficient method for comput-ing the minimum weight of error correcting codes in order toestimate the performance of the codes. In general, it is diffi-cult to compute the minimum weight dmin or the number ofcodewords with its weight for the (n, k) linear code with largecodelength n and information digits k. Although some effi-cient methods for binary cyclic codes with low rate have beenproposed, efficient method has not shown for the code of highrate. In this paper, we propose a method for computing theminimum weight of binary (n, k) cyclic codes with high rate(k/n > 1/2). It is based on the properties of n-sparse. Forany binary (n, k) cyclic codes with high rate, the complexityof our method is very small compared with the conventionalmethods.

On Relation between the Defining Set and theWeight Distribution for Cyclic Codes

Takayasu Kaida, Junru Zheng

We discuss the weight distribution for cyclic codes defined bythe defining sets. In order to study on relation between thedefining set and the weight distribution, a condition for con-necting with cyclic codes by distinct defining sets is investi-gated. Moreover some examples of binary cyclic codes withlength 15 and 63 are given.

Wed1-2 : Quantum InformationProcessing (1)

Property of Optimum Quantum Detection for MixedStates with Non Gaussian and Gaussian Noise

Toshiyuki Tsuchimoto, Tomohiro Sawada, Shogo Usami,Tsuyoshi Sasaki Usuda, Ichi Takumi

To derive an optimum detection minimizing the average prob-ability of error is a fundamental problem in quantum detectiontheory. So far, optimum detections have been derived for manysignals. Almost solutions are for pure-state signals. However,a study of mixed-state signals is important not only for reli-able communications but also for secure communications. Inthe present paper, a property of minimum error probability is

considered for mixed states with non Gaussian noise, which areartificial mixed-state signals.

Characteristics of Classical Capacity of anAttenuated Channel Assisted by OrthogonalEntangled States

Seiji Hattori, Tsuyoshi Sasaki Usuda

It had been shown that use of entanglement enhances classical

communications. We compute the capacity C(1)Bell assisted by

orthogonal entangled states. We compare it with the capacityCsq assisted by two-mode squeezed states when the quantumchannel is an ideal channel or an attenuated channel.

Counter-examples of the Trace Inequalities Relatedto the Auxiliary Function of the Quantum ReliabilityFunction

Shigeru Furuichi, Kenjiro Yanagi

We study the open problem given by Holevo and Ogawa-Nagaoka on the concavity of the auxiliary function of the quan-tum reliability function. Firstly we review the previous resultson this problem in the case that the parameter s is positive.Secondly we consider the problem in the case that the param-eter s is negative.

Artificial but Fully Quantum Description Approachto Quantum State Distinction Problem

Kentaro Imafuku, Hideki Imai

When distinguisher, who tries to distinguish two non-orthogonal quantum states, employs the best strategy, theinterference term between the ”success world” and ”failingworld” vanishes.

Wed1-3 : Random Number

Generation of a Discrete Distribution Using BiasedCoins

Danielle P. B. de A. Camara, Valdemar C. da Rocha Jr.,Cecilio PimentelThe efficient generation of a discrete probability distributionis of current interest in areas like cryptography and randomnumber generation. This paper presents an algorithm for gen-erating a discrete distribution using two or more coins, beingone of them unbiased. In particular, this approach contributesan alternative solution to the classical problem of generatinga discrete uniform probability distribution using two or moredistinct coins.

Analysis for Pseudorandom Number GeneratorsUsing Logistic Map

Shunsuke Araki, Takeru Miyazaki, Satoshi Uehara

We are studying a pseudorandom number generator with thelogistic map. A suitable basic parameter, a precision of thegenerator, must be needed in order to design an algorithm ofthe generator. In this paper we defined a simple algorithm ofthe generator and checked randomness for the output by theNIST statistical test. Thus this numerical experiment showsthe shortest precision, 56 bits. Additionally, we discussed whytwo precisions, 54 bits and 60 bits, were not suitable param-eters. Last, we gave an attack for the generator with a shortprecision.

Correction of Overlapping Template Matching TestIncluded in NIST Randomness Test Suite

Kenji Hamano, Toshinobu Kaneko

Accurate values for occurrence probabilities of the templateused in the overlapping template matching test included inNIST randomness test suite (NIST SP800-22) have been an-alyzed. The inaccurate values used in the NIST randomnesstest suite cause significant difference of pass rate. When theinaccurate values are used and significance level is set to 1%,

17


the experimental mean value of pass rate, which is calculatedby use of random number sequences taken from DES (DataEncryption Standard), is about 98.8%. In contrast, our newvalues derived from a set of recurrence formulas for the NISTrandomness test suite give an empirical distribution of passrate that meets the theoretical binomial distribution. Here,the experimental mean value of pass rate is about 99%, whichcorresponds to the significance level 1%.

A Keystream Resynchronization by Time andPrecision Information

Janghong Yoon

An Effective Simple Fuzzy Approach for Stable RealRandom Number Generator

Sunchun Park, Youngmi Park, Daesun Park, Chunsu Kim,ChoogHo Cho

Wed1-4 : Sensor Networks

Measurement of Distance Between Nodes in anAd-hoc Network by Multiple Acoustic Waves

Wataru Uemura, Masashi Murata

On ad-hoc network, distance information between nodes isneeded for making packets routing tables. Usually we get in-formation of a wireless signal power from a wireless networkcard because there is a relationship between the wireless signalpower and distance information between nodes. Some net-work cards, however, do not provide us a wireless signal poweror such information. In this paper, we provide a novel dis-tance measurement method using acoustic waves. The receiv-ing acoustic waves consist of a direct wave and reflected waves.The power of the direct wave varies inversely as the distance,and the power of the reflected waves have periodicity. It istoo difficult for a node to know the distance information fromthe power of the receiving acoustic wave because of the peri-odicity of reflected waves. The periodicity of reflected wavesdepends on the wave length. In this paper, we propose thedistance measurement method with multiple sine waves. Andexperiments show its implementability.

Acoustic Sensing for Detection of ApproachingVehicles

Kensaku Asahi, Fumiyasu Miyoshi, Akira Ogawa

We have been in research for preventing vehicles from head-oncollision by sound, and focused on the sound from tires of avehicle. So far, the direction of approaching vehicles has beendetected with two microphones onboard the vehicle, whichis called the basic scheme. The detection time of the basicscheme, however, may be affected by ambient noise such assound of engine. We have developed an improved scheme inwhich the direction of approaching vehicle is to be detectedfrom the sound signals captured with multiple pairs of micro-phone arrays. In addition, experimental results on the effectof engine sound are shown in this paper.

Bayes Stopping Rule for Wireless Sensor Networks

Jin Kyung Park, Woo Cheol Shin, Jun Ha, Cheon Won Choi

A wireless sensor network is a network of compact micro-sensors equipped with wireless communication capability. Ina wireless sensor network, sensor nodes are usually battery-powered and it is difficult to change or recharge their batteries.Also, a wireless sensor network is often deployed to collect andupdate data periodically. Late delivery of a data segment by asensor node causes the sink node to defer data processing andthe data segment itself to be obsolete. Thus, such a wirelesssensor network gives rise to two critical issues; saving energyand supporting timeliness in data delivery. Intending to re-solve these issues, we propose a version of ALOHA as a MACscheme for a wireless sensor network. While conserving thesimplicity and robustness of the original version of ALOHA,the proposed version of ALOHA possesses a distinctive featurethat a sensor node decides between stop and continuation prior

to each delivery attempt for a packet. Such a decision needs astopping rule and we suggest a Bayes stopping rule. Note thata Bayes stopping rule minimizes the Bayes risk which reflectsthe energy, timeliness and throughput losses. Also, a Bayesstopping rule is practical since a sensor node makes a decisiononly using its own history of delivery attempt results and theprior information about the failure in delivery attempt. Nu-merical examples confirm that the proposed version of ALOHAcombined with a Bayes stopping rule is a useful MAC schemein the severe environment of wireless sensor network.

Iterative Joint Channel-Decoding Scheme Using theCorrelation of Transmitted Information Sequences inSensor Networks

Kentaro Kobayashi, Takaya Yamazato, Hiraku Okada,Masaaki Katayama

In this study, we consider joint channel decoding of Turbo codefor multiple correlated data that are observed by sensor nodesdensely deployed in a sensor field. We focus on the correla-tion properties of observation data and try to reduce decodingerror by an iterative procedure. An approach to use practicalchannel codes for more than two correlated data is still not pre-sented. A problem in the extension to cases of more than twosensor nodes is how to use the information of correlation ob-tained from observation data. In this study, we propose an iter-ative channel decoding scheme that uses them with weighting.We show that when the number of sensor nodes is increased,decoding performance improvement cannot be achieved by sim-ple weighting, and so a more appropriate weight is needed. Wefind the optimum weight that minimizes the bit error rate fromthe analytical formula for uncoded BPSK and apply it to thecase of Turbo code.

Wed1-5 : Image & Speech

Sign-only Synthesis

Zhimei Yang, Hiroshi Kondo, Takaharu Koda, Lifeng Zhang

Sign-only syntheses [1] of several typical and real orthogo-nal transforms are presented. Phase-only synthesis is intro-duced by ”Image recovery -Theory and Application-” writtenby Henry Stark. Sign-only synthesis is the extended versionof the Phase-only synthesis. Sign-only synthesis is defined asan inverse transform of only signs of the transform coefficientsand has a variety of applications. Employed orthogonal trans-forms are Discrete Cosine Transform, Hadamard transform,Binarized Fourier Transform and Karhunen-Loeve Transform.These transforms have real number resulting coefficients andthen it looks interesting to know the property of each trans-form signs. The characteristics of these Sign-only synthesisare compared each other. And interesting nature of trans-form signs are extended. One application of Sign-only synthe-sis is shown as a facial authentication. Keywords : Orthogo-nal transforms, Sign-only synthesis , Discrete Cosine Trans-form, Hadamard Transform , Binarized Fourier Transform,Karhunen-Loeve Transform

Statistical Methods for a Large VocabularyContinuous Speech Recognition System for Hindi

Kshitij Gupta, Pramod Kumar Sharma

In this paper we describe a large vocabulary continuous speechrecognition (LVCSR) system for Hindi based on statisticalmethods. While a rule based approach provides a reasonablespelling to phone sequence mapping, it, however, requires anin-depth knowledge of the linguistics of the language and be-comes difficult to account for certain anomalies through rules.Statistical methods provide a better alternative by using thetraining data available to develop trainable models that adaptto actual speech with greater ease and efficiency as comparedto the rule based techniques. Hidden Markov Models (HMM)have been utilised for modelling continuous speech, with phonesized segments and Gaussian Mixture Models (GMM) for mod-elling probabilities which also facilitate associating acousticdifferences with corresponding labels. We present a completeoverview of the proposed system from the initial speech sig-nal processing using Mel filter cepstral coefficients (MFCC),through acoustic modelling using HMM that incorporates ini-

18


tialisation as well as training, and the language model, finallyelaborating upon the Viterbi decoding for recognition. Spe-cial emphasis has been laid on aspects of the system that arelanguage specific and should be adapted for better output.

Supplement to a Theorem for Biorthogonal Bases ofWavelets and a Consideration of Four-term Sequence(hn)

Hajime Sato

We propose a variation of the theorem already obtained in 1992by Cohen, Daubechies and Feauveau to give necessary andsufficient conditions for biorthogonality of the corresponding

scaling functions φ and eφ. Their theorem brings us a simpleprocedure to check that a pair of finite real sequences (hn) and

(ehn) generate biorthogonal bases of wavelets.We make a single-sequence version of the theorem to give

necessary and sufficient conditions only for (hn) to generate ascaling function φ of some multiresolution analysis. Since forany scaling function φ there exists at least one scaling functioneφ with biorthogonality to each other, our conditions turn outto be sufficient for (hn) to generate biorthogonal wavelets. The

associated sequence (ehn) is not necessarily finite, in this case.Numerical results about 4-term sequences (hn) satisfying our

conditions are depicted.

Application of Background Subtraction withRenewable Background to Gesture Region Extraction

Akio Ogihara, Hiroshi Matsumoto, Akira Shiozaki

Background subtraction algorithm is often used in image pro-cessing in order to extract moving object. In this paper, wepropose a new background subtraction algorithm. In the pro-posed method, we introduce the renewal of background imageaccording to the situation of input image. In comparison withthe conventional method, our method is able to extract mov-ing object more accurately and more efficiently. Moreover, theproposed method has been applied to gesture region extractionas one of its applications.

A Study on the Expansion of a ResolutionConversion Method into Rational Scale UsingNeighboring Blocks’ DCT Coefficients

Tomio Goto, Yoshihiro Shinkai, Masaru Sakurai, TadashiKitamuraThere are a number of approaches for converting image res-olution. In general, resolution conversion takes place in thespatial domain, which is a straightforward method. How-ever, DCT (Discrete Cosine Transform) is often used in im-age compression. Resolution conversion in the DCT domainis noteworthy because this method can convert image reso-lution with compressed image data (ex. JPEG and MPEGformats) without decoding so that the resolution conversionprocess in this method is faster than that in the straightfor-ward method. However, there are many problems in which thescaled up images have blocky noise, the edges are blurry andthe basis length after transformation is not the same as beforetransformation, so general decoders such as JPEG and MPEGcannot be used in this method.

We have proposed a new conversion method in the DCTdomain using neighboring blocks’ DCT coefficients. It is pos-sible to convert image resolution and to improve resolutionconversion images by decreasing edge blur and blocky noise.However, using this method was not possible to scale up atrational rates, and it was not useful for resolution conversion.So, we propose an expansion to rational rates for this method.

Wed2-1 : Coded Modulation andSpace-Time Codes

Improved Decoding for Trellis Coded Modulationwith a Convolutional Processor

Yeong-Luh Ueng, Ruey-Yi Wei, Chia-Jung Yeh, Mao-ChaoLin, Jun-Yun Lu

It is already known that trellis coded modulation (TCM), con-structed by using the encoder of a convolutional code C withshort constraint length followed by a convolutional processorand a signal mapper, can achieve large squared free distances,where the convolutional processor is a rate-one convolutionalcode with large constraint length. The previously used decod-ing results in large error coefficients and hence the obtainedcoding gain is distant from the asymptotic coding gain. In thispaper, we propose to use an expanded trellis of C with somerecovered information to decode the TCM. With the proposeddecoding, additional coding gain can be obtained as comparedto the previously used decoding.

Golden Space-Time Trellis Coded Modulation

Yi Hong, Emanuele Viterbo, Jean-Claude Belfiore

In this paper, we present a multidimensional trellis coded mod-ulation scheme for a high rate 2 × 2 multiple-input multiple-output (MIMO) system over slow fading channels. Set parti-tioning of the Golden code is designed specifically to increasethe minimum determinant. The branches of the outer trelliscode are labeled with these partitions. Viterbi algorithm is ap-plied for trellis decoding. In order to compute the branch met-rics a sphere decoder is used. The general framework for codeoptimization is given. Performance of the proposed scheme isevaluated by simulation and it is shown that it achieves signif-icant performance gains over uncoded Golden code.

New Optimal Rate-Diversity Tradeoff Space-TimeCodes with Adaptive Iterative Decoding

Wen-Hsien Chiu, Hsuan-Jung Su

The design of smart-greedy space-time (ST) codes for multiple-input multiple-output (MIMO) wireless systems in a varietyof mobility conditions is an open problem of great interest.Motivated by the space-time codes proposed by Lu and Ku-mar, which achieve the optimal tradeoff between the trans-mission rate and the transmit diversity gain, we propose analgebraic method for constructing optimal rate-diversity trade-off ST codes in the smart-greedy sense. This construction isshown to achieve the optimal rate-diversity tradeoff in quasi-static fading channels and provide outstanding potential forseizing temporal diversity in fast fading channels.

Performance Comparison Between ConventionalSpace-Time Block Code and Proposed ConstellationRotation Space-Time Codes

Mea-Hwa Park, Hyo-Shil Kim, Jong-Deuk Kim, Youn-ShikByun

Conventional STBC(Space-Time Block Code) from orthogonaldesigns proposed by Alamouti [1], have attracted much atten-tion lately due to their fast MLD(Maximum Likelihood Decod-ing) and full diversity. But coding gain is another importantfactor in the performance of the system. Face to this problem,we analyze the performance of multiple transmit/receive an-tenna systems with CR(constellation Rotation) precoder calledCR-STC. STBC which based on CR code has maximum diver-sity gain and more coding gain than conventional STBC with-out sacrificing additive bandwidth in frequency quasi-staticfading channels. In this paper, we set the receive antennanumber 2, and combine the improved STBC which based onnew CR codes with MIMO-OFDM systems. Then continue toanalyze the performance of system with the schemes proposedin this paper. Finally, we make a comparison between the per-formance of the system with new proposed CR-ST algorithmsand that of conventional scheme. Using 4QAM modulation,simulation result shows the proposed scheme called Method1 and Method 2 have about 0.5 dB, 1 dB more performanceimprovements than conventional STBC at BER=10−2, respec-tively.

19


Wed2-2 : Quantum InformationProcessing (2)

Entanglement of Formation of a DecoheredQuasi-Bell State

Ryutaro Yamamoto, Tsuyoshi Sasaki Usuda, Ichi Takumi

Recently it has been shown that the entangled state bynonorthogonal states such as coherent state of light can havecomplete degree of entanglement. However, when we gener-ate it experimentally and apply to quantum protocols, it isnecessary to consider various incompleteness of the entangledstates. In the present paper, we consider degradation prop-erty of entanglement of decohered quasi-Bell states by usingEntanglement of Formation.

Quantum Secure Direct Communication Protocolsfor Sending a Quantum State

Yumiko Murakami, Masaki Nakanishi, Manabu Hagiwara,Shigeru Yamashita, Yasuhiko Nakashima

We propose a new quantum secure direct communication pro-tocol, which has an advantage of combining the following fea-tures over related works: The protocol allows us to send aquantum state in security; The proper sender and receiver candetect an eavesdropper efficiently; The protocol employs noentanglement resource, and thus it is relatively easy to be ex-perimented in current technology.

Uncertainty Principle and Oblivious Transfer

Takayuki Miyadera, Hideki Imai

We discuss security of a quantum protocol by using the uncer-tainty relation, the most fundamental principle of the quan-tum theory. We generalize a “probabilistic” uncertainty rela-tion which was obtained by I.Damgaard, S.Fehr, L.Salvail, andC.Schaffner to prove the security of quantum oblivious transferunder the assumption of quantum bounded storage. Our gen-eralization yields us to generalize their result on the memorysize to more realistic circumstance.

Perfect Single-Error-Correcting Binary Code forInteractive Secret Key Reconciliation

Koichi YamazakiHow to construct perfect single-error-correction codes for inter-active secret key reconciliation is proposed to reduce the pro-cess time of secret key reconciliation protocol, which could bedominated by interactive communication through public chan-nel. First, we show the Hamming bound modified for error cor-recting codes for an interactive secret key reconciliation. Thenwe propose explicit coding and decoding algorithms. Paritycheck matrices proposed here is constructed by modifying bi-nary Hamming codes. Computer simulation results are givento compare performance of an interactive secret key reconcili-ation with the proposed code and BBBSS protocol.

Wed2-3 : Pattern Recognition

A Note on Spelling Correction Methods Based uponStatistical Decision Theory

Yasunari Maeda, Hideki Yoshida, Yoshitaka Fujiwara,Toshiyasu Matsushima

A spelling correction problem is one of important topics in thefield of NLP(Natural Language Processing). In previous re-search a DMC(Discrete Memoryless Channel) with unknownparameters has been used as a model for generating misspelledwords. In the previous research the spelling correction problemwas divided into two problems, estimating the unknown pa-rameters of stochastic models and correcting misspelled words.MLE(Maximum Likelihood Estimate) was used in the previ-ous research basically, but there was no reason why MLE wasused. There was no theoretical guarantee when the number ofdata for learning was finite.

In this paper we treat estimating the unknown parameters

and correcting misspelled words as one problem based uponstatistical decision theory. In the spelling correction problemthere are three kinds of error rates, an error rate per sentence,an error rate per word, an error rate per alphabet. The errorrate is the probability of failure in correcting misspelling. Inthis paper we treat the error rate per sentence and the errorrate per word. We propose optimal methods which minimizethe error rates with reference to the Bayes criterion and ap-proximate methods in order to reduce computational complex-ity.

Fast Nearest Neighbor Search Algorithm forWaveform Quantization Using Reflection Group

Shuichi Maki, Nobumoto Yamane, Yoshitaka Morikawa

Highspeed implementations have been studied in the field ofvector quantization (VQ). In the existing prequantization (PQ)method, we fast quantize an input vector by scalar quantiza-tion (SQ) and then we perform full search (FS) VQ by using thereduced codebooks corresponding to SQ outputs(P-SQ). Thispaper, using kaleidoscope VQ (KVQ), extends the PQ methodto VQ on unit hypersphere(P-KVQ). KVQ is considered ashyperspherical lattice VQ, in which lattice points can be gen-erated by reflections, and can be implemented only by sortingand signchanging of input vector components. Computer simu-lations, using 4 and 8 dimensional codebooks designed for uni-form hyperspherical distribution, showed that we can reducequantization time to 3% of the direct FSVQ and superiority ofP-KVQ for P-SQ is shown by comparisons of memory amount.

The Entropy Potential of a Discrete ProbabilityDistribution

Jan PolandIn this paper, a new information theoretic quantity for a prob-ability distribution pν : ν ∈ N on a discrete space N isstudied: the entropy potential. It is defined as the maximalentropy of all of the following legal transformations of the dis-tribution: There is one reference element µ ∈ N , and therespective probability pµ is kept fixed. All other probabilitiespν (ν 6= µ) can be arbitrarily decreased, after which the dis-tribution is renormalized. It is shown that the entropy poten-tial is a natural quantity describing the uncertainty of a classof hypotheses where one hypothesis is true, e.g. in Bayesianlearning. In particular, performance guarantees for a stochasticmodel selection learner can be shown using the entropy poten-tial. We prove characterizations and estimates, and computethe entropy potential for broad classes of discrete probabilitydistributions.

User Verification Method by Biometric Feature inKeystroke Motion and Key Press Timing

Akio Ogihara, Hiroyuki Matsumura, Akira Shiozaki

We propose an ATM (automatic teller machine) user verifica-tion method using biometric feature in keystroke motion. Inthe proposed method, ATM user verification is performed byusing the 10 types of biometric feature which are extractedfrom hand-shape in ATM operation. Moreover, we calculatethe similarity between current operator and genuine user inconsideration of key-press timing. The proposed method canimprove the safety of the present situation without special ad-ditional operation, physical load and psychological burden.

Wed2-4 : Ad Hoc Networks

Equalization Techniques for Multihop CooperativeWireless Networks with Asynchronous Relaying

Ryu Yamashita, Hidekazu Murata, Susumu Yoshida,Kiyomichi Araki

This paper presents the performance of a cooperative relay-ing scheme using single carrier transmission with frequencydomain equalization (SC-FDE) and that with time domainequalization (SC-TDE). A cooperative relaying scheme is thekey technique for multihop wireless networks to improve itsend-to-end transmission performance. When this network isan autonomous distributed network, timing synchronization

20


among relay stations in the hop is a challenging task sincepropagation delays are inevitably different among relay sta-tions. In this paper, equalization techniques are employed tocope with time asynchronous received signals from the previoushop. A delay diversity technique is used as a transmit diver-sity scheme for cooperation, since an equalizer can be usednot only to overcome asynchronous received signals but also todemodulate the signals with delay diversity. By computer sim-ulations, the effects of delay diversity and asynchronous relaysare investigated when SC-FDE and SC-TDE are applied to acooperative relaying.

Adaptive Modulation Schemes for MultihopCooperative Wireless Networks

Bao Thi Ngoc Pham, Hidekazu Murata, Susumu Yoshida,Kiyomichi Araki

Wireless multihop communications with cooperation of multi-ple relay terminals at each hop give diversity effect and showa significant frame error rate performance improvement thanthat without cooperation. To improve the spectral efficiencyof this communication networks, adaptive modulation is con-sidered.

In this paper, three schemes for adaptive modulationcontrols are investigated in cooperative multihop networks.Throughput performance of these schemes are investigated bycomputer simulations in Rayleigh fading channels assuming adelay diversity technique. In simulations, the received SNR isestimated based on the path metric of the Viterbi algorithm,and the channel estimation is done by recursive-least-squaresalgorithm (RLS).

Adaptive Node Selection Algorithm for Co-operativeMulti-hop Networks

Ryu Atsuta, Takahiko Saba

In multi-hop networks, the quality of transmission in a lowersignal to noise power ratio (SNR) link is improved by co-operative transmission. However, in a higher SNR link, co-operative transmission increases traffic load. Hence, the num-ber of co-operation nodes (C-nodes) is cautiously determinedwhen co-operative transmission is employed. In this paper, wepropose an adaptive algorithm to select an appropriate set ofC-nodes. We provide an adaptive algorithm based on a biterror rate criteria. The system using the proposed algorithmis evaluated by computer simulation in the network with andwithout interference. From the results, the system using ourproposed algorithm can reduce the traffic load and providegood transmission performance, because it selects a set of co-operative nodes adaptively according to SNR of the link.

Implementation of Mobile PPC Realizing Mobility ofMobile Nodes

Masaki Sejimo, Akira Watanabe

We have proposed a new communication system called MobilePPC (Mobile Peer to Peer Communication), which can keeptheir connections during their communications even thoughthey change their locations, without using any extra devices.We have implemented Mobile PPC in IP layer, and evaluatedthe system.

Wed2-5 : Sequences

Correlation Distribution of Quadriphase ZCZSequences Obtained from a Perfect Sequence and aUnitary Matrix

Shuichi Jono, Satoshi Uehara

A class of zero-correlation zone (ZCZ) sequences constructedby the recursive procedure from a perfect sequence and a uni-tary matrix was proposed by Torii, Nakamura, and Suehiro.In the reference, properties of just enough for the class ofsequences used in approximately synchronized CDMA (AS-CDMA) systems were considered. In this paper, we give moredetailed distributions of correlation values for their ZCZ se-quence sets, and expect that the results make an effect on anyapplications employing AS-CDMA systems.

Higher Dimensional Complete-ComplementarySequences: A General Approach

R. S. Raja Durai, Naoki Suehiro

In many applications in image, communications, signal pro-cessing, the notion of two-dimensional sequences are widelyinvestigated. This paper focuses on sets of n-dimensionalsequences that constitute a complete-complementary codesof sequences. A novel method to construct a class of n-dimensional complete-complementary codes of order No andsize Mn−1 ×Mn−2 × · · ·×Mo with Mn−1 ≤ Mn−2 ≤ · · · ≤ Mo

is presented. Since an n-dimensional complete-complementarysequences requires only the shorter-length complementary se-quences, it has a possitive impact on modulation scheme re-quirements under some circumstances. The advantage of an n-dimensional complete-complementary sets of sequences is thatit increases the maximum user count and processing gain fora given sequence size. What remains is to define a suitablen-dimensional channel over which the n-dimensional complete-complementary sets of sequences can be implemented.

On the Relationship of Sidel’nikov Sequences

Tae-Hyung Lim, Young-Sik Kim, Jung-Soo Chung, Jong-SeonNoIn this paper, the relationship among M -ary Sidel’nikov se-quences generated by different primitive elements and decima-tion are studied. Their autocorrelation function and autocor-relation distribution are derived. It is proved that Sidel’nikovsequences for a given period are equivalent under the decima-tion, cyclic shift, and scalar multiplication of the sequence.

21

Author Index

AAdrat, Marc . . . . . . . . . . . . . . . . . . . . . . . . . Tue1-3-2 p. 7Akane, Masataka . . . . . . . . . . . . . . . . . . . . Tue2-2-5 p. 9Alexandrova, Todorka . . . . . . . . . . . . . . . Tue2-2-1 p. 9Amadou Garba, Aminata . . . . . . . . . . . . Tue3-4-1 p. 12Aoki, Satoshi . . . . . . . . . . . . . . . . . . . . . . . . Mon1-2-1 p. 1Araki, Kiyomichi . . . . . . . . . . . . . . . . . . . . Wed2-4-1 p. 20Araki, Kiyomichi . . . . . . . . . . . . . . . . . . . . Wed2-4-2 p. 21Araki, Shunsuke . . . . . . . . . . . . . . . . . . . . . Wed1-3-2 p. 17Asahi, Kensaku . . . . . . . . . . . . . . . . . . . . . . Wed1-4-2 p. 18Asatani, Jun . . . . . . . . . . . . . . . . . . . . . . . . Tue1-1-5 p. 6Ata, Shingo . . . . . . . . . . . . . . . . . . . . . . . . . Mon2-4-2 p. 5Atsuta, Ryu . . . . . . . . . . . . . . . . . . . . . . . . . Wed2-4-3 p. 21Attrapadung, Nuttapong . . . . . . . . . . . . Mon2-2-5 p. 4

BBajcsy, Jan . . . . . . . . . . . . . . . . . . . . . . . . . . Tue3-4-1 p. 12Bannai, Banri . . . . . . . . . . . . . . . . . . . . . . . Mon2-1-1 p. 3Beaudoin, Vincent . . . . . . . . . . . . . . . . . . . Tue1-3-4 p. 7Belfiore, Jean-Claude . . . . . . . . . . . . . . . . Wed2-1-2 p. 19Berksoy, Burak . . . . . . . . . . . . . . . . . . . . . . Tue2-4-3 p. 10Berksoy, Burak . . . . . . . . . . . . . . . . . . . . . . Tue2-4-5 p. 10Bhargava, Vijay K. . . . . . . . . . . . . . . . . . . Tue2-3-3 p. 10Bista, Bhed Bahadur . . . . . . . . . . . . . . . . Tue1-2-3 p. 6Boche, Holger . . . . . . . . . . . . . . . . . . . . . . . Tue1-5-2 p. 8Boche, Holger . . . . . . . . . . . . . . . . . . . . . . . Tue3-3-1 p. 12Boche, Holger . . . . . . . . . . . . . . . . . . . . . . . Tue3-3-2 p. 12Boche, Holger . . . . . . . . . . . . . . . . . . . . . . . Tue3-3-3 p. 12Boche, Holger . . . . . . . . . . . . . . . . . . . . . . . Tue3-3-5 p. 12Byun, Il Mu . . . . . . . . . . . . . . . . . . . . . . . . . Tue2-1-3 p. 9Byun, Youn-Shik . . . . . . . . . . . . . . . . . . . . Tue1-5-3 p. 8Byun, Youn-Shik . . . . . . . . . . . . . . . . . . . . Tue3-5-2 p. 13Byun, Youn-Shik . . . . . . . . . . . . . . . . . . . . Tue4-4-5 p. 16Byun, Youn-Shik . . . . . . . . . . . . . . . . . . . . Wed2-1-4 p. 19

CCamara, Danielle P. B. de A. . . . . . . . . Wed1-3-1 p. 17Chan, Terence H. . . . . . . . . . . . . . . . . . . . . Tue4-3-1 p. 15Chan, Terence H. . . . . . . . . . . . . . . . . . . . . Tue4-3-2 p. 15Cheng, Jay . . . . . . . . . . . . . . . . . . . . . . . . . . Tue1-3-3 p. 7Cheng, Jun . . . . . . . . . . . . . . . . . . . . . . . . . . Tue2-5-4 p. 11Cheong, Il-Ahn . . . . . . . . . . . . . . . . . . . . . . Tue1-2-2 p. 6Cheun, Kyungwhoon . . . . . . . . . . . . . . . . Mon2-4-4 p. 5Chiani, Marco . . . . . . . . . . . . . . . . . . . . . . . Tue3-1-3 p. 11Chiu, Wen-Hsien . . . . . . . . . . . . . . . . . . . . Wed2-1-3 p. 19Cho, ChoogHo . . . . . . . . . . . . . . . . . . . . . . . Wed1-3-5 p. 18Cho, Joon Ho . . . . . . . . . . . . . . . . . . . . . . . Tue1-4-5 p. 8Choe, Chang-hui . . . . . . . . . . . . . . . . . . . . Tue4-4-4 p. 16Choi, Cheon Won . . . . . . . . . . . . . . . . . . . . Wed1-4-3 p. 18Choi, Jin Sung . . . . . . . . . . . . . . . . . . . . . . Tue4-1-3 p. 14Chung, Jung-Soo . . . . . . . . . . . . . . . . . . . . Wed2-5-3 p. 21Chung, Sae-Young . . . . . . . . . . . . . . . . . . . Tue3-3-4 p. 12Clevorn, Thorsten . . . . . . . . . . . . . . . . . . . Tue1-3-2 p. 7Cui, Yang . . . . . . . . . . . . . . . . . . . . . . . . . . . Tue3-2-1 p. 11

Dda Rocha Jr., Valdemar C. . . . . . . . . . . Wed1-3-1 p. 17Dauwels, Justin . . . . . . . . . . . . . . . . . . . . . . Mon1-3-3 p. 2Denno, Satoshi . . . . . . . . . . . . . . . . . . . . . . Mon2-4-1 p. 4Dube, Danny . . . . . . . . . . . . . . . . . . . . . . . . Tue1-3-4 p. 7Duhamel, Pierre . . . . . . . . . . . . . . . . . . . . . Tue2-3-2 p. 9

EEnomoto, Kazuto . . . . . . . . . . . . . . . . . . . . Tue4-2-1 p. 14Ertug, Ozgur . . . . . . . . . . . . . . . . . . . . . . . . Tue1-5-1 p. 8

Ertug, Ozgur . . . . . . . . . . . . . . . . . . . . . . . . Tue3-4-4 p. 13Esmaeili, Morteza . . . . . . . . . . . . . . . . . . . Mon2-3-1 p. 4

FFehske, Albrecht J. . . . . . . . . . . . . . . . . . . Tue1-5-4 p. 8Fettweis, Gerhard P. . . . . . . . . . . . . . . . . . Tue1-5-4 p. 8Fossorier, Marc . . . . . . . . . . . . . . . . . . . . . . Tue1-1-4 p. 6Fossorier, Marc . . . . . . . . . . . . . . . . . . . . . . Tue2-1-2 p. 8Fossorier, Marc . . . . . . . . . . . . . . . . . . . . . . Tue3-1-3 p. 11Fraboul, Christian . . . . . . . . . . . . . . . . . . . Tue4-3-3 p. 15Fujii, Masahiro . . . . . . . . . . . . . . . . . . . . . . Mon1-4-2 p. 2Fujii, Masahiro . . . . . . . . . . . . . . . . . . . . . . Tue3-4-2 p. 12

Fujisawa, Masaya . . . . . . . . . . . . . . . . . . . . Tue1-1-2 p. 6Fujiwara, Toru . . . . . . . . . . . . . . . . . . . . . . Tue1-1-4 p. 6Fujiwara, Toru . . . . . . . . . . . . . . . . . . . . . . Tue1-1-5 p. 6Fujiwara, Yoshitaka . . . . . . . . . . . . . . . . . . Wed2-3-1 p. 20Funahashi, Yuuki . . . . . . . . . . . . . . . . . . . . Tue4-1-1 p. 14Furuichi, Shigeru . . . . . . . . . . . . . . . . . . . . Wed1-2-3 p. 17

GGoto, Tomio . . . . . . . . . . . . . . . . . . . . . . . . . Wed1-5-5 p. 19Gulliver, T. Aaron . . . . . . . . . . . . . . . . . . . Mon2-3-1 p. 4Gupta, Kshitij . . . . . . . . . . . . . . . . . . . . . . . Wed1-5-2 p. 18

HHa, Jun . . . . . . . . . . . . . . . . . . . . . . . . . . . . . Wed1-4-3 p. 18Habuchi, Hiromasa . . . . . . . . . . . . . . . . . . Tue1-4-4 p. 7Hagiwara, Manabu . . . . . . . . . . . . . . . . . . Mon2-1-1 p. 3Hagiwara, Manabu . . . . . . . . . . . . . . . . . . Tue2-1-2 p. 8Hagiwara, Manabu . . . . . . . . . . . . . . . . . . Wed2-2-2 p. 20Hamano, Kenji . . . . . . . . . . . . . . . . . . . . . . Wed1-3-3 p. 17Han, Te Sun . . . . . . . . . . . . . . . . . . . . . . . . . Mon1-3-1 p. 2Hanaoka, Goichiro . . . . . . . . . . . . . . . . . . . Mon2-2-3 p. 4Hanaoka, Goichiro . . . . . . . . . . . . . . . . . . . Tue3-2-2 p. 11Handa, Atsurou . . . . . . . . . . . . . . . . . . . . . Tue3-4-2 p. 12Hata, Masayasu . . . . . . . . . . . . . . . . . . . . . Tue4-1-1 p. 14Hattori, Seiji . . . . . . . . . . . . . . . . . . . . . . . . Wed1-2-2 p. 17Hayashi, Masayuki . . . . . . . . . . . . . . . . . . Mon1-4-4 p. 3Hayashi, Masayuki . . . . . . . . . . . . . . . . . . Tue3-1-5 p. 11Hayashi, Shunichi . . . . . . . . . . . . . . . . . . . . Tue3-2-4 p. 12Hayashi, Takashi . . . . . . . . . . . . . . . . . . . . Mon1-2-5 p. 1Higashikatsuragi, Kenji . . . . . . . . . . . . . . Tue2-4-1 p. 10Higashikatsuragi, Kenji . . . . . . . . . . . . . . Tue2-4-2 p. 10Hirasawa, Shigeichi . . . . . . . . . . . . . . . . . . Tue3-1-4 p. 11Hirata, Shinji . . . . . . . . . . . . . . . . . . . . . . . . Mon2-4-1 p. 4Hirotomo, Masanori . . . . . . . . . . . . . . . . . Wed1-1-3 p. 17Hiwatashi, Kengo . . . . . . . . . . . . . . . . . . . . Tue1-2-1 p. 6Hollanti, Camilla . . . . . . . . . . . . . . . . . . . . Tue3-5-3 p. 13Hong, Song-Nam . . . . . . . . . . . . . . . . . . . . Tue2-1-4 p. 9Hong, Song-Nam . . . . . . . . . . . . . . . . . . . . Tue4-1-5 p. 14Hong, Yi . . . . . . . . . . . . . . . . . . . . . . . . . . . . Wed2-1-2 p. 19Hosoya, Gou . . . . . . . . . . . . . . . . . . . . . . . . . Tue3-1-4 p. 11

IIchikawa, Takenori . . . . . . . . . . . . . . . . . . . Tue2-2-3 p. 9Ikeda, Yoshitaka . . . . . . . . . . . . . . . . . . . . . Tue2-2-3 p. 9Ikegaya, Ryoji . . . . . . . . . . . . . . . . . . . . . . . Wed1-1-2 p. 17Imafuku, Kentaro . . . . . . . . . . . . . . . . . . . . Wed1-2-4 p. 17Imai, Hideki . . . . . . . . . . . . . . . . . . . . . . . . . Mon2-1-1 p. 3Imai, Hideki . . . . . . . . . . . . . . . . . . . . . . . . . Mon2-2-5 p. 4Imai, Hideki . . . . . . . . . . . . . . . . . . . . . . . . . Tue2-1-2 p. 8Imai, Hideki . . . . . . . . . . . . . . . . . . . . . . . . . Tue3-2-1 p. 11Imai, Hideki . . . . . . . . . . . . . . . . . . . . . . . . . Tue3-2-2 p. 11Imai, Hideki . . . . . . . . . . . . . . . . . . . . . . . . . Tue3-2-5 p. 12Imai, Hideki . . . . . . . . . . . . . . . . . . . . . . . . . Wed1-2-4 p. 17Imai, Hideki . . . . . . . . . . . . . . . . . . . . . . . . . Wed2-2-3 p. 20Imai, Jun . . . . . . . . . . . . . . . . . . . . . . . . . . . . Mon1-1-4 p. 1Isaka, Motohiko . . . . . . . . . . . . . . . . . . . . . Mon2-5-2 p. 5Itami, Makoto . . . . . . . . . . . . . . . . . . . . . . . Mon1-4-2 p. 2Itami, Makoto . . . . . . . . . . . . . . . . . . . . . . . Tue3-4-2 p. 12Ito, Masashi . . . . . . . . . . . . . . . . . . . . . . . . . Tue4-2-2 p. 14Ito, Masashi . . . . . . . . . . . . . . . . . . . . . . . . . Tue4-2-3 p. 14Itoh, Kohji . . . . . . . . . . . . . . . . . . . . . . . . . . Mon1-4-2 p. 2Itoh, Kohji . . . . . . . . . . . . . . . . . . . . . . . . . . Tue3-4-2 p. 12Itsui, Takayuki . . . . . . . . . . . . . . . . . . . . . . Wed1-1-2 p. 17Iwanami, Yasunori . . . . . . . . . . . . . . . . . . . Tue3-5-4 p. 13Iwanami, Yasunori . . . . . . . . . . . . . . . . . . . Tue4-4-2 p. 15Iwata, Ken-ichi . . . . . . . . . . . . . . . . . . . . . . Mon2-3-2 p. 4Iwata, Motoi . . . . . . . . . . . . . . . . . . . . . . . . Mon1-2-2 p. 1Iwata, Motoi . . . . . . . . . . . . . . . . . . . . . . . . Mon1-2-3 p. 1

JJamalipour, Abbas . . . . . . . . . . . . . . . . . . Tue4-4-3 p. 15Jang, Min-Ho . . . . . . . . . . . . . . . . . . . . . . . . Tue4-1-4 p. 14Jang, Min-Ho . . . . . . . . . . . . . . . . . . . . . . . . Tue4-1-5 p. 14Jeon, In San . . . . . . . . . . . . . . . . . . . . . . . . . Tue4-1-4 p. 14Jiang, Xueqin . . . . . . . . . . . . . . . . . . . . . . . Tue4-4-4 p. 16Jono, Shuichi . . . . . . . . . . . . . . . . . . . . . . . . Wed2-5-1 p. 21Joo, Hyeong-Gun . . . . . . . . . . . . . . . . . . . . Tue2-1-4 p. 9

22


KKaida, Takayasu . . . . . . . . . . . . . . . . . . . . . Mon2-1-3 p. 3Kaida, Takayasu . . . . . . . . . . . . . . . . . . . . . Wed1-1-5 p. 17Kaji, Yuichi . . . . . . . . . . . . . . . . . . . . . . . . . Tue2-1-1 p. 8Kajiwara, Akihiro . . . . . . . . . . . . . . . . . . . Tue2-4-1 p. 10Kajiwara, Akihiro . . . . . . . . . . . . . . . . . . . Tue2-4-2 p. 10Kamabe, Hiroshi . . . . . . . . . . . . . . . . . . . . Mon1-5-1 p. 3Kamoi, Koichi . . . . . . . . . . . . . . . . . . . . . . . Tue2-3-1 p. 9Kamoi, Koichi . . . . . . . . . . . . . . . . . . . . . . . Tue2-5-4 p. 11Kaneko, Toshinobu . . . . . . . . . . . . . . . . . . Tue2-2-3 p. 9Kaneko, Toshinobu . . . . . . . . . . . . . . . . . . Wed1-3-3 p. 17Kang, Hyunho . . . . . . . . . . . . . . . . . . . . . . . Mon2-2-4 p. 4Kasai, Kenta . . . . . . . . . . . . . . . . . . . . . . . . Wed1-1-1 p. 16Kasai, Kenta . . . . . . . . . . . . . . . . . . . . . . . . Wed1-1-2 p. 17Kasami, Tadao . . . . . . . . . . . . . . . . . . . . . . Tue1-1-4 p. 6Kasami, Tadao . . . . . . . . . . . . . . . . . . . . . . Tue1-1-5 p. 6Katayama, Masaaki . . . . . . . . . . . . . . . . . Tue2-5-1 p. 10Katayama, Masaaki . . . . . . . . . . . . . . . . . Wed1-4-4 p. 18Kato, Yoshiyuki . . . . . . . . . . . . . . . . . . . . . Tue4-2-3 p. 14Katoh, Takashi . . . . . . . . . . . . . . . . . . . . . . Tue1-2-3 p. 6Kawasaki, Yuuji . . . . . . . . . . . . . . . . . . . . . Mon1-2-4 p. 1Khemapatapan, Chaiyaporn . . . . . . . . . Tue2-4-4 p. 10Khosravifard, Mohammadali . . . . . . . . . Mon2-3-1 p. 4Kikuchi, Hisakazu . . . . . . . . . . . . . . . . . . . Tue1-4-1 p. 7Kikuchi, Hisakazu . . . . . . . . . . . . . . . . . . . Tue1-4-2 p. 7Kim, Byeongjo . . . . . . . . . . . . . . . . . . . . . . Mon1-5-4 p. 3Kim, Chunsu . . . . . . . . . . . . . . . . . . . . . . . . Wed1-3-5 p. 18Kim, Dae-Son . . . . . . . . . . . . . . . . . . . . . . . Tue1-4-3 p. 7Kim, Hyo-Shil . . . . . . . . . . . . . . . . . . . . . . . Tue1-5-3 p. 8Kim, Hyo-Shil . . . . . . . . . . . . . . . . . . . . . . . Tue4-4-5 p. 16Kim, Hyo-Shil . . . . . . . . . . . . . . . . . . . . . . . Wed2-1-4 p. 19Kim, Jaebum . . . . . . . . . . . . . . . . . . . . . . . . Mon1-5-4 p. 3Kim, Jaehong . . . . . . . . . . . . . . . . . . . . . . . Mon1-5-4 p. 3Kim, Jeongchang . . . . . . . . . . . . . . . . . . . . Mon2-4-4 p. 5Kim, Jong-Deuk . . . . . . . . . . . . . . . . . . . . . Wed2-1-4 p. 19Kim, Kwang Soon . . . . . . . . . . . . . . . . . . . Tue2-1-3 p. 9Kim, Ryun-Woo . . . . . . . . . . . . . . . . . . . . . Tue3-5-2 p. 13Kim, Saejoon . . . . . . . . . . . . . . . . . . . . . . . . Mon1-1-1 p. 1Kim, Saejoon . . . . . . . . . . . . . . . . . . . . . . . . Tue3-1-1 p. 11Kim, Sung Hoon . . . . . . . . . . . . . . . . . . . . . Tue4-4-4 p. 16Kim, Sung-Yeon . . . . . . . . . . . . . . . . . . . . . Tue1-5-3 p. 8Kim, Sung-Yeon . . . . . . . . . . . . . . . . . . . . . Tue4-4-5 p. 16Kim, Sunghwan . . . . . . . . . . . . . . . . . . . . . Tue4-1-5 p. 14Kim, Young-Joon . . . . . . . . . . . . . . . . . . . . Tue1-4-3 p. 7Kim, Young-Sik . . . . . . . . . . . . . . . . . . . . . Wed2-5-3 p. 21Kimura, Akisato . . . . . . . . . . . . . . . . . . . . . Mon2-3-4 p. 4Kitagawa, Takashi . . . . . . . . . . . . . . . . . . . Tue2-1-2 p. 8Kitagawa, Takashi . . . . . . . . . . . . . . . . . . . Tue3-2-2 p. 11Kitamura, Tadashi . . . . . . . . . . . . . . . . . . Wed1-5-5 p. 19Kløve, Torleiv . . . . . . . . . . . . . . . . . . . . . . . Mon2-1-2 p. 3Kobara, Kazukuni . . . . . . . . . . . . . . . . . . . Tue3-2-1 p. 11Kobara, Kazukuni . . . . . . . . . . . . . . . . . . . Tue3-2-5 p. 12Kobayashi, Kentaro . . . . . . . . . . . . . . . . . Wed1-4-4 p. 18Kobayashi, Kingo . . . . . . . . . . . . . . . . . . . . Mon1-5-2 p. 3Kobayashi, Kingo . . . . . . . . . . . . . . . . . . . . Mon2-2-4 p. 4Kobayashi, Kingo . . . . . . . . . . . . . . . . . . . . Mon2-5-1 p. 5Koda, Hiromu . . . . . . . . . . . . . . . . . . . . . . . Mon1-2-4 p. 1Koda, Hiromu . . . . . . . . . . . . . . . . . . . . . . . Mon1-2-5 p. 1Koda, Takaharu . . . . . . . . . . . . . . . . . . . . . Wed1-5-1 p. 18Kohno, Ryuji . . . . . . . . . . . . . . . . . . . . . . . . Mon1-4-4 p. 3Kohno, Ryuji . . . . . . . . . . . . . . . . . . . . . . . . Tue3-1-5 p. 11Koike, Chimato . . . . . . . . . . . . . . . . . . . . . . Tue2-5-3 p. 10Kondo, Hiroshi . . . . . . . . . . . . . . . . . . . . . . Wed1-5-1 p. 18Kose, Satoru . . . . . . . . . . . . . . . . . . . . . . . . Mon1-5-1 p. 3Koumoto, Takuya . . . . . . . . . . . . . . . . . . . Tue1-1-5 p. 6Kubo, Hiroshi . . . . . . . . . . . . . . . . . . . . . . . Mon2-4-3 p. 5Kuribayashi, Minoru . . . . . . . . . . . . . . . . . Mon2-2-2 p. 4Kurkoski, Brian M. . . . . . . . . . . . . . . . . . . Mon1-5-2 p. 3Kurkoski, Brian M. . . . . . . . . . . . . . . . . . . Mon2-2-4 p. 4Kurkoski, Brian M. . . . . . . . . . . . . . . . . . . Mon2-5-1 p. 5Kuwakado, Hidenori . . . . . . . . . . . . . . . . . Tue2-2-2 p. 9Kuzuoka, Shigeaki . . . . . . . . . . . . . . . . . . . Tue1-3-1 p. 7Kwon, Woo Suk . . . . . . . . . . . . . . . . . . . . . Mon2-5-4 p. 5

LLacan, Jerome . . . . . . . . . . . . . . . . . . . . . . . Tue4-3-3 p. 15Lee, Dong-Jin . . . . . . . . . . . . . . . . . . . . . . . Tue3-5-2 p. 13Lee, Donghoon . . . . . . . . . . . . . . . . . . . . . . Mon2-4-4 p. 5Lee, JaeHo . . . . . . . . . . . . . . . . . . . . . . . . . . Tue4-2-4 p. 15Lee, Jeong Woo . . . . . . . . . . . . . . . . . . . . . Mon2-5-4 p. 5Lee, Joohwan . . . . . . . . . . . . . . . . . . . . . . . . Tue4-4-1 p. 15Lee, MoonHo . . . . . . . . . . . . . . . . . . . . . . . . Tue4-4-4 p. 16

Lee, Sang Hyun . . . . . . . . . . . . . . . . . . . . . Tue2-1-3 p. 9Lee, Yen-Yi . . . . . . . . . . . . . . . . . . . . . . . . . Tue1-3-3 p. 7Lee, Young Seob . . . . . . . . . . . . . . . . . . . . . Tue4-1-3 p. 14Li, Zheyu . . . . . . . . . . . . . . . . . . . . . . . . . . . . Wed1-1-4 p. 17Lim, Dae-Woon . . . . . . . . . . . . . . . . . . . . . Tue4-5-1 p. 16Lim, Tae-Hyung . . . . . . . . . . . . . . . . . . . . . Wed2-5-3 p. 21Lin, Mao-Chao . . . . . . . . . . . . . . . . . . . . . . Wed2-1-1 p. 19Lin, Shih-Chun . . . . . . . . . . . . . . . . . . . . . . Tue3-5-1 p. 13Lu, Jun-Yun . . . . . . . . . . . . . . . . . . . . . . . . . Wed2-1-1 p. 19

MMaeda, Nobuhiko . . . . . . . . . . . . . . . . . . . . Mon1-2-2 p. 1Maeda, Yasunari . . . . . . . . . . . . . . . . . . . . Wed2-3-1 p. 20Maehara, Shinya . . . . . . . . . . . . . . . . . . . . . Mon1-5-2 p. 3Mahmino, Ali . . . . . . . . . . . . . . . . . . . . . . . Tue4-3-3 p. 15Maki, Shuichi . . . . . . . . . . . . . . . . . . . . . . . . Wed2-3-2 p. 20Marsch, Patrick . . . . . . . . . . . . . . . . . . . . . Tue1-5-4 p. 8Matsumoto, Hiroshi . . . . . . . . . . . . . . . . . Wed1-5-4 p. 19Matsumoto, Ryutaroh . . . . . . . . . . . . . . . Tue2-5-3 p. 10Matsumura, Hiroyuki . . . . . . . . . . . . . . . . Wed2-3-4 p. 20Matsunami, Isamu . . . . . . . . . . . . . . . . . . . Tue2-4-1 p. 10Matsunami, Isamu . . . . . . . . . . . . . . . . . . . Tue2-4-2 p. 10Matsushima, Tomoko K. . . . . . . . . . . . . . Tue3-4-5 p. 13Matsushima, Toshiyasu . . . . . . . . . . . . . . Tue3-1-4 p. 11Matsushima, Toshiyasu . . . . . . . . . . . . . . Wed2-3-1 p. 20Matsuura, Kanta . . . . . . . . . . . . . . . . . . . . Tue3-2-2 p. 11Matsuzaki, Masayuki . . . . . . . . . . . . . . . . Tue1-4-4 p. 7Matz, Gerald . . . . . . . . . . . . . . . . . . . . . . . . Tue2-3-2 p. 9Mercier, Hugues . . . . . . . . . . . . . . . . . . . . . Tue2-3-3 p. 10Michel, Thomas . . . . . . . . . . . . . . . . . . . . . Tue4-5-5 p. 16Miyadera, Takayuki . . . . . . . . . . . . . . . . . Wed2-2-3 p. 20Miyaji, Atsuko . . . . . . . . . . . . . . . . . . . . . . Tue1-2-4 p. 6Miyauchi, Yuusuke . . . . . . . . . . . . . . . . . . Tue4-5-2 p. 16Miyazaki, Takeru . . . . . . . . . . . . . . . . . . . . Wed1-3-2 p. 17Miyoshi, Fumiyasu . . . . . . . . . . . . . . . . . . . Wed1-4-2 p. 18Mizuochi, Takashi . . . . . . . . . . . . . . . . . . . Mon2-4-3 p. 5Mochida, Shinich . . . . . . . . . . . . . . . . . . . . Mon2-4-3 p. 5Mohri, Masami . . . . . . . . . . . . . . . . . . . . . . Tue1-1-3 p. 6Mohri, Masami . . . . . . . . . . . . . . . . . . . . . . Wed1-1-3 p. 17Mohri, Masami . . . . . . . . . . . . . . . . . . . . . . Wed1-1-4 p. 17Morihiro, Yoshiteru . . . . . . . . . . . . . . . . . . Mon2-4-1 p. 4Morii, Masakatu . . . . . . . . . . . . . . . . . . . . . Mon2-2-2 p. 4Morii, Masakatu . . . . . . . . . . . . . . . . . . . . . Tue1-1-3 p. 6Morii, Masakatu . . . . . . . . . . . . . . . . . . . . . Tue2-2-2 p. 9Morii, Masakatu . . . . . . . . . . . . . . . . . . . . . Tue2-2-4 p. 9Morii, Masakatu . . . . . . . . . . . . . . . . . . . . . Wed1-1-3 p. 17Morii, Masakatu . . . . . . . . . . . . . . . . . . . . . Wed1-1-4 p. 17Morikawa, Yoshitaka . . . . . . . . . . . . . . . . . Tue2-2-5 p. 9Morikawa, Yoshitaka . . . . . . . . . . . . . . . . . Wed2-3-2 p. 20Morita, Hiroyoshi . . . . . . . . . . . . . . . . . . . . Mon1-1-3 p. 1Morita, Hiroyoshi . . . . . . . . . . . . . . . . . . . . Tue2-2-1 p. 9Motoyoshi, Katsuyuki . . . . . . . . . . . . . . . Mon2-4-3 p. 5Murakami, Hideo . . . . . . . . . . . . . . . . . . . . Mon1-4-3 p. 2Murakami, Yumiko . . . . . . . . . . . . . . . . . . Wed2-2-2 p. 20Murata, Hidekazu . . . . . . . . . . . . . . . . . . . Wed2-4-1 p. 20Murata, Hidekazu . . . . . . . . . . . . . . . . . . . Wed2-4-2 p. 21Murata, Masashi . . . . . . . . . . . . . . . . . . . . Wed1-4-1 p. 18Myung, Seho . . . . . . . . . . . . . . . . . . . . . . . . Tue4-1-2 p. 14

NNagasaka, Kenji . . . . . . . . . . . . . . . . . . . . . Mon1-2-1 p. 1Nagasaka, Kenji . . . . . . . . . . . . . . . . . . . . . Mon2-2-1 p. 3Nagata, Tomokazu . . . . . . . . . . . . . . . . . . . Tue4-2-4 p. 15Nakagawa, Kenji . . . . . . . . . . . . . . . . . . . . Mon1-3-2 p. 2Nakanishi, Masaki . . . . . . . . . . . . . . . . . . . Wed2-2-2 p. 20Nakashima, Yasuhiko . . . . . . . . . . . . . . . . Wed2-2-2 p. 20Nam, Taek-Yong . . . . . . . . . . . . . . . . . . . . Tue1-2-2 p. 6Naydenova, Irina . . . . . . . . . . . . . . . . . . . . Mon2-1-2 p. 3Nguyen, Ha H. . . . . . . . . . . . . . . . . . . . . . . Tue2-5-2 p. 10Nguyen, Le Khoa . . . . . . . . . . . . . . . . . . . . Tue3-5-4 p. 13Nishiara, Mikihiko . . . . . . . . . . . . . . . . . . . Mon1-1-3 p. 1Nishimura, Takuya . . . . . . . . . . . . . . . . . . Mon1-1-2 p. 1Nishiyama, Fumio . . . . . . . . . . . . . . . . . . . Mon1-4-3 p. 2No, Jong-Seon . . . . . . . . . . . . . . . . . . . . . . . Tue4-1-4 p. 14No, Jong-Seon . . . . . . . . . . . . . . . . . . . . . . . Tue4-1-5 p. 14No, Jong-Seon . . . . . . . . . . . . . . . . . . . . . . . Tue4-5-1 p. 16No, Jong-Seon . . . . . . . . . . . . . . . . . . . . . . . Wed2-5-3 p. 21Nogami, Yasuyuki . . . . . . . . . . . . . . . . . . . Tue2-2-5 p. 9Noh, Hyung-Suk . . . . . . . . . . . . . . . . . . . . . Tue4-5-1 p. 16Nuida, Koji . . . . . . . . . . . . . . . . . . . . . . . . . Tue2-1-2 p. 8

23


OOchiai, Hideki . . . . . . . . . . . . . . . . . . . . . . . Mon1-4-1 p. 2Ochiai, Hideki . . . . . . . . . . . . . . . . . . . . . . . Tue1-2-1 p. 6Oechtering, Tobias J. . . . . . . . . . . . . . . . . Tue3-3-1 p. 12Ogami, Yuuki . . . . . . . . . . . . . . . . . . . . . . . Mon1-1-2 p. 1Ogawa, Akira . . . . . . . . . . . . . . . . . . . . . . . . Tue4-1-1 p. 14Ogawa, Akira . . . . . . . . . . . . . . . . . . . . . . . . Tue4-2-5 p. 15Ogawa, Akira . . . . . . . . . . . . . . . . . . . . . . . . Wed1-4-2 p. 18Ogawa, Kazuto . . . . . . . . . . . . . . . . . . . . . . Mon2-2-3 p. 4Ogihara, Akio . . . . . . . . . . . . . . . . . . . . . . . Mon1-2-2 p. 1Ogihara, Akio . . . . . . . . . . . . . . . . . . . . . . . Mon1-2-3 p. 1Ogihara, Akio . . . . . . . . . . . . . . . . . . . . . . . Wed1-5-4 p. 19Ogihara, Akio . . . . . . . . . . . . . . . . . . . . . . . Wed2-3-4 p. 20Oh, Min Seok . . . . . . . . . . . . . . . . . . . . . . . Tue4-1-3 p. 14Ohigashi, Toshihiro . . . . . . . . . . . . . . . . . . Tue2-2-4 p. 9Ohtake, Go . . . . . . . . . . . . . . . . . . . . . . . . . . Mon2-2-3 p. 4Oka, Ikuo . . . . . . . . . . . . . . . . . . . . . . . . . . . Mon2-4-2 p. 5Okada, Hiraku . . . . . . . . . . . . . . . . . . . . . . . Tue2-5-1 p. 10Okada, Hiraku . . . . . . . . . . . . . . . . . . . . . . . Wed1-4-4 p. 18Okada, Minoru . . . . . . . . . . . . . . . . . . . . . . Tue4-5-4 p. 16Okamoto, Eiji . . . . . . . . . . . . . . . . . . . . . . . Tue3-5-4 p. 13Okamoto, Eiji . . . . . . . . . . . . . . . . . . . . . . . Tue4-4-2 p. 15Ono, Fumie . . . . . . . . . . . . . . . . . . . . . . . . . . Tue1-4-4 p. 7Oohama, Yasutada . . . . . . . . . . . . . . . . . . Mon2-3-2 p. 4Oohama, Yasutada . . . . . . . . . . . . . . . . . . Mon2-3-3 p. 4Oyachi, Takahiko . . . . . . . . . . . . . . . . . . . . Mon2-2-1 p. 3

PPaolini, Enrico . . . . . . . . . . . . . . . . . . . . . . Tue3-1-3 p. 11Park, Daesun . . . . . . . . . . . . . . . . . . . . . . . . Wed1-3-5 p. 18Park, Hyuncheol . . . . . . . . . . . . . . . . . . . . . Mon1-5-4 p. 3Park, Jin Kyung . . . . . . . . . . . . . . . . . . . . . Wed1-4-3 p. 18Park, Mea-Hwa . . . . . . . . . . . . . . . . . . . . . . Wed2-1-4 p. 19Park, Seongsu . . . . . . . . . . . . . . . . . . . . . . . Mon1-5-4 p. 3Park, Sunchun . . . . . . . . . . . . . . . . . . . . . . . Wed1-3-5 p. 18Park, Woo-Myoung . . . . . . . . . . . . . . . . . . Tue4-1-4 p. 14Park, Youngmi . . . . . . . . . . . . . . . . . . . . . . Wed1-3-5 p. 18Pham, Bao Thi Ngoc . . . . . . . . . . . . . . . . Wed2-4-2 p. 21Piantanida, Pablo . . . . . . . . . . . . . . . . . . . Tue2-3-2 p. 9Piao, Yong Chun . . . . . . . . . . . . . . . . . . . . Tue3-1-2 p. 11Pimentel, Cecilio . . . . . . . . . . . . . . . . . . . . Wed1-3-1 p. 17Poland, Jan . . . . . . . . . . . . . . . . . . . . . . . . . Wed2-3-3 p. 20

RRaja Durai, R. S. . . . . . . . . . . . . . . . . . . . . Wed2-5-2 p. 21Rhee, Duho . . . . . . . . . . . . . . . . . . . . . . . . . Tue2-1-3 p. 9Rosnes, Eirik . . . . . . . . . . . . . . . . . . . . . . . . Mon2-5-3 p. 5

SSaba, Takahiko . . . . . . . . . . . . . . . . . . . . . . Tue4-5-2 p. 16Saba, Takahiko . . . . . . . . . . . . . . . . . . . . . . Tue4-5-3 p. 16Saba, Takahiko . . . . . . . . . . . . . . . . . . . . . . Wed2-4-3 p. 21Saidi, Hossein . . . . . . . . . . . . . . . . . . . . . . . Mon2-3-1 p. 4Saiki, Shunsuke . . . . . . . . . . . . . . . . . . . . . . Tue4-2-5 p. 15Saito, Hidetoshi . . . . . . . . . . . . . . . . . . . . . Tue3-1-5 p. 11Sakai, Ryuichi . . . . . . . . . . . . . . . . . . . . . . . Tue3-2-3 p. 11Sakamoto, Junichi . . . . . . . . . . . . . . . . . . . Tue4-2-1 p. 14Sakaniwa, Kohichi . . . . . . . . . . . . . . . . . . . Wed1-1-1 p. 16Sakaniwa, Kohichi . . . . . . . . . . . . . . . . . . . Wed1-1-2 p. 17Sakata, Shojiro . . . . . . . . . . . . . . . . . . . . . . Mon1-2-4 p. 1Sakata, Shojiro . . . . . . . . . . . . . . . . . . . . . . Mon1-2-5 p. 1Sakata, Shojiro . . . . . . . . . . . . . . . . . . . . . . Tue1-1-2 p. 6Sakurai, Masaru . . . . . . . . . . . . . . . . . . . . . Wed1-5-5 p. 19Sasahara, Shoichi . . . . . . . . . . . . . . . . . . . . Tue4-5-3 p. 16Sasaki, Shigenobu . . . . . . . . . . . . . . . . . . . Tue1-4-1 p. 7Sasaki, Shigenobu . . . . . . . . . . . . . . . . . . . Tue1-4-2 p. 7Sasano, Hiroshi . . . . . . . . . . . . . . . . . . . . . . Mon1-1-2 p. 1Sato, Hajime . . . . . . . . . . . . . . . . . . . . . . . . Wed1-5-3 p. 19Sawada, Tomohiro . . . . . . . . . . . . . . . . . . . Wed1-2-1 p. 17Schmalen, Laurent . . . . . . . . . . . . . . . . . . . Tue1-3-2 p. 7Schubert, Martin . . . . . . . . . . . . . . . . . . . . Tue1-5-2 p. 8Schubert, Martin . . . . . . . . . . . . . . . . . . . . Tue3-3-5 p. 12Sejimo, Masaki . . . . . . . . . . . . . . . . . . . . . . Wed2-4-4 p. 21Ser, Wee . . . . . . . . . . . . . . . . . . . . . . . . . . . . Mon1-4-5 p. 3Sharma, Pramod Kumar . . . . . . . . . . . . . Wed1-5-2 p. 18Shi, Shuying . . . . . . . . . . . . . . . . . . . . . . . . . Tue1-5-2 p. 8Shibuya, Akihiro . . . . . . . . . . . . . . . . . . . . Mon2-4-3 p. 5Shibuya, Tomoharu . . . . . . . . . . . . . . . . . . Wed1-1-1 p. 16Shibuya, Tomoharu . . . . . . . . . . . . . . . . . . Wed1-1-2 p. 17Shikata, Junji . . . . . . . . . . . . . . . . . . . . . . . Tue1-2-1 p. 6Shimanuki, Noriyuki . . . . . . . . . . . . . . . . . Mon2-5-1 p. 5

Shimbo, Daisuke . . . . . . . . . . . . . . . . . . . . . Mon2-4-2 p. 5Shimoyama, Yuji . . . . . . . . . . . . . . . . . . . . Wed1-1-1 p. 16Shin, Beomkyu . . . . . . . . . . . . . . . . . . . . . . Tue4-1-4 p. 14Shin, Dong-Joon . . . . . . . . . . . . . . . . . . . . . Tue2-1-4 p. 9Shin, Dong-Joon . . . . . . . . . . . . . . . . . . . . . Tue3-1-2 p. 11Shin, Dong-Joon . . . . . . . . . . . . . . . . . . . . . Tue4-1-5 p. 14Shin, Dong-Joon . . . . . . . . . . . . . . . . . . . . . Tue4-5-1 p. 16Shin, Min-Ho . . . . . . . . . . . . . . . . . . . . . . . . Mon1-1-1 p. 1Shin, SeongHan . . . . . . . . . . . . . . . . . . . . . Tue3-2-5 p. 12Shin, Woo Cheol . . . . . . . . . . . . . . . . . . . . Wed1-4-3 p. 18Shinkai, Yoshihiro . . . . . . . . . . . . . . . . . . . Wed1-5-5 p. 19Shiozaki, Akira . . . . . . . . . . . . . . . . . . . . . . Mon1-2-2 p. 1Shiozaki, Akira . . . . . . . . . . . . . . . . . . . . . . Mon1-2-3 p. 1Shiozaki, Akira . . . . . . . . . . . . . . . . . . . . . . Wed1-5-4 p. 19Shiozaki, Akira . . . . . . . . . . . . . . . . . . . . . . Wed2-3-4 p. 20Shiraishi, Yoshiaki . . . . . . . . . . . . . . . . . . . Tue2-2-4 p. 9Shiraki, Yoshinao . . . . . . . . . . . . . . . . . . . . Mon1-1-4 p. 1Shwedyk, Ed . . . . . . . . . . . . . . . . . . . . . . . . Tue2-5-2 p. 10Song, Hong-Yeop . . . . . . . . . . . . . . . . . . . . Tue1-4-3 p. 7Song, Yun-Seok . . . . . . . . . . . . . . . . . . . . . . Tue1-4-1 p. 7Soshi, Masakazu . . . . . . . . . . . . . . . . . . . . . Tue1-2-4 p. 6Stanczak, Slawomir . . . . . . . . . . . . . . . . . . Tue3-3-2 p. 12Stanczak, Slawomir . . . . . . . . . . . . . . . . . . Tue3-3-3 p. 12Su, Hsuan-Jung . . . . . . . . . . . . . . . . . . . . . Tue3-5-1 p. 13Su, Hsuan-Jung . . . . . . . . . . . . . . . . . . . . . Wed2-1-3 p. 19Su, WenHung . . . . . . . . . . . . . . . . . . . . . . . Tue4-2-4 p. 15Suehiro, Naoki . . . . . . . . . . . . . . . . . . . . . . . Wed2-5-2 p. 21Sugawara, Manabu . . . . . . . . . . . . . . . . . . Tue4-4-2 p. 15Sugiyama, Kenji . . . . . . . . . . . . . . . . . . . . . Tue2-1-1 p. 8Suh, Kyoung-Whoan . . . . . . . . . . . . . . . . Tue4-4-1 p. 15Sum, Chin Sean . . . . . . . . . . . . . . . . . . . . . Tue1-4-1 p. 7Sum, Chin Sean . . . . . . . . . . . . . . . . . . . . . Tue1-4-2 p. 7Sun, Dongzhao . . . . . . . . . . . . . . . . . . . . . . Mon1-1-3 p. 1Suyari, Hiroki . . . . . . . . . . . . . . . . . . . . . . . Mon1-3-5 p. 2Suzuki, Hidekazu . . . . . . . . . . . . . . . . . . . . Tue1-2-5 p. 6Suzuki, Hidekazu . . . . . . . . . . . . . . . . . . . . Tue4-2-1 p. 14

TTada, Mitsuru . . . . . . . . . . . . . . . . . . . . . . . Tue3-2-4 p. 12Takata, Toyoo . . . . . . . . . . . . . . . . . . . . . . . Tue1-2-3 p. 6Takeichi, Naoyuki . . . . . . . . . . . . . . . . . . . Tue3-4-3 p. 13Takumi, Ichi . . . . . . . . . . . . . . . . . . . . . . . . . Tue4-1-1 p. 14Takumi, Ichi . . . . . . . . . . . . . . . . . . . . . . . . . Wed1-2-1 p. 17Takumi, Ichi . . . . . . . . . . . . . . . . . . . . . . . . . Wed2-2-1 p. 20Tamaki, Shiro . . . . . . . . . . . . . . . . . . . . . . . Tue4-2-4 p. 15Tan, Choon Peng . . . . . . . . . . . . . . . . . . . . Mon1-3-4 p. 2Tanahashi, Makoto . . . . . . . . . . . . . . . . . . Mon1-4-1 p. 2Tanaka, Hiroyuki . . . . . . . . . . . . . . . . . . . . Tue1-2-3 p. 6Tanaka, Keisuke . . . . . . . . . . . . . . . . . . . . . Mon1-2-3 p. 1Tano, Yutaka . . . . . . . . . . . . . . . . . . . . . . . . Tue3-4-3 p. 13Terada, Takeaki . . . . . . . . . . . . . . . . . . . . . Tue1-2-4 p. 6Teramachi, Yasuaki . . . . . . . . . . . . . . . . . . Tue3-4-5 p. 13Terasaka, Keiji . . . . . . . . . . . . . . . . . . . . . . Tue2-4-1 p. 10Terasaka, Keiji . . . . . . . . . . . . . . . . . . . . . . Tue2-4-2 p. 10Toguchi, Hirofumi . . . . . . . . . . . . . . . . . . . Mon1-2-3 p. 1Tokushige, Hitoshi . . . . . . . . . . . . . . . . . . . Tue1-1-4 p. 6Tsuchimoto, Toshiyuki . . . . . . . . . . . . . . Wed1-2-1 p. 17Tsuzuki, Shinji . . . . . . . . . . . . . . . . . . . . . . Tue3-4-3 p. 13

UUchida, Ryosuke . . . . . . . . . . . . . . . . . . . . . Tue2-5-1 p. 10Uehara, Satoshi . . . . . . . . . . . . . . . . . . . . . Wed1-3-2 p. 17Uehara, Satoshi . . . . . . . . . . . . . . . . . . . . . Wed2-5-1 p. 21Uemura, Wataru . . . . . . . . . . . . . . . . . . . . . Wed1-4-1 p. 18Ueng, Yeong-Luh . . . . . . . . . . . . . . . . . . . . Wed2-1-1 p. 19Umehara, Daisuke . . . . . . . . . . . . . . . . . . . Mon2-4-1 p. 4Usami, Shogo . . . . . . . . . . . . . . . . . . . . . . . . Tue4-1-1 p. 14Usami, Shogo . . . . . . . . . . . . . . . . . . . . . . . . Wed1-2-1 p. 17Usuda, Tsuyoshi Sasaki . . . . . . . . . . . . . . Wed1-2-1 p. 17Usuda, Tsuyoshi Sasaki . . . . . . . . . . . . . . Wed1-2-2 p. 17Usuda, Tsuyoshi Sasaki . . . . . . . . . . . . . . Wed2-2-1 p. 20Uyematsu, Tomohiko . . . . . . . . . . . . . . . . Mon2-3-4 p. 4Uyematsu, Tomohiko . . . . . . . . . . . . . . . . Tue1-3-1 p. 7Uyematsu, Tomohiko . . . . . . . . . . . . . . . . Tue1-3-5 p. 7Uyematsu, Tomohiko . . . . . . . . . . . . . . . . Tue2-5-3 p. 10

VVary, Peter . . . . . . . . . . . . . . . . . . . . . . . . . . Tue1-3-2 p. 7Viterbo, Emanuele . . . . . . . . . . . . . . . . . . . Wed2-1-2 p. 19

WWada, Tadahiro . . . . . . . . . . . . . . . . . . . . . Tue4-4-3 p. 15

24


Wada, Tatsuaki . . . . . . . . . . . . . . . . . . . . . . Mon1-3-5 p. 2Waku, Akihiro . . . . . . . . . . . . . . . . . . . . . . . Mon1-4-2 p. 2Wang, Peng . . . . . . . . . . . . . . . . . . . . . . . . . Mon1-4-5 p. 3Watanabe, Akira . . . . . . . . . . . . . . . . . . . . Tue1-2-5 p. 6Watanabe, Akira . . . . . . . . . . . . . . . . . . . . Tue4-2-1 p. 14Watanabe, Akira . . . . . . . . . . . . . . . . . . . . Tue4-2-2 p. 14Watanabe, Akira . . . . . . . . . . . . . . . . . . . . Tue4-2-3 p. 14Watanabe, Akira . . . . . . . . . . . . . . . . . . . . Wed2-4-4 p. 21Watanabe, Hajime . . . . . . . . . . . . . . . . . . . Tue3-2-2 p. 11Watanabe, Yoichiro . . . . . . . . . . . . . . . . . . Tue2-3-1 p. 9Watanabe, Yoichiro . . . . . . . . . . . . . . . . . . Tue2-5-4 p. 11Watanabe, Yu . . . . . . . . . . . . . . . . . . . . . . . Mon1-4-2 p. 2Wei, Lei . . . . . . . . . . . . . . . . . . . . . . . . . . . . . Tue1-1-1 p. 5Wei, Lei . . . . . . . . . . . . . . . . . . . . . . . . . . . . . Tue2-4-3 p. 10Wei, Lei . . . . . . . . . . . . . . . . . . . . . . . . . . . . . Tue2-4-5 p. 10Wei, Ruey-Yi . . . . . . . . . . . . . . . . . . . . . . . . Wed2-1-1 p. 19Wiczanowski, Marcin . . . . . . . . . . . . . . . . Tue3-3-2 p. 12Wiczanowski, Marcin . . . . . . . . . . . . . . . . Tue3-3-3 p. 12Wiczanowski, Marcin . . . . . . . . . . . . . . . . Tue3-3-5 p. 12Wunder, Gerhard . . . . . . . . . . . . . . . . . . . . Tue4-5-5 p. 16

YYagi, Hideki . . . . . . . . . . . . . . . . . . . . . . . . . Tue3-1-4 p. 11Yamada, Yoshio . . . . . . . . . . . . . . . . . . . . . Tue3-4-3 p. 13Yamaguchi, Kazuhiko . . . . . . . . . . . . . . . . Mon1-5-2 p. 3Yamaguchi, Kazuhiko . . . . . . . . . . . . . . . . Mon2-2-4 p. 4Yamaguchi, Kazuhiko . . . . . . . . . . . . . . . . Mon2-5-1 p. 5Yamamoto, Heiichi . . . . . . . . . . . . . . . . . . Tue4-5-4 p. 16Yamamoto, Ryutaro . . . . . . . . . . . . . . . . . Wed2-2-1 p. 20Yamane, Nobumoto . . . . . . . . . . . . . . . . . Wed2-3-2 p. 20Yamashita, Ryu . . . . . . . . . . . . . . . . . . . . . Wed2-4-1 p. 20Yamashita, Shigeru . . . . . . . . . . . . . . . . . . Wed2-2-2 p. 20Yamazaki, Koichi . . . . . . . . . . . . . . . . . . . . Wed2-2-4 p. 20Yamazato, Takaya . . . . . . . . . . . . . . . . . . . Tue2-5-1 p. 10Yamazato, Takaya . . . . . . . . . . . . . . . . . . . Tue4-2-5 p. 15Yamazato, Takaya . . . . . . . . . . . . . . . . . . . Wed1-4-4 p. 18Yanagi, Kenjiro . . . . . . . . . . . . . . . . . . . . . . Wed1-2-3 p. 17Yang, Kyeongcheol . . . . . . . . . . . . . . . . . . Tue4-1-2 p. 14Yang, Libo . . . . . . . . . . . . . . . . . . . . . . . . . . Tue1-1-1 p. 5Yang, Peng . . . . . . . . . . . . . . . . . . . . . . . . . . Tue3-2-2 p. 11Yang, Yajun . . . . . . . . . . . . . . . . . . . . . . . . . Tue2-5-2 p. 10Yang, Zhimei . . . . . . . . . . . . . . . . . . . . . . . . Wed1-5-1 p. 18Yeh, Chia-Jung . . . . . . . . . . . . . . . . . . . . . . Wed2-1-1 p. 19Yoon, Janghong . . . . . . . . . . . . . . . . . . . . . Wed1-3-4 p. 18Yoshida, Hideki . . . . . . . . . . . . . . . . . . . . . . Wed2-3-1 p. 20Yoshida, Susumu . . . . . . . . . . . . . . . . . . . . Wed2-4-1 p. 20Yoshida, Susumu . . . . . . . . . . . . . . . . . . . . Wed2-4-2 p. 21Yoshikawa, Hideki . . . . . . . . . . . . . . . . . . . Mon1-5-3 p. 3Yu, Young-Cheol . . . . . . . . . . . . . . . . . . . . Tue4-5-4 p. 16

ZZhang, Lifeng . . . . . . . . . . . . . . . . . . . . . . . Wed1-5-1 p. 18Zhang, Rui . . . . . . . . . . . . . . . . . . . . . . . . . . Tue3-2-2 p. 11Zheng, Junru . . . . . . . . . . . . . . . . . . . . . . . . Mon2-1-3 p. 3Zheng, Junru . . . . . . . . . . . . . . . . . . . . . . . . Wed1-1-5 p. 17Zhou, Chan . . . . . . . . . . . . . . . . . . . . . . . . . Tue4-5-5 p. 16

25

Date post:	21-Jul-2018
Category:	Documents
Upload:	vokien
View:	214 times
Download:	0 times

ISITA2006 The 2006 International Symposium on Information Theory … · ISITA2006 The 2006...

Documents