• 일시 : 2015 8 5 수요일 오후 4:30~6:00
  • 장소 : 공업센터 본관 406
  • Title : 분배저장을 위한 코딩데이터 복구시 필요한 통신대역폭의  최소화
  • Speaker : Prof. Jaekyun Moon 

In modern distributed storage, data is stored across a multitude of low-cost storage nodes that are bound to fail occasionally. Accordingly, a need arises to provide protection against random failures of nodes that are generally

located physically apart. Error protection can be given in the form of traditional error correction coding but an additional requirement arises that has to do with reconstructing data using a minimum bandwidth of communication networks that link the nodes together. This is critical in making the recovery process as fast as possible given the limited bandwidth resource.

This additional requirement makes error correction code design both interesting and challenging.Some of the existing ideas based on the well-known Reed-Solomon codes are discussed along with a new idea that makes efficient use of the factor-graph representation of the code constraint.

 Speaker Bio :

Jaekyun Moon is a Professor of electrical engineering at KAIST. He was with the faculty of the Department of Electrical and Computer Engineering at the University of Minnesota, Twin Cities.

His research interests are in the area of signal processing and coding for data storage and digital communication. He consulted as Chief Scientist for DSPG, Inc. and worked as Chief Technology Officier at Link-A-Media Devices Corporation.Prof. Moon received the McKnight Land-Grant Professorship from the University of Minnesota, and the IBM Faculty Development Awards as well as the IBM Partnership Awards. He was awarded the National Storage Industry Consortium (NSIC) Technical Achievement Award for the invention of the maximum transition run (MTR) code, a widely used error-control/modulation code in commercial storage systems. He is an IEEE Fellow.