[go: up one dir, main page]

CN100466717C - The method of automatic clearing, adding record and searching for digital TV EPG information - Google Patents

The method of automatic clearing, adding record and searching for digital TV EPG information Download PDF

Info

Publication number
CN100466717C
CN100466717C CNB2005100447849A CN200510044784A CN100466717C CN 100466717 C CN100466717 C CN 100466717C CN B2005100447849 A CNB2005100447849 A CN B2005100447849A CN 200510044784 A CN200510044784 A CN 200510044784A CN 100466717 C CN100466717 C CN 100466717C
Authority
CN
China
Prior art keywords
record
epg
time
information
info
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Active
Application number
CNB2005100447849A
Other languages
Chinese (zh)
Other versions
CN1758746A (en
Inventor
邓泽学
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Hisense Co Ltd
Hisense Visual Technology Co Ltd
Original Assignee
Hisense Group Co Ltd
Qingdao Hisense Electronics Co Ltd
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Hisense Group Co Ltd, Qingdao Hisense Electronics Co Ltd filed Critical Hisense Group Co Ltd
Priority to CNB2005100447849A priority Critical patent/CN100466717C/en
Publication of CN1758746A publication Critical patent/CN1758746A/en
Application granted granted Critical
Publication of CN100466717C publication Critical patent/CN100466717C/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Images

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L65/00—Network arrangements, protocols or services for supporting real-time applications in data packet communication
    • H04L65/10—Architectures or entities
    • H04L65/102—Gateways
    • H04L65/1043—Gateway controllers, e.g. media gateway control protocol [MGCP] controllers
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F1/00—Details not covered by groups G06F3/00 - G06F13/00 and G06F21/00
    • G06F1/16—Constructional details or arrangements
    • G06F1/1613—Constructional details or arrangements for portable computers
    • G06F1/1626—Constructional details or arrangements for portable computers with a single-body enclosure integrating a flat display, e.g. Personal Digital Assistants [PDAs]
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F1/00—Details not covered by groups G06F3/00 - G06F13/00 and G06F21/00
    • G06F1/16—Constructional details or arrangements
    • G06F1/1613—Constructional details or arrangements for portable computers
    • G06F1/1633—Constructional details or arrangements of portable computers not specific to the type of enclosures covered by groups G06F1/1615 - G06F1/1626
    • G06F1/1637—Details related to the display arrangement, including those related to the mounting of the display in the housing
    • G06F1/1639—Details related to the display arrangement, including those related to the mounting of the display in the housing the display being based on projection
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F21/00—Security arrangements for protecting computers, components thereof, programs or data against unauthorised activity
    • G06F21/30—Authentication, i.e. establishing the identity or authorisation of security principals
    • G06F21/305—Authentication, i.e. establishing the identity or authorisation of security principals by remotely controlling device operation
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F21/00—Security arrangements for protecting computers, components thereof, programs or data against unauthorised activity
    • G06F21/60—Protecting data
    • G06F21/62—Protecting access to data via a platform, e.g. using keys or access control rules
    • G06F21/6209—Protecting access to data via a platform, e.g. using keys or access control rules to a single file or object, e.g. in a secure envelope, encrypted and accessed using a key, or with access control rules appended to the object itself
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F21/00—Security arrangements for protecting computers, components thereof, programs or data against unauthorised activity
    • G06F21/70—Protecting specific internal or peripheral components, in which the protection of a component leads to protection of the entire computer
    • G06F21/71—Protecting specific internal or peripheral components, in which the protection of a component leads to protection of the entire computer to assure secure computing or processing of information
    • G06F21/74—Protecting specific internal or peripheral components, in which the protection of a component leads to protection of the entire computer to assure secure computing or processing of information operating in dual or compartmented mode, i.e. at least one secure mode
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F21/00—Security arrangements for protecting computers, components thereof, programs or data against unauthorised activity
    • G06F21/70—Protecting specific internal or peripheral components, in which the protection of a component leads to protection of the entire computer
    • G06F21/88—Detecting or preventing theft or loss
    • G—PHYSICS
    • G11—INFORMATION STORAGE
    • G11B—INFORMATION STORAGE BASED ON RELATIVE MOVEMENT BETWEEN RECORD CARRIER AND TRANSDUCER
    • G11B20/00—Signal processing not specific to the method of recording or reproducing; Circuits therefor
    • G11B20/10—Digital recording or reproducing
    • G11B20/10009—Improvement or modification of read or write signals
    • G—PHYSICS
    • G11—INFORMATION STORAGE
    • G11B—INFORMATION STORAGE BASED ON RELATIVE MOVEMENT BETWEEN RECORD CARRIER AND TRANSDUCER
    • G11B20/00—Signal processing not specific to the method of recording or reproducing; Circuits therefor
    • G11B20/10—Digital recording or reproducing
    • G11B20/10009—Improvement or modification of read or write signals
    • G11B20/10305—Improvement or modification of read or write signals signal quality assessment
    • G11B20/10398—Improvement or modification of read or write signals signal quality assessment jitter, timing deviations or phase and frequency errors
    • G11B20/10425—Improvement or modification of read or write signals signal quality assessment jitter, timing deviations or phase and frequency errors by counting out-of-lock events of a PLL
    • H—ELECTRICITY
    • H03—ELECTRONIC CIRCUITRY
    • H03L—AUTOMATIC CONTROL, STARTING, SYNCHRONISATION OR STABILISATION OF GENERATORS OF ELECTRONIC OSCILLATIONS OR PULSES
    • H03L7/00—Automatic control of frequency or phase; Synchronisation
    • H03L7/06—Automatic control of frequency or phase; Synchronisation using a reference signal applied to a frequency- or phase-locked loop
    • H03L7/08—Details of the phase-locked loop
    • H03L7/085—Details of the phase-locked loop concerning mainly the frequency- or phase-detection arrangement including the filtering or amplification of its output signal
    • H03L7/091—Details of the phase-locked loop concerning mainly the frequency- or phase-detection arrangement including the filtering or amplification of its output signal the phase or frequency detector using a sampling device
    • H—ELECTRICITY
    • H03—ELECTRONIC CIRCUITRY
    • H03M—CODING; DECODING; CODE CONVERSION IN GENERAL
    • H03M13/00—Coding, decoding or code conversion, for error detection or error correction; Coding theory basic assumptions; Coding bounds; Error probability evaluation methods; Channel models; Simulation or testing of codes
    • H03M13/03—Error detection or forward error correction by redundancy in data representation, i.e. code words containing more digits than the source words
    • H03M13/23—Error detection or forward error correction by redundancy in data representation, i.e. code words containing more digits than the source words using convolutional codes, e.g. unit memory codes
    • H—ELECTRICITY
    • H03—ELECTRONIC CIRCUITRY
    • H03M—CODING; DECODING; CODE CONVERSION IN GENERAL
    • H03M13/00—Coding, decoding or code conversion, for error detection or error correction; Coding theory basic assumptions; Coding bounds; Error probability evaluation methods; Channel models; Simulation or testing of codes
    • H03M13/29—Coding, decoding or code conversion, for error detection or error correction; Coding theory basic assumptions; Coding bounds; Error probability evaluation methods; Channel models; Simulation or testing of codes combining two or more codes or code structures, e.g. product codes, generalised product codes, concatenated codes, inner and outer codes
    • H03M13/2903—Methods and arrangements specifically for encoding, e.g. parallel encoding of a plurality of constituent codes
    • H—ELECTRICITY
    • H03—ELECTRONIC CIRCUITRY
    • H03M—CODING; DECODING; CODE CONVERSION IN GENERAL
    • H03M13/00—Coding, decoding or code conversion, for error detection or error correction; Coding theory basic assumptions; Coding bounds; Error probability evaluation methods; Channel models; Simulation or testing of codes
    • H03M13/29—Coding, decoding or code conversion, for error detection or error correction; Coding theory basic assumptions; Coding bounds; Error probability evaluation methods; Channel models; Simulation or testing of codes combining two or more codes or code structures, e.g. product codes, generalised product codes, concatenated codes, inner and outer codes
    • H03M13/2957—Turbo codes and decoding
    • H03M13/2993—Implementing the return to a predetermined state, i.e. trellis termination
    • H—ELECTRICITY
    • H03—ELECTRONIC CIRCUITRY
    • H03M—CODING; DECODING; CODE CONVERSION IN GENERAL
    • H03M13/00—Coding, decoding or code conversion, for error detection or error correction; Coding theory basic assumptions; Coding bounds; Error probability evaluation methods; Channel models; Simulation or testing of codes
    • H03M13/63—Joint error correction and other techniques
    • H03M13/635—Error control coding in combination with rate matching
    • H03M13/6356—Error control coding in combination with rate matching by repetition or insertion of dummy data, i.e. rate reduction
    • H—ELECTRICITY
    • H03—ELECTRONIC CIRCUITRY
    • H03M—CODING; DECODING; CODE CONVERSION IN GENERAL
    • H03M13/00—Coding, decoding or code conversion, for error detection or error correction; Coding theory basic assumptions; Coding bounds; Error probability evaluation methods; Channel models; Simulation or testing of codes
    • H03M13/63—Joint error correction and other techniques
    • H03M13/635—Error control coding in combination with rate matching
    • H03M13/6362—Error control coding in combination with rate matching by puncturing
    • H—ELECTRICITY
    • H03—ELECTRONIC CIRCUITRY
    • H03M—CODING; DECODING; CODE CONVERSION IN GENERAL
    • H03M7/00—Conversion of a code where information is represented by a given sequence or number of digits to a code where the same, similar or subset of information is represented by a different sequence or number of digits
    • H03M7/30—Compression; Expansion; Suppression of unnecessary data, e.g. redundancy reduction
    • H03M7/40—Conversion to or from variable length codes, e.g. Shannon-Fano code, Huffman code, Morse code
    • H03M7/4006—Conversion to or from arithmetic code
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04B—TRANSMISSION
    • H04B10/00—Transmission systems employing electromagnetic waves other than radio-waves, e.g. infrared, visible or ultraviolet light, or employing corpuscular radiation, e.g. quantum communication
    • H04B10/25—Arrangements specific to fibre transmission
    • H04B10/2575—Radio-over-fibre, e.g. radio frequency signal modulated onto an optical carrier
    • H04B10/25752—Optical arrangements for wireless networks
    • H04B10/25753—Distribution optical network, e.g. between a base station and a plurality of remote units
    • H04B10/25754—Star network topology
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04B—TRANSMISSION
    • H04B7/00—Radio transmission systems, i.e. using radiation field
    • H04B7/24—Radio transmission systems, i.e. using radiation field for communication between two or more posts
    • H04B7/26—Radio transmission systems, i.e. using radiation field for communication between two or more posts at least one of which is mobile
    • H04B7/2628—Radio transmission systems, i.e. using radiation field for communication between two or more posts at least one of which is mobile using code-division multiple access [CDMA] or spread spectrum multiple access [SSMA]
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04J—MULTIPLEX COMMUNICATION
    • H04J13/00—Code division multiplex systems
    • H04J13/0077—Multicode, e.g. multiple codes assigned to one user
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04J—MULTIPLEX COMMUNICATION
    • H04J13/00—Code division multiplex systems
    • H04J13/16—Code allocation
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L1/00—Arrangements for detecting or preventing errors in the information received
    • H04L1/004—Arrangements for detecting or preventing errors in the information received by using forward error control
    • H04L1/0056—Systems characterized by the type of code used
    • H04L1/0064—Concatenated codes
    • H04L1/0066—Parallel concatenated codes
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L1/00—Arrangements for detecting or preventing errors in the information received
    • H04L1/004—Arrangements for detecting or preventing errors in the information received by using forward error control
    • H04L1/0056—Systems characterized by the type of code used
    • H04L1/0067—Rate matching
    • H04L1/0068—Rate matching by puncturing
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L12/00—Data switching networks
    • H04L12/28—Data switching networks characterised by path configuration, e.g. LAN [Local Area Networks] or WAN [Wide Area Networks]
    • H04L12/46—Interconnection of networks
    • H04L12/4641—Virtual LANs, VLANs, e.g. virtual private networks [VPN]
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L25/00—Baseband systems
    • H04L25/02—Details ; arrangements for supplying electrical power along data transmission lines
    • H04L25/03—Shaping networks in transmitter or receiver, e.g. adaptive shaping networks
    • H04L25/03006—Arrangements for removing intersymbol interference
    • H04L25/03012—Arrangements for removing intersymbol interference operating in the time domain
    • H04L25/03019—Arrangements for removing intersymbol interference operating in the time domain adaptive, i.e. capable of adjustment during data reception
    • H04L25/03038—Arrangements for removing intersymbol interference operating in the time domain adaptive, i.e. capable of adjustment during data reception with a non-recursive structure
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L25/00—Baseband systems
    • H04L25/38—Synchronous or start-stop systems, e.g. for Baudot code
    • H04L25/40—Transmitting circuits; Receiving circuits
    • H04L25/49—Transmitting circuits; Receiving circuits using code conversion at the transmitter; using predistortion; using insertion of idle bits for obtaining a desired frequency spectrum; using three or more amplitude levels ; Baseband coding techniques specific to data transmission systems
    • H04L25/4902—Pulse width modulation; Pulse position modulation
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L25/00—Baseband systems
    • H04L25/38—Synchronous or start-stop systems, e.g. for Baudot code
    • H04L25/40—Transmitting circuits; Receiving circuits
    • H04L25/49—Transmitting circuits; Receiving circuits using code conversion at the transmitter; using predistortion; using insertion of idle bits for obtaining a desired frequency spectrum; using three or more amplitude levels ; Baseband coding techniques specific to data transmission systems
    • H04L25/4904—Transmitting circuits; Receiving circuits using code conversion at the transmitter; using predistortion; using insertion of idle bits for obtaining a desired frequency spectrum; using three or more amplitude levels ; Baseband coding techniques specific to data transmission systems using self-synchronising codes, e.g. split-phase codes
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L25/00—Baseband systems
    • H04L25/38—Synchronous or start-stop systems, e.g. for Baudot code
    • H04L25/40—Transmitting circuits; Receiving circuits
    • H04L25/49—Transmitting circuits; Receiving circuits using code conversion at the transmitter; using predistortion; using insertion of idle bits for obtaining a desired frequency spectrum; using three or more amplitude levels ; Baseband coding techniques specific to data transmission systems
    • H04L25/497—Transmitting circuits; Receiving circuits using code conversion at the transmitter; using predistortion; using insertion of idle bits for obtaining a desired frequency spectrum; using three or more amplitude levels ; Baseband coding techniques specific to data transmission systems by correlative coding, e.g. partial response coding or echo modulation coding transmitters and receivers for partial response systems
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L27/00—Modulated-carrier systems
    • H04L27/10—Frequency-modulated carrier systems, i.e. using frequency-shift keying
    • H04L27/14—Demodulator circuits; Receiver circuits
    • H04L27/156—Demodulator circuits; Receiver circuits with demodulation using temporal properties of the received signal, e.g. detecting pulse width
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L41/00—Arrangements for maintenance, administration or management of data switching networks, e.g. of packet switching networks
    • H04L41/06—Management of faults, events, alarms or notifications
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L47/00—Traffic control in data switching networks
    • H04L47/10—Flow control; Congestion control
    • H04L47/15—Flow control; Congestion control in relation to multipoint traffic
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L47/00—Traffic control in data switching networks
    • H04L47/70—Admission control; Resource allocation
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L47/00—Traffic control in data switching networks
    • H04L47/70—Admission control; Resource allocation
    • H04L47/72—Admission control; Resource allocation using reservation actions during connection setup
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L47/00—Traffic control in data switching networks
    • H04L47/70—Admission control; Resource allocation
    • H04L47/74—Admission control; Resource allocation measures in reaction to resource unavailability
    • H04L47/745—Reaction in network
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L47/00—Traffic control in data switching networks
    • H04L47/70—Admission control; Resource allocation
    • H04L47/76—Admission control; Resource allocation using dynamic resource allocation, e.g. in-call renegotiation requested by the user or requested by the network in response to changing network conditions
    • H04L47/765—Admission control; Resource allocation using dynamic resource allocation, e.g. in-call renegotiation requested by the user or requested by the network in response to changing network conditions triggered by the end-points
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L47/00—Traffic control in data switching networks
    • H04L47/70—Admission control; Resource allocation
    • H04L47/82—Miscellaneous aspects
    • H04L47/822—Collecting or measuring resource availability data
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L47/00—Traffic control in data switching networks
    • H04L47/70—Admission control; Resource allocation
    • H04L47/82—Miscellaneous aspects
    • H04L47/824—Applicable to portable or mobile terminals
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L51/00—User-to-user messaging in packet-switching networks, transmitted according to store-and-forward or real-time protocols, e.g. e-mail
    • H04L51/48—Message addressing, e.g. address format or anonymous messages, aliases
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L51/00—User-to-user messaging in packet-switching networks, transmitted according to store-and-forward or real-time protocols, e.g. e-mail
    • H04L51/58—Message adaptation for wireless communication
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L61/00—Network arrangements, protocols or services for addressing or naming
    • H04L61/09—Mapping addresses
    • H04L61/25—Mapping addresses of the same type
    • H04L61/2503—Translation of Internet protocol [IP] addresses
    • H04L61/255—Maintenance or indexing of mapping tables
    • H04L61/2553—Binding renewal aspects, e.g. using keep-alive messages
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L63/00—Network architectures or network communication protocols for network security
    • H04L63/12—Applying verification of the received information
    • H04L63/126—Applying verification of the received information the source of the received data
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L65/00—Network arrangements, protocols or services for supporting real-time applications in data packet communication
    • H04L65/1066—Session management
    • H04L65/1101—Session protocols
    • H04L65/1104—Session initiation protocol [SIP]
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L9/00—Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols
    • H04L9/08—Key distribution or management, e.g. generation, sharing or updating, of cryptographic keys or passwords
    • H04L9/0816—Key establishment, i.e. cryptographic processes or cryptographic protocols whereby a shared secret becomes available to two or more parties, for subsequent use
    • H04L9/085—Secret sharing or secret splitting, e.g. threshold schemes
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L9/00—Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols
    • H04L9/30—Public key, i.e. encryption algorithm being computationally infeasible to invert or user's encryption keys not requiring secrecy
    • H04L9/304—Public key, i.e. encryption algorithm being computationally infeasible to invert or user's encryption keys not requiring secrecy based on error correction codes, e.g. McEliece
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04M—TELEPHONIC COMMUNICATION
    • H04M1/00—Substation equipment, e.g. for use by subscribers
    • H04M1/72—Mobile telephones; Cordless telephones, i.e. devices for establishing wireless links to base stations without route selection
    • H04M1/724—User interfaces specially adapted for cordless or mobile telephones
    • H04M1/72403—User interfaces specially adapted for cordless or mobile telephones with means for local support of applications that increase the functionality
    • H04M1/72409—User interfaces specially adapted for cordless or mobile telephones with means for local support of applications that increase the functionality by interfacing with external accessories
    • H04M1/72415—User interfaces specially adapted for cordless or mobile telephones with means for local support of applications that increase the functionality by interfacing with external accessories for remote control of appliances
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04M—TELEPHONIC COMMUNICATION
    • H04M7/00—Arrangements for interconnection between switching centres
    • H04M7/12—Arrangements for interconnection between switching centres for working between exchanges having different types of switching equipment, e.g. power-driven and step by step or decimal and non-decimal
    • H04M7/1205—Arrangements for interconnection between switching centres for working between exchanges having different types of switching equipment, e.g. power-driven and step by step or decimal and non-decimal where the types of switching equipement comprises PSTN/ISDN equipment and switching equipment of networks other than PSTN/ISDN, e.g. Internet Protocol networks
    • H04M7/1295—Details of dual tone multiple frequency signalling
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04N—PICTORIAL COMMUNICATION, e.g. TELEVISION
    • H04N1/00—Scanning, transmission or reproduction of documents or the like, e.g. facsimile transmission; Details thereof
    • H04N1/00912—Arrangements for controlling a still picture apparatus or components thereof not otherwise provided for
    • H04N1/00957—Compiling jobs, e.g. for batch processing
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04N—PICTORIAL COMMUNICATION, e.g. TELEVISION
    • H04N1/00—Scanning, transmission or reproduction of documents or the like, e.g. facsimile transmission; Details thereof
    • H04N1/32—Circuits or arrangements for control or supervision between transmitter and receiver or between image input and image output device, e.g. between a still-image camera and its memory or between a still-image camera and a printer device
    • H04N1/32101—Display, printing, storage or transmission of additional information, e.g. ID code, date and time or title
    • H04N1/32106—Display, printing, storage or transmission of additional information, e.g. ID code, date and time or title separate from the image data, e.g. in a different computer file
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04N—PICTORIAL COMMUNICATION, e.g. TELEVISION
    • H04N1/00—Scanning, transmission or reproduction of documents or the like, e.g. facsimile transmission; Details thereof
    • H04N1/40—Picture signal circuits
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04N—PICTORIAL COMMUNICATION, e.g. TELEVISION
    • H04N19/00—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals
    • H04N19/10—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using adaptive coding
    • H04N19/102—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using adaptive coding characterised by the element, parameter or selection affected or controlled by the adaptive coding
    • H04N19/103—Selection of coding mode or of prediction mode
    • H04N19/109—Selection of coding mode or of prediction mode among a plurality of temporal predictive coding modes
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04N—PICTORIAL COMMUNICATION, e.g. TELEVISION
    • H04N19/00—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals
    • H04N19/10—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using adaptive coding
    • H04N19/134—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using adaptive coding characterised by the element, parameter or criterion affecting or controlling the adaptive coding
    • H04N19/136—Incoming video signal characteristics or properties
    • H04N19/137—Motion inside a coding unit, e.g. average field, frame or block difference
    • H04N19/139—Analysis of motion vectors, e.g. their magnitude, direction, variance or reliability
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04N—PICTORIAL COMMUNICATION, e.g. TELEVISION
    • H04N19/00—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals
    • H04N19/60—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using transform coding
    • H04N19/625—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using transform coding using discrete cosine transform [DCT]
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04N—PICTORIAL COMMUNICATION, e.g. TELEVISION
    • H04N19/00—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals
    • H04N19/90—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using coding techniques not provided for in groups H04N19/10-H04N19/85, e.g. fractals
    • H04N19/91—Entropy coding, e.g. variable length coding [VLC] or arithmetic coding
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04N—PICTORIAL COMMUNICATION, e.g. TELEVISION
    • H04N21/00—Selective content distribution, e.g. interactive television or video on demand [VOD]
    • H04N21/40—Client devices specifically adapted for the reception of or interaction with content, e.g. set-top-box [STB]; Operations thereof
    • H04N21/41—Structure of client; Structure of client peripherals
    • H04N21/426—Internal components of the client ; Characteristics thereof
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04N—PICTORIAL COMMUNICATION, e.g. TELEVISION
    • H04N23/00—Cameras or camera modules comprising electronic image sensors; Control thereof
    • H04N23/57—Mechanical or electrical details of cameras or camera modules specially adapted for being embedded in other devices
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04N—PICTORIAL COMMUNICATION, e.g. TELEVISION
    • H04N5/00—Details of television systems
    • H04N5/44—Receiver circuitry for the reception of television signals according to analogue transmission standards
    • H04N5/4448—Receiver circuitry for the reception of television signals according to analogue transmission standards for frame-grabbing
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04N—PICTORIAL COMMUNICATION, e.g. TELEVISION
    • H04N5/00—Details of television systems
    • H04N5/44—Receiver circuitry for the reception of television signals according to analogue transmission standards
    • H04N5/46—Receiver circuitry for the reception of television signals according to analogue transmission standards for receiving on more than one standard at will
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04N—PICTORIAL COMMUNICATION, e.g. TELEVISION
    • H04N5/00—Details of television systems
    • H04N5/64—Constructional details of receivers, e.g. cabinets or dust covers
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04N—PICTORIAL COMMUNICATION, e.g. TELEVISION
    • H04N5/00—Details of television systems
    • H04N5/76—Television signal recording
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04N—PICTORIAL COMMUNICATION, e.g. TELEVISION
    • H04N7/00—Television systems
    • H04N7/01—Conversion of standards, e.g. involving analogue television standards or digital television standards processed at pixel level
    • H04N7/0112—Conversion of standards, e.g. involving analogue television standards or digital television standards processed at pixel level one of the standards corresponding to a cinematograph film standard
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04N—PICTORIAL COMMUNICATION, e.g. TELEVISION
    • H04N9/00—Details of colour television systems
    • H04N9/12—Picture reproducers
    • H04N9/31—Projection devices for colour picture display, e.g. using electronic spatial light modulators [ESLM]
    • H04N9/3129—Projection devices for colour picture display, e.g. using electronic spatial light modulators [ESLM] scanning a light beam on the display screen
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04N—PICTORIAL COMMUNICATION, e.g. TELEVISION
    • H04N9/00—Details of colour television systems
    • H04N9/64—Circuits for processing colour signals
    • H04N9/642—Multi-standard receivers
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04N—PICTORIAL COMMUNICATION, e.g. TELEVISION
    • H04N9/00—Details of colour television systems
    • H04N9/79—Processing of colour television signals in connection with recording
    • H04N9/7921—Processing of colour television signals in connection with recording for more than one processing mode
    • H04N9/7925—Processing of colour television signals in connection with recording for more than one processing mode for more than one standard
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W12/00—Security arrangements; Authentication; Protecting privacy or anonymity
    • H04W12/10—Integrity
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W28/00—Network traffic management; Network resource management
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W4/00—Services specially adapted for wireless communication networks; Facilities therefor
    • H04W4/12—Messaging; Mailboxes; Announcements
    • H04W4/14—Short messaging services, e.g. short message services [SMS] or unstructured supplementary service data [USSD]
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W52/00—Power management, e.g. Transmission Power Control [TPC] or power classes
    • H04W52/04—Transmission power control [TPC]
    • H04W52/30—Transmission power control [TPC] using constraints in the total amount of available transmission power
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W76/00—Connection management
    • H04W76/10—Connection setup
    • H04W76/12—Setup of transport tunnels
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F2221/00—Indexing scheme relating to security arrangements for protecting computers, components thereof, programs or data against unauthorised activity
    • G06F2221/21—Indexing scheme relating to G06F21/00 and subgroups addressing additional information or applications relating to security arrangements for protecting computers, components thereof, programs or data against unauthorised activity
    • G06F2221/2105—Dual mode as a secondary aspect
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F2221/00—Indexing scheme relating to security arrangements for protecting computers, components thereof, programs or data against unauthorised activity
    • G06F2221/21—Indexing scheme relating to G06F21/00 and subgroups addressing additional information or applications relating to security arrangements for protecting computers, components thereof, programs or data against unauthorised activity
    • G06F2221/2115—Third party
    • G—PHYSICS
    • G11—INFORMATION STORAGE
    • G11B—INFORMATION STORAGE BASED ON RELATIVE MOVEMENT BETWEEN RECORD CARRIER AND TRANSDUCER
    • G11B20/00—Signal processing not specific to the method of recording or reproducing; Circuits therefor
    • G11B20/22—Signal processing not specific to the method of recording or reproducing; Circuits therefor for reducing distortions
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L43/00—Arrangements for monitoring or testing data switching networks
    • H04L43/08—Monitoring or testing based on specific metrics, e.g. QoS, energy consumption or environmental parameters
    • H04L43/0823—Errors, e.g. transmission errors
    • H04L43/0829—Packet loss
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L51/00—User-to-user messaging in packet-switching networks, transmitted according to store-and-forward or real-time protocols, e.g. e-mail
    • H04L51/04—Real-time or near real-time messaging, e.g. instant messaging [IM]
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L65/00—Network arrangements, protocols or services for supporting real-time applications in data packet communication
    • H04L65/10—Architectures or entities
    • H04L65/1016—IP multimedia subsystem [IMS]
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04M—TELEPHONIC COMMUNICATION
    • H04M3/00—Automatic or semi-automatic exchanges
    • H04M3/42—Systems providing special services or facilities to subscribers
    • H04M3/42221—Conversation recording systems
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04N—PICTORIAL COMMUNICATION, e.g. TELEVISION
    • H04N2201/00—Indexing scheme relating to scanning, transmission or reproduction of documents or the like, and to details thereof
    • H04N2201/0077—Types of the still picture apparatus
    • H04N2201/0094—Multifunctional device, i.e. a device capable of all of reading, reproducing, copying, facsimile transception, file transception
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04N—PICTORIAL COMMUNICATION, e.g. TELEVISION
    • H04N2201/00—Indexing scheme relating to scanning, transmission or reproduction of documents or the like, and to details thereof
    • H04N2201/32—Circuits or arrangements for control or supervision between transmitter and receiver or between image input and image output device, e.g. between a still-image camera and its memory or between a still-image camera and a printer device
    • H04N2201/3201—Display, printing, storage or transmission of additional information, e.g. ID code, date and time or title
    • H04N2201/3212—Display, printing, storage or transmission of additional information, e.g. ID code, date and time or title of data relating to a job, e.g. communication, capture or filing of an image
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04N—PICTORIAL COMMUNICATION, e.g. TELEVISION
    • H04N2201/00—Indexing scheme relating to scanning, transmission or reproduction of documents or the like, and to details thereof
    • H04N2201/32—Circuits or arrangements for control or supervision between transmitter and receiver or between image input and image output device, e.g. between a still-image camera and its memory or between a still-image camera and a printer device
    • H04N2201/3201—Display, printing, storage or transmission of additional information, e.g. ID code, date and time or title
    • H04N2201/3212—Display, printing, storage or transmission of additional information, e.g. ID code, date and time or title of data relating to a job, e.g. communication, capture or filing of an image
    • H04N2201/3222—Display, printing, storage or transmission of additional information, e.g. ID code, date and time or title of data relating to a job, e.g. communication, capture or filing of an image of processing required or performed, e.g. forwarding, urgent or confidential handling
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04N—PICTORIAL COMMUNICATION, e.g. TELEVISION
    • H04N2201/00—Indexing scheme relating to scanning, transmission or reproduction of documents or the like, and to details thereof
    • H04N2201/32—Circuits or arrangements for control or supervision between transmitter and receiver or between image input and image output device, e.g. between a still-image camera and its memory or between a still-image camera and a printer device
    • H04N2201/3201—Display, printing, storage or transmission of additional information, e.g. ID code, date and time or title
    • H04N2201/3274—Storage or retrieval of prestored additional information
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04N—PICTORIAL COMMUNICATION, e.g. TELEVISION
    • H04N5/00—Details of television systems
    • H04N5/38—Transmitter circuitry for the transmission of television signals according to analogue transmission standards
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04N—PICTORIAL COMMUNICATION, e.g. TELEVISION
    • H04N5/00—Details of television systems
    • H04N5/44—Receiver circuitry for the reception of television signals according to analogue transmission standards
    • H04N5/445—Receiver circuitry for the reception of television signals according to analogue transmission standards for displaying additional information
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04N—PICTORIAL COMMUNICATION, e.g. TELEVISION
    • H04N5/00—Details of television systems
    • H04N5/44—Receiver circuitry for the reception of television signals according to analogue transmission standards
    • H04N5/445—Receiver circuitry for the reception of television signals according to analogue transmission standards for displaying additional information
    • H04N5/45—Picture in picture, e.g. displaying simultaneously another television channel in a region of the screen
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04N—PICTORIAL COMMUNICATION, e.g. TELEVISION
    • H04N5/00—Details of television systems
    • H04N5/66—Transforming electric information into light information
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04N—PICTORIAL COMMUNICATION, e.g. TELEVISION
    • H04N5/00—Details of television systems
    • H04N5/76—Television signal recording
    • H04N5/765—Interface circuits between an apparatus for recording and another apparatus
    • H04N5/775—Interface circuits between an apparatus for recording and another apparatus between a recording apparatus and a television receiver
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04N—PICTORIAL COMMUNICATION, e.g. TELEVISION
    • H04N5/00—Details of television systems
    • H04N5/76—Television signal recording
    • H04N5/84—Television signal recording using optical recording
    • H04N5/85—Television signal recording using optical recording on discs or drums
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04N—PICTORIAL COMMUNICATION, e.g. TELEVISION
    • H04N5/00—Details of television systems
    • H04N5/76—Television signal recording
    • H04N5/907—Television signal recording using static stores, e.g. storage tubes or semiconductor memories
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04N—PICTORIAL COMMUNICATION, e.g. TELEVISION
    • H04N7/00—Television systems
    • H04N7/01—Conversion of standards, e.g. involving analogue television standards or digital television standards processed at pixel level
    • H04N7/0117—Conversion of standards, e.g. involving analogue television standards or digital television standards processed at pixel level involving conversion of the spatial resolution of the incoming video signal
    • H04N7/0122—Conversion of standards, e.g. involving analogue television standards or digital television standards processed at pixel level involving conversion of the spatial resolution of the incoming video signal the input and the output signals having different aspect ratios
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04N—PICTORIAL COMMUNICATION, e.g. TELEVISION
    • H04N9/00—Details of colour television systems
    • H04N9/79—Processing of colour television signals in connection with recording
    • H04N9/80—Transformation of the television signal for recording, e.g. modulation, frequency changing; Inverse transformation for playback
    • H04N9/804—Transformation of the television signal for recording, e.g. modulation, frequency changing; Inverse transformation for playback involving pulse code modulation of the colour picture signal components
    • H04N9/8042—Transformation of the television signal for recording, e.g. modulation, frequency changing; Inverse transformation for playback involving pulse code modulation of the colour picture signal components involving data reduction
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W28/00—Network traffic management; Network resource management
    • H04W28/16—Central resource management; Negotiation of resources or communication parameters, e.g. negotiating bandwidth or QoS [Quality of Service]
    • H04W28/18—Negotiating wireless communication parameters
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W28/00—Network traffic management; Network resource management
    • H04W28/16—Central resource management; Negotiation of resources or communication parameters, e.g. negotiating bandwidth or QoS [Quality of Service]
    • H04W28/26—Resource reservation
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W4/00—Services specially adapted for wireless communication networks; Facilities therefor
    • H04W4/12—Messaging; Mailboxes; Announcements
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W40/00—Communication routing or communication path finding
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W72/00—Local resource management
    • H04W72/20—Control channels or signalling for resource management
    • H04W72/23—Control channels or signalling for resource management in the downlink direction of a wireless link, i.e. towards a terminal
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W8/00—Network data management
    • H04W8/22—Processing or transfer of terminal data, e.g. status or physical capabilities
    • H04W8/24—Transfer of terminal data
    • H04W8/245—Transfer of terminal data from a network towards a terminal
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W8/00—Network data management
    • H04W8/26—Network addressing or numbering for mobility support
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W88/00—Devices specially adapted for wireless communication networks, e.g. terminals, base stations or access point devices
    • H04W88/08—Access point devices
    • H04W88/085—Access point devices with remote components
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W88/00—Devices specially adapted for wireless communication networks, e.g. terminals, base stations or access point devices
    • H04W88/16—Gateway arrangements
    • Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
    • Y10—TECHNICAL SUBJECTS COVERED BY FORMER USPC
    • Y10S—TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
    • Y10S370/00—Multiplex communications
    • Y10S370/901—Wide area network
    • Y10S370/902—Packet switching
    • Y10S370/903—Osi compliant network
    • Y10S370/906—Fiber data distribution interface, FDDI
    • Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
    • Y10—TECHNICAL SUBJECTS COVERED BY FORMER USPC
    • Y10S—TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
    • Y10S370/00—Multiplex communications
    • Y10S370/901—Wide area network
    • Y10S370/902—Packet switching
    • Y10S370/903—Osi compliant network
    • Y10S370/907—Synchronous optical network, SONET

Landscapes

  • Engineering & Computer Science (AREA)
  • Signal Processing (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Multimedia (AREA)
  • Theoretical Computer Science (AREA)
  • Physics & Mathematics (AREA)
  • Computer Security & Cryptography (AREA)
  • Computer Hardware Design (AREA)
  • General Engineering & Computer Science (AREA)
  • General Physics & Mathematics (AREA)
  • Probability & Statistics with Applications (AREA)
  • Software Systems (AREA)
  • Human Computer Interaction (AREA)
  • Spectroscopy & Molecular Physics (AREA)
  • Computing Systems (AREA)
  • Mathematical Physics (AREA)
  • Power Engineering (AREA)
  • General Business, Economics & Management (AREA)
  • Business, Economics & Management (AREA)
  • Optics & Photonics (AREA)
  • Health & Medical Sciences (AREA)
  • Bioethics (AREA)
  • General Health & Medical Sciences (AREA)
  • Electromagnetism (AREA)
  • Discrete Mathematics (AREA)
  • Telephonic Communication Services (AREA)
  • Management Or Editing Of Information On Record Carriers (AREA)

Abstract

一种数字电视EPG信息的自动清理、增加记录和查找获取方法。它包括自动清理、增加EPG信息记录、增加EPG当前/下一个信息记录和查找获取四部分。自动清理包括确定内存中共用的EPG信息的记录空间和最大记录条数，设定保留EPG信息的时间，防止长时间工作时溢出；当EPG记录总数＞0时，检索出当前最新记录的时间；计算出门限时间，亦即最新记录的时间减保留EPG信息的时间；删除超出门限时间的记录；更新EPG信息记录总数并重新整理信息记录等步骤。它自动清理维护，可防止数据溢出，工作十分稳定。其信息存储和检索速度快，调用接口简单。而且具有良好的可移植性，除数字电视机外，还可推广到其它接收设备中。

Figure 200510044784

A method for automatically clearing, adding records, searching and obtaining digital TV EPG information. It includes four parts: automatic cleaning, adding EPG information record, adding EPG current/next information record and searching and obtaining. Automatic cleaning includes determining the recording space and the maximum number of records shared by the EPG information in the memory, setting the time for retaining the EPG information, and preventing overflow during long-term work; when the total number of EPG records > 0, retrieve the time of the latest current record; Calculate the threshold time, that is, the time of the latest record minus the time for retaining EPG information; delete records exceeding the threshold time; update the total number of EPG information records and rearrange the information records and other steps. It automatically cleans and maintains, prevents data overflow, and works very stably. Its information storage and retrieval speed is fast, and the calling interface is simple. Moreover, it has good portability, and can be extended to other receiving devices besides digital televisions.

Figure 200510044784

Description

Acquisition methods is write down and searches in the automatic cleaning of Digital Television EPG information, increase
Technical field
The invention belongs to the digital television technical field, more particularly relate to the automatic cleaning of Digital Television EPG information, the design that increases record and search acquisition methods.
Background technology
In the receiving terminal for digital television product, TV Guide (Electronic ProgramGuide) EPG is a function very close with consumer's relation.By TV Guide, the consumer can understand each channel program broadcast situation in future, carries out displaying predetermined programme, reads synopsis, obtain various information of digital media or the like.
The automatic deletion of traditional EPG information, increase record and search acquisition methods and do not have automatic maintenance function, can not prevent that data from overflowing, work is stable inadequately.Simultaneously, its information storage and retrieval speed is slower, and calling interface also bothers, and is unfavorable for transplanting promoting.
Summary of the invention
Purpose of the present invention just is to overcome above-mentioned shortcoming and defect, provide a kind of Digital Television EPG information of complete, simple, easy care automatic cleaning, increase record and search acquisition methods.It has automatic maintenance function, can prevent that data from overflowing, and it is very stable to work.Simultaneously, its information storage and retrieval speed is fast, and calling interface is simple.And have good portability, except that digital television set, also extend in other receiving equipments.
In order to achieve the above object, the present invention includes automatic cleaning, increase EPG information record, increase EPG current/next information record and search and obtain four parts, wherein cleaning may further comprise the steps automatically:
A1, determine shared EPG recording of information space and the dominant record bar number of all programs in the internal memory, time difference with all information in the maintenance EPG information is no more than the time that keeps EPG information in the internal memory, sets the time that keeps EPG information, overflows when preventing to work long hours;
A2 is when EPG record sum〉0 the time, retrieve the time of current state-of-the-art record:
A3 calculates the thresholding time, that is the time of state-of-the-art record subtracts the time (defaulting to 7 days) that EPG information keeps;
A4, deletion is early than the record of thresholding time;
A5 upgrades EPG information record sum and organize your messages record again.
All channels of the present invention are shared an internal memory, as the information storage area of electronic program guides.But can there be different divisions the electronic program guide information memory block of this internal memory, so its dominant record quantity is adjustable.
Increase EPG information recording part branch and comprise following steps:
B1 adjusts record start time time zone;
B2 obtains EPG information record insertion point, comprises step by step following:
B1 detects EPG information record sum, when it=0 the time, promptly enter the B3 step;
B2, whether when it is not equal to 0, it is full to detect the EPG memory block, when expire the EPG memory block, promptly enters the B3 step;
B3 when the EPG memory block is discontented, retrieves according to service-id and event-id, if retrieve existing this record, promptly enters the B3 step;
B4, if retrieve existing this record, then with move behind the record after the insertion point, with the record zero clearing of insertion point, EPG information record sum is added 1;
B3 judges the numerical value of record insertion point index, when record insertion point index＜0, does not increase new EPG information record;
B4 when record insertion point index 〉=0, copies current record in the EPG information array to.
Increase EPG current/next information recording part branch comprises following steps:
C1 obtains current/next information record insertion point, comprises step by step following:
C1 detects current/next information record sum, when it=0 the time, promptly enter the C2 step:
C2, whether when it is not equal to 0, it is full to detect current/next memory block, when expire the EPG memory block, promptly enters the C2 step:
C3 when current/next memory block is discontented, retrieves according to service-id and event-id, if retrieve existing this record, promptly enters the C2 step;
C4, if retrieve existing this record, then with move behind the record after the insertion point, with the record zero clearing of insertion point, current/next information record sum is added 1;
C2 judges the numerical value of record insertion point index, when record insertion point index＜0, does not increase new current/next information record;
C3 when record insertion point index 〉=0, copies current record in current/next information array to.
Search the acquisition unit branch and comprise following steps:
D1 judges whether input parameter is effective, and when input parameter was invalid, nothing was obtained;
D2, when input parameter is effective, the record quantity of searching first matching E PG information record and mating altogether;
D3, the record quantity of recording indexes more to be checked and coupling does not have when the record quantity of recording indexes to be checked 〉=coupling and obtains, and when the record quantity of recording indexes to be checked＜coupling, obtains an EPG information.
The present invention searches and obtains an EPG information or store an EPG information and directly adopt binary search.Location and seek rate are fast.It has only 4 key interface functions, wherein two be used for data inject, two be used for data and obtain.
Task of the present invention comes to this and finishes.
The invention provides a kind of Digital Television EPG information of complete, simple, easy care automatic cleaning, increase record and search acquisition methods.It has automatic maintenance function, but the set information retention time, but carry out garbage-cleaning every day one time, overflow to prevent data, can guarantee to stablize altogether for a long time.Simultaneously, its information storage and retrieval speed is fast, and calling interface is simple.It also has good portability, except that digital television set, also extends in other receiving equipments.
Description of drawings
The flow chart that Fig. 1 clears up automatically for the present invention.
Fig. 2 is the flow chart of the expired EPG information of cleaning among Fig. 1.
Fig. 3 is for increasing the flow chart of EPG information record.
Fig. 4 is for obtaining the flow chart of EPG information record insertion point among Fig. 3.
Fig. 5 is for increasing the flow chart of Now/Next information record.
Fig. 6 is for obtaining the flow chart of Now/Next information record insertion point among Fig. 5.
Fig. 7 is the flow chart that obtains an EPG information.
Embodiment
Embodiment 1.A kind of automatic cleaning of Digital Television EPG information, increase record and search acquisition methods, comprise automatic cleaning, increase EPG information record, increase EPG current/next information record and search and obtain four parts.As shown in Figure 1, wherein automatic cleaning may further comprise the steps:
1. determine shared EPG recording of information space and the dominant record bar number of all programs in the internal memory, be no more than the time that keeps EPG information in the internal memory with the time difference that keeps all information in the EPG information, set the time that keeps EPG information, overflow when preventing to work long hours;
2. when EPG record sum〉0 the time, retrieve the time of current state-of-the-art record;
3. calculate the thresholding time, that is the time of state-of-the-art record subtracts the time that keeps EPG information;
4. deletion exceeds the record of thresholding time;
5. upgrade EPG information record sum and organize your messages record again.
Its source code is:
// keep all the information time differences in the EPG information to be no more than DaysToKeep, overflow when preventing to work long hours
BOOL?EPG::EPGList_GabageRemove(void)
{
int?i＝0，j＝0；
int?temp_Year；
UCHAR8temp_Month，temp_Day；
long?LatestTime，FirstTime，TempTime；
int?GabageCount＝0；
if(Weekly_EPG_Info_Number<＝　0)
return?TRUE；
temp_Year ＝Weekly_EPG_Info[0].start_time，Year；
temp_Month ＝Weekly_EPG_Info[0].start_time.Month；
temp_Day ＝Weekly_EPG_Info[0].start_time.Day；
LatestTime＝(temp_Year<<16)|(temp_Month<<8)|temp_Day；
FirstTime＝LatestTime；
// find out the nearest time
for(i＝0；i<Weekly_EPG_Info_Number；i++)
{
temp_Year ＝Weekly_EPG_Info[i].start_time.Year；
temp_Month ＝Weekly_EPG_Info[i].start_time.Month；
temp_Day ＝Weekly_EPG_Info[i].start_time.Day；
TempTime＝(temp_Year<<16)|(temp_Month<<8)|temp_Day；
if(LatestTime<TempTime)
{
LatestTime＝TempTime；
}
}
temp_Day ＝LatestTime?&?0x000000ff；
temp_Month?＝(LatestTime?&?0x0000ff00)>>8；
temp_Year＝(LatestTime?&?0xffff0000)>>16；
// calculate the thresholding time, exceed with DaysToKeep
if(temp_Day>DaysToKeep)
temp_Day＝temp_Day-DaysToKeep；
else?if( (temp_Month＝＝2)||(temp_Month＝＝4)‖(temp_Month＝＝6)
‖(temp_Month＝＝8)‖(temp_Month＝＝9)||(temp_Month＝＝11)
‖(temp_Month＝＝1))
{
if(temp_Month-1＝＝0)
{
temp_Month＝12；
temp_Year?--；
}
else
temp_Month?--；
temp_Day＝31+temp_Day-DaysToKeep；
}
else?if((temp_Month＝＝5)‖(temp_Month＝＝7)‖(temp_Month＝＝10)||(temp_Month＝＝12))
{
temp_Month?--；
temp_Day＝30+temp_D?ay-DaysToKeep；
}
else?if(temp_Month＝＝3)
{
if(((temp_Year％400)＝＝0)||(((temp_Year％4)＝＝0)&&((temp_Year％100)！＝0)))
{
temp_Month--；
temp_Day＝29+temp_Day-DaysToKeep；
}
else
{
temp_Month--；
temp_Day＝28+temp_Day-DaysToKeep；
}
}
printf(＂Gate?Time?is?％d，％d，％d\n＂，temp_Year，temp_Month，temp_Day)；
// deletion exceeds the information of time restriction
FirstTime＝(temp_Year<<16)|(temp_Month<<8)|temp_Day；
for(i＝0；i<Weekly_EPG_Info_Number；i++)
{
temp_Year＝Weekly_EPG_Info[i].start_time.Year；
temp_Month＝Weekly_EPG_Info[i].start_time.Month；
temp_Day＝Weekly_EPG_Info[i].start_time.Day；
TempTime＝(temp_Year<<16)|(temp_Month<<8)|temp_Day；
if(FirstTime>TempTime)
{
memset((void*)&?Weekly_EPG_Info[i]，0，sizeof(Weekly_EPG_INFO_STRUCT))；
GabageCount++；
}
}
if(GabageCount＝＝0)
return?TRUE；
// rearrangement EPG information record
int?HoleIndex＝0，DefragmentIndex；
int?k＝Weekly_EPG_Info_Number；
while(k)
{
for(i＝HoleIndex；i<Weekly_EPG_Info_Number；i++)
{
if(Weekly_EPG_Info[i].service_id＝＝0)
{
HoleIndex＝i；
break；
}
}
for(j＝HoleIndex；j<Weekly_EPG_Info_Number；j++)
{
if(Weekly_EPG_Info[j].service_id！＝0)
{
DefragmentIndex＝j；
break；
}
}
memcpy((void*)&?Weekly_EPG_Info[HoleIndex]，
(void*)&?Weekly_EPG_Info[DefragmentIndex]，
sizeof(Weekly_EPG_INFO_STRUCT))；
memset((void*)&?Weekly_EPG_Info[DefragmentIndex]，0，sizeof(Weekly_EPG_INFO_STRUCT))；
HoleIndex?++；
k--；
if(HoleIndex>＝DefragmentIndex)
break；
}
Weekly_EPG_Info_Number＝Weekly_EPG_Info_Number-GabageCount；
return?TRUE；
}
As Fig. 3～shown in Figure 4, increase EPG information recording part branch and comprise following steps:
1. adjust record start time time zone;
2. obtain EPG information record insertion point, comprise step by step following:
(1) detect EPG information record sum, when it=0 the time, promptly enter next step;
(2) whether when it is not equal to 0, it is full to detect the EPG memory block, when expire the EPG memory block, promptly enters next step;
3. when the EPG memory block is discontented, retrieve according to service-id and evemt-id:
(1) if retrieve existing this record, promptly enters next step;
(2) if do not retrieve existing this record, then with move behind the record after the insertion point, with the record zero clearing of insertion point, EPG information record sum is added 1;
4. judge the numerical value of record insertion point index, when record insertion point index＜0, do not increase new EPG information record;
5. when record insertion point index 〉=0, current record is copied in the EPG information array.
Its source code is:
New EPG information of // increase
BOOL?EPG::AddEP?GList(tagDVBEIT_EVENT_ENTRY_STRUCT?*?pEPG)
{
int?IndexofNewInfo；
//----------------------------the time zone adjustment---------------------------------------------------
if((*pEPG).start_time.Hour<16)
{
(*pEPG).start_time.Hour＝(*pEPG).start_time.Hour+China_TimeZone；
}
else
{
(*pEPG).start_time.Hour＝(*pEPG).start_time.Hour+China_TimeZone-24；
(*pEPG).start_time.Day＝(*pEPG).start_time.Day+1；
if((*pEPG).start_time.Month＝＝1||(*pEPG).start_time.Month＝＝3||(*pEPG).start_time.Month＝＝5
||(*pEPG).start_time.Month＝＝7||(*pEPG).start_time.Month＝＝8||(*pEPG).start_time.Month＝＝10
||(*pEPG).start_time.Month＝＝12)
{
if((*pEPG).start_time.Day>31)
{
(*pEPG).start_time.Day＝1；
(*pEPG).start_time.Month＝(*pEPG).start_time.Month+1；
if((*pEPG).start_time.Month＝＝13)
{
(*pEPG).start_time.Month＝1；
(*pEPG).start_time.Year＝(*pEPG).start_time.Year+1；
}
}
}
else?if((*pEPG).start_time.Month＝＝4||(*pEPG).start_time.Month＝＝6
||(*pEPG).start_time.Month＝＝9||(*pEPG).start_time.Month＝＝11)
{
if((*pEPG).start_time.Day>30)
{
(*pEPG).start_time.Day＝1；
(*pEPG).start_time.Month＝(*pEPG).start_time.Month+1；
if((*pEPG).start_time.Month＝＝13)
{
(*pEPG).start_time.Month＝1；
(*pEPG).start_time.Year＝(*pEPG).start_time.Year+1；
}
}
}
else
{
int?OddMonth＝0；
if(((*pEPG).start_time.Year?％?400)＝＝0‖
(((*pEPG).start_time.Year％4)＝＝0?&?&((*pEPG).start_time.Year?％?100)！＝0))
OddMonth＝1；
if((*pEPG).start_time.Day>28+OddMonth)
{
(*pEPG).start_time.Day＝1；
(*pEPG).start_time.Month＝(*pEPG).start_time.Month+1；
if((*pEPG).start_time.Month＝＝13)
{
(*pEPG).start_time.Month＝1；
(*pEPG).start_time.Year＝(*pEPG).start_time.Year+1；
}
}
}
}
//------------------------------------obtain the insertion point-----------------------------------------
IndexofNewInfo＝Get_EPG_ServiceID_Index((*pEPG).service_id，(*pEPG).event_id)；
if(IndexofNewInfo＝＝-1)
{ ∥ does not have available insertion point
return?FALSE；
}
else
{ // with new EPG information record copies is in the EPG information bank
Weekly_EPG_Info[IndexofNewInfo].service_id ＝(*pEPG).service_id；
Weekly_EPG_Info[IndexofNewInfo].duration ＝(*pEPG).duration；
Weekly_EPG_Info[IndexofNewInfo].event_id ＝(*pEPG).event_id；
Weekly_EPG_Info[IndexofNewInfo].start_time.Year ＝(*pEPG).start_time.Year；
Weekly_EPG_Info[IndexofNewInfo].start_time.Month ＝(*pEPG).start_time.Month；
Weekly_EPG_Info[IndexofNewInfo].start_time.Day ＝(*pEPG).start_time.Day；
Weekly_EPG_Info[IndexofNewInfo].start_time.Hour ＝(*pEPG).start_time.Hour；
Weekly_EPG_Info[IndexofNewInfo].start_time.Minute ＝(*pEPG).start_time.Minute；
Weekly_EPG_Info[IndexofNewInfo].start_time.Second＝(*pEPG).start_time.Second；
Weekly_EPG_Info[IndexofNewInfo].end_time.Year ＝(*pEPG).end_time.Year；
Weekly_EPG_Info[IndexofNewInfo].end_time.Month?＝(*pEPG).end_time.Month；
Weekly_EPG_Info[IndexofNewInfo].end_time.Day ＝(*pEPG).end_time.Day；
Weekly_EPG_Info[IndexofNewInfo].end_time.Hour ＝(*pEPG).end_time.Hour；
Weekly_EPG_Info[IndexofNewInfo].end_time.Minute ＝(*pEPG).end_time.Minute；
Weekly_EPG_Info[IndexofNewInfo].end_time.Second ＝(*pEPG).end_time.Second；
Weekly_EPG_Info[IndexofNewInfo].short_event_desc.event_name_length ＝
(*pEPG).short_event_desc.event_name_length；
Weekly_EPG_Info[IndexofNewInfo].short_event_desc.text_length＝
(*pEPG).short_event_desc.text_length；
if(Weekly_EPG_Info[IndexofNewInfo].short_event_desc.event_name_length>＝30)
{
Weekly_EPG_Info[IndexofNewInfo].short_event_desc.event_name_length＝30；
memcpy((char*)Weekly_EPG_Info[IndexofNewInfo].short_event_desc.event_name_str，(char
*)(*pEPG).short_event_desc.event_name_str，30)；
Weekly_EPG_Info[IndexofNewInfo].short_event_desc.event_name_str[29]＝′\0′；
}
else
strcpy((char *)Weekly_EPG_Info[IndexofNewInfo].short_event_desc.event_name_str， (char
*)(*pEPG).short_event_desc.event_name_str)；
if(Weekly_EPG_Info[IndexofNewInfo].short_event_desc.text_length>＝30)
{
Weekly_EPG_Info[IndexofNewInfo].short_event_desc.text_length＝30；
memcpy((char *)Weekly_EPG_Info[IndexofNewInfo].short_event_desc.text_str， (char
*)(*pEPG).short_event_desc.text_str，30)；
Weekly_EPG_Info[IndexofNewInfo].short_event_desc.text_str[29]＝′\0′；
}
else
strcpy((char *)Weekly_EPG_Info[IndexofNewInfo].short_event_desc.text_str， (char
*)(*pEPG).short_event_desc.text_str)；
}
return?TRUE；
}
// search the array index of specifying serviceID and eventID, if do not find, just distribute one
//serviceID and eventID arrange according to ascending order
int?EPG::Get_EPG_ServiceID_Index(UINT16?serviceID，UINT16?eventID)
{
int?i；
BOOL?foundIt；
int?IndexFound；
if(Weekly_EPG_Info_Number＝＝0)
{
Weekly_EPG_Info_Number++；
return?0；
}
if(Weekly_EPG_Info_Number>＝Max_Weekly_EPG_Info_Number)
{
printf(＂Now?EPG?storage?full！\n＂)；
return-1；
}
// check whether have this serviceID and eventID, if exist, directly return index
foundIt＝QuickFind(serviceID，eventID，TRUE，&IndexFound)；
// printf(＂Index?is?％d，Found?result?is?％d\n＂，IndexFound，foundIt)；
if(foundIt)
return?IndexFound；
else
// if there is no eventID, distribute one new
{
for(i＝Weekly_EPG_Info_Number-1；i>＝IndexFound；i--)
memcpy((void*)&?Weekly_EPG_Info[i+1]，(void*)&?Weekly_EPG_Info[i]，
sizeof(Weekly_EPG_INFO_STRUCT))；
i++；
memset((void*)&?Weekly_EPG_Info[i]，0，sizeof(Weekly_EPG_INFO_STRUCT))；
Weekly_EPG_Info_Number++；
return?IndexFound；
}
retum?IndexFound；
}
As Fig. 5～shown in Figure 6, increase current/next information recording part branch and comprise following steps:
1. obtain current/next information record insertion point, comprise step by step following:
(1) detect current/next information record sum, when it=0 the time, return 0;
(2) whether when it is not equal to 0, it is full to detect current/next memory block, when expire the EPG memory block, returns-1;
(3) when current/next memory block is discontented, retrieve,, promptly return the index of this record if retrieve existing this record according to service-id and evemt-id;
(4) if do not retrieve existing this record, then with move behind the record after the insertion point, with the record zero clearing of insertion point, current/next information record sum is added 1, returns the index of this record;
2. judge the numerical value of record insertion point index:
(1) when record insertion point index＜0, do not increase new current/next information record;
(2) when record insertion point index 〉=0, current record is copied in current/next information array.
Increase EPG information record, increase EPG current/source code that next information recording part divides is as follows:
New current/next event information of // increase
BOOL?EPG::AddNowNextInfo(tagDVBEIT_EVENT_ENTRY_STRUCT?*?pShortEvent)
{
int?IndexofNewInfo；
//----------------obtain the insertion point--------------------------------------------------------------------------
IndexofNewInfo＝Get_NowNext_ServiceID_Index((*pShortEvent).service_id，(*pShortEvent).NextFlag)；
if(IndexofNewInfo＝＝-1)
{
printf(＂EPG?Storage?Full，Error\n＂)；
return?FALSE；
}
else
{ Now_Next_Info[IndexofNewInfo].NextFlag ＝(*pShortEvent).NextFlag；
Now_Next_Info[IndexofNewInfo].service_id ＝(*pShortEvent).service_id；
Now_Next_Info[IndexofNewInfo].duration ＝(*pShortEvent).duration；
Now_Next_Info[IndexofNewInfo].event_id ＝(*pShortEvent)，event_id；
Now_Next_Info[IndexofNewInfo].start_time.Year ＝(*pShortEvent).start_time.Year；
Now_Next_Info[IndexofNewInfo].start_time.Month ＝(*pShortEvent).start_time.Month；
Now_Next_Info[IndexofNewInfo].start_time.Day ＝(*pShortEvent).start_time.Day；
Now_Next_Info[IndexofNewInfo].start_time.Hour ＝(*pShortEvent).start_time.Hour；
Now_Next_Info[IndexofNewInfo].start_time.Minute?＝(*pShortEvent).start_time.Minute；
Now_Next_Info[IndexofNewInfo].start_time.Second?＝(*pShortEvent).start_time.Second；
Now_Next_Info[IndexofNewInfo].end_time.Year ＝(*pShortEvent).end_time.Year；
Now_Next_Info[IndexofNewInfo].end_time.Month ＝(*pShortEvent).end_time.Month；
Now_Next_Info[IndexofNewInfo].end_time.Day ＝(*pShortEvent).end_time.Day；
Now_Next_Info[IndexofNewInfo].end_time.Hour ＝(*pShortEvent).end_time.Hour；
Now_Next_Info[IndexofNewInfo].end_time.Minute ＝(*pShortEvent).end_time.Minute；
Now_Next_Info[IndexofNewInfo].end_time.Second ＝(*pShortEvent).end_time.Second；
Now_Next_Info[IndexofNewInfo].short_event_desc.event_name_length ＝
(*pShortEvent).short_event_desc.event_name_length；
Now_Next_Info[IndexofNewInfo].short_event_desc.text_length ＝
(*pShortEvent).short_event_desc.text_length；
if(Now_Next_Info[IndexofNewInfo].short_event_desc.event_name_length>＝30)
{
Now_Next_Info[IndexofNewInfo].short_event_desc.event_name_length＝30；
memcpy((char*)Now_Next_Info[IndexofNewInfo].short_event_desc.event_name_str， (char
*)(*pShortEvent).short_event_desc.event_name_str，30)；
Now_Next_Info[IndexofNewInfo].short_event_desc.event_name_str[29]＝′\0′；
}
else
strcpy((char *)Now_Next_Info[IndexofNewInfo].short_event_desc.event_name_str， (char
*)(*pShortEvent).short_event_desc.event_name_str)；
}
return?TRUE；
}
// search the array index of specifying serviceID, if do not find, just distribute one
//serviceID arranges according to ascending order
int?EPG::Get_NowNext_ServiceID_Index(UINT16?serviceID，BOOL?NextFlag)
{
inti；
BOOL?foundIt；
int?IndexFound；
if(Now_Next_Info_Number＝＝0)
{
Now_Next_Info_Number++；
return?0；
}
if(Now_Next_Info_Number>＝Max_Now_Next_Info_Number)
{
printf(＂Now?EPG?storage?full！\n＂)；
return-1；
}
// check whether have this serviceID and eventID, if exist, directly return index
foundIt＝QuickFind(serviceID，(int)NextFlag，FALSE，&IndexFound)；
if(foundIt)
return?IndexFound；
else
// if there is no eventID, distribute one new
{
for(i＝Now_Next_Info_Number-1；i>＝IndexFound；i--)
memcpy((void *) & Now_Next_Info[i+1]， (void *) & Now_Next_Info[i]，
sizeof(Now_Next_INFO_STRUCT))；
i++；
memset((void*)&?Now_Next_Info[i]，0，sizeof(Now_Next_INFO_STRUCT))；
Now_Next_Info_Number++；
return?IndexFound；
}
return?IndexFound；
}
As shown in Figure 7, EPG information recording searching acquisition unit branch comprises following steps:
1. judge whether input parameter is effective, and when input parameter was invalid, nothing was obtained;
2. when input parameter is effective, search first matching E PG information record and the record quantity of mating altogether;
The record quantity of recording indexes 3. more to be checked and coupling does not have when the record quantity of recording indexes to be checked 〉=coupling and obtains, and when the record quantity of recording indexes to be checked＜coupling, obtains an EPG information.
Its source code is as follows:
// input serviceID and the date and the same day which bar EPG, return the pointer that points to this EPG record, then be sky
// notice that the IndexOfRecords value is since 0
Weekly_EPG_INFO_STRUCT * EPG::Get_EPG_Info_InOneDay(UINT16 serviceID，UCHAR8 Date，?int
IndexOfRecords)
{
int?RecordsFound＝0；
int?firstIndex；
if(Date>31||Date<＝0||IndexOfRecords<0)
return?NULL；
firstIndex＝QuickLocateMultiEPG(serviceID，Date，&?RecordsFound)；
if(IndexOfRecords>＝RecordsFound)
{
printf(＂No?More?EPG?Records?for?This?Day！\n＂)；
return?NULL；
}
else
{
return?&(Weekly_EPG_Info[firstIndex+IndexOfRecords])；
}
}
// notice that when supposing the EPG information issuing herein, the program EVENT_ID of appointment is continuous, though discontinuous,
// middle the eventID that also can not insert other programs.If this hypothesis is false, then should revise this function
int?EPG::QuickLocateMultiEPG(UINT16?ServiceID，UCHAR8?Date，int*MatchedNumber)
{
int?left＝0；
int?right＝0；
int?mid；
long?tempID；
tempID＝(ServiceID<<16)|Date；
int?firstIndex＝0，lastIndex＝0；
right＝Weekly_EPG_Info_Number-1；
if(right<0)
{
*MatchedNumber＝0；
return?0；
}
mid＝(right+left)/2；
First coupling record of // location
while(left<＝right)
{
mid＝(right+left)/2；
if(tempID<＝((Weekly_EPG_Info[mid].service_id<<16)|Weekly_EPG_Info[mid].start_time.Day))
right＝mid-1；
else
left＝mid+1；
}
if(tempID＝＝((Weekly_EPG_Info[mid].service_id<<16)|Weekly_EPG_Info[mid].start_time.Day))
{
firstIndex＝mid；
}
else?if(tempID＝＝((Weekly_EPG_Info[mid+1].service_id<<16)|Weekly_EPG_Info[mid+1].start_time.Day))
{
firstIndex＝mid+1；
}
else
{
*?MatchedNumber＝0；
return?0；
}
Last the coupling record of // location
left＝0；
right＝Weekly_EPG_Info_Number-1；
mid＝(right+left)/2；
while(left<＝right)
{
mid＝(right+left)/2；
if(tempID<((Weekly_EPG_Info[mid].service_id<<16)|Weekly_EPG_Info[mid].start_time.Day))
right＝mid-1；
else
left＝mid+1；
}
if(tempID＝＝((Weekly_EPG_Info[mid].service_id<<16)|Weekly_EPG_Info[mid].start_time.Day))
{
lastIndex＝mid；
}
elseif(tempID＝＝((Weekly_EPG_Info[mid-1].service_id<<16)|Weekly_EPG_Info[mid-1].start_time.Day))
{
lastIndex＝mid-1；
}
*?MatchedNumber＝lastIndex-firstIndex+1；
return?firstIndex；
}
Search and obtain a current/next information and directly adopt binary search.Search obtain and the source code of binary search as follows:
// obtain the pointer of a current or next event information
// input service ID, the Current state.
// NextFlag=FALSE, the current program information of this serviceID is obtained in expression
// NextFlag=TRUE, the next programme information of this serviceID is obtained in expression
Now_Next_INFO_STRUCT?*?EPG::GetNowNextInfo(UINT16?serviceID，BOOL?NextFlag)
{
int?left＝0，right＝0，mid＝0；
long?tempID＝(serviceID<<16)|(int)NextFlag；
right＝Now_Next_Info_Number-1；
if(right<0)
{
return?NULL；
}
mid＝(right+left)/2；
while(left<＝right)
{
mid＝(right+left)/2；
if(tempID<(Now_Next_Info[mid].service_id<<16|(int)(Now_Next_Info[mid].NextFlag)))
{
right＝mid-1；
}
else?if(tempID>(Now_Next_Info[mid].service_id<<16|(int)(Now_Next_Info[mid].NextFlag)))
{
left＝mid+1；
}
else?if(tempID＝＝(Now_Next_Info[mid].service_id<<16|(int)(Now_Next_Info[mid].NextFlag)))
{
return?&Now_Next_Info[mid]；
}
}
if(tempID＝＝(Now_Next_Info[mid].service_id<<16|(int)(Now_Next_Info[mid].NextFlag)))
{
return?&Now_Next_Info[mid]；
}
return?NULL；
}
// binary search
During //FindInEPG, serviceID and eventID unite as keyword
//FindInEPG is a fictitious time, thinks to search in nownext information, and this moment, eventID was substituted by NextFlag
BOOL?EPG::QuickFind(UINT16?ServiceID，UINT16?eventID，BOOL?FindInEPG，int*IndexFound)
{
int?left＝0；
int?right＝0；
int?rmid；
UINT32?tempID；
tempID＝(ServiceID<<16)|eventID；
if(FindInEPG)
{
right＝Weekly_EPG_Info_Number-1；
if(right<0)
{
*IndexFound＝0；
return?FALSE；
}
mid＝(right+left)/2；
while(left<＝right)
{
mid＝(right+left)/2；
if(tempID<((Weekly_EPG_Info[mid].service_id<<16)|Weekly_EPG_Info[mid].event_id))
right＝mid-1；
else if (tempID > ((Weekly_EPG_Info[mid].service_id <<16)
|Weekly_EPG_Info[mid].event_id))
left＝mid+1；
else if(tempID ＝＝ ((Weekly_EPG_Info[mid].service_id <<16)
|Weekly_EPG_Info[mid].event_id))
{
*IndexFound＝mid；
return?TRUE；
}
}
if(tempID<((Weekly_EPG_Info[mid].service_id<<16)|Weekly_EPG_Info[mid].event_id))
{
*IndexFound＝mid；
return?FALSE；
}
else?if(tempID＝＝((Weekly_EPG_Info[mid].service_id<<16)|Weekly_EPG_Info[mid].event_id))
{
*IndexFound＝mid；
return?TRUE；
}
else
{
*IndexFound＝mid+1；
return?FALSE；
}
}
else//find?in?NowNextInfo
{
// notice that this moment, eventID was substituted by NextFlag
right＝Now_Next_Info_Number-1；
left＝0；
if(right<0)
{
*IndexFound＝0；
return?FALSE；
}
mid＝(right+left)/2；
|(int)Now_Next_Info[1].NextFlag))；
while(left<＝right)
{
mid＝(right+left)/2；
if(tempID<((Now_Next_Info[mid].service_id<<16)|(int)Now_Next_Info[mid].NextFlag))
right＝mid-1；
else if (tempID > ((Now_Next_Info[mid].service_id <<16)
|(int)Now_Next_Info[mid].NextFlag))
left＝mid+1；
else if(tempID ＝＝ ((Now_Next_Info[mid].service_id <<16)
|(int)Now_Next_Info[mid].NextFlag))
{
*IndexFound＝mid；
return?TRUE；
}
}
if(tempID<((Now_Next_Info[mid].service_id<<16)|(int)Now_Next_Info[mid].NextFlag))
{
*IndexFound＝mid；
return?FALSE；
}
else?if(tempID＝＝((Now_Next_Info[mid].service_id<<16)|(int)Now_Next_Info[mid].NextFlag))
{
*IndexFound＝mid；
return?TRUE；
}
else
{
*IndexFound＝mid+1；
return?FALSE；
}
}
}
void?CleanEPG(void*pvParam)
{
while(1)
{
Clear up the EPG data // every day one time
Delay(1000*3600*24)；
EPG_DVBC.EPGList_GabageRemove()；
}
return；
}
EPG.H
#ifndef?EPG_h
#define?EPG_h
#define?max_events_per_program?7*24
#define?NEXT?TRUE
#define?NOW?FALSE
typedef?struct?SHORT_EVENT_DESC_STRUCT
{
/*?for?short_event_descriptor()*/
UCHAR8?event_name_length；
UCHAR8 event_name_str[30]; // 15 Chinese characters
UCHAR8?text_length；
UCHAR8 text_str[30]; // 15 Chinese characters
}；
typedef?struct EXT_EVENT_DESC_STRUCT
{
/*?for?extended_event_descriptor() */
UCHAR8?ISO_639_language_code[4]；
int item_description_length[MAX_NUM_OF_ITEMS]；
UCHAR8?item_description_char[MAX_NUM_OF_ITEMS][30]；
int item_length[MAX_NUM_OF_ITEMS]；
UCHAR8?item_char[MAX_NUM_OF_ITEMS][30]；
UCHAR8?text_length；
UCHAR8?text_char[128]；
}；
struct?Now_Next_INFO_STRUCT
{
UINT16 service_id；
UINT16 event_id；
DVBTIME start_time；
DVBTIME end_time；
UINT32 duration；
BOOL NextFlag；
SHORT_EVENT_DESC_STRUCT short_event_desc；
}；
struct?Weekly_EPG_INFO_STRUCT
{
UINT16 service_id；
UINT16 event_id；
DVBTIME start_time；
DVBTIME end_time；
UINT32 duration；
SHORT_EVENT_DESC_STRUCT short_event_desc；
}；
struct?Ext_EPG_INFO_STRUCT
{
UINT16 service_id；
UINT16 event_id；
DVBTIME start_time；
DVBTIME end_time；
UINT32 duration；
EXT_EVENT_DESC_STRUCT ext_event_desc；
}；
void?CleanEPG(void*pvParam)；
class?EPG{
public:
CORE_TASK_ID?TaskID_CleanEPG；
EPG()；
～EPG()；
BOOL?Init(void)；
BOOL?AddNowNextInfo(tagDVBEIT_EVENT_ENTRY_STRUCT?*?pShortEvent)；
BOOL?AddEPGList(tagDVBEIT_EVENT_ENTRY_STRUCT?*?pEPG)；
BOOL?ADDExtEPGList(tagDVBEIT_EVENT_ENTRY_STRUCT?*?pExtEPG)；
BOOL?EPGList_GabageRemove(void)；
Now_Next_INFO_STRUCT?*?GetNowNextInfo(UINT16serviceID，BOOL?Current)；
Weekly_EPG_INFO_STRUCT?*?Get_EPG_Info_InOneDay(UINT16?serviceID，UCHAR8?Date，int
IndexOfRecords)；
int?Get_Now_Next_Info_Number(void)；
int?Get_Weekly_EPG_Info_Number(void)；
void?outputNowNextInfo(void)；
void?outputEPGListInfo(void)；
void?PrintEPGofOneDay(UINT16?ServiceID，UCHAR8?Day)；
private:
int?Max_Now_Next_Info_Number；
int?Now_Next_Info_Number；
CORE_SEM_ID?EPG_LOCK；
CORE_SEM_ID?NowNext_LOCK；
int?Max_Weekly_EPG_Info_Number；
int?Weekly_EPG_Info_Number；
int?China_TimeZone；
int?Max_Ext_EPG_Info_Number；
int?Ext_EPG_Info_Number；
Int DaysToKeep; The fate of // reservation EPG
Now_Next_INFO_STRUCT *Now_Next_Info；
Weekly_EPG_INFO_STRUCT *Weekly_EPG_Info；
Ext_EPG_INFO_STRUCT *Ext_EPG_Info；
BOOL?QuickFind(UINT16?ServiceID，UINT16?eventID，BOOL?FindInEPG，int*IndexFound)；
int?QuickLocateMultiEPG(UINT16?ServiceID，UCHAR8?Date，int*MatchedNumber)；
int?Get_NowNext_ServiceID_Index(UINT16?serviceID，BOOL?NextFlag)；
int?Get_EPG_ServiceID_Index(UINT16?serviceID，UINT16?eventID)；
}；
#endif
Embodiment 1 has automatic maintenance function, but the set information retention time, but carry out garbage-cleaning every day one time, overflow to prevent data, it is stable to guarantee to work long hours.Simultaneously, its information storage and retrieval speed is fast, and calling interface is simple.It also has good portability, except that digital television set, also extends in other receiving equipment.

