Broadcasting Server Bit Map Overlap Check
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Conventional methods for checking broadcasting schedule overlap in broadcasting systems are inefficient, leading to increased time and decreased server efficiency as the number of programs and channels grows, making it difficult to provide rapid broadcasting services.
Innovation Solution
A broadcasting system that uses bit maps to determine service time overlaps by comparing bit values, with a schedule arrangement unit, bit map configuration unit, and overlap check unit to efficiently identify overlapping service times, allowing for faster new program arrangement and improved schedule management.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Device complexity
If conventional sequential comparison method is used to check broadcasting schedule overlap, then the checking process is simple and easy to implement, but the time consumed increases proportionally with the number of programs and channels
Solution Approach 1:
The patent transforms the service time information of programs into bit map data structures, where each bit represents a specific time slot. This parameter transformation allows the overlap checking to be performed through efficient bit-wise operations (AND, OR, XOR) instead of sequential comparison, dramatically reducing the time complexity from O(n*m) to O(n/64) where n is the number of time slots and m is the number of programs.
Solution Approach 2:
The patent replaces the mechanical sequential comparison process with automated bit-wise logical operations. The broadcasting server automatically performs bit map operations to detect overlaps, eliminating the need for manual or sequential program-by-program comparison, thus substituting a time-consuming mechanical process with a faster computational approach.
2Quantity of substance
If the number of channels and programs increases to provide more broadcasting content, then the volume of content increases, but the time taken to arrange new programs increases sharply
Solution Approach 1:
The patent transforms program service time information into bit map representations, enabling efficient parallel processing of multiple programs and channels. This parameter transformation allows the system to handle increased content volume without proportionally increasing arrangement time, as bit-wise operations can process multiple time slots simultaneously.
Solution Approach 2:
The patent pre-processes program service time information into bit map data structures before actual scheduling operations. By preparing the bit maps in advance and organizing service time data in a standardized format, the system reduces the computational burden during new program arrangement, enabling faster processing even as content volume grows.
3Ease of operation
If sequential comparison of service time information is performed for each program on each channel, then the checking method is straightforward, but the broadcasting server efficiency decreases
Solution Approach 1:
The patent changes the representation parameter of service time information from discrete program records to continuous bit map arrays. This parameter change enables the broadcasting server to perform bulk operations on multiple programs simultaneously through bit-wise logic operations, dramatically improving server efficiency while maintaining operational simplicity through standardized bit map processing routines.
Data Source
AI summary
A broadcasting system includes a broadcasting server which checks for overlap in a broadcasting schedule. The broadcasting server performs an operation on a first bit map corresponding to service time information of each program on each of at least one channel and a second bit map corresponding to service time information of a new program, and additionally arranges the new program. The broadcasting system providing broadcasting service through a variety of networks, enables a broadcasting program schedule to be managed efficiently, and performs a schedule overlap check so as to arrange a new program to be performed in a minimum amount of time.