Electronics and Telecommunications Research Institute

Pyeong Soo Mah

Seon Tae Kim

Duk Kyun Woo

Sang Cheol Kim

Gyu Sang Shin

Bumho Kim

Yu Seung Ma

Byung Gyu Kim

Suk Kyu Song

Hae Yong Kim

Jin Won Kim

Kyeong Tae Kim

Jeong-Woo Lee

Seon-Tae Kim

Yong Ki Son

Jinwuk Seok

Hyung Kook Jun

Chang Min Shin

Bum Ho Kim

Mi Sun Yu

Jin Ho Chang

There is provided a network join method including transmitting a long beacon message including transmission timing information of a first short beacon message to a child node network device, transmitting a first short beacon message including information regarding an interval in which it is possible to transmit a message, to the child node network device according to a transmission timing of the first short beacon message, receiving a slot allocation request message from the child node network device according to the interval in which it is possible to transmit a message, and checking whether the child node network device joins a network, and transmitting a slot allocation confirmation message to the child node network device.

Network join method and network device using the network join method

A fault-based software testing method and system are provided. The fault-based software testing method includes: generating a plurality of error programs by injecting faults into a testing target program; grouping the generated error programs into a plurality of groups with respect to respective test data, and selecting representative error programs with respect to the respective groups; and when an error is detected in the execution result of the representative error programs with respect to the corresponding test data, determining that errors are detected in all the error programs of the corresponding group.

Fault-based software testing method and system

The present invention relates to a task scheduling method for a real time operating system (RTOS) mounted to an embedded system, and more particularly, to a task scheduling method which allows a programmer to make a CPU reservation for a task. The task scheduling method for a real time operating system, includes: at a scheduling time point, determining whether or not a highest priority of tasks present in a ready queue is a predetermined value K; if the highest priority is determined to be K, applying a reservation based scheduler to perform a scheduling; and if the highest priority is determined not to be K, applying a priority based scheduler to perform a scheduling; the tasks present in the ready queue, the priority of which is K, contains idle CPU reservation allocation information received as a factor when the tasks the priority of which is K are created.

Task scheduling method for real time operating system

Provided is a method of dynamically reallocating a thread stack in a multi-threaded operating system, and more particularly, a method of dynamically allocating a thread stack of a multi-threaded operating system in an embedded system for wireless sensor nodes. The method includes the steps of: measuring sizes of data and non-data sections of a stack with respect to each thread; determining a new size of the non-data section of each stack based on the size of the data section of the stack measured with respect to each thread; and adjusting the size of the non-data section of each stack to the determined new size. According to the method, even without the source code analysis, an amount of memory spaces to be used can be reduced compared to that of a conventional static stack allocation method.

Dynamic stack allocating method in multi-threaded operating systems

Provided is a fast mode-searching apparatus and method for motion-prediction. The fast mode-searching apparatus includes a probability information obtaining unit, a first inter mode searching unit, a second inter mode searching unit, and a selective intra mode searching unit. The probability information obtaining unit detects whether at least one of a macroblock of a previous frame, a macroblock of a current frame, and adjacent macroblocks corresponds to at least one of P16&#xd7;16, P16&#xd7;8, and P8&#xd7;16. The first inter mode searching unit performs an inter mode search on a block that is not detected by the probability information obtaining unit. The second inter mode searching unit determines whether the macroblock of the current frame corresponds to P16&#xd7;16 as a result of performing the inter mode search on a block detected by the probability information obtaining unit. The selective intra mode searching unit performs an intra mode search if the macroblock of the current frame corresponds to P16&#xd7;16.

Fast mode-searching apparatus and method for fast motion-prediction

A fast motion estimation apparatus and method in which motion estimation is carried out on a current block of a current frame of video image data with reference to a corresponding matching block of a previous frame are provided. The fast motion estimation apparatus includes: a determination unit which determines whether an SAD between pixel values of a current block of a current frame and a corresponding matching block of a previous frame is greater than a predefined threshold; an initial search unit which performs an initial search when the SAD is greater than the predetermined threshold to find which search point of a current search pattern is the minimal SAD point and to determine whether the minimal SAD point matches the center of the current search pattern; and a repetitive search unit which performs an iteration search when the minimal SAD point differs from the center of the current search pattern to reset the minimal SAD point to be a center of the current search pattern and to set a number of search points and the size of a search pattern based on from current search pattern to a center of the search window of the previous frame.

Fast motion estimation apparatus and method using block matching algorithm

The present invention relates to a half-pel motion estimation method. The calculation object half-pel, which is in the block of the previous or next reference frame, is not estimated additionally for each block of the current frame divided into blocks of a predetermined size. The present invention suggests an algorithm that can perform half-pel search only with a SAD value used in integer-pel search and a random variable for correcting errors. Since the present invention does not have to generate half-pel for motion estimation, the calculation amount is amazingly reduced and the calculation time is reduced.

Fast half-pel searching method on the basis of SAD values according to integer-pel search and random variable corresponding to each macro block

A method of estimating motion in a mobile device reduces access of external memory and power consumption while increasing the usability of internal memory. The method includes recognizing an overlapped block of a reference search area between the current and its next macro block, and transferring only non-overlapped blocks to internal memory when motion estimation of a next macro block is performed.

Growing community of inventors

Daejeon, South Korea

Pyeong Soo Mah