CN110300332B - Game loading method and system based on IPTV - Google Patents

Game loading method and system based on IPTV Download PDF

Info

Publication number
CN110300332B
CN110300332B CN201910527661.2A CN201910527661A CN110300332B CN 110300332 B CN110300332 B CN 110300332B CN 201910527661 A CN201910527661 A CN 201910527661A CN 110300332 B CN110300332 B CN 110300332B
Authority
CN
China
Prior art keywords
matrix
value
game resource
vector
loaded
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
CN201910527661.2A
Other languages
Chinese (zh)
Other versions
CN110300332A (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.)
Nanjing Keyuan Information Technology Co ltd
Original Assignee
Nanjing Keyuan Information Technology 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 Nanjing Keyuan Information Technology Co ltd filed Critical Nanjing Keyuan Information Technology Co ltd
Priority to CN201910527661.2A priority Critical patent/CN110300332B/en
Publication of CN110300332A publication Critical patent/CN110300332A/en
Application granted granted Critical
Publication of CN110300332B publication Critical patent/CN110300332B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Images

Classifications

    • A—HUMAN NECESSITIES
    • A63—SPORTS; GAMES; AMUSEMENTS
    • A63F—CARD, BOARD, OR ROULETTE GAMES; INDOOR GAMES USING SMALL MOVING PLAYING BODIES; VIDEO GAMES; GAMES NOT OTHERWISE PROVIDED FOR
    • A63F13/00—Video games, i.e. games using an electronically generated display having two or more dimensions
    • A63F13/60—Generating or modifying game content before or while executing the game program, e.g. authoring tools specially adapted for game development or game-integrated level editor
    • A—HUMAN NECESSITIES
    • A63—SPORTS; GAMES; AMUSEMENTS
    • A63F—CARD, BOARD, OR ROULETTE GAMES; INDOOR GAMES USING SMALL MOVING PLAYING BODIES; VIDEO GAMES; GAMES NOT OTHERWISE PROVIDED FOR
    • A63F13/00—Video games, i.e. games using an electronically generated display having two or more dimensions
    • A63F13/60—Generating or modifying game content before or while executing the game program, e.g. authoring tools specially adapted for game development or game-integrated level editor
    • A63F13/69—Generating or modifying game content before or while executing the game program, e.g. authoring tools specially adapted for game development or game-integrated level editor by enabling or updating specific game elements, e.g. unlocking hidden features, items, levels or versions
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F9/00—Arrangements for program control, e.g. control units
    • G06F9/06—Arrangements for program control, e.g. control units using stored programs, i.e. using an internal store of processing equipment to receive or retain programs
    • G06F9/44—Arrangements for executing specific programs
    • G06F9/445—Program loading or initiating
    • G06F9/44521—Dynamic linking or loading; Link editing at or after load time, e.g. Java class loading
    • 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/47—End-user applications
    • H04N21/478—Supplemental services, e.g. displaying phone caller identification, shopping application
    • H04N21/4781—Games
    • 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/60—Network structure or processes for video distribution between server and client or between remote clients; Control signalling between clients, server and network components; Transmission of management data between server and client, e.g. sending from server to client commands for recording incoming content stream; Communication details between server and client 
    • H04N21/61—Network physical structure; Signal processing
    • H04N21/6106—Network physical structure; Signal processing specially adapted to the downstream path of the transmission network
    • H04N21/6125—Network physical structure; Signal processing specially adapted to the downstream path of the transmission network involving transmission via Internet

Landscapes

  • Engineering & Computer Science (AREA)
  • Multimedia (AREA)
  • Software Systems (AREA)
  • Theoretical Computer Science (AREA)
  • Physics & Mathematics (AREA)
  • General Engineering & Computer Science (AREA)
  • General Physics & Mathematics (AREA)
  • Signal Processing (AREA)
  • Data Exchanges In Wide-Area Networks (AREA)

Abstract

The invention provides a game loading method and system based on an IPTV. The method comprises the following steps: obtaining a plurality of game resource packages to be loaded; constructing an SDK development framework; performing version adaptation on the plurality of game resource packages to be loaded and the SDK development framework; and loading the plurality of game resource packages to be loaded through the SDK development framework. According to the method, the game resource package is loaded by the SDK development frame formed by integrating the loading environments of unity3d, unity2d, cos, cosjs and the like which the game resource package depends on, when a user wants to experience a certain game, the user only needs to select the game in the SDK development frame to enter the experience, complex loading environment downloading and installing processes are not needed, waste of flow resources and memory resources is avoided, the operation is simple and convenient, and the user experience is improved.

Description