Claims (5)

1.一种数字电视EPG信息的自动清理、增加记录和查找获取方法，其特征在于它包括自动清理、增加EPG信息记录、增加EPG当前/下一个信息记录和查找获取四部分，其中自动清理包括以下步骤:1. A kind of automatic clearing up of digital television EPG information, increase record and search acquisition method, it is characterized in that it comprises automatic clearing, increase EPG information record, increase EPG current/next information record and search acquisition four parts, wherein automatic clearing comprises The following steps: A1，确定内存中所有节目共用的EPG信息的记录空间和最大记录条数，以保持EPG信息中所有信息的时间差不超过内存中保留EPG信息的时间，设定保留EPG信息的时间，防止长时间工作时溢出；A1. Determine the recording space and the maximum number of records of EPG information shared by all programs in the memory, so that the time difference of all information in the EPG information does not exceed the time for retaining the EPG information in the memory, and set the time for retaining the EPG information to prevent long-term overflow while working; A2，当EPG记录总数>0时，检索出当前最新记录的时间:A2, when the total number of EPG records>0, retrieve the time of the latest record: A3，计算出门限时间，亦即最新记录的时间减EPG信息保留的时间；A3, calculate the threshold time, that is, the time of the latest record minus the time for retaining the EPG information; A4，删除早于门限时间的记录；A4, delete records earlier than the threshold time; A5，更新EPG信息记录总数并重新整理信息记录。A5, update the total number of EPG information records and rearrange the information records. 2.按照权利要求1所述的数字电视EPG信息的自动清理、增加记录和查找获取方法，其特征在于增加EPG信息记录部分包括以下步骤:2. according to the automatic cleaning of digital TV EPG information of claim 1, increase record and search acquisition method, it is characterized in that increasing EPG information record part comprises the following steps: B1，调整记录起始时间时区；B1, adjust the recording start time and time zone; B2，获取EPG信息记录插入点，包括以下分步骤:B2, obtaining the EPG information record insertion point, including the following sub-steps: b1，检测EPG信息记录总数，当它＝0时，即进入B3步骤；b1, detect the total number of EPG information records, when it=0, promptly enter the B3 step; b2，当它不等于0时，检测EPG存储区是否已满，当EPG存储区已满时，即进入B3步骤；b2, when it is not equal to 0, detect whether the EPG storage area is full, and when the EPG storage area is full, enter the B3 step; b3，当EPG存储区不满时，根据service—id和event—id进行检索，如果检索到已有该记录，即进入B3步骤；b3, when the EPG storage area is not full, search according to service_id and event_id, if the record is retrieved, enter step B3; b4，如果没有检索到已有该记录，则将插入点之后的记录后移、将插入点的记录清零、将EPG信息记录总数加1；b4, if the existing record is not retrieved, the record after the insertion point is moved backward, the record at the insertion point is cleared, and the total number of EPG information records is increased by 1; B3，判断记录插入点索引的数值，当记录插入点索引<0时，不增加新的EPG信息记录；B3, judging the value of the record insertion point index, when the record insertion point index<0, no new EPG information record is added; B4，当记录插入点索引≥0时，将当前记录拷贝到EPG信息数组中。B4. When the record insertion point index ≥ 0, copy the current record to the EPG information array. 3.按照权利要求2所述的数字电视EPG信息的自动清理、增加记录和查找获取方法，其特征在于增加EPG当前/下一个信息记录部分包括以下步骤:3. according to the automatic cleaning of digital television EPG information claimed in claim 2, increase record and search acquisition method, it is characterized in that increasing EPG current/next information recording part comprises the following steps: C1，获取当前/下一个信息记录插入点，包括以下分步骤:C1, obtaining the current/next information record insertion point, including the following sub-steps: c1，检测当前/下一个信息记录总数，当它＝0时，即进入C2步骤:c1, detect the current/next total number of information records, when it=0, promptly enter the C2 step: c2，当它不等于0时，检测当前/下一个存储区是否已满，当EPG存储区已满时，即进入C2步骤:c2, when it is not equal to 0, detect whether the current/next storage area is full, and when the EPG storage area is full, promptly enter the C2 step: c3，当当前/下一个存储区不满时，根据service—id和event—id进行检索，如果检索到已有该记录，即进入C2步骤；c3, when the current/next storage area is not full, search according to service_id and event_id, if the record is retrieved, enter step C2; c4，如果没有检索到已有该记录，则将插入点之后的记录后移、将插入点的记录清零、将当前/下一个信息记录总数加1；c4, if the existing record is not retrieved, move the record after the insertion point backward, clear the record at the insertion point, and add 1 to the total number of current/next information records; C2，判断记录插入点索引的数值，当记录插入点索引<0时，不增加新的当前/下一个信息记录；C2, determine the value of the record insertion point index, when the record insertion point index <0, do not add a new current/next information record; C3，当记录插入点索引≥0时，将当前记录拷贝到当前/下一个信息数组中。C3, when the record insertion point index ≥ 0, copy the current record to the current/next information array. 4.按照权利要求3所述的数字电视EPG信息的自动清理、增加记录和查找获取方法，其特征在于查找获取部分包括以下步骤:4. according to the automatic cleaning of digital TV EPG information according to claim 3, increase record and search acquisition method, it is characterized in that search acquisition part comprises the following steps: D1，判断输入参数是否有效，当输入参数无效时，无获取；D1, to determine whether the input parameter is valid, when the input parameter is invalid, no acquisition; D2，当输入参数有效时，查找第一项匹配的EPG信息记录和总共匹配的记录数量；D2, when the input parameters are valid, search for the first matching EPG information record and the total number of matching records; D3，比较待查询记录索引和匹配的记录数量，当待查询记录索引≥匹配的记录数量时无获取，当待查询记录索引<匹配的记录数量时，获取一条EPG信息。D3. Compare the index of the record to be queried with the number of matching records. When the index of the record to be queried ≥ the number of records to be queried, there is no acquisition. When the index of the record to be queried < the number of records to be matched, an EPG information is obtained. 5.按照权利要求3所述的数字电视EPG信息的自动清理、增加记录和查找获取方法，其特征在于，在获取EPG信息记录插入点、获取当前/下一个信息记录插入点时，查找获取一条EPG信息直接采用折半查找法。5. according to the automatic clearing up of digital TV EPG information of claim 3, increase record and search acquisition method, it is characterized in that, when obtaining EPG information record insertion point, obtaining current/next information record insertion point, search and obtain one The EPG information directly uses the binary search method.
CNB2005100447849A 2005-09-19 2005-09-19 The method of automatic clearing, adding record and searching for digital TV EPG information Active CN100466717C (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CNB2005100447849A CN100466717C (en) 2005-09-19 2005-09-19 The method of automatic clearing, adding record and searching for digital TV EPG information

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CNB2005100447849A CN100466717C (en) 2005-09-19 2005-09-19 The method of automatic clearing, adding record and searching for digital TV EPG information

Publications (2)

Publication Number Publication Date
CN1758746A CN1758746A (en) 2006-04-12
CN100466717C true CN100466717C (en) 2009-03-04

Family

ID=36703897

Family Applications (1)

Application Number Title Priority Date Filing Date
CNB2005100447849A Active CN100466717C (en) 2005-09-19 2005-09-19 The method of automatic clearing, adding record and searching for digital TV EPG information

Country Status (1)

Country Link
CN (1) CN100466717C (en)

Families Citing this family (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JP5060926B2 (en) * 2007-11-28 2012-10-31 ルネサスエレクトロニクス株式会社 Program information processing apparatus and program information processing method
CN101667180B (en) * 2008-09-03 2012-10-17 神讯电脑(昆山)有限公司 Database space management system and its method
CN102123321A (en) * 2010-12-08 2011-07-13 深圳Tcl新技术有限公司 Method and system for avoiding automatic upgrade of network television
CN104581194A (en) * 2014-12-22 2015-04-29 乐视致新电子科技（天津）有限公司 Current program information searching method and device
CN110166069A (en) * 2018-04-17 2019-08-23 北京丰信达科技有限公司 A kind of family's blackboard with communication function

Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN1260667A (en) * 1995-11-17 2000-07-19 汤姆森消费电子有限公司 Time arranying apparatus and performance-searching method of inquiry tools in TV receiver
JP2001111911A (en) * 1999-10-12 2001-04-20 Sony Corp Program guide data processing method and program guide data processing device
US20020059185A1 (en) * 2000-10-14 2002-05-16 Lg Electronics Inc. Method of managing index data in main memory database
CN1453998A (en) * 2002-04-23 2003-11-05 日本电气株式会社 Programme search equipment, programme video frequency processing equipment and program
JP2005057404A (en) * 2003-08-01 2005-03-03 Matsushita Electric Ind Co Ltd Channel search announcing method and digital broadcast receiver

Patent Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN1260667A (en) * 1995-11-17 2000-07-19 汤姆森消费电子有限公司 Time arranying apparatus and performance-searching method of inquiry tools in TV receiver
JP2001111911A (en) * 1999-10-12 2001-04-20 Sony Corp Program guide data processing method and program guide data processing device
US20020059185A1 (en) * 2000-10-14 2002-05-16 Lg Electronics Inc. Method of managing index data in main memory database
CN1453998A (en) * 2002-04-23 2003-11-05 日本电气株式会社 Programme search equipment, programme video frequency processing equipment and program
JP2005057404A (en) * 2003-08-01 2005-03-03 Matsushita Electric Ind Co Ltd Channel search announcing method and digital broadcast receiver

Also Published As

Publication number Publication date
CN1758746A (en) 2006-04-12

Similar Documents

Publication Publication Date Title
US10412451B2 (en) Storing same channel overlapping recordings
CN101202855B (en) Method, system of program management and digital television receiving terminal
CN105812937B (en) A kind of TV programme suggesting method and television program recommending device
CN100466717C (en) The method of automatic clearing, adding record and searching for digital TV EPG information
CN106649491A (en) Natural language analysis technology-based information pushing system
CN103546634A (en) Handhold equipment theme control method and handhold equipment theme control device
CN101459795A (en) Intelligent storage method for television program
US10965989B2 (en) Methods and apparatus to model on/off states of media presentation devices based on return path data
CN108989724B (en) Embedded video camera video storage method and file search method
CN106649509A (en) User feature extraction method and device
CN107306283B (en) Data synchronization method and device
CN112765135B (en) Data processing method, device, electronic equipment and storage medium
CN110703976A (en) Clipping method, electronic device, and computer-readable storage medium
CN104881774A (en) Method and apparatus for automatically establishing schedule
CN104699682B (en) Information processing method and device
CN102802090A (en) Video copyright protection method and system
CN101615206A (en) The system and method for metadata is provided
WO2020016526A4 (en) Method implemented by computer for the creation of contents comprising synthesis images
CN101359971A (en) Method and system providing electronic program guiding service
CN103401998B (en) Realization method of correlation alarm clock on mobile equipment
CN111314736B (en) Video copyright analysis method and device, electronic equipment and storage medium
CN102316358B (en) Method for recording streaming media file and corresponding equipment
CN111475678A (en) Method, server and terminal for pushing search results
CN100559487C (en) The method and system of the recording capacity of management accounts equipment
CN106162218B (en) Program recording control method, system and management and popularity statistical server

Legal Events

Date Code Title Description
C06 Publication
PB01 Publication
C10 Entry into substantive examination
SE01 Entry into force of request for substantive examination
C14 Grant of patent or utility model
GR01 Patent grant
CP01 Change in the name or title of a patent holder

Address after: 266071 Shandong city of Qingdao province Jiangxi City Road No. 11

Patentee after: HISENSE Co.,Ltd.

Patentee after: Hisense Visual Technology Co., Ltd.

Address before: 266071 Shandong city of Qingdao province Jiangxi City Road No. 11

Patentee before: HISENSE Co.,Ltd.

Patentee before: QINGDAO HISENSE ELECTRONICS Co.,Ltd.

CP01 Change in the name or title of a patent holder