Game loading method and system based on IPTV
Technical Field
The invention relates to the technical field of IPTV, in particular to a game loading method and a game loading system based on IPTV.
Background
IPTV refers to a television broadcast service based on an IP network. IPTV services can be roughly divided into two major categories, namely, basic services and value-added services, where the basic services refer to video content services mainly based on audition content, and include live broadcast, on-demand broadcast, carousel, time-shift, and the like; the value added services generally include the fields of communication, information, games, and transactions.
The game is an important member of IPTV value-added services, and is one of the value-added services which are very attractive to IPTV. In general, IPTV-based games use a set-top box as a terminal, and download game resource packages from a game server to the terminal, where the game resource packages are loaded by the terminal. However, because the loading environments of different game resource packages are different, when a user wants to experience different games, the user needs to download and install the loading environment corresponding to the game resource package from the game server, and a large amount of traffic resources and memory resources of the terminal are consumed.
Disclosure of Invention
Aiming at the defects in the prior art, the invention provides a game loading method and a game loading system based on an IPTV (Internet protocol television), which are used for solving the problems that due to the difference of loading environments of different game resource packages, when a user wants to experience different games, the corresponding loading environments need to be downloaded and installed from a game server, and a large amount of flow resources and memory resources of a terminal are consumed. The method comprises the following steps:
obtaining a plurality of game resource packages to be loaded;
constructing an SDK development framework;
performing version adaptation on the plurality of game resource packages to be loaded and the SDK development framework;
loading the plurality of game resource packages to be loaded through the SDK development framework;
the SDK development framework comprises a unity3d loading environment, a unity2d loading environment, a cos loading environment and a cos js loading environment;
in the process of downloading the game resource package, the game resource package needs to be subjected to redundant information elimination processing, wherein the steps of the redundant information elimination processing are shown as S1-S5:
s1, converting the game resource package into binary machine codes which can be recognized by a machine;
s2, cutting the binary machine code according to each byte, wherein each byte forms a piece of data, P pieces of data are shared, and each piece of data contains 8-bit numerical values, so that a matrix B of P rows and 8 columns is formed;
s3, optimizing the rows and the columns of the matrix B, wherein the specific steps are as follows;
s301, constructing an operation matrix Y, wherein the initial value of the matrix Y is a matrix B, and meanwhile, constructing an identification vector M, and the initial value of the M is null;
s302, judging whether the first row of the matrix Y needs to be removed or not by using a formula (1);
CF＝sum(Y1)
if CF＝P then K＝1,T＝[1,0]
else if CF＝0then K＝1,T＝[0,0]
else if Y1≠Y2then K＝1,T＝[0,1]
else K＝0,T＝[0,0]
M＝[M,T]
(1)
where CF, T is the intermediate parameter, sum is the sum, Y1If … then … is the value of the first column of matrix Y, then the calculation after then is run if the condition is satisfied, if not, then the run after else for the next row is run, Y1≠Y2The value of the first column for all rows of the matrix Y is not equal to the value of the second column, [ M, T]To add the value of T to the rear of the vector M, K is a decision function, if K is 0, step S4 is performed, if K is equal to 1, the value of the first column of the matrix Y is deleted, and then the step S302 is repeated for the matrix Y from which the 1 st column is deleted;
s4, performing second information elimination on the matrix Y from which all the repeated columns needing to be eliminated are eliminated, wherein the specific steps are described as follows;
s401, constructing an information matrix Q, namely assigning a value of a first row of a matrix Y as a first piece of data of the matrix Q and a value of a second row of the matrix Y to a vector J to be detected, constructing a position vector Z, setting the first value of the Z to be 1, and simultaneously removing the first two rows of the matrix Y;
s402, adjusting an information matrix Q and a position vector Z by using a formula (2);
Figure GDA0002414920920000031
GL＝[CL1,CL2,……CLlength(Q)]
max z＝max(GL)
if max z＝1then Z＝[Z,find(GL＝1)]
else Q＝Q.add(J),Z＝[Z,length(Q)+1]
(2)
wherein, GLcGL, maxz are intermediate parameters, length () is the number of values in the statistical brackets, if a vector is in brackets, the number of values in the vector is counted, if a matrix is in brackets, the number of rows of the matrix, JiIs the ith value, Q, of vector Jc,iThe value of the c-th row and i-th column of the matrix Q, max (GL), the maximum value of GL, and find (GL ═ 1)The position corresponding to a value of 1 in the quantity GL, [ Z, find (GL ═ 1)]Add (J) to the last row of the matrix Q, [ Z, length (Q) +1, to add the value of find (GL ═ 1) to the back of the vector Z]To add length (Q) +1 to the back of vector Z;
s403, judging whether the matrix Y is empty or not, if not, assigning the first row of the matrix Y to the vector J to be detected, deleting the first row of the matrix Y, repeating the step S403, and if the matrix Y is empty, operating the step S5;
and S5, taking the information matrix Q, the position vector Z and the identification vector M as the information after the redundant information elimination processing, transmitting the information, and recovering the information by using the reverse operation of the redundant information elimination processing when the information needs to be used.
In an embodiment of the present invention, after performing version adaptation on the plurality of game resource packages to be loaded and the SDK development framework, the method further includes: and updating the versions of the game resource packages to be loaded.
In one embodiment of the present invention, the version updating of the game resource packages to be loaded includes:
comparing the plurality of game resource packages to be loaded with the latest game resource package;
when the plurality of game resource packages to be loaded are different from the latest game resource package, acquiring the latest game resource package from a game server.
Another embodiment of the present invention provides a game loading system based on an IPTV, including:
the acquisition module is used for acquiring a plurality of game resource packages to be loaded;
the construction module is used for constructing an SDK development framework;
the adaptation module is used for carrying out version adaptation on the plurality of game resource packages to be loaded and the SDK development framework;
the loading module loads the game resource packages to be loaded through the SDK development framework;
the SDK development framework comprises a unity3d loading environment, a unity2d loading environment, a cos loading environment and a cos js loading environment;
in the process of downloading the game resource package, the game resource package needs to be subjected to redundant information elimination processing, wherein the steps of the redundant information elimination processing are shown as S1-S5:
s1, converting the game resource package into binary machine codes which can be recognized by a machine;
s2, cutting the binary machine code according to each byte, wherein each byte forms a piece of data, P pieces of data are shared, and each piece of data contains 8-bit numerical values, so that a matrix B of P rows and 8 columns is formed;
s3, optimizing the rows and the columns of the matrix B, wherein the specific steps are as follows;
s301, constructing an operation matrix Y, wherein the initial value of the matrix Y is a matrix B, and meanwhile, constructing an identification vector M, and the initial value of the M is null;
s302, judging whether the first row of the matrix Y needs to be removed or not by using a formula (1);
CF＝sum(Y1)
if CF＝P then K＝1,T＝[1,0]
else if CF＝0then K＝1,T＝[0,0]
else if Y1≠Y2then K＝1,T＝[0,1]
else K＝0,T＝[0,0]
M＝[M,T]
(1)
where CF, T is the intermediate parameter, sum is the sum, Y1If … then … is the value of the first column of matrix Y, then the calculation after then is run if the condition is satisfied, if not, then the run after else for the next row is run, Y1≠Y2The value of the first column for all rows of the matrix Y is not equal to the value of the second column, [ M, T]To add the value of T to the rear of the vector M, K is a decision function, if K is 0, step S4 is performed, if K is equal to 1, the value of the first column of the matrix Y is deleted, and then the step S302 is repeated for the matrix Y from which the 1 st column is deleted;
s4, performing second information elimination on the matrix Y from which all the repeated columns needing to be eliminated are eliminated, wherein the specific steps are described as follows;
s401, constructing an information matrix Q, namely assigning a value of a first row of a matrix Y as a first piece of data of the matrix Q and a value of a second row of the matrix Y to a vector J to be detected, constructing a position vector Z, setting the first value of the Z to be 1, and simultaneously removing the first two rows of the matrix Y;
s402, adjusting an information matrix Q and a position vector Z by using a formula (2);
Figure GDA0002414920920000051
GL＝[CL1,CL2,……CLlength(Q)]
maxz＝max(GL)
if max z＝1then Z＝[Z,find(GL＝1)]
else Q＝Q.add(J),Z＝[Z,length(Q)+1]
(2)
wherein, GLcGL, max z are intermediate parameters, length () is the number of values in the statistical brackets, if a vector is in brackets the number of values of the vector is counted, if a matrix is in brackets the number of rows of the matrix, JiIs the ith value, Q, of vector Jc,iThe value of the c-th row and i-th column of the matrix Q, max (GL) is the maximum value of GL, find (GL ═ 1) is the position corresponding to the value of 1 found in the vector GL, [ Z, find (GL ═ 1)]Add (J) to the last row of the matrix Q, [ Z, length (Q) +1, to add the value of find (GL ═ 1) to the back of the vector Z]To add length (Q) +1 to the back of vector Z;
s403, judging whether the matrix Y is empty or not, if not, assigning the first row of the matrix Y to the vector J to be detected, deleting the first row of the matrix Y, repeating the step S403, and if the matrix Y is empty, operating the step S5;
and S5, taking the information matrix Q, the position vector Z and the identification vector M as the information after the redundant information elimination processing, transmitting the information, and recovering the information by using the reverse operation of the redundant information elimination processing when the information needs to be used.
In an embodiment of the present invention, after performing version adaptation on the plurality of game resource packages to be loaded and the SDK development framework, the method further includes: and updating the versions of the game resource packages to be loaded.
In one embodiment of the present invention, further comprising:
and the updating module is used for updating the versions of the game resource packages to be loaded after the game resource packages to be loaded are subjected to version adaptation with the SDK development framework.
In one embodiment of the invention, the update module comprises:
a comparing unit, configured to compare the plurality of game resource packages to be loaded with the latest game resource package;
and the downloading unit is used for acquiring the latest game resource packet from the game server when the plurality of game resource packets to be loaded are different from the latest game resource packet.
Compared with the prior art, the system provided by the invention has the following advantages:
according to the method, the game resource package is loaded by the SDK development frame formed by integrating the loading environments of unity3d, unity2d, cos, cosjs and the like which the game resource package depends on, when a user wants to experience a certain game, the user only needs to select the game in the SDK development frame to enter the experience, complex loading environment downloading and installing processes are not needed, waste of flow resources and memory resources is avoided, the operation is simple and convenient, and the user experience is improved.
The redundant information eliminating processing method provided by the invention can greatly reduce the storage space of the game resource packet and improve the storage efficiency under the condition of not losing any information quantity, can greatly improve the speed of downloading the game resource packet, reduce the flow required during transmission, reduce the internal bandwidth and temporary occupation, does not need to add extra equipment, can be realized only by simple calculation, and can greatly improve the intelligent efficiency under the condition of not increasing the cost.
Additional features and advantages of the invention will be set forth in the description which follows, and in part will be obvious from the description, or may be learned by practice of the invention. The objectives and other advantages of the invention will be realized and attained by the structure particularly pointed out in the written description and claims hereof as well as the appended drawings.
The technical solution of the present invention is further described in detail by the accompanying drawings and embodiments.
Drawings
In order to more clearly illustrate the embodiments of the present invention or the technical solutions in the prior art, the drawings used in the description of the embodiments or the prior art will be briefly described below, it is obvious that the drawings in the following description are only some embodiments of the present invention, and for those skilled in the art, other drawings can be obtained according to the drawings without creative efforts.
Fig. 1 is a schematic flowchart of a game loading method based on IPTV provided in the present invention;
fig. 2 is a schematic structural diagram of an IPTV-based game loading system according to the present invention;
fig. 3 is another schematic structural diagram of an IPTV-based game loading system according to the present invention;
fig. 4 is a schematic structural diagram of an update module in an IPTV-based game loading system according to the present invention.
Detailed Description
The technical solutions in the embodiments of the present invention will be clearly and completely described below with reference to the drawings in the embodiments of the present invention, and it is obvious that the described embodiments are only a part of the embodiments of the present invention, and not all of the embodiments. All other embodiments, which can be derived by a person skilled in the art from the embodiments given herein without making any creative effort, shall fall within the protection scope of the present invention.
Referring to fig. 1, fig. 1 is a schematic flowchart of a game loading method based on an IPTV provided in the present invention. The method comprises the following steps:
obtaining a plurality of game resource packages to be loaded;
constructing an SDK development framework;
carrying out version adaptation on a plurality of game resource packages to be loaded and an SDK development framework;
loading a plurality of game resource packages to be loaded through an SDK development framework;
the SDK development framework comprises a unity3d loading environment, a unity2d loading environment, a cos loading environment and a cos js loading environment;
in the process of downloading the game resource package, the game resource package needs to be subjected to redundant information elimination processing, wherein the steps of the redundant information elimination processing are shown as S1-S5:
s1, converting the game resource packet into binary machine codes which can be identified by the machine;
s2, cutting the binary machine code according to each byte, wherein each byte forms a piece of data, P pieces of data are shared, and each piece of data contains 8-bit numerical values, so that a matrix B of P rows and 8 columns is formed;
s3, optimizing the rows and the columns of the matrix B, wherein the specific steps are as follows;
s301, constructing an operation matrix Y, wherein the initial value of the matrix Y is a matrix B, and simultaneously constructing an identification vector M, and the initial value of the M is null;
s302, judging whether the first row of the matrix Y needs to be removed or not by using a formula (1);
CF＝sum(Y1)
if CF＝P then K＝1,T＝[1,0]
else if CF＝0then K＝1,T＝[0,0]
else if Y1≠Y2then K＝1,T＝[0,1]
else K＝0,T＝[0,0]
M＝[M,T]
(1)
where CF, T is the intermediate parameter, sum is the sum, Y1If … the … is the value of the first column of the matrix Y, then if the condition between if and then is satisfiedRunning the calculation after then, if not, running the run after else for the next row, Y1≠Y2The value of the first column for all rows of the matrix Y is not equal to the value of the second column, [ M, T]To add the value of T to the rear of the vector M, K is a decision function, if K is 0, step S4 is performed, if K is equal to 1, the value of the first column of the matrix Y is deleted, and then the step S302 is repeated for the matrix Y from which the 1 st column is deleted;
s4, performing second information elimination on the matrix Y from which all the repeated columns needing to be eliminated are eliminated, wherein the specific steps are described as follows;
s401, constructing an information matrix Q, namely assigning a value of a first row of a matrix Y as a first piece of data of the matrix Q and a value of a second row of the matrix Y to a vector J to be detected, constructing a position vector Z, setting the first value of the Z to be 1, and simultaneously removing the first two rows of the matrix Y;
s402, adjusting an information matrix Q and a position vector Z by using a formula (2);
Figure GDA0002414920920000091
GL＝[CL1,CL2,……CLlength(Q)]
max z＝max(GL)
if max z＝1then Z＝[Z,find(GL＝1)]
else Q＝Q.add(J),Z＝[Z,length(Q)+1]
(2)
wherein, GLcGL, maxz are intermediate parameters, length () is the number of values in the statistical brackets, if a vector is in brackets, the number of values in the vector is counted, if a matrix is in brackets, the number of rows of the matrix, JiIs the ith value, Q, of vector Jc,iThe value of the c-th row and i-th column of the matrix Q, max (GL) is the maximum value of GL, find (GL ═ 1) is the position corresponding to the value of 1 found in the vector GL, [ Z, find (GL ═ 1)]Add (J) to the last row of the matrix Q, [ Z, length (Q) +1, to add the value of find (GL ═ 1) to the back of the vector Z]To add length (Q) +1 to the back of vector Z;
s403, judging whether the matrix Y is empty or not, if not, assigning the first row of the matrix Y to the vector J to be detected, deleting the first row of the matrix Y, repeating the step S403, and if the matrix Y is empty, operating the step S5;
and S5, taking the information matrix Q, the position vector Z and the identification vector M as the information after the redundant information elimination processing, transmitting the information, and recovering the information by using the reverse operation of the redundant information elimination processing when the information is required to be used.
Specifically, a user downloads a plurality of game halls in a set top box of a game resource package to be loaded from a game server through a set top box, then constructs an SDK development frame through the game halls in the set top box to form the SDK frame integrating various loading environments, then carries out version adaptation on the plurality of game resource packages to be loaded and the SDK development frame to form a uniform runtimesDK, and finally loads the plurality of game resource packages to be loaded through the SDK development frame. The SDK development framework is mainly used for unifying interactive interfaces of the terminal and games and providing a library for new game development. The framework is mainly written by Java language, and a jar package is formed after compiling and is used as a third-party library for other applications. The SDK development framework integrates the unity3d loading environment, unity2d loading environment, cos loading environment and cosjs loading environment which are depended by the game resource package, so that the loading efficiency of the game is improved, the loading difficulty and the loading time are greatly reduced, the game loading process is clearer, the hierarchical structure is clearer, and the maintenance and the expansion are more convenient in the later period.
The redundant information eliminating processing method provided by the invention can greatly reduce the storage space of the game resource packet and improve the storage efficiency under the condition of not losing any information quantity, can greatly improve the speed of downloading the game resource packet, reduce the flow required during transmission, reduce the internal bandwidth and temporary occupation, does not need to add extra equipment, can be realized only by simple calculation, and can greatly improve the intelligent efficiency under the condition of not increasing the cost
In a specific embodiment, after performing version adaptation on a plurality of game resource packages to be loaded and the SDK development framework, the method further includes: and updating the versions of the game resource packages to be loaded.
Specifically, after the multiple game resource packages to be loaded are subjected to version adaptation with the SDK development framework, the versions of the game resource packages need to be confirmed, and since the game resource packages include multiple resource files, different resource files may be updated, and if the different resource files are not updated, the updated resource files need to be downloaded and stored.
In a specific embodiment, the version updating of a plurality of game resource packages to be loaded includes:
comparing a plurality of game resource packages to be loaded with the latest game resource package;
and when a plurality of game resource packages to be loaded are different from the latest game resource package, acquiring the latest game resource package from the game server.
Specifically, when updating versions of a plurality of game resource packages to be loaded, firstly comparing a package file header of a latest game resource package on a game server with a package file header of a local game resource, and determining whether the position of basic information of the game resource package on the game server is changed, wherein the package file header carries the position and the size of the basic information of the game resource file in the game resource package; if the position of the basic information of the compared game resource file is changed, marking the changed basic information of the local game resource file as a first state, wherein the first state is used for indicating that the local game resource file is in a state to be updated; if the position of the basic information of the game resource file is not changed, the basic information of the local game resource file which is not changed is marked to be in a second state, wherein the second state is used for indicating that the local game resource file is in a ready state.
The game resource package comprises a package file header of a game resource package, and the package file header of the game resource package comprises basic information of a resource file, whether the game resource package of a local game resource package and the game resource package of a server are changed or not can be judged by comparing the basic information of the resource file in the package file header, if the position of the basic information of the game resource file is changed, the resource file on the server is updated, the basic information of the local resource file is marked to be updated for subsequent updating, otherwise, the basic information is marked to be in a ready state, and updating is not needed. The version updating operation is carried out on the game resource package, so that the game resource which is experienced by the user at each time is the latest version, and the game experience of the user is improved.
According to the method, the game resource package is loaded by the SDK development frame formed by integrating the loading environments of unity3d, unity2d, cos, cosjs and the like which the game resource package depends on, when a user wants to experience a certain game, the user only needs to select the game in the SDK development frame to enter the experience, complex loading environment downloading and installing processes are not needed, waste of flow resources and memory resources is avoided, the operation is simple and convenient, and the user experience is improved.
As shown in fig. 2, the present invention provides an IPTV-based game loading system based on the foregoing embodiment, including:
the acquisition module is used for acquiring a plurality of game resource packages to be loaded;
the construction module is used for constructing an SDK development framework;
the adaptation module is used for carrying out version adaptation on a plurality of game resource packages to be loaded and the SDK development framework;
the loading module loads a plurality of game resource packages to be loaded through the SDK development framework;
the SDK development framework comprises a unity3d loading environment, a unity2d loading environment, a cos loading environment and a cos js loading environment;
in the process of downloading the game resource package, the game resource package needs to be subjected to redundant information elimination processing, wherein the steps of the redundant information elimination processing are shown as S1-S5:
s1, converting the game resource package into binary machine codes which can be recognized by a machine;
s2, cutting the binary machine code according to each byte, wherein each byte forms a piece of data, P pieces of data are shared, and each piece of data contains 8-bit numerical values, so that a matrix B of P rows and 8 columns is formed;
s3, optimizing the rows and the columns of the matrix B, wherein the specific steps are as follows;
s301, constructing an operation matrix Y, wherein the initial value of the matrix Y is a matrix B, and meanwhile, constructing an identification vector M, and the initial value of the M is null;
s302, judging whether the first row of the matrix Y needs to be removed or not by using a formula (1);
CF＝sum(Y1)
if CF＝P then K＝1,T＝[1,0]
else if CF＝0then K＝1,T＝[0,0]
else if Y1≠Y2then K＝1,T＝[0,1]
else K＝0,T＝[0,0]
M＝[M,T]
(1)
where CF, T is the intermediate parameter, sum is the sum, Y1If … then … is the value of the first column of matrix Y, then the calculation after then is run if the condition is satisfied, if not, then the run after else for the next row is run, Y1≠Y2The value of the first column for all rows of the matrix Y is not equal to the value of the second column, [ M, T]To add the value of T to the rear of the vector M, K is a decision function, if K is 0, step S4 is performed, if K is equal to 1, the value of the first column of the matrix Y is deleted, and then the step S302 is repeated for the matrix Y from which the 1 st column is deleted;
s4, performing second information elimination on the matrix Y from which all the repeated columns needing to be eliminated are eliminated, wherein the specific steps are described as follows;
s401, constructing an information matrix Q, namely assigning a value of a first row of a matrix Y as a first piece of data of the matrix Q and a value of a second row of the matrix Y to a vector J to be detected, constructing a position vector Z, setting the first value of the Z to be 1, and simultaneously removing the first two rows of the matrix Y;
s402, adjusting an information matrix Q and a position vector Z by using a formula (2);
Figure GDA0002414920920000131
GL＝[CL1,CL2,……CLlength(Q)]
maxz＝max(GL)
if max z＝1then Z＝[Z,find(GL＝1)]
else Q＝Q.add(J),Z＝[Z,length(Q)+1]
(2)
wherein, GLcGL, maxz are intermediate parameters, length () is the number of values in the statistical brackets, if a vector is in brackets, the number of values in the vector is counted, if a matrix is in brackets, the number of rows of the matrix, JiIs the ith value, Q, of vector Jc,iThe value of the c-th row and i-th column of the matrix Q, max (GL) is the maximum value of GL, find (GL ═ 1) is the position corresponding to the value of 1 found in the vector GL, [ Z, find (GL ═ 1)]Add (J) to the last row of the matrix Q, [ Z, length (Q) +1, to add the value of find (GL ═ 1) to the back of the vector Z]To add length (Q) +1 to the back of vector Z;
s403, judging whether the matrix Y is empty or not, if not, assigning the first row of the matrix Y to the vector J to be detected, deleting the first row of the matrix Y, repeating the step S403, and if the matrix Y is empty, operating the step S5;
and S5, taking the information matrix Q, the position vector Z and the identification vector M as the information after the redundant information elimination processing, transmitting the information, and recovering the information by using the reverse operation of the redundant information elimination processing when the information needs to be used.
In an embodiment of the present invention, after performing version adaptation on the plurality of game resource packages to be loaded and the SDK development framework, the method further includes: and updating the versions of the game resource packages to be loaded.
As shown in fig. 3, in a specific embodiment, the method further includes:
and the updating module is used for updating the versions of the game resource packages to be loaded after the game resource packages to be loaded are subjected to version adaptation with the SDK development framework.
As shown in fig. 4, in a specific embodiment, the update module includes:
a comparison unit for comparing a plurality of game resource packs to be loaded with the latest game resource pack;
and the downloading unit is used for acquiring the latest game resource packet from the game server when the plurality of game resource packets to be loaded are different from the latest game resource packet.
With regard to the system in the above embodiment, the specific steps thereof have been described in detail in the embodiment related to the method, and will not be elaborated herein. .
It will be apparent to those skilled in the art that various changes and modifications may be made in the present invention without departing from the spirit and scope of the invention. Thus, if such modifications and variations of the present invention fall within the scope of the claims of the present invention and their equivalents, the present invention is also intended to include such modifications and variations.

Claims (6)

1. An IPTV-based game loading method is characterized by comprising the following steps:
obtaining a plurality of game resource packages to be loaded;
constructing an SDK development framework;
performing version adaptation on the plurality of game resource packages to be loaded and the SDK development framework;
loading the plurality of game resource packages to be loaded through the SDK development framework;
the SDK development framework comprises a unity3d loading environment, a unity2d loading environment, a cos loading environment and a cos js loading environment;
in the process of downloading the game resource package, the game resource package needs to be subjected to redundant information elimination processing, wherein the steps of the redundant information elimination processing are shown as S1-S5:
s1, converting the game resource package into binary machine codes which can be recognized by a machine;
s2, cutting the binary machine code according to each byte, wherein each byte forms a piece of data, P pieces of data are shared, and each piece of data contains 8-bit numerical values, so that a matrix B of P rows and 8 columns is formed;
s3, optimizing the rows and the columns of the matrix B, wherein the specific steps are as follows;
s301, constructing an operation matrix Y, wherein the initial value of the matrix Y is a matrix B, and meanwhile, constructing an identification vector M, and the initial value of the M is null;
s302, judging whether the first row of the matrix Y needs to be removed or not by using a formula (1);
CF＝sum(Y1)
if CF＝P then K＝1,T＝[1,0]
else if CF＝0then K＝1,T＝[0,0]
else if Y1≠Y2then K＝1,T＝[0,1]
else K＝0,T＝[0,0]
M＝[M,T]
(1)
where CF, T is the intermediate parameter, sum is the sum, Y1If … then … is the value of the first column of matrix Y, then the calculation after then is run if the condition is satisfied, if not, then the run after else for the next row is run, Y1≠Y2The value of the first column for all rows of the matrix Y is not equal to the value of the second column, [ M, T]To add the value of T to the rear of the vector M, K is a decision function, if K is 0, step S4 is performed, if K is equal to 1, the value of the first column of the matrix Y is deleted, and then the step S302 is repeated for the matrix Y from which the 1 st column is deleted;
s4, performing second information elimination on the matrix Y from which all the repeated columns needing to be eliminated are eliminated, wherein the specific steps are described as follows;
s401, constructing an information matrix Q, namely assigning a value of a first row of a matrix Y as a first piece of data of the matrix Q and a value of a second row of the matrix Y to a vector J to be detected, constructing a position vector Z, setting the first value of the Z to be 1, and simultaneously removing the first two rows of the matrix Y;
s402, adjusting an information matrix Q and a position vector Z by using a formula (2);
Figure FDA0002414920910000021
GL＝[CL1,CL2,……CLlength(Q)]
maxz＝max(GL)
if maxz＝1 then Z＝[Z,find(GL＝1)]
else Q＝Q.add(J),Z＝[Z,length(Q)+1]
(2)
wherein, GLcGL, maxz are intermediate parameters, length () is the number of values in the statistical brackets, if a vector is in brackets, the number of values in the vector is counted, if a matrix is in brackets, the number of rows of the matrix, JiIs the ith value, Q, of vector Jc,iThe value of the c-th row and i-th column of the matrix Q, max (GL) is the maximum value of GL, find (GL ═ 1) is the position corresponding to the value of 1 found in the vector GL, [ Z, find (GL ═ 1)]Add (J) to the last row of the matrix Q, [ Z, length (Q) +1, to add the value of find (GL ═ 1) to the back of the vector Z]To add length (Q) +1 to the back of vector Z;
s403, judging whether the matrix Y is empty or not, if not, assigning the first row of the matrix Y to the vector J to be detected, deleting the first row of the matrix Y, repeating the step S403, and if the matrix Y is empty, operating the step S5;
and S5, taking the information matrix Q, the position vector Z and the identification vector M as the information after the redundant information elimination processing, transmitting the information, and recovering the information by using the reverse operation of the redundant information elimination processing when the information needs to be used.
2. The method of claim 1, after performing version adaptation on the plurality of game resource packages to be loaded and the SDK development framework, further comprising: and updating the versions of the game resource packages to be loaded.
3. The method of claim 2, wherein performing a version update on the plurality of game resource packages to be loaded comprises:
comparing the plurality of game resource packages to be loaded with the latest game resource package;
when the plurality of game resource packages to be loaded are different from the latest game resource package, acquiring the latest game resource package from a game server.
4. An IPTV-based game loading system, comprising:
the acquisition module is used for acquiring a plurality of game resource packages to be loaded;
the construction module is used for constructing an SDK development framework;
the adaptation module is used for carrying out version adaptation on the plurality of game resource packages to be loaded and the SDK development framework;
the loading module loads the game resource packages to be loaded through the SDK development framework;
the SDK development framework comprises a unity3d loading environment, a unity2d loading environment, a cos loading environment and a cos js loading environment;
in the process of downloading the game resource package, the game resource package needs to be subjected to redundant information elimination processing, wherein the steps of the redundant information elimination processing are shown as S1-S5:
s1, converting the game resource package into binary machine codes which can be recognized by a machine;
s2, cutting the binary machine code according to each byte, wherein each byte forms a piece of data, P pieces of data are shared, and each piece of data contains 8-bit numerical values, so that a matrix B of P rows and 8 columns is formed;
s3, optimizing the rows and the columns of the matrix B, wherein the specific steps are as follows;
s301, constructing an operation matrix Y, wherein the initial value of the matrix Y is a matrix B, and meanwhile, constructing an identification vector M, and the initial value of the M is null;
s302, judging whether the first row of the matrix Y needs to be removed or not by using a formula (1);
CF＝sum(Y1)
if CF＝P then K＝1,T＝[1,0]
else if CF＝0 then K＝1,T＝[0,0]
else if Y1≠Y2then K＝1,T＝[0,1]
else K＝0,T＝[0,0]
M＝[M,T]
(1)
where CF, T is the intermediate parameter, sum is the sum, Y1If … then … is the value of the first column of matrix Y, then the calculation after then is run if the condition is satisfied, if not, then the run after else for the next row is run, Y1≠Y2The value of the first column for all rows of the matrix Y is not equal to the value of the second column, [ M, T]To add the value of T to the rear of the vector M, K is a decision function, if K is 0, step S4 is performed, if K is equal to 1, the value of the first column of the matrix Y is deleted, and then the step S302 is repeated for the matrix Y from which the 1 st column is deleted;
s4, performing second information elimination on the matrix Y from which all the repeated columns needing to be eliminated are eliminated, wherein the specific steps are described as follows;
s401, constructing an information matrix Q, namely assigning a value of a first row of a matrix Y as a first piece of data of the matrix Q and a value of a second row of the matrix Y to a vector J to be detected, constructing a position vector Z, setting the first value of the Z to be 1, and simultaneously removing the first two rows of the matrix Y;
s402, adjusting an information matrix Q and a position vector Z by using a formula (2);
Figure FDA0002414920910000051
GL＝[CL1,CL2,……CLlength(Q)]
maxz＝max(GL)
if maxz＝1 then Z＝[Z,find(GL＝1)]
else Q＝Q.add(J),Z＝[Z,length(Q)+1]
(2)
wherein, GLcGL, maxz are intermediate parameters, length () is the number of values in the statistical brackets, if a vector is in brackets, the number of values in the vector is counted, if a matrix is in brackets, the number of rows of the matrix, JiIs the ith value, Q, of vector Jc,iThe value of the c-th row and i-th column of the matrix Q, max (GL) is the maximum value of GL, find (GL ═ 1) is the position corresponding to the value of 1 found in the vector GL, [ Z, find (GL ═ 1)]Add (J) to the last row of the matrix Q, [ Z, length (Q) +1, to add the value of find (GL ═ 1) to the back of the vector Z]To add length (Q) +1 to the back of vector Z;
s403, judging whether the matrix Y is empty or not, if not, assigning the first row of the matrix Y to the vector J to be detected, deleting the first row of the matrix Y, repeating the step S403, and if the matrix Y is empty, operating the step S5;
and S5, taking the information matrix Q, the position vector Z and the identification vector M as the information after the redundant information elimination processing, transmitting the information, and recovering the information by using the reverse operation of the redundant information elimination processing when the information needs to be used.
5. The system of claim 4, further comprising:
and the updating module is used for updating the versions of the game resource packages to be loaded after the game resource packages to be loaded are subjected to version adaptation with the SDK development framework.
6. The system of claim 5, wherein the update module comprises:
a comparing unit, configured to compare the plurality of game resource packages to be loaded with the latest game resource package;
and the downloading unit is used for acquiring the latest game resource packet from the game server when the plurality of game resource packets to be loaded are different from the latest game resource packet.
CN201910527661.2A 2019-06-18 2019-06-18 Game loading method and system based on IPTV Active CN110300332B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN201910527661.2A CN110300332B (en) 2019-06-18 2019-06-18 Game loading method and system based on IPTV

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201910527661.2A CN110300332B (en) 2019-06-18 2019-06-18 Game loading method and system based on IPTV

Publications (2)

Publication Number Publication Date
CN110300332A CN110300332A (en) 2019-10-01
CN110300332B true CN110300332B (en) 2020-05-08

Family

ID=68028252

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201910527661.2A Active CN110300332B (en) 2019-06-18 2019-06-18 Game loading method and system based on IPTV

Country Status (1)

Country Link
CN (1) CN110300332B (en)

Families Citing this family (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN114553862A (en) * 2022-03-09 2022-05-27 博雅网络游戏开发（深圳）有限公司 Game resource package distribution downloading method
CN117707753A (en) * 2023-06-25 2024-03-15 荣耀终端有限公司 Resource update control method, electronic equipment and chip system

Citations (8)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN102752081A (en) * 2012-07-03 2012-10-24 Ut斯达康通讯有限公司 Parallel cyclic redundancy check method and device in high-speed Ethernet
CN103269396A (en) * 2013-05-02 2013-08-28 百度在线网络技术（北京）有限公司 Method and system capable of conducting management on mobile terminal
CN103970517A (en) * 2013-01-30 2014-08-06 中兴通讯股份有限公司 Access processing method and device for IPTV (internet protocol television) game
CN104240284A (en) * 2014-10-10 2014-12-24 重庆邮电大学 Flash based game image rendering method and system
CN104360871A (en) * 2014-10-12 2015-02-18 厦门雅基软件有限公司 Quick starting method for installation of cell phone games
CN106730855A (en) * 2017-02-20 2017-05-31 李守明 A kind of system for realizing virtually being interacted with reality
US9737812B2 (en) * 2007-02-13 2017-08-22 Sizmek Technologies Ltd. Method of interacting with an interactive game program
CN108888951A (en) * 2018-06-25 2018-11-27 网易（杭州）网络有限公司 Game resource treating method and apparatus

Family Cites Families (7)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20060068917A1 (en) * 2004-09-21 2006-03-30 Snoddy Jon H System, method and handheld controller for multi-player gaming
EP2809027B1 (en) * 2013-05-30 2018-09-12 Nederlandse Organisatie voor toegepast- natuurwetenschappelijk onderzoek TNO Method and system for reconstruction of a data object from distributed redundant data parts
CN103345395B (en) * 2013-07-01 2016-06-29 绵阳市武道数码科技有限公司 A kind of 3D game engine for MMO role playing
CN104866291A (en) * 2014-02-24 2015-08-26 上海连梦文化传播有限公司 Android-based 2D mobile game engine
CN105824957B (en) * 2016-03-30 2019-09-03 电子科技大学 The query engine system and querying method of distributed memory columnar database
CN106139591A (en) * 2016-06-27 2016-11-23 江苏易乐网络科技有限公司 A kind of web game engine based on Flex
CN109284286B (en) * 2018-09-12 2021-04-06 贵州省赤水市气象局 Method for extracting effective characteristics from original data set

Patent Citations (8)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US9737812B2 (en) * 2007-02-13 2017-08-22 Sizmek Technologies Ltd. Method of interacting with an interactive game program
CN102752081A (en) * 2012-07-03 2012-10-24 Ut斯达康通讯有限公司 Parallel cyclic redundancy check method and device in high-speed Ethernet
CN103970517A (en) * 2013-01-30 2014-08-06 中兴通讯股份有限公司 Access processing method and device for IPTV (internet protocol television) game
CN103269396A (en) * 2013-05-02 2013-08-28 百度在线网络技术（北京）有限公司 Method and system capable of conducting management on mobile terminal
CN104240284A (en) * 2014-10-10 2014-12-24 重庆邮电大学 Flash based game image rendering method and system
CN104360871A (en) * 2014-10-12 2015-02-18 厦门雅基软件有限公司 Quick starting method for installation of cell phone games
CN106730855A (en) * 2017-02-20 2017-05-31 李守明 A kind of system for realizing virtually being interacted with reality
CN108888951A (en) * 2018-06-25 2018-11-27 网易（杭州）网络有限公司 Game resource treating method and apparatus

Also Published As

Publication number Publication date
CN110300332A (en) 2019-10-01

Similar Documents

Publication Publication Date Title
CN108055264B (en) Scheduling apparatus and method for push streaming server, and computer-readable storage medium
CN101795392B (en) Application data-downloading method, digital television receiving terminal and system
US20020032754A1 (en) Method and apparatus for profiling in a distributed application environment
CN111953776A (en) Application service message pushing method and device, computer equipment and computer storage medium
CN102547447B (en) A kind of method of downloading video files, Apparatus and system
CN110300332B (en) Game loading method and system based on IPTV
CN111475575B (en) Data synchronization method and device based on block chain and computer readable storage medium
US8407260B2 (en) Method and apparatus for caching broadcasting information
CN110865842B (en) OTA upgrading method and equipment
CN111031376B (en) Bullet screen processing method and system based on WeChat applet
CN104202667A (en) IPTV (internet protocol television) set-top box upgrading method and system
CN110460879B (en) Video request scheduling method, device, server and storage medium
CN106850720A (en) Method for upgrading software, apparatus and system
CN104866339A (en) Distributed persistent management method, system and device of FOTA data
CN102203734B (en) Conditional processing method and apparatus
CN111817984A (en) Message sending method, device, equipment and storage medium
CN107040615A (en) Method for down loading, terminal and the computer-readable recording medium of media slicing
CN108011934B (en) Method and device for processing resource data
CN113194339A (en) Live list generation method and device, electronic equipment and readable storage medium
CN103034632A (en) Information transmitting method and a system
CN112347355A (en) Data processing method, device, server and storage medium
CN112148333B (en) Block chain server firmware updating system
CN115080156B (en) Flow-batch-integration-based optimized calculation method and device for big data batch calculation
CN102946559B (en) The upgrade method of a kind of digital TV terminal, terminal, server and system thereof
CN112732265A (en) Data processing method and related device

Legal Events

Date Code Title Description
PB01 Publication
PB01 Publication
SE01 Entry into force of request for substantive examination
SE01 Entry into force of request for substantive examination
GR01 Patent grant
GR01 Patent grant